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

Ricky Ini Liuمشاهده پروفایل

دانشیار

• Algebraic Combinatorics
• Algebraic Geometry
• Combinatorial Geometry
• +۵ مورد دیگر

Ricky Ini Liu is an Associate Professor in the Department of Mathematics at the University of Washington. Previously, he held positions at North Carolina State University, the University of Michigan, and the University of Minnesota. He earned his Ph.D. in Mathematics from MIT in 2010 under Alexander Postnikov. His research focuses on algebraic combinatorics, particularly its intersections with algebraic geometry, combinatorial geometry, and representation theory. Key interests include Schubert polynomials, polytopes, Hopf algebras, and Kronecker coefficients. He has contributed to foundational work on birational rowmotion, Gelfand-Tsetlin polytopes, and Fomin-Kirillov algebras. Liu has taught a wide range of courses at UW, including special topics in dynamical algebraic combinatorics, combinatorial theory, and problem-solving. He has also been a key instructor at the Mathematical Olympiad Summer Program since 2007 and mentored undergraduates in research programs at the University of Minnesota, Duluth. His publications span high-impact journals like Selecta Mathematica and Journal of Combinatorial Theory , with recent work addressing topics such as determinantal formulas for Schubert polynomials and applications of flow polytopes to diagonal harmonics. Though no specific awards are listed, his extensive publication record and academic roles reflect significant contributions to combinatorial mathematics.

Catherine Greenhillمشاهده پروفایل

استاد

• Combinatorics
• Graph Theory
• Applied Probability
• +۶ مورد دیگر

Professor Catherine Greenhill is a faculty member at the School of Mathematics and Statistics, UNSW Sydney , where she serves as Professor and head of the Combinatorics group. Her academic career spans institutions including the University of Queensland, University of Oxford, University of Leeds, University of Melbourne, and Australian National University. D.Phil., University of Oxford (1996) M.Sc. (Research) in Combinatorics (1992) B.Sc. (Hons) in Pure Mathematics (1991) Her research focuses on the intersection of discrete mathematics , theoretical computer science , and probability , particularly in asymptotic combinatorics , probabilistic methods , and analysis of algorithms . Her work includes asymptotic enumeration of combinatorial structures and design of randomized algorithms for graph sampling and counting. Her recent publications (2025–2021) center on random graphs and hypergraphs , with key contributions to switch Markov chains , degree sequence analysis , and chromatic number bounds . These works reflect her expertise in probabilistic combinatorics and algorithmic complexity . Scientific Awards: Fellow of the Australian Academy of Science (2022) Christopher Heyde Medal in Pure Mathematics (2015) June Griffith Fellowship (2013) Hall Medal (2010) Advising and Grants: She has supervised numerous PhD/Masters students and secured multiple ARC Discovery Grants (2019–2021, 2014–2016, 2012–2014). Her grants address topics like hypergraph modeling, random discrete structures, and network analysis in illicit drug trafficking.

Illya V. Hicksمشاهده پروفایل

استاد

• Combinatorial Optimization
• Integer Programming
• Graph Theory
• +۵ مورد دیگر

Illya V. Hicks is a Professor in the Computational and Applied Mathematics Department at Rice University. He holds a PhD from Rice University (2000) and a BS from Texas State University (1995). His research focuses on combinatorial optimization, integer programming, graph theory, and matroid theory, with applications in social networks, cancer treatment, and network design. He has advised numerous doctoral, post-doctoral, and masters students. Education: PhD and MA in Computational and Applied Mathematics, Rice University, 2000 BS in Mathematics, Texas State University, 1995 Research Interests: Utilizing graph decomposition techniques to solve NP-complete problems, including branch decompositions and matroid circuit problems. Applications include sensor network design, healthcare logistics, and algorithmic graph theory. Awards: Recognized with the 2015 Presidential Mentoring Award (Rice University), 2010 Forum Moving Spirit Award (INFORMS), and the 2005 Optimization Prize for Young Researchers. Grants and Projects: Includes NSF-funded research on branch decomposition techniques, submodular optimization, and healthcare service distribution. Active in promoting minority participation in operations research through travel grants and mentoring initiatives. Labs/Teams: Engaged in collaborative research on graph algorithms, combinatorial optimization, and interdisciplinary applications in healthcare and engineering.

Maria Chudnovskyمشاهده پروفایل

استاد

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

Maria Chudnovsky is a Professor of Mathematics at Princeton University and a former Professor of IEOR and Mathematics at Columbia University (2006-2014). Her research focuses on graph theory and combinatorics, with significant contributions to structural graph theory, perfect graphs, and algorithmic applications. Education: B.A. Summa Cum Laude (1996) and M.Sc. (1999) from Technion, Ph.D. (2003) from Princeton University Her work addresses fundamental problems in graph coloring, forbidden induced subgraphs, and combinatorial optimization, including the proof of the Strong Perfect Graph Theorem and development of algorithms for detecting graph structures. Notable awards include the MacArthur Foundation Fellowship (2013-2017), D.R. Fulkerson Prize (2009), and Henry Burchard Fine Professor of Mathematics (2022). She has held prestigious fellowships such as the Clay Mathematics Institute Research Fellowship (2003-2008). Grants: NSF DMS-EPSRC Grant DMS-2120644 (2021-2024), US Army Research Office Grant W911NF-16-1-0404 (2016-2020), and multiple NSF grants She has advised numerous PhD/MSc students and postdocs, including Sophie Spirkl, Mingxian Zhong, and Tara Abrishami. Her outreach includes popular science communication on YouTube's Numberphile and participation in initiatives promoting women in STEM.

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

Sophie Spirkl is an Associate Professor (with tenure) in the Department of Combinatorics and Optimization at the University of Waterloo. Previously, she held postdoctoral positions at Princeton University (as an NSF postdoc and instructor, supervised by Maria Chudnovsky) and at Rutgers University (under Jeff Kahn). She earned her PhD from Princeton University under the guidance of Maria Chudnovsky and Paul Seymour. Her research focuses on graph theory and combinatorics, with notable contributions to induced subgraphs, tree decompositions, chromatic number properties, and structural graph theory. She is a recipient of the 2023 Sloan Research Fellowship and co-founded the diamond open-access journal Innovations in Graph Theory . Education: PhD in Mathematics, Princeton University (2016–2020) Postdoctoral Fellowships: Princeton (2020–2022), Rutgers (2018–2020) Research Interests: Dr. Spirkl’s work spans multiple areas of combinatorics, including structural graph theory, extremal graph theory, and algorithmic graph theory. She has published extensively on topics such as induced subgraph obstructions, χ-boundedness, tree decompositions, and the Erdős–Hajnal conjecture. Her research often intersects with theoretical computer science, particularly in parameterized complexity and graph colorings. Awards & Recognition: 2023 Sloan Research Fellowship Contributions to the Innovations in Graph Theory journal Academic Contributions: Her articles address foundational problems in graph theory, such as the Erdős–Hajnal conjecture for C₅, logarithmic treewidth in even-hole-free graphs, and induced saturation for cycles. She collaborates with leading researchers like Maria Chudnovsky and Paul Seymour, advancing the field through rigorous combinatorial analysis. Community Engagement: She coordinates the Women in Math Directed Reading Program at Waterloo, supporting underrepresented groups in mathematics. Her spouse, Logan Crew, is a Research Assistant Professor at the same institution.

Brandon Sewardمشاهده پروفایل

دانشیار

• Ergodic theory
• Topological dynamics
• Descriptive set theory
• +۱ مورد دیگر

Brandon Seward is an Associate Professor of Mathematics at the University of California San Diego (UC San Diego), where they conduct research and teach in the Department of Mathematics. They use the pronouns they/them or he/him . Education Ph.D. in Mathematics, University of Michigan , 2015 Research Interests Their work lies at the intersection of ergodic theory, topological dynamics, descriptive set theory, and group theory . They investigate geometric, combinatorial, and entropic properties of actions of countable groups, with special emphasis on the divide between amenable and non-amenable groups. Publications & Research Impact Across 27 refereed papers (2014-2024), Seward has advanced entropy theory for non-amenable groups, Borel combinatorics of group actions, and structure theorems for measure-preserving actions. Their work has appeared in top journals such as Inventiones Mathematicae , Journal of the American Mathematical Society , and Duke Mathematical Journal . Scientific Awards Michael Brin Dynamical Systems Prize for Young Mathematicians (2018) – awarded for outstanding contributions to dynamical systems. Teaching & Mentorship Seward regularly teaches core undergraduate courses (e.g., Math 142A Introduction to Analysis) and organizes the UC San Diego Group Actions Seminar , a weekly research forum featuring international speakers. They serve as a faculty mentor and are actively involved in graduate student supervision and seminar coordination. Contact & Office Email: bseward@ucsd.edu Office: AP&M 5739, 9500 Gilman Drive, La Jolla, CA 92093-0112

• Algebraic Combinatorics
• Quasisymmetric Functions
• Schubert Calculus
• +۴ مورد دیگر

Vasu Tewari is an Assistant Professor (CLTA) at the University of Toronto, working across both the Downtown Toronto (St. George) and Mississauga (UTM) campuses. Their office is located at HU1015 (215 Huron), and they can be reached at vasu.tewari@utoronto.ca. As a member of the Department of Mathematics within the Faculty of Arts and Science, Professor Tewari contributes to both teaching and research activities at the university. Professor Tewari's research focuses on advanced topics in algebraic combinatorics, with particular expertise in: Quasisymmetric functions and their geometric interpretations Schubert polynomial theory and related structures Representation theory of symmetric groups and related algebras Combinatorial aspects of algebraic geometry Enumerative combinatorics with connections to symmetric functions Algebraic structures arising from combinatorial objects Analysis of Professor Tewari's recent publications reveals a consistent focus on the interplay between combinatorial structures and algebraic frameworks. Their work often explores generalizations of classical symmetric function theory through the lens of quasisymmetric functions, providing new insights into Schubert calculus, permutation statistics, and geometric combinatorics. A notable trend in their research is the investigation of stability phenomena in combinatorial structures and the development of new algebraic tools for studying these phenomena. Professor Tewari has made significant contributions to understanding the geometry of combinatorial objects through algebraic methods, particularly in the areas of permutahedral varieties, zonotopal algebras, and quiver representations. Their work bridges pure mathematics with potential applications in theoretical physics and computer science.

Maria Chudnovskyمشاهده پروفایل

استاد

• Graph Theory
• Applied Mathematics
• Combinatorics
• +۳ مورد دیگر

Maria Chudnovsky is a Professor in the Department of Mathematics at Princeton University. Her research focuses on structural graph theory, particularly in areas such as graph decomposition, induced subgraphs, and algorithmic applications of graph structure. She is renowned for her contributions to understanding perfect graphs, even-hole-free graphs, and the Erdős–Hajnal conjecture. Her work often explores the interplay between graph structure and algorithmic efficiency, with applications in combinatorial optimization and theoretical computer science. Notable contributions include foundational results on tree decompositions, chromatic number bounds, and the structure of metrizable graphs. Recent research trends include investigations into induced subgraph obstructions, tree independence numbers, and the properties of sparse graphs. She has published extensively on topics such as clique-stable set separation, rainbow matchings, and the complexity of graph coloring problems in restricted graph classes. Chudnovsky has been involved in significant collaborative projects, including work funded by the DMS-EPSRC grant 'The Power of Graph Structure' (2021). Her research frequently bridges theoretical insights with practical algorithm design, contributing to both fundamental and applied areas of discrete mathematics.

Sepehr Hajebiمشاهده پروفایل

مدرس

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

Sepehr Hajebi is a Mathematics Instructor at Princeton University and a Postdoctoral Scholar at the University of Waterloo, where his position is funded by Sophie Spirkl. He completed his PhD in Combinatorics and Optimization at the University of Waterloo between 2020 and 2024 under the supervision of Sophie Spirkl. His research focuses on combinatorics and graph theory, particularly structural aspects such as induced subgraphs, graph minors, and algorithms. He also explores topology, number theory, and category theory. Education: PhD in Combinatorics and Optimization, University of Waterloo (2020–2024) Research Interests: His work delves into structural graph theory with applications to induced subgraphs, algorithmic problems, and graph minors. He investigates foundational questions in topology, number theory, and category theory, reflecting a commitment to interdisciplinary mathematical inquiry. Advising and Grants: His postdoctoral funding at Waterloo is provided by Sophie Spirkl, though no specific grants or advisees are detailed.

Tobias Müllerمشاهده پروفایل

استاد

• Combinatorics
• Probability Theory
• Random Graphs
• +۵ مورد دیگر

Prof. Tobias Müller is a Professor at the Bernoulli Institute for Mathematics, Computer Science and Artificial Intelligence at the University of Groningen. His academic journey includes previous positions at Utrecht University, CWI (Centrum Wiskunde & Informatica), Tel Aviv University, and Eindhoven University of Technology, with a doctorate from the University of Oxford under Colin McDiarmid. His research focuses on combinatorics, probability theory, random graphs, percolation, discrete and stochastic geometry, and combinatorial game theory. He has contributed extensively to understanding complex networks, hyperbolic models, and geometric random structures. Research Interests: Random Graphs and Percolation Theory Discrete and Stochastic Geometry Hyperbolic Network Models Probabilistic Combinatorics Geometric Probability Graph Algorithms and Connectivity Notable Contributions: Analysis of Voronoi and Poisson-Voronoi percolation in hyperbolic planes. Studies on Mallows random permutations and their cycle structures. Research on component games and logical limit laws in graph theory. Investigations into the geometry and properties of random geometric graphs. Grants & Collaborations: Active in organizing workshops and conferences on random graphs and geometric networks, including the BIRS Workshop on Random Geometric Graphs and the STAR Workshops series. Labs/Teams: Member of the Bernoulli Institute’s research groups, focusing on stochastic studies, combinatorics, and algorithmic methods.

Asaf Shapiraمشاهده پروفایل

استاد

• Extremal Combinatorics
• Graph Theory
• Property Testing
• +۴ مورد دیگر

Professor Asaf Shapira is a faculty member in the Department of Theoretical Mathematics at Tel Aviv University's School of Mathematical Sciences. He has been actively contributing to combinatorics and graph theory research for over a decade, with numerous publications in top journals including Journal of the ACM, Advances in Mathematics, and Geometric and Functional Analysis. Professor Shapira's research focuses on extremal combinatorics, graph theory, and property testing. His work explores fundamental questions in Ramsey theory, hypergraph theory, and probabilistic methods in combinatorics. He has made significant contributions to the study of graph regularity, removal lemmas, and extremal problems in dense and sparse graphs. His recent publications demonstrate a consistent focus on theoretical aspects of combinatorics with connections to theoretical computer science. A notable trend is his work on developing polynomial bounds for various combinatorial theorems and exploring connections between combinatorial structures and computational complexity. His research often bridges pure mathematics with theoretical computer science applications. Professor Shapira teaches advanced courses at Tel Aviv University including Extremal Graph Theory, Basic Combinatorics, and seminars on specialized topics in combinatorics. His teaching spans undergraduate and graduate levels, reflecting his commitment to educating the next generation of mathematicians.

• Graph Theory
• Ramsey Theory
• Graph Coloring
• +۲ مورد دیگر

John Gimbel is a Professor of Mathematics at Western Michigan University since 1987. He holds a PhD from 1984 and has made significant contributions to graph theory, particularly in Ramsey Theory and graph coloring. Research Interests: His work focuses on the inevitability of order in disordered graphs (Ramsey Theory) and graph coloring methods, including fractional coloring and constraints on bounded genus/triangle-free graphs. Key themes include structural analysis, extremal properties, and surface embeddings. Selected Publications: Spanning 1991–2025, his research covers H-free subgraphs in random graphs, genus/girth coloring bounds, triangle-free coloring, convexity numbers, and defective Ramsey numbers in degenerate graphs. Contact: Email: jggimbel@alaska.edu . Office: CH 304C, Phone: 907-474-6102.

Jindrich Zapletalمشاهده پروفایل

استاد

• Set Theory
• Mathematical Logic
• Descriptive Set Theory
• +۳ مورد دیگر

Jindrich Zapletal is a Professor in the Department of Mathematics at the University of Florida, affiliated with the College of Liberal Arts and Sciences. He holds a Ph.D. from The Pennsylvania State University (1995), advised by Thomas Jech. His research focuses on set theory, mathematical logic, and their applications, with specializations in descriptive set theory, combinatorial set theory, and forcing techniques. He is a core member of the UF Logic and Set Theory Group, which organizes the annual South Eastern Logic Symposium (SEALS), funded by the NSF. He teaches advanced courses like Invariant Descriptive Set Theory and has advised numerous graduate students. His work frequently explores consistency results under ZF set theory, chromatic numbers of hypergraphs, and interactions between forcing and topology. He actively contributes to conferences and has co-authored influential textbooks and monographs in set theory and logic. Education: Ph.D., Mathematics, The Pennsylvania State University, 1995 Research Interests: Choiceless set theory, descriptive set theory, forcing with ideals, and combinatorial structures in set theory Professional Roles: Organizer of SEALS conferences, instructor for graduate-level logic courses Grants: NSF Award 1945890 and multiple University of Florida grants Zapletal’s research emphasizes foundational questions in set theory, particularly under weaker axioms like ZF+DC, and their implications for algebra, topology, and combinatorics. His recent work includes studies on chromatic numbers of geometric hypergraphs and the structure of sigma-ideals in Polish spaces. Collaborations span topics like permutation models, game determinacy, and measure-theoretic forcing.

Mihyun Kangمشاهده پروفایل

استاد

• Combinatorics
• Discrete Probability
• Algorithms
• +۳ مورد دیگر

Mihyun Kang is a Professor in the Institute of Discrete Mathematics at Graz University of Technology (TU Graz), leading the Combinatorics Group. She holds significant academic positions and has been recognized with a Heisenberg Fellowship (German Research Foundation) and a Friedrich Wilhelm Bessel Research Award (Alexander von Humboldt Foundation). Her research focuses on combinatorics, discrete probability, and algorithms, with a specialization in random graph theory. She contributes to editorial boards, including Random Structures & Algorithms . Her research interests emphasize high-dimensional graphs, percolation processes, and structural properties of random graphs. She explores topics such as phase transitions, graph enumeration, and algorithmic applications in combinatorial problems. Her work bridges theoretical foundations with practical applications in algorithm design and probabilistic modeling. Dr. Kang’s scientific achievements include pioneering studies on hypergraphs, bootstrap percolation, and the evolution of random graph processes. Her recent publications highlight advancements in understanding graph components, connectivity thresholds, and universality phenomena in random structures. She collaborates widely, contributing to conferences and international initiatives like the SFB “Discrete random structures: enumeration and scaling limits.” Her professional activities include advising doctoral students and supervising research projects at TU Graz. She leads the Combinatorics Group, which hosts the Graz Combinatorics Seminar and actively engages in academic outreach. Her contributions extend to textbook authorship, including Diskrete Mathematik für die Informatik , and she maintains an active presence in discrete mathematics education and research.

Lutz Warnkeمشاهده پروفایل

استاد

• Combinatorics
• Probability Theory
• Random Graphs
• +۵ مورد دیگر

Lutz Warnke is a Professor of Mathematics at the University of California, San Diego, with prior affiliations at Georgia Institute of Technology (where he received tenure in 2021) and Peterhouse, Cambridge University (Junior Research Fellow until 2016). His research focuses on probabilistic combinatorics, random graphs, phase transitions, and combinatorial probability, with applications to extremal combinatorics and Ramsey theory. Education : Ph.D. in Mathematics from the University of Oxford (2012), supervised by Oliver Riordan. Dr. Warnke's research explores the structure and evolution of random graphs and processes, including Achlioptas processes, Ramsey numbers, and extremal problems. His work often bridges probabilistic methods with algorithmic applications and theoretical computer science. His publications from 2022–2025 reveal trends in random graph isomorphisms, clique coloring thresholds, extremal subgraph counts, and hardness of online algorithms. Key subfields include percolation, phase transitions, and probabilistic methods applied to combinatorial structures. Scientific Awards : Dénes König Prize (2016), Alfred P. Sloan Research Fellowship (2018), NSF CAREER Award (2020), Richard Rado Prize (2014). Dr. Warnke actively supervises PhD students and postdocs, including Matthew Cho (PhD ongoing), Erlang Surya (PhD 2025), Emily Zhu (PhD 2025), and He Guo (PhD 2021). He has received teaching accolades at Georgia Tech and contributes to graduate courses in probabilistic combinatorics, random graph theory, and stochastic processes.