Find Academic Supervisors

Nathan ReadingView profile

Professor

• Algebraic Combinatorics
• Geometric Combinatorics
• Coxeter Groups
• +3 more

Nathan Reading is a Professor in the Department of Mathematics at North Carolina State University (NCSU). He holds a Ph.D. in Mathematics from the University of Minnesota (2002) and a B.S. in Physics from Stanford University (1995). His research focuses on algebraic and geometric combinatorics, particularly in Coxeter groups, cluster algebras, and lattice-theoretic approaches. He has been actively involved in organizing the Triangle Lectures in Combinatorics, a biannual research conference. His research interests include noncrossing partitions, cluster scattering diagrams, and the lattice theory of torsion classes. Recent work explores connections between Coxeter groups and combinatorial structures on surfaces. Reading has authored numerous papers on topics such as semidistributive lattices, scattering diagrams, and Cambrian frameworks. He teaches advanced combinatorics courses (e.g., MA 724: Combinatorics II) and has advised graduate students. His work has been supported by grants from the National Science Foundation (NSF), including DMS-1500949. Reading maintains an active presence in the mathematics community through publications, conference organization, and pedagogical contributions.

Tom RobyView profile

Professor

• Algebraic Combinatorics
• Enumerative Combinatorics
• Dynamical Algebraic Combinatorics
• +4 more

Tom Roby is a tenured full Professor in the Department of Mathematics at the University of Connecticut (UConn). He holds a Ph.D. in algebraic combinatorics from MIT under Richard Stanley, with prior degrees from Swarthmore College and Kenwood Academy. His research focuses on algebraic and enumerative combinatorics, particularly birational rowmotion, homomesy, and dynamical algebraic combinatorics. He has held faculty roles at Cal State Hayward (now East Bay), the University of Wisconsin, Reed College, and the University of Tokyo as a JSPS postdoctoral fellow. Roby has directed the Quantitative Learning Center (Q Center) at UConn from 2005–2012 and contributed to educational outreach programs such as ACCLAIM and PROMYS. His teaching includes courses like Math 2210Q (Applied Linear Algebra). He actively engages in academic service, including directing summer programs for students and K–12 teachers. His work bridges theoretical research with practical education, emphasizing combinatorial dynamics and algebraic structures. His professional activities include organizing workshops on dynamical algebraic combinatorics and publishing extensively on topics like rowmotion, toggling, and poset dynamics. He maintains a robust online presence with course materials, software resources, and collaborations through platforms like Zulip and Nexus.

Blake JacksonView profile

Research Professor

• Cluster Algebras
• Enumerative Combinatorics
• Representation Theory
• +3 more

Blake Jackson is an Assistant Research Professor at the University of Connecticut's Department of Mathematics. His research focuses on algebraic and enumerative combinatorics, representation theory, and applications of machine learning to mathematical problems. He earned his Ph.D. from the University of Alabama under Kyungyong Lee and is currently mentored by Ralf Schiffler and Kyu-Hwan Lee at UConn. Education and Background: Bachelor's degree from Jacksonville State University, Alabama. Ph.D. in Mathematics from the University of Alabama (Tuscaloosa). Research Interests: Blake’s work spans cluster algebras, symmetric functions, quiver representations, and machine learning. Recent projects include geometric modeling of modules over path algebras, studying Banff/Louise quivers, c-vector geometry for mutation-infinite quivers, and using machine learning to explore quiver mutation-acyclicity. He is actively developing algorithms to find combinatorial bijections on Dyck paths related to q,t-Catalan numbers. Publications: His recent work combines theoretical mathematics with computational methods, focusing on geometric and algebraic structures in combinatorics. Machine learning techniques are increasingly central to his research, driven by promising results in quiver mutation analysis. Awards: No specific awards mentioned in the provided texts. Grants and Advising: While no grants are listed, Blake collaborates with leading researchers in algebraic combinatorics. He mentors students through his research projects, though no formal advisees are noted. Labs/Teams: His current work involves interdisciplinary collaborations, including machine learning applications in mathematical research.

Olya MandelshtamView profile

Assistant Professor

• Algebraic Combinatorics
• Enumerative Combinatorics
• Symmetric Functions
• +3 more

Olya Mandelshtam is an Assistant Professor in the Department of Combinatorics and Optimization at the University of Waterloo . Her research focuses on algebraic combinatorics, particularly symmetric and quasisymmetric functions, with connections to probability and interacting particle systems. Education: Ph.D. in Mathematics, University of California, Berkeley (2016), advised by Lauren Williams Presidential Postdoctoral Scholar at UCLA (2016–2017) Tamarkin Assistant Professor and NSF Postdoctoral Fellow, Brown University (2017–2021) Research Interests: Her work bridges algebraic structures (e.g., Macdonald polynomials, Koornwinder polynomials) and probabilistic models like the asymmetric simple exclusion process (ASEP) and zero-range processes (TAZRP). She explores combinatorial bijections, multiline queues, and integrable systems to study these connections. Recent Activities: She organizes the Combinatorics Seminar at Waterloo and participates in conferences such as ICERM workshops on Category Theory and Machine Learning, ICECA, and events on integrable systems in algebraic combinatorics. Advising: Current graduate students include Kartik Singh, Jerónimo Valencia Porras, Guilherme Zeus Dantas e Moura, and Harper Niergarth, with past advisee William Chan. Research collaborations include work on multiline queues, non-attacking fillings, and particle system dynamics.

Irène MarcoviciView profile

Professor

• Probability Theory
• Dynamical Systems
• Cellular Automata
• +4 more

Irène Marcovici is a Professor in the Department of Mathematics at the University of Rouen Normandy, affiliated with the Raphaël Salem Mathematics Laboratory (LMRS). She leads the Probability and Dynamical Systems team within LMRS and participates in the ALEA and SDA2 working groups of the GDR Informatique Fondamentale et ses Mathématiques. PhD in Mathematics (2013, University of Paris Diderot) Habilitation à Diriger des Recherches (2021, University of Lorraine) Her research focuses on probability theory , dynamical systems , and cellular automata , with significant contributions to percolation theory, self-organization phenomena, and combinatorics on words. She investigates how randomness influences complex systems, particularly through probabilistic cellular automata and their ergodic properties. Analysis of her recent publications (2021-2025) reveals a strong emphasis on percolation dynamics (e.g., corner percolation with directional bias), self-stabilization mechanisms in cellular systems, and combinatorial structures like Kolakoski sequences. Her work bridges theoretical computer science and pure mathematics, often employing stochastic methods to solve problems in symbolic dynamics and discrete geometry. Supervision & Collaborations: Currently supervising Maxence Poutrel (with Jérôme Casse) Previously supervised Pierrick Siest (2021-2024), Jocelyn Begeot (now Associate Professor), and Pierre-Adrien Tahay (now PRAG at Telecom Nancy) Regular collaborations with Régine Marchand, Nazim Fatès, and Pascal Moyal Laboratory Context: As leader of the Probability and Dynamical Systems team at LMRS, she contributes to France's national research infrastructure in fundamental mathematics, with connections to CNRS and international working groups focused on automata theory and discrete probability.

Jason SmithView profile

Senior Lecturer

• Combinatorics
• Topology
• Topological Data Analysis
• +12 more

Jason Smith is a Senior Lecturer in Mathematics at the Department of Physics and Mathematics, Nottingham Trent University. His work bridges pure mathematics and neuroscience, focusing on combinatorial and topological methods for analyzing brain networks and functional data. His educational background includes: PhD in Computer and Information Science, University of Strathclyde (2015) MMath, University of Bath (2012) His research lies at the intersection of combinatorics, topology, and neuroscience. He applies tools from graph theory, topological data analysis (TDA), and algebraic topology to study the structure and function of neural systems. Key areas include the analysis of connectomes (such as C. Elegans and Drosophila), modeling brain network dynamics, and developing theoretical frameworks for understanding neural coding through combinatorial and topological lenses. His work often involves collaborations with neuroscientists and computational biologists. His recent publications demonstrate a strong trend toward interdisciplinary research, combining deep mathematical theory with applications in neuroscience. The articles span topics from the topology of directed flag complexes and tournaplexes to the combinatorics of permutation patterns and the Abelian sandpile model, all unified by their relevance to understanding complex biological networks. There is a clear progression from theoretical combinatorics toward computational and applied neurotopology. He has collaborated extensively with researchers from the University of Aberdeen, EPFL (including the Laboratory for Topology and Neuroscience and the Blue Brain Project), and other institutions. He has developed several open-source software tools such as Flagser-count, Tournser, and Deltser for computing persistent homology in directed networks, reflecting his commitment to computational reproducibility and tool development. He has presented his work in various venues, with talks and posters on topics including permutation posets, tournaplexes, and functional brain data classification. His research is supported by collaborative projects focusing on the topological analysis of neural systems and the mathematical foundations of pattern posets.

David BevanView profile

Lecturer

• Enumerative Combinatorics
• Asymptotic Combinatorics
• Probabilistic Combinatorics
• +7 more

David Bevan is a Lecturer in the Department of Mathematics and Statistics at the University of Strathclyde, Faculty of Science. His research is centered on combinatorics, particularly in the areas of enumerative, asymptotic, probabilistic, and extremal combinatorics, with a focus on permutations and permutation classes. His research interests include: Permutation patterns and avoidance Limit shapes and permutons Monotone grid classes and structural combinatorics Random integer compositions and probabilistic models Graph theory and network structures Analytic combinatorics and asymptotic enumeration The trends in his recent publications (2025–2017) reflect a deep and consistent focus on the structural and asymptotic behavior of discrete combinatorial objects, especially permutations. His work often combines probabilistic reasoning, analytic techniques, and extremal analysis to derive enumeration results and characterise limiting behaviors. He frequently collaborates with researchers such as Dan Threlfall, Robert Brignall, and Sergey Kitaev. David Bevan has served in key professional roles, including: Guest Editor, Discrete Mathematics and Theoretical Computer Science (2023) Guest Editor, Enumerative Combinatorics and Applications (2021) Organiser, Permutation Patterns 2021 Virtual Workshop Organiser, Scottish Combinatorics Meeting 2023 Peer Reviewer, Combinatorial Theory (2023) He is the Principal Investigator on the Maths DTP 2020 project at the University of Strathclyde (2020–2025), focusing on combinatorial research with PhD student Daniel Threlfall. He has delivered numerous invited talks at international workshops and conferences, including at Oberwolfach, Dagstuhl, and the Permutation Patterns series. David Bevan leads research within the Strathclyde Combinatorics Group and maintains an active research blog. He teaches courses in graph theory, networks in finance, logic, computation, and computer systems, reflecting his interdisciplinary expertise bridging mathematics and computer science.

Joshua P. SwansonView profile

Assistant Professor

• Algebraic Combinatorics
• Representation Theory
• Quantum Groups
• +5 more

Joshua P. Swanson is an RTPC Assistant Professor of Mathematics at the University of Southern California (USC). Previously, he held a Stefan E. Warshawski Visiting Assistant Professorship at the University of California, San Diego (UCSD). He earned his PhD in Mathematics from the University of Washington under advisor Sara Billey, focusing on major index statistics and asymptotics. His research spans algebraic combinatorics with an emphasis on web bases for quantum group representations, plabic graphs, invariant theory, and analytic combinatorics. Education: PhD in Mathematics, University of Washington (2018) Bachelor's degree (implied, details not specified) Research Interests: Algebraic combinatorics, quantum group representations, plabic graphs, Coxeter groups, q-analogues, limit laws, and supercoinvariant algebras. He co-organizes workshops such as ICERM's Topical Workshop on Webs in Algebra, Geometry, Topology, and Combinatorics (2025). Publications: Over 20 peer-reviewed articles in top journals including Algebraic Combinatorics , European Journal of Combinatorics , and Advances in Mathematics . Recent work focuses on web bases, q-Stirling numbers, and harmonic differential forms. Awards: NSF Grant DMS-2348843 ($180,000) AMS-Simons Travel Grant ($5,000) Personal prize from Doron Zeilberger ($300) McKibben & Merner Fellowship ($10,000) Teaching: Taught over 20 courses at USC and UCSD, including Probability Theory (Math 407), Linear Algebra (Math 225), and Combinatorics (Math 184). Active in mentoring undergraduate researchers via USC's SURF program. Professional Engagement: Co-organizes seminars like the USC Combinatorics Seminar and serves on conference committees for FPSAC and CanaDAM. Maintains active collaborations with researchers such as Christian Gaetz, Oliver Pechenik, and Jessica Striker.

Kevin LimantaView profile

Researcher

• Combinatorics
• Number Theory
• Algebra
• +3 more

Dr Kevin Limanta is a Researcher at the School of Mathematics and Statistics , UNSW Sydney. He teaches MATH1131 Mathematics 1A (Calculus) and MATH1231 Mathematics 1B (Algebra), serving as course convenor for both. His research spans advanced mathematical domains including: Combinatorics (super Catalan numbers, Dyck paths) Algebraic Structures (finite field Fourier summation) Harmonic Analysis (spherical harmonics on S³) Functional Analysis (Morrey space properties) Dr Limanta's publications focus on algebraic interpretations of Catalan numbers, permutation-generated Dyck path mappings, and harmonic function theory on mathematical spaces. His work intersects pure mathematics with computational applications.

• Enumerative Combinatorics
• Algebraic Combinatorics
• Alternating Sign Matrices
• +7 more

Ilse Fischer is a Professor in the Department of Mathematics at the Faculty of Mathematics, University of Vienna. She holds the titles of Univ.-Prof., Mag. Dr., and Privatdoz., reflecting her senior academic status and contributions to combinatorics. Her research is centered on algebraic and enumerative combinatorics, with a focus on alternating sign matrices, plane partitions, lozenge tilings, and symmetric functions. Her research interests include: Enumerative and bijective combinatorics Alternating sign matrices and their symmetry classes Plane partitions and totally symmetric variants Lozenge tilings of hexagons with defects Gelfand-Tsetlin patterns and lattice path models Combinatorial identities and symmetric functions Analysis of her recent publications (2020–2024) reveals a consistent focus on exact enumeration, combinatorial bijections, and algebraic structures. Her work often bridges combinatorics with mathematical physics, particularly through models like the six-vertex (square ice) model. She frequently collaborates with leading researchers such as Matjaž Konvalinka, Mircea Ciucu, and Florian Schreier-Aigner, publishing in top journals including Advances in Mathematics , European Journal of Combinatorics , and Algebraic Combinatorics . She has received two scientific prizes, though specific names are not listed. Her academic activity remains strong, with ongoing projects and publications, indicating active research leadership. She advises students and postdoctoral researchers, though specific names are not provided in the text. She has led multiple research projects, particularly in the areas of combinatorial enumeration and symmetric functions. She is involved in collaborative research networks and regularly contributes to major combinatorics conferences such as FPSAC and AofA. Her work continues to advance foundational results in algebraic combinatorics, including bijective proofs of long-standing conjectures.

Irène MarcoviciView profile

Professor

• Probability Theory
• Cellular Automata
• Dynamic Systems
• +3 more

Irène Marcovici is a Professor at the University of Rouen Normandy, affiliated with the Raphaël Salem Mathematics Laboratory (LMRS) and leading the Probability and Dynamic Systems Team. Her research spans probability theory, cellular automata, stochastic processes, and combinatorics, with a focus on ergodicity, percolation, and self-organization phenomena. She collaborates with institutions like the GDR Fundamental Computer Science and its Mathematics and has contributed to journals such as Probability Theory and Related Fields, Annales Henri Lebesgue, and Theoretical Computer Science. Education: Habilitation à Diriger des Recherches (2021, University of Lorraine), PhD in Mathematics (2013, University of Paris Diderot) Research Focus: Marcovici's work explores probabilistic cellular automata, percolation models, and their applications in physics, computer science, and mathematics. Key projects include analyzing stability regions in queueing systems, developing decentralized diagnostics, and studying self-descriptive sequences. Her articles highlight interdisciplinary connections between discrete mathematics and stochastic dynamics. Notable Collaborations: She has co-authored publications with researchers like Jérôme Casse, Régine Marchand, Nazim Fatès, and Mathieu Sablik. Her team participates in the ALEA and SDA2 working groups under GDR Fundamental Computer Science and its Mathematics.

Matthias BeckView profile

Professor

• Combinatorics
• Number Theory
• Discrete Geometry
• +5 more

Matthias Beck is a Professor of Mathematics at San Francisco State University (SFSU), where he has held positions since 2004. He specializes in combinatorics, number theory, and discrete geometry, focusing on lattice-point enumeration in polyhedra and Ehrhart theory. His research has led to influential textbooks such as Computing the Continuous Discretely (2007) and Combinatorial Reciprocity Theorems (2018). Beck has also contributed to education through the Art of Proof textbook and leadership roles like Associate Chair of the Mathematics Department. Beck's academic journey includes a Ph.D. from Temple University (2000) and postdoctoral fellowships at institutions like MSRI and the Max Planck Institute. His awards include the MAA's Deborah and Franklin Tepper Haimo Award for Distinguished Teaching (2013). He has advised numerous graduate and undergraduate students, fostering collaborations in research areas from magic squares to graph colorings. His work bridges pure and applied mathematics, with applications in music theory, optimization, and combinatorial geometry. Beck actively participates in academic service, including editorial roles at journals like the Electronic Journal of Combinatorics and leadership in initiatives like the National Alliance for Doctoral Studies in Mathematics.

Amy N. MyersView profile

Senior Lecturer

• Combinatorics
• Probability Theory
• Enumerative Combinatorics
• +3 more

Amy N. Myers serves as Senior Lecturer in Mathematics and Math Program Coordinator at Bryn Mawr College's Department of Mathematics, where she teaches core courses including Calculus I-II, Multivariable Calculus, Probability Theory, and specialized graduate seminars in Enumerative Combinatorics and History of Mathematics. Her academic credentials include a Ph.D. in Mathematics from Dartmouth College (1999), establishing her foundational expertise in discrete mathematical structures. Dr. Myers' research demonstrates exceptional depth in combinatorial mathematics , particularly in pattern avoidance phenomena and probabilistic enumeration . Her work on interval orders bridges order theory with topological combinatorics, while her contributions to the Coupon Collector's Problem reveal novel asymptotic behaviors with applications in computational biology. The SIGEST recognition of her probability research by SIAM Review underscores its interdisciplinary significance across theoretical computer science and stochastic modeling. Analysis of her publication trajectory shows consistent innovation in multiset permutation statistics and forbidden substring constraints, with recent focus on shellability properties in ordered structures. Her combinatorial frameworks increasingly incorporate computational topology, reflecting evolving methodological sophistication. No scientific awards are documented in the available institutional records. As Math Program Coordinator, Dr. Myers oversees curriculum development and student advising for mathematics majors, though specific mentorship details remain undisclosed. Grant funding information is not publicly accessible through current university channels. Research infrastructure details including laboratories or collaborative teams are not referenced in her official academic profile.

Jason P. SmithView profile

Senior Lecturer

• Combinatorics
• Algebraic Topology
• Topological Data Analysis
• +7 more

Jason P. Smith is a Senior Lecturer in Mathematics within the Department of Physics and Mathematics at Nottingham Trent University. His research bridges combinatorics, algebraic topology, and neuroscience, focusing on the application of topological data analysis to understand neural connectivity and brain function. His educational background includes a Ph.D. in Computer and Information Science from the University of Strathclyde (2012–2015), supervised by Einar Steingrímsson, and an MMath from the University of Bath (2008–2012). Smith's research interests center on combinatorics, particularly permutation patterns and posets, and algebraic topology, especially persistent homology and directed flag complexes. He applies these mathematical tools to neuroscience, modeling cortical connectivity and neural coding strategies. His work often involves developing computational methods for analyzing complex networks. The recent publications reflect a strong trend toward interdisciplinary research combining topology, combinatorics, and neuroscience. His work explores how the structure of neural networks influences information processing, using tools like tournaplexes and flag complexes to extract topological features from connectomic data. Email: jason.smith@ntu.ac.uk Google Scholar GitHub ORCID CV He has developed several open-source software packages including Tournser, Flagser-count, and Deltser, which are used for computing persistent homology in directed networks. He previously held research positions at the University of Aberdeen (2018–2020) and the University of Strathclyde (2015–2018), working on topological analysis of neural systems and combinatorial algebraic topology. No formal advising of students is listed, nor are any grants or scientific awards mentioned in the provided text. Smith is actively involved in the neurotopology research community and contributes to computational tools for topological data analysis in neuroscience. He is part of collaborative projects involving institutions such as the University of Aberdeen and international neuroscience initiatives.

Laura YangView profile

Lecturer

• Combinatorics
• Discrete Mathematics
• Graph Theory
• +1 more

Laura Yang is an Associate Lecturer in the Department of Mathematics at the University of Central Florida. Her research explores combinatorial mathematics, including tree structures, permutation patterns, and enumerative techniques. Publications focus on Riordan paths, hook-length identities, and discrete mathematical structures. Teaches undergraduate mathematics courses and contributes to curriculum development.