Find Academic Supervisors

Tian An WongView profile

Associate Professor

• Number Theory
• Representation Theory
• Algebraic Geometry
• +7 more

Tian An Wong is an Associate Professor of Mathematics at the University of Michigan-Dearborn, with affiliations in the College of Arts, Sciences, and Letters and the Center for Southeast Asian Studies. They are actively involved in research at the intersection of pure mathematics and social justice issues. Dr. Wong's educational background includes a PhD in Mathematics from the City University of New York (CUNY) Graduate Center (2016) and a BA in Mathematics from Vassar College (2011). Wong's research spans both pure mathematics and applied areas with social relevance. Their primary mathematical interests include: Number Theory, particularly modular forms and L-functions Representation Theory Automorphic Forms Topological Data Analysis applied to social issues Causal inference in policing data Wong has published extensively in both pure mathematics journals and interdisciplinary venues. Their recent work shows a strong trend toward applying mathematical techniques to analyze police violence, predictive policing algorithms, and social justice issues. This dual focus on theoretical mathematics and socially relevant applications makes their research program distinctive. Notable scientific contributions include: Work on Bianchi modular forms and their applications Research on Dedekind sums and their connections to number theory Analysis of police violence using topological data analysis Critical examinations of predictive policing algorithms Wong advises numerous students, particularly on projects that bridge pure mathematics with social justice applications. They lead the Blue Data Lab, which studies police violence, surveillance, and technology, and are involved in the Mathematical and Computational Approaches to Social Justice initiative. Wong is also active in public scholarship, writing for venues like the AMS Inclusion/Exclusion blog, Times Higher Education, and Critical Asian Studies, where they address issues of race, equity, and the role of mathematics in society.

Kaethe MindenView profile

Assistant Professor

• Logic
• Set Theory
• Combinatorial Group Theory
• +3 more

Kaethe Minden is an Assistant Professor of Mathematics at Bard College at Simon's Rock. She holds a PhD from The Graduate Center, City University of New York, and a BS from the University of California Los Angeles. Her research focuses on logic and set theory, particularly large cardinals and forcing, with recent work intersecting combinatorial group theory via infinitary Latin squares. She joined Simon's Rock in 2019, following roles as a Mathematics Fellow at Marlboro College and as a graduate instructor at CUNY. Her academic background includes advanced studies in foundational mathematics, with a strong emphasis on theoretical frameworks and their applications. Minden’s teaching philosophy integrates active learning strategies, as evidenced by her publications on writing-based pedagogy in undergraduate mathematics education. Her research articles span set-theoretic forcing techniques, combinatorial structures, and educational methodologies. Notable work includes explorations of subcomplete forcing, resurrection axioms, and infinite Latin squares. She actively contributes to advancing mathematical education through innovative assessment tools and metacognitive strategies, particularly in pandemic-era online learning environments.

• Finite Geometries
• Combinatorics
• Topological Graph Theory
• +1 more

Oscar Vega is a Professor in the Department of Mathematics at California State University, Fresno. He holds a Licenciatura en Matemáticas from Universidad de Chile and a Ph.D. in Mathematics from the University of Iowa. His research focuses on Finite Geometries, Combinatorics, and Topological Graph Theory. He teaches a wide range of mathematics courses, including MATH 75, MATH 100, MATH 111, and advanced topics like MATH 251 and MATH 263. Education: Licenciatura en Matemáticas, Universidad de Chile Ph.D. Mathematics, University of Iowa Research Interests: Vega explores Finite Geometries to study combinatorial structures, applies Combinatorics to solve problems in design theory, and investigates Topological Graph Theory focusing on graph embeddings and spatial networks. His work bridges abstract mathematical frameworks with practical applications in education and computational modeling. His courses reflect expertise across foundational and advanced mathematical disciplines, from introductory calculus (MATH 75/75A/75B) to graduate-level topics in algebra (MATH 250/251/252) and discrete mathematics (MATH 260/263). No specific grants, advising records, or published articles are listed here, though his professional webpage may contain additional details.

Laura TaalmanView profile

Professor

• Algebraic Geometry
• Knot Theory
• Game and Puzzle Analysis
• +4 more

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.

• Matrix Analysis
• Discrete Mathematics
• Graph Theory
• +3 more

Margarida Mitjana Riera is a Senior Professor at the Universitat Politècnica de Catalunya (UPC), affiliated with the Department of Applied Mathematics I and the Faculty of Mathematics and Statistics. She is part of the MAPTHE (Matrix Analysis and Discrete Potential Theory) and OMGRAPH (Optimization Methods on Graphs) research groups. Her work focuses on matrix analysis, graph theory, linear algebra applications in networks, and optimization. She holds a degree in Mathematics and a PhD from UPC. Her research interests include inverse eigenvalue problems, network analysis, resistance distances, and circulant matrices. She has authored over 200 publications, including articles in journals like Linear Algebra and Its Applications and Special Matrices , and contributed to projects on optimization methods on graphs and discrete potential theory. She actively participates in conferences and collaborates on educational initiatives like the Curs 0 preparatory program for engineering students. Her grants include AGRUPS 2024 and prior competitive R+D+I projects. She advises on research in subdivision networks and matrix theory, with contributions to both theoretical and applied mathematics.

Andrés R. Vindas MeléndezView profile

Assistant Professor

• algebraic combinatorics
• enumerative combinatorics
• geometric combinatorics
• +4 more

Andrés R. Vindas Meléndez is a Costa Rican-American mathematician currently serving as an Assistant Professor of Mathematics at Harvey Mudd College . Prior to this role, he held positions as a National Science Foundation Postdoctoral Fellow and Lecturer at UC Berkeley and as a Postdoctoral Scholar at the Simons Laufer Mathematical Sciences Institute (formerly MSRI). He is also a research scholar at the Institute for Computational and Experimental Research Mathematics (ICERM) for the Data Science & Social Justice program. Education : PhD in Mathematics from the University of Kentucky, MS in Mathematics from San Francisco State University, and BA in Mathematics from UC Berkeley with minors in Philosophy and Chicanx & Latinx Studies. Vindas Meléndez focuses on algebraic, enumerative, and geometric combinatorics , with additional interests in data science for social justice and the scholarship of teaching and learning . His work includes Ehrhart theory, Catalan combinatorics, and polynomial properties like real-rootedness and gamma-positivity. He emphasizes quantitative justice and interdisciplinary applications of mathematics to address racial and social issues. Scientific Awards : National Science Foundation Postdoctoral Fellow. At Harvey Mudd, he fosters inclusive mathematical communities, aiming to dismantle systemic barriers in mathematical spaces. His affiliations with ICERM and SLMath highlight his engagement with programs focused on fairness and equity in data science.

Arne WinterhofView profile

Researcher

• Finite Fields
• Number Theory
• Coding Theory
• +5 more

Arne Winterhof is a Senior Fellow at the Johann Radon Institute for Computational and Applied Mathematics (RICAM) of the Austrian Academy of Sciences. He holds the title of University Lecturer (Univ.-Doz.) and has extensive experience in academic leadership, including project leadership roles in multiple FWF-funded research projects. His primary affiliation is with RICAM's Applied Discrete Mathematics and Cryptography group. Winterhof earned his Diploma (summa cum laude) and PhD (summa cum laude) in Mathematics from TU Braunschweig (1994, 1996) and completed his Habilitation at the University of Vienna in 2001. He has held positions at institutions such as Temasek Laboratories (National University of Singapore) and has been a Senior Scientist and Fellow at RICAM since 2003. In 2016, he declined a Full Professorship offer at the University of Rostock. His research focuses on Finite Fields, Number Theory, Coding Theory, Cryptology, Combinatorics, and Cryptography. He has received prestigious awards, including the Edmund and Rosa Hlawka Prize (2004) and the Austrian Mathematical Society Advancement Award (2010). He serves on editorial boards for journals like Finite Fields and Their Applications and Cryptography and Communications . Winterhof has led numerous research projects, including Generalized Cyclotomic Mappings of Finite Fields (2025–2027) and On the Hierarchy of Measures of Pseudorandomness (2014–2018). His work emphasizes pseudorandom sequence design, cryptographic applications, and theoretical foundations in discrete mathematics.

• Analytic Number Theory
• Probabilistic Number Theory
• Multiplicative Number Theory
• +5 more

Dimitrios Koukoulopoulos is a Full Professor at the University of Montreal's Faculty of Arts and Sciences, specializing in the Department of Mathematics and Statistics. His research focuses on analytic, probabilistic, and multiplicative number theory, including sieve methods, additive combinatorics, and the anatomy of integers and permutations. He is a member of the Centre de recherches mathématiques (CRM) and has supervised numerous postdoctoral fellows and graduate students. Key research projects include topics on L-functions, multiplicative functions, and log-correlated fields, supported by grants from NSERC and the FRQNT. Notable contributions include resolving the Duffin-Schaeffer conjecture and authoring a 2019 book on prime number distribution. His work spans pure and applied mathematics, with extensive collaborations in number theory and mathematical analysis. Grants: Leads projects on divisor distribution, L-functions, and random multiplicative functions (2024–2030), supported by NSERC and FRQNT. Advising: Supervised over 20 students, including postdocs and doctoral candidates in number theory and related fields. He holds administrative roles, including overseeing graduate studies in mathematics at the University of Montreal.

Szemerédi EndreView profile

Professor

• Discrete mathematics
• Combinatorics
• Theoretical computer science
• +1 more

Endre Szemerédi is a Hungarian mathematician and computer scientist, currently serving as a Permanent Research Fellow at the Alfréd Rényi Institute of Mathematics (Hungarian Academy of Sciences) and holding the New Jersey Professor of Computer Science position at Rutgers University since 1986. His career spans prestigious institutions including Stanford, Caltech, and the Institute for Advanced Study. Expertise: Discrete mathematics, combinatorics, theoretical computer science, and number theory. Education: M.Sc. (1965, Eötvös Loránd University), Ph.D. (1970, Moscow State University under Israel Gelfand). Research legacy encompasses foundational contributions to combinatorics, graph theory, and computational complexity. His work on Hamiltonian cycles in random graphs , parallel sorting networks , and the Blow-up Lemma revolutionized extremal combinatorics and algorithm design. Scientific honors include: 2012 Abel Prize and Széchenyi Prize 2008 Rolf Schock Prize and Steele Prize 1982 Member of Hungarian Academy of Sciences , 2010 Member of US National Academy of Sciences 1975 Pólya Prize , 1973 Rényi Prize , multiple Grünwald Prizes .

Reza AkhtarView profile

Professor

• Algebraic Geometry
• Combinatorics
• Quasigroups
• +7 more

Dr. Reza Akhtar is a Professor of Mathematics at Miami University, serving as Associate Chair. He holds a Ph.D. in Mathematics from Brown University. His research focuses on Algebraic Geometry, Combinatorics, Quasigroups, and Abstract Algebra, with notable contributions to topics like group theory, combinatorial structures, and algebraic number theory. Dr. Akhtar has authored numerous publications in prestigious journals and has taught advanced courses such as Abstract Algebra, Algebraic Geometry, and Financial Mathematics. He is actively involved in graduate education, supervising graduate-level algebra courses. Education: Ph.D., Mathematics (Brown University); Senior Thesis on Cyclotomic Euclidean Number Fields Affiliations: Department of Mathematics, Miami University; Oxford, Ohio His research interests span a wide range of mathematical disciplines, including K-theory, algebraic geometry, combinatorics, and number theory. Recent work includes studies on quasigroups, zero-divisor graphs, and applications to cryptography. Dr. Akhtar has also contributed to interdisciplinary projects, such as Toric Residue Codes and connections between group theory and music theory through Messiaen's modes. Teaching highlights include courses like Algebraic Graph Theory, Financial Mathematics for Actuaries, and graduate-level Algebra sequences. He has been instrumental in mentoring students through Miami's SUMSRI program, focusing on topics like elliptic curves and advanced algebraic structures.

Lia SchützeView profile

Researcher

• Formal Methods
• Verification
• Automata Theory
• +3 more

Lia Schütze is a Researcher at the Max Planck Institute for Software Systems (MPI-SWS) in Kaiserslautern, Germany, with an office in Room 612, Building G 26. Her work falls under the institute's research domains including Algorithms, Theory & Logic, Programming Languages & Verification, Cyber-Physical Systems, and Security & Privacy. She maintains an active research profile with publications spanning theoretical foundations to applied verification systems. Her research program centers on formal verification of infinite-state computational models, with dual expertise in theoretical computer science and network performance analysis. Key contributions include: Advancing verification techniques for Vector Addition Systems with States (VASS) and reversal-bounded counter machines Developing novel approaches to unboundedness problems through amalgamation methods Establishing tighter bounds for coverability and reachability in computational models Applying network calculus to verify industrial control systems and stochastic network performance Investigating well-quasi-orderings and monotone descending chains for termination analysis Analysis of her 2017-2025 publications reveals a clear evolution from applied network calculus toward increasingly sophisticated theoretical verification frameworks. Her work consistently bridges abstract mathematical foundations with practical verification challenges, particularly in cyber-physical systems where theoretical guarantees meet real-world performance constraints. The recurring focus on improving computational bounds demonstrates her commitment to making verification techniques practically feasible. No scientific awards or fellowships are documented in the available information about Dr. Schütze's career. While specific doctoral advisees are not mentioned in the provided materials, her active publication record and institutional role at MPI-SWS suggest ongoing mentorship within research teams. Similarly, though no explicit grants are referenced, her sustained research output implies successful funding acquisition for projects in formal methods and verification. As a core researcher at MPI-SWS, Dr. Schütze contributes to one of Europe's premier computer science research environments. Her work intersects with multiple institute focus areas, particularly within the Algorithms and Theory group and Programming Languages and Verification initiatives. The collaborative structure of MPI-SWS enables her theoretical advances to directly impact practical verification tools and methodologies used across the software systems research community.

Vadim SokolovView profile

Associate Professor

• Systems Engineering
• Operations Research
• Transportation Systems Analysis
• +6 more

Vadim Sokolov is an Associate Professor in the Department of Systems Engineering and Operations Research at George Mason University (GMU), with affiliate status in the College of Engineering and Computing (CEIE). His research focuses on developing robust methodologies for large-scale systems analysis, combining agent-based modeling, Bayesian statistical techniques, and computational experimentation. He co-developed Polaris, an open-source mobility simulator widely used in transportation network analysis by government entities. Previously, Sokolov served as a Principal Computational Scientist at Argonne National Laboratory, a Fellow at the University of Chicago's Computation Institute, and a Lecturer at the University of Chicago. He holds a Ph.D. in Computational Mathematics from Northern Illinois University. His research interests span agent-based modeling, Bayesian analysis, transportation systems, and computational software development. Notable contributions include work on stochastic computer models, deep learning applications in traffic flow prediction, and quantum Bayesian computation. He has published in top-tier journals such as the Annals of Applied Statistics and Transportation Research Part C. Though no awards are explicitly listed, his extensive publications and industry collaborations highlight his impactful work in computational systems and transportation analysis.

Bojan BašićView profile

Professor

• Combinatorics
• Discrete Geometry
• Word Theory
• +2 more

Bojan Bašić is Full Professor in Mathematical Logic and Discrete Mathematics at the Faculty of Sciences, University of Novi Sad. His office is located in building DMI&DF (second floor, room 27). His research spans discrete mathematics with focus areas in combinatorial word theory, geometric tiling problems (Heesch number analysis), and discrete structures. He maintains an active publication record in combinatorial mathematics. His recent articles demonstrate sustained focus on combinatorial problems in discrete geometry (particularly Heesch tiling problems) and combinatorics on words (palindromic structures and permutation theory). The research combines abstract combinatorial reasoning with algorithmic approaches. He maintains a personal research website and provides academic consultations.

• Combinatorics
• Probabilistic Methods
• Random Graphs
• +4 more

Rajko Nenadov is a Lecturer in Theoretical Computer Science at the University of Auckland, New Zealand. Previously, he earned his PhD from ETH Zurich in 2016 under Angelika Steger. He held postdoctoral positions at Monash University (Australia) and ETH Zurich, focusing on combinatorics and graph theory. Between 2018–2022, he worked as a software engineer at Google Zurich, contributing to search ranking algorithms. Returning to academia in 2023, his research emphasizes probabilistic methods, random structures, and applications in theoretical computer science. His education includes a PhD in Computer Science from ETH Zurich (2016). Notable career milestones include postdoctoral research on expanders, pseudorandomness, and Ramsey theory, followed by industry experience in algorithmic development. Rajko’s research interests revolve around combinatorics, with a focus on probabilistic methods, random graphs, extremal graph theory, and Ramsey theory. His work bridges foundational combinatorics with practical applications in computer science, particularly in algorithm design and computational complexity. His recent publications explore topics like hypergraph universality, container theorems, and extremal subgraph counting. These contributions highlight advancements in probabilistic combinatorics and structural graph theory. No scientific awards or grants are explicitly listed in the provided information. His career transition from academia to industry and back underscores his interdisciplinary expertise in theory and applied computing.

Adam ShefferView profile

Associate Professor

• Computational Geometry
• Discrete Mathematics
• Incidence Geometry
• +3 more

Adam Sheffer is an Associate Professor of Mathematics at Baruch College and the Graduate Center of the City University of New York (CUNY). He is a member of Baruch's Discrete Math Group and serves as the Director of the NYC Discrete Math REU and the Baruch College Computer Science Program. His research focuses on computational geometry, discrete mathematics, and additive combinatorics, with notable contributions to incidence geometry and polynomial methods. He is the author of Polynomial Methods and Incidence Theory (Cambridge University Press) and an editor of the Journal of Computational Geometry . Sheffer's academic activities include organizing the Polymath Jr Program and the NYC Geometry Seminar. He has mentored numerous student research projects, several of which have led to published papers. Key research interests include geometric incidences, distinct distances problems, and combinatorial configurations. His work frequently bridges algebraic and geometric techniques to solve problems in discrete mathematics.