جست‌وجوی استاد و پژوهشگر

Ed Carrمشاهده پروفایل

دانشیار

• Cybersecurity
• Graph Theory
• Quantum Computing
• +۳ مورد دیگر

Ed Carr is an Associate Professor of Computer Science at the Department of Computer Science & Mathematics, Emory & Henry College. Previously, he held roles at North Carolina A&T State University as Undergraduate Program Director and Graduate Faculty. His research focuses on Cybersecurity (Intrusion Detection, Zero-Knowledge Proofs), Graph Theory (Hamiltonian Cycles, Graph Coloring), and Quantum Computing. He has advised numerous graduate and undergraduate students, contributing to cybersecurity, algorithms, and systems projects. Education: Ph.D./MS Computer Science (NC A&T), MS Applied Mathematics (Western Carolina), BS Mathematics (Wingate). Research interests span cybersecurity frameworks, graph theory applications, and quantum computing paradigms. His work has been supported by grants totaling $1.57M from NSF, DOD, DOE, and others. Notable projects include GenCyber Summer Camps (DOD/NSA) and quantum information science initiatives. Publications emphasize graph cycle existence and algorithmic developments. He teaches advanced courses like Operating Systems, Concurrent Programming, and Data Structures. Awards: None explicitly listed. Advising highlights include key permutation libraries, ZKP authentication systems, and network security tools. His professional experience spans academia and community colleges, with roles at Gardner-Webb University and Edgecombe Community College.

• Graph Theory
• Combinatorics
• Data Science
• +۴ مورد دیگر

Dr. Joe DeMaio is a Professor of Mathematics and Data Science at Kennesaw State University, where he teaches courses such as Graph Theory (MATH 8020) and Mathematical Statistics (STAT 7010). He holds a Ph.D. (1996) and M.A. (1994) from Emory University, along with earlier degrees from Wake Forest University. His research focuses on combinatorics, graph theory, and recreational mathematics, particularly exploring topics like knight’s tours on chessboards, Fibonacci numbers in graph structures, and applications of graph theory in data science. DeMaio’s work often combines theoretical insights with practical applications, as seen in his studies of clustering algorithms, customer similarity detection, and optimization problems using SAS software. He has collaborated on projects analyzing healthcare management, energy sector safety, and sports team dynamics. His publications frequently highlight innovative uses of graph theory, including its role in chess problems and educational mathematics. He is also involved in editorial roles for academic journals, contributing to the field’s academic rigor and dissemination. While no specific awards are noted in the provided texts, his extensive publication record and course offerings reflect his contributions to both academia and applied data science. His teaching and research emphasize foundational mathematical principles and their real-world applications, making him a key figure in interdisciplinary studies at Kennesaw State.

Elizabeth A. Arnoldمشاهده پروفایل

استاد

• Groebner Bases
• Algorithms
• Mathematics of Sudoku
• +۲ مورد دیگر

Elizabeth A. Arnold is a Professor of Pure Mathematics and Mathematics Education at James Madison University (JMU), serving as Chair of Pure Mathematics since 2004. She holds a PhD in Algebra from the University of Maryland (2000), an MEd in Curriculum and Instruction from George Mason University (1994), and a BA in Government from Georgetown University (1989). Research Interests : Focuses on Groebner Bases, algorithm design, and the mathematics behind Sudoku puzzles. Her work bridges abstract algebra with recreational mathematics, including studies on Sudoku symmetry groups and polynomial system representations. Teaching : Teaches advanced courses such as Abstract Algebra I/II, Linear Algebra, and Geometry. Develops LaTeX-based curricula for mathematics education, emphasizing hands-on projects and collaborative learning. Publications : Authored notable papers including Groebner Basis Representation of Sudoku (2010) and Minimal Complete Shidoku Symmetry Groups (2013). Research spans symbolic computation, combinatorial mathematics, and educational pedagogy. Affiliations : Member of the American Mathematical Society (AMS), Mathematical Association of America (MAA), and Association for Women in Mathematics (AWM).

Brant Jonesمشاهده پروفایل

استاد

• Combinatorics
• Algorithms
• Game Theory
• +۳ مورد دیگر

Brant Jones is a Professor of Pure Mathematics at James Madison University (JMU), where he has been since 2010. He earned his PhD in Mathematics from the University of Washington in 2007 and held a VIGRE Fellowship at the University of California, Davis. His research focuses on combinatorics, particularly games, algorithms, algebraic structures, and enumerative combinatorics, often involving computational tools. He has mentored 28 undergraduate students in research projects and contributed to software libraries like liberiksson for Coxeter group computations. Jones has been awarded NSF grants for JMU's Research Experiences for Undergraduates (REU) program and led workshops at ICERM and AIM. His work has been cited by Don Knuth in The Art of Computer Programming . Education: PhD in Mathematics, University of Washington (2007); Postdoctoral Fellowship at UC Davis (2007–2010). Research Interests: Combinatorial game theory, algebraic structures, enumerative combinatorics, and reflection group representation theory. He frequently uses programming to aid his research and has experience in software engineering. Publications: Over 20 peer-reviewed articles, including works on games of best choice, Kazhdan-Lusztig polynomials, and combinatorial enumeration. Recent work includes collaborations on core partitions and affine permutation patterns. Awards/Grants: NSF REU funding (2017–2023), REUF workshop leadership (2019), citations in The Art of Computer Programming (2021). Teaching: Courses in discrete mathematics, abstract algebra, calculus, and combinatorics. Coordinates JMU's Putnam Competition team. Software Contributions: Developed liberiksson for Coxeter group calculations and contributed to Sage's combinatorics modules.

Laura Taalmanمشاهده پروفایل

استاد

• Algebraic Geometry
• Knot Theory
• Game and Puzzle Analysis
• +۴ مورد دیگر

Laura Taalman is a Professor in the Department of Mathematics & Statistics at James Madison University (JMU), where she has been since 2000. She holds a PhD in Mathematics from Duke University (2000), an MA in Mathematics from Duke (1997), and a BS in Mathematics from the University of Chicago (1994). Her research spans algebraic geometry, knot theory, graph theory, and the algebraic/combinatorial analysis of games and puzzles. Recently, her work focuses on computational generative design for 3D printing, coding for interactive mathematical exploration, and procedural design. She is also an author of nationally-published calculus textbooks and puzzle books. Dr. Taalman’s teaching includes general education courses (e.g., MATH 103, ISCI 104), STEM calculus (MATH 231-232), and pure math courses like Discrete Mathematics (MATH 245) and Graph Theory (MATH 353). Her service contributions include leading the JMU Haynes Scholars RLC program, directing the JMU Experimental Mathematics Lab (JEM Lab), and managing the JMU 3SPACE Classroom. She participates in initiatives like the Illustrating Mathematics Steering Committee. Her publications blend theoretical mathematics with applications in art and design, such as modeling dynamical systems for 3D printing and analyzing Celtic knot designs. Recent work emphasizes interdisciplinary connections between mathematics, art, and technology, reflecting her commitment to innovative pedagogy and public-facing scholarship. Professional activities include organizing conferences (e.g., Bridges Conferences) and contributing to outreach programs. Her research and teaching highlight a dual focus on foundational mathematics and creative, applied problem-solving.

Jennifer Vandenbusscheمشاهده پروفایل

استاد

• Graph Theory
• Extremal Graph Theory
• Mathematics Education
• +۲ مورد دیگر

Dr. Jennifer Vandenbussche is a Professor in the Department of Mathematics at Kennesaw State University (KSU), where she has served since 2008. She holds a Ph.D. in Mathematics from the University of Illinois at Urbana-Champaign (2008), along with an M.A. and B.Mus. degree from SUNY Potsdam. Her research focuses on graph theory, particularly extremal graph theory, and pedagogical innovations in undergraduate mathematics education. She has been recognized with KSU's Outstanding Teaching Award in 2021. Dr. Vandenbussche currently coordinates the Minor in Mathematics program, guiding students across STEM disciplines to integrate mathematics into their coursework. Her scholarly work spans theoretical mathematics and educational research, emphasizing evidence-based practices in curriculum design and faculty collaboration. Education: Ph.D. in Mathematics, University of Illinois at Urbana-Champaign (2008) M.A. in Mathematics, University of Illinois at Urbana-Champaign B.Mus., SUNY Potsdam Research Interests: Dr. Vandenbussche’s mathematical research delves into structural and extremal properties of graphs, including path covers, graph coloring, and bipartite graph extensions. In education research, she explores effective teaching methodologies, homework policies, and student engagement strategies in STEM classrooms. She has pioneered initiatives such as incentivized early remediation programs in calculus and faculty-driven curriculum reforms through 'Strand Committees.' Grants & Awards: Outstanding Teaching Award, Kennesaw State University (2021) Contributions to interdisciplinary active learning strategies for freshmen Labs/Teams: She leads the Minor in Mathematics program, fostering collaboration between mathematics and engineering disciplines. Her work on Strand Committees emphasizes faculty-led departmental change and evidence-based instructional improvements.

• Geometric Group Theory
• Combinatorial Group Theory
• Thompson's Groups
• +۳ مورد دیگر

Jose Burillo Puig is a Professor at the Universitat Politècnica de Catalunya (UPC), affiliated with the Department of Mathematics within the Faculty of Mathematics and Statistics (FME) . He is a core member of the GAPCOMB Group (Geometric, Algebraic, and Probabilistic Combinatorics), focusing on advanced research in geometric and combinatorial group theory. His work emphasizes the study of Thompson’s groups, metric properties of groups, and algebraic combinatorics. Key research areas include irrational-slope Thompson’s groups, commutator structures in piecewise projective groups, and the conjugacy problem in group extensions. He has led multiple competitive R&D projects funded by Spanish and Catalan agencies, such as Métodos Geométricos en Teoría de Grupos and Red Española de Teoría de Grupos . He collaborates actively with researchers like Sean Cleary, Armando Martino, and Enric Ventura. His publications span Advances in Mathematics , Israel Journal of Mathematics , and Geometry & Topology , addressing topics like subgroup conjugacy, metric geometry, and group automorphisms. He has supervised projects related to geometric aspects of Thompson’s groups and combinatorial group theory. Burillo Puig holds an ORCID ID (0000-0002-1078-3614) and is part of UPC’s research network, contributing to initiatives like the Geometric, Algebraic and Probabilistic Combinatorics group. His research bridges abstract algebra with geometric and probabilistic methods, shaping contemporary group theory.

• Combinatorics
• Graph Theory
• Discrete Mathematics
• +۵ مورد دیگر

Marcos Noy Serrano is a Professor in the Department of Mathematics at Universitat Politecnica de Catalunya (UPC), where he is a key member of the GAPCOMB research group focused on Geometric, Algebraic and Probabilistic Combinatorics. With a career spanning over three decades, he has established himself as a leading researcher in combinatorics and discrete mathematics. His research interests center on combinatorics, particularly in graph theory, enumerative combinatorics, and computational geometry. Noy's work frequently explores planar graphs, random structures, and combinatorial enumeration, with significant contributions to understanding the properties and counting of various combinatorial structures. His research combines algebraic, geometric, and probabilistic approaches to tackle fundamental problems in discrete mathematics. Noy's scholarly output shows consistent productivity with over 300 documented activities, including numerous journal articles in top combinatorics publications, research projects, and conference presentations. His recent work (2021-2024) focuses on chordal graphs with bounded tree-width, enumeration of various planar graph structures, random cubic planar maps, and logical properties of random sparse structures, demonstrating his continued engagement with cutting-edge problems in combinatorics. Among his notable recognitions are the prestigious Medalla Narcís Monturiol al mèrit científic i tecnològic and the Humboldt Research Award, highlighting the international impact of his work. He has also led significant research projects including the María de Maeztu Program for Centers and Units of Excellence in R&D and the COntemporary COmbinatorics and Applications (COCOA) project. Noy has supervised doctoral students, including Larrauri, L. who completed work on First Order Logic of Random Sparse Structures. He maintains active research collaborations across Spain and internationally, contributing to the vibrant combinatorics research community.

• Combinatorics
• Graph Theory
• Discrete Mathematics
• +۴ مورد دیگر

Affiliations & Roles Sonia Pérez Mansilla is a researcher at the Universitat Politècnica de Catalunya (UPC), affiliated with the Departament de Matemàtiques and the Escola d'Enginyeria de Telecomunicació i Aeroespacial de Castelldefels (EETAC) . She is a core member of two research groups: COMBGRAPH (Combinatorics, Graph Theory and Applications) OMGRAPH (Optimization Methods on Graphs) Education She holds a doctoral degree in Mathematics from UPC, with a thesis titled Recubrimientos k-arco transitivos de digrafos (2001), exploring symmetry in graph structures. Research Interests Her work focuses on combinatorics, graph theory, and optimization methods applied to networks. Key themes include: Algebraic graph constructions (e.g., Cayley digraphs) Graph symmetry (arc transitivity, vertex transitivity) Applications in telecommunications and unmanned aerial systems Publications Trends Her articles span theoretical contributions (e.g., Cayley digraph optimizations) and applied work (e.g., channel allocation in mobile networks). Recent efforts emphasize geometric approaches to dense network design and hypergraph symmetry analysis. Grants & Collaborations She has led/co-led multiple competitive projects funded by Spanish and Catalan agencies, including: AGRUPS grants (2022–2024) Projects on combinatorial optimization and graph applications Labs & Teams Active in the COMBGRAPH and OMGRAPH groups, collaborating with experts like Miquel Àngel Fiol and Oriol Serra on discrete mathematics and algorithmic challenges.

• Combinatorics
• Algebra
• Geometry
• +۳ مورد دیگر

John Machacek is an Assistant Professor of Mathematics and Computer Science at Hampden-Sydney College. His academic journey includes a PhD in Mathematics from Michigan State University (advised by Michael Shapiro), postdoctoral positions at the University of Oregon and York University, and prior visiting roles at Hampden-Sydney. He specializes in combinatorics with applications to algebra, geometry, topology, and theoretical computer science. His research explores topics such as cluster algebras, matroid theory, graph theory, and scheduling problems. Key educational milestones include a B.S. from the University of Minnesota-Twin Cities (Honors Thesis advised by Victor Reiner) and postdoctoral collaborations with Patricia Hersh and Nantel Bergeron. His Erdős number is 3, reflecting collaborative work in combinatorial mathematics. Research trends in his articles focus on algebraic and geometric combinatorics, including studies on Grassmannians, matroid structures, scheduling algorithms, and discrete dynamical systems. His work bridges pure combinatorics with interdisciplinary applications in physics and computer science. No scientific awards are explicitly listed, though his extensive contributions to MathOverflow and collaborative projects highlight his scholarly engagement. He advises no listed students but actively participates in academic communities across platforms like MathOverflow and Google Scholar. His research outputs span diverse subfields, emphasizing both foundational theory and applied problem-solving.

Alex Blackمشاهده پروفایل

پژوهشگر

• Algebraic Combinatorics
• Geometric Combinatorics
• Optimization
• +۳ مورد دیگر

Alex Black is currently a Hermann Weyl Instructor at ETH Zurich, focusing on algebraic and geometric combinatorics and optimization. He will join Bowdoin College as a tenure-track assistant professor in the mathematics department starting Fall 2025. His research emphasizes the simplex method and its applications in optimization and polytope theory. Black’s research explores the interplay between algebraic and geometric combinatorics, with a particular focus on optimization and the simplex method. His work addresses topics such as polytopes, matroid theory, and pivot rules, aiming to advance understanding in discrete and computational geometry. He investigates issues like exponential lower bounds for pivot rules, monotone paths on polytopes, and the structure of flag polymatroids. INFORMS 2022 George Nicholson Paper Competition Finalist for Small Shadows of Lattice Polytopes No advising roles or grants are explicitly mentioned in the provided information.

Stephan Elsenhansمشاهده پروفایل

استاد

• Algebraic Geometry
• Number Theory
• Computational Algebra
• +۳ مورد دیگر

Stephan Elsenhans is a Professor of Mathematics specializing in Computer Algebra at the University of Würzburg. He holds the Professorship for Mathematics at the Chair of Mathematics I (Algebra) within the Institute of Mathematics. His office is located in Building 30 (Mathematics West), Room 03.010 on the Hubland Nord campus at Emil-Fischer-Straße 30, 97074 Würzburg, Germany. Professor Elsenhans' primary research interests lie at the intersection of Algebraic Geometry , Number Theory , and Computational Mathematics . His work focuses on K3 surfaces , cubic surfaces , Galois groups , and Diophantine equations , with an emphasis on developing and implementing computational methods to solve theoretical problems in these areas. His research often combines deep theoretical insights with practical computational approaches. Analysis of his publication record reveals a consistent focus on computational aspects of arithmetic geometry. There is a strong emphasis on point counting algorithms , invariant theory , and the arithmetic properties of algebraic surfaces . His work frequently addresses fundamental questions about rational points on algebraic varieties, employing techniques from both theoretical mathematics and computer algebra. The collaborative nature of his research, particularly with Jörg Jahnel, demonstrates the interdisciplinary character of modern mathematical research. Professor Elsenhans is an active member of the Computer Algebra research team at the University of Würzburg's Institute of Mathematics. His work contributes significantly to the department's strength in computational algebra and arithmetic geometry. While specific information about students and grants is not detailed in available materials, his extensive publication record in prestigious journals indicates an active research program with considerable impact in his fields of expertise.

• Algebra
• Combinatorics
• Geometry
• +۷ مورد دیگر

Prof. Michael Cuntz is a Professor at the Institute of Algebra, Number Theory and Discrete Mathematics at Leibniz University Hannover, affiliated with the Faculty of Mathematics and Physics. He holds roles such as Deputy Chairperson of the Admissions Board for Teacher Training Courses and Faculty Information Officer (FIO). His research focuses on algebraic structures involving reflections, including Weyl groupoids, simplicial arrangements, complex reflection groups, and frieze patterns. He is a member of the Riemann Center for Geometry and Physics. Education: Studied mathematics at the University of Heidelberg (1996–2002) and the University of Paris VII (1999–2000). Professional milestones include his professorship at Leibniz University since 2013. Research projects encompass four key areas: Weyl groupoids/Nichols algebras, simplicial arrangements/Terao's conjecture, complex reflection groups/modular data, and cluster algebras/frieze patterns. His work often integrates computational algebra for conjecture exploration. Publications span over 50 articles, including recent contributions on root systems, singular curves, and frieze patterns. His work bridges algebra, combinatorics, and geometry, with applications in quantum groups and modular tensor categories.

Ilias S. Kotsireasمشاهده پروفایل

استاد

• Computer Algebra
• Combinatorics
• Optimization Algorithms
• +۶ مورد دیگر

Dr. Ilias S. Kotsireas is a Professor in the Department of Computer Science and Physics at Wilfrid Laurier University (WLU), Canada. He serves as Director of the CARGO (Computer Algebra Research Group) lab and Editor-in-Chief of the Journal of Algebraic Combinatorics . His research focuses on computational mathematics, combinatorics, optimization algorithms, and symbolic computation. Kotsireas is a Fellow of the Institute of Combinatorics and its Applications (ICA, 2004) and has held leadership roles in organizations like ACM SIGSAM and the ACA Working Group. He maintains adjunct appointments at the Athena Research Center (Greece) and the University of Waterloo, and is a Principal Scientist at ORCCA (Ontario Research Centre for Computer Algebra). His work integrates computer algebra systems with SAT solvers to address complex combinatorial problems, such as Hadamard matrices and Golay pairs. Recent research explores neurosymbolic frameworks, blockchain economics, and machine learning applications in algebraic geometry. Education: Advanced degrees in Mathematics/Computer Science (not explicitly listed, inferred from roles). Research Interests: Computer algebra systems, combinatorial search, algorithm portfolios, cryptographic protocols, and computational neuroscience applications. His contributions span theoretical advancements (e.g., Legendre pair algorithms) and practical tools (e.g., Maple-based software). Kotsireas collaborates internationally, organizing conferences like ACA and publishing in venues such as Journal of Symbolic Computation and SpringerPlus . His lab, CARGO, emphasizes supercomputing and interdisciplinary projects. Awards: Fellow of the Institute of Combinatorics and its Applications (ICA), 2004 Labs & Teams: Leads the CARGO lab and affiliated with ORCCA, focusing on computational algebra and high-performance computing.

Desi Small-Rodriguezمشاهده پروفایل

استادیار

• Indigenous Studies
• Social Demography
• Critical Demography
• +۵ مورد دیگر

Desi Small-Rodriguez is an Assistant Professor of Sociology and American Indian Studies at the University of California, Los Angeles. Their work focuses on critical quantitative and mixed-methods research at the intersection of race, indigeneity, and data-driven inequality. They specialize in survey research partnerships with Indigenous communities, emphasizing Indigenous Data Sovereignty and Governance through their Data Warriors Lab. Key areas include tribal data systems, health disparities, and challenges in census undercounting. Research interests span Indigenous studies, political sociology, and science and technology studies. Recent work addresses AI ethics, tribal sovereignty, and pandemic impacts on Native communities. The Data Warriors Lab operationalizes Indigenous-led data practices to support self-determined futures. Current projects include tribal data linkage systems and critiques of racialized census methodologies. Notable contributions include advancing the CARE principles for Indigenous data governance and analyzing disparities in health outcomes using tribally disaggregated data. Their research bridges academic theory with community-driven solutions, prioritizing partnerships with Native Nations and grassroots organizations. Grants and lab activities include a recent $1M grant funding graduate and undergraduate researchers, as well as collaborations on tribal data infrastructure projects. Academic advising focuses on training scholars committed to ethical Indigenous research methodologies. Labs/Teams: Directs the Data Warriors Lab, an Indigenous social science laboratory advancing data sovereignty through community-university partnerships.