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

Máté L. Telekمشاهده پروفایل

پژوهشگر

• Real Algebraic Geometry
• Tropical Geometry
• Particle Physics
• +۳ مورد دیگر

Máté L. Telek is a postdoctoral researcher at the Max Planck Institute for Mathematics in the Sciences (MPI-MiS) in Leipzig, Germany, working in the Nonlinear Algebra research group under Bernd Sturmfels. He completed his PhD in 2024 at the University of Copenhagen under Elisenda Feliu and will move to Leipzig University in January 2026 with a prestigious Marie Curie Fellowship to work on the project 'Positive Solutions in the Sciences'. His educational background includes a PhD from the University of Copenhagen (2024), an M.Sc. from Heidelberg University (2020), and a B.Sc. from Heidelberg University (2018). His doctoral thesis was titled 'Signed Support of Multivariate Polynomials and Applications'. Telek's research centers on real algebraic geometry and tropical geometry, with significant applications in particle physics and chemical reaction networks. His work bridges abstract mathematical theory with practical scientific problems, particularly in understanding the geometric structures underlying polynomial systems and their positive solutions. He has made notable contributions to generalizing Descartes' rule of signs to multivariate settings and analyzing connectivity in parameter regions of biochemical networks. His publication record shows a strong focus on computational aspects of algebraic geometry, with recent papers exploring connections between tropical geometry, Feynman integrals in physics, and multistationarity in reaction networks. His work demonstrates interdisciplinary reach spanning pure mathematics, theoretical physics, and systems biology. Scientific Awards: Best Talk Award at the Conference on Geometry: Theory and Applications Telek has been actively involved in the academic community through conference presentations, seminar organization (including a minisymposium at SIAM-AG25), and participation in numerous workshops. His teaching experience includes leading exercises for graduate courses at both MPI-MiS Leipzig and the University of Copenhagen, focusing on applied algebra and geometry. As a member of the Nonlinear Algebra group at MPI-MiS, Telek collaborates with an international team of researchers exploring the frontiers of algebraic methods in science. His upcoming move to Leipzig University with a Marie Curie Fellowship indicates significant recognition of his research potential and promise for future contributions to the field.

• Geometric Group Theory
• Hyperbolic Geometry
• Curves on Surfaces
• +۳ مورد دیگر

Marie Trin is a postdoctoral researcher at the Max Planck Institute for Mathematics in the Sciences (Leipzig) working in Prof. Anna Wienhard's research group since completing her PhD in June 2024. She maintains dual academic engagement through ongoing teaching appointments at Université de Rennes. Her research focuses on the intersection of geometric structures with topological dynamics, particularly examining: Geodesic currents and their applications to surface geometry Mapping class group actions on curve complexes Thurston compactification for non-compact hyperbolic surfaces Combinatorial properties of arc systems on surfaces Recent publications demonstrate methodological innovation in applying geometric group theory to solve longstanding problems in surface topology, with particular emphasis on counting techniques for geometric structures and stability properties of subgroup embeddings. Her 2024 thesis “Application des courants géodésiques à la géométrie des surfaces” established foundational connections between geodesic current theory and classical surface geometry. As an educator, she implements Federico Ardila’s teaching axioms through mathematics outreach projects and structured coursework in Euclidean geometry, probability, and computational mathematics using Python/Xcas. Her doctoral training at Université de Rennes under Juan Souto culminated in significant contributions to the geometric analysis of surface curves. She actively participates in research networks including the “Groups, Dynamics and Surfaces” conference series and maintains collaborative projects across European mathematical institutes through the Max Planck research framework.

• Geometry
• Dynamical Systems
• Lie Groups
• +۲ مورد دیگر

León Carvajales is an Adjunct Professor at the Institute of Statistics, Faculty of Economic and Administrative Sciences, University of the Republic (Uruguay). His academic journey includes postdoctoral research at Heidelberg University (mentored by Anna Wienhard and Beatrice Pozzetti) and a postdoctoral fellowship at the Mathematical Sciences Research Institute (MSRI), guided by Fanny Kassel. PhD in Mathematics, Universidad de la República (Uruguay) PhD in Mathematics, Sorbonne Université (France) Carvajales’ research lies at the intersection of geometry, dynamical systems, and Lie groups, focusing on Anosov representations and higher Teichmüller-Thurston theories. His work explores domains of discontinuity, growth of quadratic forms, and counting problems under Anosov subgroups, contributing to the understanding of discrete subgroups in Lie groups. His recent publications highlight advancements in asymmetric metrics for Anosov representations, counting problems in special-orthogonal representations, and geometric dynamics on homogeneous spaces. Collaborations with prominent researchers like Beatrice Pozzetti and Anna Wienhard underscore his engagement in collaborative mathematical exploration.

Richard Evan Schwartzمشاهده پروفایل

استاد

• Geometry
• Topology
• Dynamical Systems
• +۵ مورد دیگر

Richard Evan Schwartz is the Chancellor's Professor of Mathematics at Brown University, where he has been a faculty member since 2005, becoming Chancellor's Professor in 2010. His research spans several areas of geometry and dynamical systems, with particular focus on billiards, projective geometry, and topological phenomena. Dr. Schwartz received his B.S. in Mathematics from UCLA in 1987 and his Ph.D. from Princeton University in 1991. Prior to joining Brown, he held positions at various institutions including the University of Maryland, where he served as Associate Professor (1997-2000), Professor (2000-2004), and Ruth Davis Professor (2004-2005). His research interests include mathematical billiards, particularly outer billiards; projective geometry and the pentagram map; CR geometry; and the geometry of paper folding including Moebius bands and tori. He approaches these topics with a unique blend of theoretical analysis, computational experimentation, and visual intuition. His work often reveals surprising connections between seemingly disparate mathematical areas and frequently produces beautiful geometric patterns and structures. Dr. Schwartz's recent publications demonstrate a continued focus on geometric optimization problems, particularly in paper folding geometry. His work on optimal Moebius bands represents a significant breakthrough in a problem that had remained unsolved for decades. He has also made substantial contributions to understanding the pentagram map and its connections to integrable systems, as well as exploring connections between continued fractions, graph theory, and projective geometry. National Merit Scholar (1984-7) NSF Graduate Fellow (1987-90) Sloan Dissertation Fellow (1991) NSF Postdoctoral Fellow (1993-5) Sloan Research Fellow (1996-8) ICM Speaker (2002 and 2022) Guggenheim Fellow (2003) IAS member (2003-4 and 2020-1) Clay Research Scholar (2009) Multiple Simons Sabbatical Fellowships (2012-3, 2016-7, 2020-1, 2024-5) Dr. Schwartz has mentored numerous students through his research and teaching activities. His current research is supported by NSF grant DMS-2102802 and a Mercator Fellowship. He serves as an organizer for the Brown University Geometry/Topology Seminar, fostering academic exchange in his field. His work bridges pure mathematics with creative visualization, as evidenced by his development of numerous interactive Java programs to accompany his research. He has also authored several expository works and popular mathematics books including 'You Can Count on Monsters,' 'Really Big Numbers,' and 'Gallery of the Infinite,' making complex mathematical concepts accessible to broader audiences.

Maximilian Wiesmannمشاهده پروفایل

پژوهشگر ارشد

• Algebraic Geometry
• Computational Geometry
• Combinatorics
• +۴ مورد دیگر

Maximilian Wiesmann is a mathematician working as an ELBE Postdoctoral Fellow at the Center for Systems Biology Dresden, Germany. Previously, he completed his PhD at the Max-Planck-Institute for Mathematics in the Sciences in Leipzig under the supervision of Eliana Duarte and Bernd Sturmfels. Mentored by Aida Maraj and Ivo Sbalzarini at CSBD, his work bridges pure mathematics with applications in computational biology and quantum information. His educational background includes: PhD in Mathematics, Max-Planck-Institute for Mathematics in the Sciences, Leipzig (2025) MASt in Pure Mathematics, University of Cambridge (2022) B.Sc. in Mathematics, University of Bonn (2021) Wiesmann's research focuses on the intersection of algebraic geometry and computational mathematics, particularly in nonlinear algebra applications. His work spans theoretical investigations in toric geometry and combinatorics to practical implementations in quantum information and machine learning. He has developed significant software tools including the EulerStratifications.jl Julia package, which accompanies his research on hypersurface families. His publications demonstrate a consistent trajectory from foundational mathematical structures to their applications in statistical modeling and computational science. Analysis of his 11 most recent publications reveals a strong focus on algebraic statistics and geometric approaches to statistical problems, with increasing attention to machine learning applications. His work connects pure mathematical structures with practical computational frameworks, particularly through the lens of nonlinear algebra. The development of specialized software like EulerStratifications.jl demonstrates his commitment to making theoretical advances accessible for practical computation. Wiesmann has served as a tutor in linear algebra and foundational mathematics at the University of Bonn during winter terms 2019/20 and 2020/21. He also completed a Quantum Science Summer Internship at Riverlane in Cambridge, UK in 2021, and was a visiting student at the Institute for Mathematical and Statistical Innovation at the University of Chicago in September and October 2023. At CSBD, Wiesmann is part of a vibrant research environment focused on systems biology, where he applies his expertise in algebraic geometry to biological modeling problems. His work with the Nonlinear Algebra Community on Zenodo demonstrates his commitment to open science and community building in his field.

Sunil Golwalaمشاهده پروفایل

استاد

• Dark Matter
• Dark Energy
• Astrophysics
• +۳ مورد دیگر

Prof. Sunil Golwala is a Professor of Physics at the California Institute of Technology (Caltech), affiliated with the Division of Physics, Mathematics, and Astronomy. His research focuses on dark matter and dark energy, employing cutting-edge experiments such as the Cryogenic Dark Matter Search (CDMS), Bolocam, and Microwave Kinetic Inductance Detectors (MKIDs). He leads efforts in detector development for cosmological and particle physics applications, including projects like the Germanium Observatory for Dark Matter (GEODM) and the Cornell-Caltech Atacama Telescope (CCAT). Education: B.A., University of Chicago (1993); M.A., University of California, Berkeley (1995); Ph.D., UC Berkeley (2000). Academic roles include Assistant Professor (2003–2010), Associate Professor (2010), and Professor (2010–present). He served as Director of the Caltech Submillimeter Observatory (2013–2024) and is currently Deputy Executive Officer for Astrophysics. Research Interests: Prof. Golwala’s work bridges experimental particle physics and cosmology. Key areas include: Direct detection of WIMP dark matter using cryogenic detectors. Submillimeter astronomy with Bolocam to study galaxy clusters via the Sunyaev-Zeldovich (SZ) effect. Development of MKID technology for dark matter and cosmological applications. Future projects include the CCAT telescope and the GEODM ton-scale experiment. Teaching: He teaches advanced courses in classical physics (Ph106bc), quantum mechanics (Ph125ab), and non-accelerator particle physics (Ph135c). Courses emphasize rigorous problem-solving and foundational techniques. Labs/Teams: Active in the Caltech Submillimeter Observatory and collaborations with CDMS/SuperCDMS, CCAT, and MKID development teams.

• Applied mathematics
• Pure mathematics
• Theory of computation
• +۷ مورد دیگر

Dr. Ban Pin Tan is a Mathematics Lecturer at the National University of Singapore (NUS), holding a PhD from NUS awarded in 1997. His research focuses on graph theory and digraph properties, particularly in kings in multipartite digraphs, eccentric digraphs, Roman domination, bondage numbers, and optimal orientations. He has contributed to over 8 peer-reviewed publications since 1995, addressing structural properties of tournaments and multipartite graphs. His work includes foundational studies on dominance hierarchies, 3/4-kings enumeration, and digraph orientation optimizations. Dr. Tan emphasizes teaching methodologies that foster deep conceptual understanding through systematic lecture notes, 'Pause and Think' sessions, and problem-solving exercises. He believes in inspiring students to apply mathematical principles to real-world challenges, aligning with Singapore's knowledge-based economy goals. His pedagogical approach combines rigorous problem sets with frequent quizzes to enhance critical thinking and engagement. His long-term research program includes: (1) studying kings-of-kings in semicomplete multipartite digraphs, (2) analyzing eccentric digraphs of various graph classes, (3) determining optimal orientations for graph families, (4) evaluating Roman domination and bondage numbers, and (5) exploring magic graph properties. Current investigations focus on eccentric digraphs, Roman domination extensions to digraphs, and magic graph characteristics.

Friedrich Slivovskyمشاهده پروفایل

پژوهشگر

• Quantified Boolean Formulas
• Propositional Model Counting
• Knowledge Compilation
• +۵ مورد دیگر

Friedrich Slivovsky is a researcher at the Institute of Logic and Computation within the Faculty of Informatics at Technische Universität Wien (Vienna University of Technology). His work focuses on theoretical and practical aspects of computational logic, with particular expertise in Quantified Boolean Formulas (QBFs), Propositional Model Counting (#SAT), and Knowledge Compilation. His research interests span the theoretical foundations and practical applications of computational logic. Slivovsky investigates the complexity of logical reasoning problems, develops efficient algorithms for solving them, and creates practical tools that implement these theoretical advances. His work bridges the gap between theoretical computer science and practical applications in areas like hardware verification, artificial intelligence, and electronic design automation. Analysis of his publication trends reveals a consistent focus on QBF solving techniques, with increasing emphasis on circuit minimization, proof complexity, and practical solver engineering. His recent work (2023-2024) shows a strong focus on circuit minimization techniques, combining QBF and SAT approaches to solve complex optimization problems in hardware design. Earlier work (2019-2021) emphasized dependency schemes, certification methods, and theoretical foundations of QBF solving. Slivovsky leads several significant software projects that have become important tools in the computational logic community: Qute : A dependency learning QBF solver with GitHub repository showing active development (latest commit December 2024) Unique : A preprocessor for (D)QBF that computes unique Skolem and Herbrand functions Pedant : A certifying DQBF solver These projects demonstrate his commitment to translating theoretical advances into practical tools that benefit the broader research community.

Thomas Eiterمشاهده پروفایل

استاد

• Answer Set Programming
• Knowledge Representation
• Logic Programming
• +۷ مورد دیگر

Thomas Eiter is a Professor at TU Wien's Institute of Logic and Computation. His research focuses on declarative programming paradigms, knowledge representation, and artificial intelligence. He leads projects in neurosymbolic systems, answer set programming (ASP), and stream reasoning, with applications in visual question answering, scheduling optimization, and semantic scene generation. Eiter has contributed to foundational work in ASP semantics, computational complexity, and hybrid reasoning frameworks. His work bridges logical formalisms with practical AI challenges, emphasizing explainability and scalability. Projects like ALASPO and neurosymbolic integration showcase his focus on advancing both theoretical and applied aspects of AI. Projects: HumanE AI Network, WASP, REWERSE Research Themes: Neurosymbolic AI, Answer Set Programming, Stream Reasoning Notable achievements include pioneering work on semiring-based reasoning frameworks and developing efficient ASP solvers like Alpha. His contributions span over 471 publications, emphasizing interdisciplinary applications in computer vision, robotics, and automated planning.

Ilias Zadikمشاهده پروفایل

استادیار

• High-Dimensional Statistics
• Machine Learning Theory
• Computational-Statistical Trade-offs
• +۵ مورد دیگر

Ilias Zadik is an Assistant Professor at Yale University's Department of Statistics and Data Science. His research focuses on computational-statistical trade-offs in modern machine learning, high-dimensional statistics, and probability theory. He has held postdoctoral positions at MIT (2021-2023) and NYU (2019-2021), and earned his PhD from MIT (2019), advised by David Gamarnik. He teaches courses like Stochastic Processes and has contributed to numerous conferences and workshops. His awards include MIT's Best Student Paper Honorable Mention (2017) and scholarships from Trinity College and the Onassis Foundation. Education: PhD in Operations Research, MIT (2019) MASt in Mathematics (Part III), University of Cambridge (2014) BA in Mathematics, University of Athens (2013) Internship at Microsoft Research New England (2017) Research Interests: Computational-statistical trade-offs, phase transitions in inference (e.g., All-or-Nothing phenomena), cryptographic methods in statistics, privacy-cost analysis, and algorithmic lower bounds. Awards: MIT Operations Research Best Student Paper Honorable Mention (2017) Trinity College Senior Scholarship (2014) Onassis Foundation Scholarship (2013-2014) SEEMOUS Gold Medal (2011), IMC First Prize (2011) Teaching & Service: Instructor for Yale's S&DS 351 (Stochastic Processes) and advanced courses on computational-statistical trade-offs. Co-organized the MaD+ seminar during the pandemic. Served on program committees for COLT, NeurIPS, and FOCS. Labs/Teams: Active in MIT's NSF/Simons Collaboration on Theoretical Foundations of Deep Learning and NYU's Math and Data group.

Christopher Hampsonمشاهده پروفایل

مدرس ارشد

• Modal and Temporal Logics
• Algorithms and Computational Complexity
• Theoretical Computer Science
• +۴ مورد دیگر

Dr. Christopher Hampson is a Senior Lecturer in Computer Science (Education) at King’s College London's Department of Informatics, part of the Faculty of Natural, Mathematical & Engineering Sciences. He specializes in theoretical computer science, modal logics, and algorithmic complexity. He holds an MSc in Mathematical Logic from the University of Manchester and a PhD from King’s College London on modal logic topics. His research focuses on Modal and Temporal Logics Computational Complexity Formal Verification Counter Machine Theory Computer Science Education Recent work includes studies on non-repudiation in healthcare AI systems (2024), termination analysis of faulty counter machines (2021), and dialogue systems for handling misunderstandings (2022). He collaborates with the Computing Education Research Centre (CERC) to advance pedagogical tools and curricula in computer science. Awards: none explicitly listed. Supervision: no named advisees found. Active in research groups focused on formal methods and education innovation.

Barry Allen Balofمشاهده پروفایل

استادیار

• Combinatorics
• Ordered Sets
• Geometric Representations
• +۱۲ مورد دیگر

Barry Balof is an Assistant Professor of Mathematics at Whitman College. He holds a Ph.D. in Mathematics from Dartmouth College (2003) and has been at Whitman since 2003. His research focuses on combinatorics, with a particular emphasis on geometric representations of partially ordered sets (e.g., free triangle orders), graph theory, and applications in data management, social science, and mathematical psychology. Education Ph.D., Mathematics, Dartmouth College (2003) M.A., Mathematics, Dartmouth College (2000) B.A., Mathematics and History, Colorado College (1997) His recent work explores enumerative combinatorics and the appearance of number sequences in interdisciplinary contexts. Articles highlight contributions to hypergraph spectral theory, algebraic combinatorics, and polytope representations. A recurring theme is the interplay between abstract mathematical structures and their practical applications. Scientific Awards include the A. E. Lange Award for Distinguished Science Teaching (2007), the Louis B. Perry Research Award (2006), and the Barry Goldwater Scholar (1996). He has supervised students in projects such as Enumerative Combinatorics , Tableaux Theory , and Matroid Theory and collaborates with institutions like Université Libre de Bruxelles.

Miki Hermannمشاهده پروفایل

پژوهشگر

• Computational Complexity
• Constraint Satisfaction Problems
• Satisfiability
• +۴ مورد دیگر

Miki Hermann is a CNRS Researcher at the Laboratory of Computer Science (LIX) at École Polytechnique, France. He is affiliated with the Algorithms and Complexity research group and maintains an active research program in theoretical computer science and computational logic. His research interests span computational complexity, constraint satisfaction problems, satisfiability, and logic in computer science. Hermann's work focuses on the theoretical foundations of computational problems, particularly examining complexity classifications, counting problems, and algorithmic solutions for logical and combinatorial structures. His research bridges theoretical computer science with practical applications in artificial intelligence and data analysis. The analysis of his recent publications reveals a consistent focus on computational complexity across various logical frameworks. His work demonstrates expertise in classifying the complexity of constraint satisfaction problems, propositional logic systems, and graph-theoretic problems. Notable research directions include minimal inference problems, counting complexity, and applications of satisfiability to big data transformation through his MCP project. Hermann is part of the Algorithms and Complexity research group at LIX (CNRS, UMR 7161), where he contributes to theoretical computer science research. He has developed significant software projects including MCP (Multi-Classification Project) for transforming datasets into propositional formulas and GYT (Generalized Young Tableaux) for solving variadic polynomial equations over non-negative integers.

Ulrich Görtzمشاهده پروفایل

استاد

• Arithmetic Geometry
• Number Theory
• Abelian Varieties
• +۳ مورد دیگر

Prof. Dr. Ulrich Görtz is a full-time faculty member at the University of Duisburg-Essen, leading the Research Group Görtz in the field of Arithmetic Geometry and Number Theory. His work bridges abstract algebraic geometry with number-theoretic structures, focusing on topics like Shimura varieties, Frobenius traces, and abelian varieties in positive characteristic. Research Areas: Arithmetic Geometry, Number Theory, Abelian Varieties, Positive Characteristic Geometry Organized Workshops: Oberwolfach workshops (2015, 2019) on reduction of Shimura varieties His research group includes current PhD students Giulio Marazza and Thiago Solovera e Nery, along with former members such as Francesc Fité, Xavier Guitart, and Martin Kreidl. He has collaborated with institutions like the Mathematisches Forschungsinstitut Oberwolfach and the Hausdorff Center in Bonn. The group's publications span p-adic geometry, moduli spaces, and vector bundle theory, with contributions to the understanding of Iwahori level structures, Sato-Tate groups, and Demazure resolutions. His work has appeared in journals like Ann. Inst. Fourier , Compos. Math. , and Math. Z. Prof. Görtz is actively involved in mentoring students and postdocs, with a team including secretary Julia Schulte-Kellinghaus and former collaborators like Ulrich Terstiege and Christian Kappen. His contact details include an email address ulrich.goertz@uni-due.de .

Jin-Yi Caiمشاهده پروفایل

استاد

• Computational Complexity Theory
• Theoretical Computer Science
• Algorithms
• +۳ مورد دیگر

Jin-Yi Cai is a Professor in the Computer Sciences Department at the University of Wisconsin - Madison. He holds the Rajiv & Ritu Batra Chair in Computer Science and has authored over 100 research papers. His academic journey includes a Ph.D. from Cornell University in 1986 and faculty positions at Yale, Princeton, and SUNY Buffalo. Education: Fudan University (class of 77), Cornell University (Ph.D., 1986) Previous Institutions: Yale University (1986-1989), Princeton University (1989-1993), SUNY Buffalo (1993-2000) His research focuses on computational complexity theory, algorithms, and theoretical computer science. He has explored lattice problems, graph homomorphisms, and holographic algorithms. The 15 most recent publications highlight advancements in constraint satisfaction problems, planar graphs, and dichotomy theorems, reflecting his deep engagement with complexity classification. Scientific Awards: Presidential Young Investigator Award (1990) Alfred P. Sloan Fellowship (1994) Guggenheim Fellowship (1998) Morningside Silver Medal (2004) Humboldt Research Award ACM Fellow AAAS Fellow AMS Fellow Foreign Member of Academia Europaea Gödel Prize Fulkerson Prize He serves as Editor for several journals, including the Journal of Computer and Systems Sciences and Computational Complexity . His work bridges foundational theoretical research with practical algorithmic applications, influencing both academia and industry.