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

• Combinatorics
• Probability
• Statistical Mechanics
• +۴ مورد دیگر

Olivier Bernardi is a Professor of Mathematics and Chair of the Brandeis University Department of Mathematics. His research focuses on combinatorics, with applications in probability, mathematical physics, computer science, and algebra. He specializes in bijective methods, encoding complex geometric structures into simpler forms like lattice paths and trees. A key interest is the combinatorics of maps (embedded graphs), which intersect fields like random surface theory and representation theory. Education includes a Ph.D. from Université Bordeaux 1, and M.S. and B.S. degrees from École Normale Supérieure Paris. His work bridges theoretical combinatorics with practical algorithms, emphasizing structural insights through bijections. Recent publications explore Tutte polynomials, percolation on triangulations, and geometric drawing algorithms. Awards and grants are not explicitly listed, but his leadership role as Department Chair highlights institutional contributions. He advises on research in discrete mathematics and collaborates on projects involving graph enumeration and algebraic combinatorics. His research spans foundational topics, with applications in both pure and applied mathematical domains.

• Automorphic Forms
• Modular Forms
• Combinatorics
• +۷ مورد دیگر

Karl Mahlburg was an Associate Professor in the Department of Mathematics at Louisiana State University from 2011 to 2021. He holds a Ph.D. in Mathematics from the University of Wisconsin-Madison, an M.S. in Mathematics, and a B.S. in Mathematics from Harvey Mudd College. His research focuses on automorphic forms, partition theory, combinatorial number theory, and nonstandard analysis. Research interests include: Theory of automorphic forms including modular forms and harmonic Maass forms Applications to partition theory and basic hypergeometric series Algebraic and finite combinatorics including graph theory Combinatorial probability and nonstandard analysis Dr. Mahlburg has received several prestigious awards including the Humboldt Foundation Fellowship, LSU Faculty Excellence Award, and PNAS Paper of the Year Award for his groundbreaking work on partition congruences. His research has been supported by NSF grants and Louisiana Board of Regents funding. He has advised numerous graduate and undergraduate students in mathematics research, with doctoral students pursuing careers in academia and industry. Dr. Mahlburg organized LSU's Problem-Solving Seminar for undergraduate mathematics competitions and served on multiple departmental committees.

• Discrete Geometry
• Algebraic Combinatorics
• Polytope Theory
• +۶ مورد دیگر

Cesar Ceballos is an Assistant Professor at TU Graz, leading the Discrete Geometry and Algebraic Combinatorics Group . He holds academic positions since 2012, including postdoctoral roles at FU Berlin, York University, and the Fields Institute. His research focuses on algebraic, combinatorial, and geometric problems, particularly in polytope theory, Coxeter groups, diagonal harmonics, and cluster algebras. He has overseen multiple grants, including the ANR-FWF Project PAGCAP and FWF Stand Alone Project. Ceballos has advised numerous PhD students and postdocs, including Joseph Dorfer and Matthias Müller. His teaching includes courses like Discrete and Computational Geometry and Topics on Combinatorics, Algebra, and Geometry . He earned his PhD from FU Berlin under Günter Ziegler and completed habilitations at TU Graz (2021) and the University of Vienna (2020). Research Interests: Polytope theory, simplicial complexes, tropical geometry, Coxeter groups, subword complexes, diagonal harmonics, Hopf algebras, and cluster algebras. Awards: Banting Postdoctoral Fellowship (2013-2015), Elsevier Sponsorship Fund (2018), MRI Master Class Fellowship (2008-2009), and multiple grant leadership roles. Lab/Team: The Discrete Geometry and Algebraic Combinatorics Group at TU Graz.

Andrei Asinowskiمشاهده پروفایل

پژوهشگر

• Discrete Mathematics
• Combinatorics
• Computational Geometry
• +۳ مورد دیگر

Andrei Asinowski is a Researcher at the Institute of Mathematics at Alpen-Adria-Universität Klagenfurt. He has held academic appointments at institutions including Bielefeld University (2005–2006), University of Haifa (2006–2008), Technion (2008–2011), Free University of Berlin (2012–2015), and TU Wien (2015–2018). Since 2020, he leads the FWF-funded project 'Generic Rectangulations: Enumerative and Structural Aspects' (P32731). His research focuses on combinatorics, discrete mathematics, computational geometry, and enumerative combinatorics. Key interests include rectangulations, permutation patterns, lattice paths, and guillotine partitions. Research Interests: Combinatorics of rectangulations, permutation classes, enumerative combinatorics, geometric permutations, and algorithmic applications of discrete structures. His work bridges combinatorial theory and computational geometry, with recent emphasis on bijections between rectangulations and permutations, generating functions, and analytic methods. Grants & Projects: Principal Investigator of FWF Grant P32731 (since 2020), exploring enumerative and structural aspects of rectangulations. Collaborative projects include EuroGIGA's ComPoSe (2012–2015) and SFB F50's Algorithmic and Enumerative Combinatorics (2015–2018). Publications Trends: Recent work emphasizes rectangulation enumeration, permutation patterns, and analytic combinatorics techniques. Earlier contributions addressed geometric permutations, computational geometry, and lattice path enumeration.