جستجوی استاد راهنمای دانشگاهی

Youness Lamzouriمشاهده پروفایل

استاد

• Analytic Number Theory
• Probabilistic Number Theory
• Character Sums and Exponential Sums
• +۷ مورد دیگر

Youness Lamzouri is a Professor of Mathematics at the Université de Lorraine, France, affiliated with the Institut Elie Cartan de Lorraine (IECL) and a Junior Member of the Institut Universitaire de France (IUF). His research focuses on analytic and probabilistic number theory, particularly character sums, L-functions, prime number distributions, and random multiplicative functions. PhD in Mathematics from Université de Montréal (2009) B.Sc. in Pure Mathematics from Université de Montréal (2004) He has contributed extensively to understanding extreme values in character sums, biases in prime number races, and statistical properties of L-functions. His recent work explores GCD graphs, random walks in number theory, and probabilistic models for prime distributions. He has received prestigious awards including the CMS Blair Spearman Doctoral Prize and NSERC Postdoctoral Fellowship. Currently, he supervises doctoral and master students and contributes to editorial boards of leading journals.

Hoon Hongمشاهده پروفایل

استاد

• Computer Algebra
• Computational Real Algebraic Geometry
• Quantifier Elimination
• +۴ مورد دیگر

Hoon Hong is a Professor in the Department of Mathematics at North Carolina State University (NC State), affiliated with the College of Sciences. He holds editorial roles, including former Editor-in-Chief of the Journal of Symbolic Computation. His primary research focuses on developing mathematical theories, algorithms, and software for solving algebraic constraints in mathematics, science, and engineering. Key areas include computer algebra, computational real algebraic geometry, and quantifier elimination. Education: PhD in Mathematics from The Ohio State University (1990). He leads the Symbolic Computation research group and has advised numerous PhD and Master’s students since 1993. His work emphasizes efficiency in solving algebraic constraints through novel mathematical frameworks and algorithmic improvements, often leveraging structure and approximation techniques. Research Interests: Hong’s research centers on solving algebraic constraints via mathematical theories (e.g., subresultants, discriminants), algorithm design (e.g., parameterization, reparameterization), and software development (e.g., ImUp package). He explores applications in geometric modeling, optimization, and numerical analysis, with a focus on real algebraic geometry and symbolic computation. Notable Contributions: Development of the ImUp package for uniformity-improved curve reparameterization, structural analysis of cyclotomic polynomials, and advancements in quantifier elimination techniques. His work bridges theoretical computer algebra with practical applications in engineering and science. Lab/Team: Active in the Symbolic Computation group at NC State, collaborating on projects related to algebraic algorithms, computational geometry, and mathematical software development.

Jared Duker Lichtmanمشاهده پروفایل

استادیار

• Number Theory
• Analytic Number Theory
• Multiplicative Number Theory
• +۳ مورد دیگر

Jared Duker Lichtman is a Szegö Assistant Professor at Stanford University's Department of Mathematics, beginning in the 2024-25 academic year. Previously, he served as an NSF Postdoctoral Fellow at Stanford under Prof. Kannan Soundararajan. He completed his PhD at the University of Oxford in 2023, focusing on multiplicative number theory. His research centers on prime number distribution, multiplicative structures, and analytic number theory. Notably, he established a world record in studying primes' distribution within arithmetic progressions. His work bridges classical number theory with modern techniques like sieve methods and L-function analysis. Jared's publications explore topics such as the abc conjecture, twin primes, and Erdős problems. While no formal awards are listed, his groundbreaking contributions to prime distribution and multiplicative number theory mark him as a rising star in the field. His academic trajectory includes a focus on primes in arithmetic progressions, Goldbach conjecture extensions, and probabilistic number theory applications. Ongoing research likely continues this trajectory, with potential implications for cryptography and additive number theory.

Aaron D Levinمشاهده پروفایل

دانشیار

• Number Theory
• Algebraic Geometry
• Diophantine Equations
• +۴ مورد دیگر

Aaron D. Levin is an Associate Professor in the Department of Mathematics at Michigan State University, located in C308 Wells Hall. His research focuses on number theory, algebraic geometry, and their intersections with Diophantine equations, arithmetic dynamics, and Nevanlinna theory. He has taught advanced courses such as Graduate Algebra, Number Theory, and Abstract Algebra. Levin's work emphasizes class group theory, elliptic curves, and integral points on algebraic varieties. His recent research includes studies on quadratic fields with large class group ranks, intersections in algebraic tori, and applications of Vojta’s conjecture. He has collaborated with researchers like Jean Gillibert and Umberto Zannier on topics spanning arithmetic geometry and Diophantine approximation. His contributions include a generalized Schmidt subspace theorem for closed subschemes, effective bounds for Mordell-Weil ranks, and studies on the arithmetic of elliptic surfaces. His research often bridges analytic and algebraic methods, with applications to both pure and applied mathematical problems.

Fabienne JÉZÉQUELمشاهده پروفایل

مدرس

• Numerical algorithms
• High-performance computing
• Numerical validation

Fabienne JÉZÉQUEL is a Lecturer in Computer Science at Paris-Panthéon-Assas University, affiliated with the Sorbonne University Computer Science Laboratory (LIP6) and leading the PEQUAN (Performance and Quality of Digital Algorithms) team. Her research focuses on Numerical algorithms , High-performance computing , and Numerical validation , with applications in precision control and simulation reliability. Habilitation to Supervise Research (HDR) in Computer Science, University of Paris 6 (2005) Doctorate in Computer Science, University of Paris 6 (1996) Research Themes : Numerical algorithms with dynamic precision control High-performance computing (HPC) reliability and reproducibility Stochastic arithmetic for error estimation GPU acceleration of numerical methods Recent Publications : Focus on compensated algorithms, half-precision validation, and numerical reproducibility in extreme-scale simulations. Notable contributions include advancing stochastic arithmetic for trustworthy HPC codes and optimizing CADNA for GPU performance. Administrative Roles : Member of the office of the department of economic sciences at Paris-Panthéon-Assas University Member of the LIP6 Scientific Council

• Number Theory
• Algebraic Number Theory
• Iwasawa Theory
• +۳ مورد دیگر

Manabu Ozaki is a Professor at the School of Fundamental Science and Engineering, Faculty of Science and Engineering, Waseda University, specializing in algebraic number theory with a focus on non-abelian extensions of classical Iwasawa theory. He earned his Doctor of Science degree from Waseda University, establishing the foundation for his distinguished career in number theory. Doctor of Science (Waseda University) Professor Ozaki's research centers on the deep connections between algebraic structures and number-theoretic phenomena, particularly in non-abelian Iwasawa theory, Galois groups with restricted ramification, and the construction of field extensions with prescribed properties. His work bridges abstract algebra with concrete number-theoretic problems, advancing our understanding of Z_p-extensions, Iwasawa invariants, and class field theory. His publication record reveals a consistent progression toward more sophisticated non-abelian generalizations of classical results. A significant trend in his research involves developing frameworks to characterize arithmetical equivalence of number fields through Galois-theoretic methods and exploring the structure of maximal unramified p-extensions. Japan Society for the Promotion of Science Grant: "New developments in non-abelian Iwasawa theory" (2019-2022) Japan Society for the Promotion of Science Grant: "Iwasawa theoretic approach to the absolute Galois groups of number fields" (2016-2019) Japan Society for the Promotion of Science Grant: "Non-abelian extensions of number fields with restricted ramification" (2013-2016) At Waseda University, Professor Ozaki teaches core mathematics courses including Algebra, Number Theory, and specialized graduate seminars on Algebraic Number Theory, mentoring the next generation of mathematicians while advancing the frontiers of his field.

Dimitris Koukoulopoulosمشاهده پروفایل

استاد

• Analytic Number Theory
• Multiplicative Number Theory
• Probabilistic Number Theory
• +۴ مورد دیگر

Dimitris Koukoulopoulos is a Professor of Mathematics at the Department of Mathematics and Statistics, Université de Montréal, where he holds the Chaire Courtois II in fundamental research. He is a member of the Centre de recherches mathématiques and the Montreal Number Theory Group. His research focuses on analytic number theory, with an emphasis on multiplicative and probabilistic aspects, the anatomy of integers and permutations, sieve methods, diophantine approximation, and additive combinatorics. His research explores core questions in number theory, including the distribution of prime numbers, probabilistic properties of integers, and the application of sieve methods to Diophantine problems. Recent work highlights include studies on multiplicative functions, random polynomials, and the Erdős–Hooley Delta function, demonstrating a blend of analytical and combinatorial techniques. Professor Koukoulopoulos actively mentors M.Sc. and Ph.D. students, emphasizing alignment with his research interests. His work contributes to the Montreal Number Theory Group’s collaborative research environment, fostering interdisciplinary advancements in number theory.

Olivier Blazyمشاهده پروفایل

استاد

• Cryptographic Protocols
• Post-Quantum Cryptography
• Zero-Knowledge Proofs
• +۸ مورد دیگر

Olivier Blazy is a Professor at École Polytechnique, specializing in cryptographic protocols and security analysis. His research spans post-quantum cryptography, implicit cryptography, end-to-end encryption, and online age verification systems. Current affiliations: École Polytechnique (since 2021), LIX Grace Lab Previous institutions: University of Limoges (2014-2021), Ruhr University Bochum (2012-2014), École Normale Supérieure (2009-2012) Blazy’s work focuses on developing quantum-resistant cryptographic solutions, including secret sharing mechanisms, oblivious transfer protocols, and code-based encryption systems. He has contributed to the NIST Post-Quantum Cryptography standardization process. His research includes a taxonomy for post-compromise security, analyzing recovery speeds of protocols like Signal and 5G handover systems. Recent publications explore bivariate proximity tests, cryptographic accumulators, and identity-based revocation schemes. Blazy has been featured in media discussing cybersecurity policy, including: Critique of French government’s StopCovid contact-tracing app (2020-2022) Analysis of EU digital identity frameworks (2024) Commentary on online age verification and privacy (2023) He teaches advanced cryptography courses covering encryption, differential privacy, and cryptanalysis techniques.

Claudio Llosa Isenrichمشاهده پروفایل

استادیار

• Geometric Group Theory
• Complex Geometry
• Kähler Groups
• +۷ مورد دیگر

Claudio Llosa Isenrich is an Assistant Professor in the Institute of Algebra and Geometry at Karlsruhe Institute of Technology (KIT), leading a young research group in Complex Geometry and Geometric Group Theory since October 2020. His work bridges algebraic and geometric methods, with a focus on Kähler groups, finiteness properties, and Dehn functions. His research explores the interplay between Geometric Group Theory and Complex Geometry, particularly the study of fundamental groups of compact Kähler manifolds, constructions of Kähler manifolds, large-scale geometry of nilpotent groups, and rigidity properties of mapping class groups. He also investigates Dehn functions, finiteness properties, and subgroups of hyperbolic groups. His recent preprints and publications emphasize Dehn functions of subgroups, profinite rigidity of Kähler groups, and geometric properties of CAT(0) groups. He has received significant funding, including a Lise Meitner Postdoctoral Fellowship and the KIT Faculty Prize for Excellent Teaching, and has organized seminars and workshops like the GCD Seminar and Geometry Days with Heidelberg and Straßburg. His advisees include PhD student Jannis Weis and former PhD student Jeronimo Garcia Mejia, now at the University of Oxford.

Michael Monaganمشاهده پروفایل

استاد

• Computer Algebra
• Symbolic Computation
• Polynomial Algebra
• +۴ مورد دیگر

Michael Monagan is a Professor in the Department of Mathematics at Simon Fraser University (SFU), part of the Faculty of Science. He holds a Ph.D. from the University of Waterloo (1990) and is a leading researcher in Computer Algebra and Symbolic Computation. His work focuses on polynomial algebra, parallel algorithms, and the design of computer algebra systems, particularly Maple. Monagan has developed foundational algorithms for polynomial GCD, factorization, and sparse interpolation. Research interests include computational algebra, probabilistic algorithms, algebraic simplification, and high-performance computing. He leads SFU's Computational Algebra Group (CAG) and has collaborated on projects like NSERC grants for polynomial GCD and factorization algorithms. Monagan teaches courses in calculus, computer algebra, and algebraic geometry. Monagan has advised numerous graduate students and supervised undergraduate research in areas like Hensel lifting, sparse interpolation, and polynomial systems. He has authored over 100 articles, with recent work on black box GCD algorithms, transposed Vandermonde solvers, and parallel polynomial multiplication. His contributions to Maple and theoretical computer algebra have been internationally recognized. Key collaborations include the Magma Group (University of Sydney) and Maplesoft through NSERC grants. Monagan's work bridges theory and practice, emphasizing efficient algorithm design and implementation.

• Control Theory
• Systems Engineering
• Polynomial Matrices
• +۵ مورد دیگر

Nicos Karcanias is a Professor at City, University of London, with expertise in control theory and systems engineering. His research spans mathematical systems theory, polynomial methods, and applications in electrical networks and transportation systems. He has made significant contributions to the field of determinantal assignment problems, structural transformations, and systems of systems. His research interests focus on the theoretical foundations of control systems with applications across various domains. Using algebraic and geometric methods, he has developed novel approaches to problems in system structure, polynomial matrices, and implicit system representations. His work bridges abstract mathematical concepts with practical engineering applications. Analysis of his recent publications reveals a strong focus on determinantal assignment problems, implicit systems, and structural transformations. His work combines deep mathematical insights from multilinear algebra and exterior algebra with practical control engineering applications. There's a clear progression from fundamental mathematical theory to applications in electrical networks, transportation systems, and energy management. Professor Karcanias has collaborated extensively with researchers including Leventides, J., Halikias, G., Limantseva, O., Meintanis, I., and Livada, M. These collaborations have produced significant contributions across theoretical control theory and applied systems engineering. His work demonstrates a consistent integration of mathematical rigor with engineering relevance. His research has been applied in diverse areas including electrical network analysis, bicycle localization systems, and district heating control, demonstrating the versatility and impact of his theoretical contributions. The interdisciplinary nature of his work positions him at the intersection of mathematics, electrical engineering, and systems science.

László Tóthمشاهده پروفایل

استاد

• Number Theory
• Multiplicative and Additive Arithmetic Functions
• Ramanujan Sums
• +۴ مورد دیگر

Dr. László Tóth is a full professor, vice-dean and head of the Department of Mathematics at the Institute of Mathematics and Informatics of the University of Pécs, Hungary. His research is centred on analytic and multiplicative number theory, with extensive work on arithmetic functions, Ramanujan sums, cyclotomic polynomials and the enumeration of subgroups of finite abelian groups. Research Interests Multiplicative and additive arithmetic functions and their asymptotic behaviour Dirichlet series, Ramanujan expansions and related identities Generalised cyclotomic polynomials and unitary divisors GCD–LCM sums and their applications in number theory Subgroup counting in finite abelian groups and ring-theoretic enumeration Combinatorial and probabilistic aspects of coprimality conditions Across more than 100 refereed papers he has systematically developed identities, asymptotic formulas and enumeration techniques that link classical multiplicative number theory with modern algebraic and combinatorial questions. His 2023–2025 articles continue this programme, treating odd perfect-number analogues, hyperbolic summation methods, multidimensional density questions and refined estimates for divisor-type sums. Scientific Awards & Recognition No awards listed in the provided text. Students & Mentoring No students or advisees are named in the provided text. Laboratories & Teams As head of the Department of Mathematics at the Institute of Mathematics and Informatics, University of Pécs, he leads a research group focused on analytic and combinatorial number theory, fostering collaboration on arithmetic functions and algebraic enumeration problems.

Grégoire Lecerfمشاهده پروفایل

پژوهشگر

• Computer Algebra
• Polynomial Factorization
• Symbolic Computation
• +۷ مورد دیگر

Grégoire Lecerf is a full-time researcher at CNRS (rank: Directeur de recherche ) affiliated with the Laboratoire d'Informatique de l'École Polytechnique (LIX) under the Institut Polytechnique de Paris . He leads the Algebraic modeling and symbolic computation team and serves as deputy director of LIX until December 2025. His research spans computer algebra , focusing on polynomial factorization , symbolic computation , and algorithmic complexity . He has developed software libraries like Factorix and Geomsolvex and contributed to Mathemagix . Recent publications address multivariate polynomial interpolation , Riemann–Roch spaces , and contact factorization , with application to algebraic geometry and finite fields . Trends include accelerating multi-point evaluations and optimizing resultant computations . Scientific awards include Best Paper Award 2020 (Journal of Complexity) Best Paper Award 2016 (Journal of Complexity) ISSAC 2014 Distinguished Software Presentation Award He served as editorial member of Applicable Algebra in Engineering, Communication and Computing (since 2015) and Journal of Complexity (since 2020). Past roles include leading the French computer algebra group (2016–2021) and organizing JNCF conferences (2018–2021).

Carl McTagueمشاهده پروفایل

استادیار

• Topology
• Algebraic Geometry
• Formal Methods
• +۲ مورد دیگر

Carl McTague is an Assistant Professor of the Practice in Computer Science at Boston College. He holds a Ph.D. from Cambridge University and a B.A. from the Cincinnati Conservatory of Music. His interdisciplinary research spans topology, algebraic geometry, formal methods, and computational homotopy theory. Research focuses on exotic geometries, chromatic homotopy theory, and computational approaches to algebraic topology. He actively develops machine learning applications for spectral sequence calculations and novel uses of curvature in data analysis. Honors include the NSF Graduate Research Fellowship, Cambridge Philosophical Society Research Studentship, and multiple teaching prizes. His computational work includes calculating Hirzebruch L-polynomials up to L 14 .

Erich Kaltofenمشاهده پروفایل

استاد

• Computational Algebra
• Symbolic Computation
• Number Theory
• +۴ مورد دیگر

Erich Kaltofen is a Professor of Mathematics and member of the Symbolic Computation group at North Carolina State University (NCSU). He holds an adjunct professorship in Computer Science at Duke University. His academic journey includes a PhD in Computer Science from Rensselaer Polytechnic Institute (1982) and an MS from the same institution (1979). Kaltofen’s research focuses on computational algebra, hybrid symbolic-numeric algorithms, sequential and parallel algorithms, and symbolic computation systems. Research Interests: Kaltofen’s work spans computational algebra and number theory, emphasizing the development of efficient algorithms for polynomial factorization, sparse interpolation, and error-correcting methods. He is renowned for contributions to symbolic computation systems like LinBox and FoxBox, and his research integrates theoretical insights with practical software development. Publications: His recent publications highlight advancements in sparse polynomial interpolation, error-correcting algorithms, and computational complexity. Key themes include symbolic-numeric computation, algorithm design, and applications in cryptography and algebraic geometry. Awards and Recognition: A Fellow of the ACM (2009) and recipient of the Jenks Memorial Prize (2017), Kaltofen’s contributions have shaped the field of symbolic computation. His work bridges theoretical foundations and real-world applications, impacting computer science and mathematics. Advising and Grants: Kaltofen has advised numerous PhD students and postdocs, fostering advancements in algorithmic research. His grants include NSF-funded projects on hybrid symbolic-numeric methods and error-correcting algorithms. He collaborates on initiatives such as the Genomic Sciences program at NCSU. Labs and Teams: Co-designer of the LinBox library, Kaltofen contributes to open-source software for linear algebra and symbolic computation. His work emphasizes collaborative, interdisciplinary projects addressing challenges in computational mathematics and computer science.