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

• Real and Complex Singularities
• Stratifications
• Real and Complex Algebraic Geometry
• +۳ مورد دیگر

Professor Laurentiu Paunescu is a faculty member in the School of Mathematics and Statistics at the University of Sydney . His research focuses on Real and Complex Singularities , Stratifications , and Real and Complex Algebraic Geometry , with particular interest in geometric criteria for ignoring higher-order terms in analytic maps and blow-analytic equivalence. University: University of Sydney School: School of Mathematics and Statistics Academic Rank: Professor Email: laurentiu.paunescu@sydney.edu.au, laurent@maths.usyd.edu.au Address: F07 - Carslaw Building, The University of Sydney Paunescu's research aligns with the University of Sydney's Understanding the Universe and Fundamental Laws of Nature strengths. He investigates topological invariance under bi-Lipschitz homeomorphisms, Lipschitz stratification, and connections between real and complex Milnor fibers. His work often involves collaborations with researchers like S. Koike, A. Parusiński, and M. Tibar. Recent publications (2024–2019) emphasize Lipschitz geometry (e.g., directional bundles, stratification), cohomology of hypersurface singularities , and polynomial function finiteness . Notable collaborations include studies on vanishing cohomology , clustered polar curves , and CAD construction validity . Grants from DVC Research and ARC Discovery Projects support his work. He supervises research students in areas like O-minimal Geometry and contributes to Metric Spaces (Advanced) teaching. Paunescu co-edits workshops such as the Australian-Japanese Real and Complex Singularities Workshop , advancing international collaboration in singularity theory.

Giorgis Petridisمشاهده پروفایل

دانشیار

• Arithmetic Combinatorics
• Combinatorial Geometry
• Number Theory
• +۳ مورد دیگر

Giorgis Petridis is an Associate Professor at the University of Georgia, specializing in arithmetic combinatorics, a field rooted in combinatorial number theory with modern extensions into discrete analysis and finite field geometry. Born in Athens, Greece, he earned his PhD from the University of Cambridge under Tim Gowers and held a Visiting Assistant Professor position at the University of Rochester. He serves as an editor for Combinatorial Theory and is affiliated with the Number Theory and Arithmetic Geometry group, particularly its additive combinatorics and discrete analysis subgroup. Doctor of Philosophy (2011), University of Cambridge Certificate of Advanced Studies in Mathematics (2002), St John’s College, Cambridge BA (Hons) in Mathematics (2001), St John’s College, Cambridge His research focuses on additive combinatorics, exploring sumset estimates, polynomial configurations in prime lattices, and geometric incidence problems over finite fields. He investigates combinatorial geometry, including pinned distance problems and bisector arrangements, while also contributing to exponential sum bounds and expander graph theory. His work bridges theoretical mathematics with applications in pseudorandomness and discrete geometry. Recent publications highlight trends in finite field analysis, with 6 of 15 articles addressing arithmetic structures in prime-order fields. Key keywords include Combinatorics , Number Theory , and Finite Fields , with sub-fields spanning polynomial configurations, energy bounds, and geometric combinatorics. Scientific awards include the Creative Research Medal (2024) from the University of Georgia for mid-career research impact. Grants from the Simons Foundation (MPS-TSM-00007816) and multiple NSF DMS Awards (2054214, 1723016, 1500984, 1804049) support his work on discrete analysis and conferences. He co-advises five PhD students and has supervised multiple Master’s theses on topics like point-plane incidences and additive energy. Outreach includes leading high school math teams, organizing discrete analysis sessions, and contributing to public science communication guides.

• Machine Learning
• Deep Learning
• Signal Processing
• +۹ مورد دیگر

Prof. Dr.-Ing. Ahmad Osman is a Professor at the Saarland University of Applied Sciences (htw saar), specializing in Test Technologies and Test Methods within the Faculty of Engineering. He also holds an Adjunct Professor position at Laval University in Quebec, Canada, in the Department of Electrical Engineering and Computer Science. His research focuses on Artificial Intelligence applications in Signal and Image Processing for Non-destructive Testing (NDT) , with extensive work on Deep Learning , 3D Ultrasound Tomography , and Sensor Data Fusion in industrial contexts. Engineering Artificial Intelligence Signal Processing Image Processing Non-destructive Testing Quality Control Augmented Reality Osman leads the AutomaTiQ research group and serves as Head of the Algorithms/Signal and Data Processing Department at Fraunhofer IZFP . His recent publications (2017–2022) emphasize Deep Learning for defect detection in CFRP , Terahertz Imaging for artwork diagnostics, and Acoustic Sensors for agricultural quality control. He has organized international conferences on Structural Health Monitoring and contributed to Springer books on NDT technologies. His projects include ComforTex-AI (2024) and development of 3D positioners for ultrasound measurements. Collaborations span institutions in Germany, Canada, Italy, and Brazil, with advisory roles in the German Society for NDT and technical committees for conferences in Montreal and Egypt.

Bela Bollobasمشاهده پروفایل

استاد

• Extremal Graph Theory
• Random Graphs
• Probabilistic Combinatorics
• +۳ مورد دیگر

Béla Bollobás is a renowned mathematician affiliated with the University of Memphis as the Jabie Hardin Chair of Excellence in Combinatorics and the University of Cambridge as a Fellow of Trinity College and Honorary Professor at the Centre for Mathematical Sciences. His work spans combinatorics, probability theory, and graph theory, with significant contributions to percolation and random graphs. Dr. Rer. Nat. (Budapest, 1967) Ph.D. (Cambridge, 1972) Sc.D. (Cambridge, 1984) Bollobás pioneered extremal graph theory, random graphs, and probabilistic combinatorics. He introduced novel graph polynomials and advanced bootstrap percolation models, impacting both theoretical mathematics and statistical physics. His research includes inhomogeneous random graphs and cellular automata in random environments. His selected publications reveal a focus on percolation thresholds, graph invariants, and stochastic processes. Notably, he derived sharp thresholds for bootstrap percolation and defined critical probabilities for Voronoi percolation. Senior Whitehead Prize (2007) Fellow of the Royal Society (2011) Foreign Member, Hungarian Academy of Sciences (1990) Foreign Member, Polish Academy of Sciences (2013) Honorary Doctorate, Adam Mickiewicz University (2013) Szechenyi Prize (2017) Bollobás has supervised over 50 Ph.D. students and authored over 450 publications, including 10 books. He co-founded the journal Combinatorics, Probability and Computing and served on eight editorial boards. He organized numerous conferences, including Bill Tutte and Paul Erdős events.

• Wireless Communications
• MIMO Systems
• Signal Processing
• +۳ مورد دیگر

Oussama Damen is a Professor at the University of Waterloo's Department of Electrical and Computer Engineering. His research focuses on advanced wireless communication systems, particularly in MIMO (Multiple-Input Multiple-Output) systems, signal processing, and machine learning applications in telecommunications. He is actively involved in developing innovative solutions for beamforming, hybrid precoding, and distributed decoding in massive MIMO and millimeter-wave networks. Damen's work also extends to optical fiber communication, federated learning in wireless systems, and optimization of resource allocation in next-generation networks like 5G/6G. His research interests include wireless communication theory, antenna system design, channel modeling, and algorithm development for improving spectral and energy efficiency. He has contributed extensively to the theoretical foundations of MIMO detection, lattice reduction techniques, and statistical signal processing methods. Notable trends in his publications emphasize bridging theoretical performance limits with practical implementations, particularly in scenarios involving channel impairments, limited backhaul capacity, and multi-core fiber transmission. His work often addresses fairness and optimization in distributed systems, including federated learning frameworks and hybrid beamforming architectures. No scientific awards or grants are explicitly mentioned in the provided information. Damen has advised no listed students, and no specific lab affiliations are noted.

Christophe VIGNATمشاهده پروفایل

استاد

• Mathematics
• Number Theory
• Probability Theory
• +۴ مورد دیگر

Christophe VIGNAT is a Professor at CentraleSupélec, affiliated with the Laboratoire des Signaux et Systèmes (L2S). His research focuses on number theory, special functions, probability, and their applications in signal processing and control systems. He has held visiting professorships at École Polytechnique Fédérale de Lausanne (EPFL) and Tulane University. VIGNAT's work bridges pure mathematics and applied fields, with notable contributions to Bernoulli/Euler polynomials, multiple zeta values, and probabilistic methods in number theory. His recent publications explore topics like partition functions, theta functions, and Ramanujan-type identities. He has delivered talks at international conferences and collaborates widely with researchers in mathematics and physics. Research Interests: Number theory, special functions (Bessel, orthogonal polynomials), probability theory, signal processing, control systems, analytic combinatorics, and their interconnections. His work often employs symbolic computation and probabilistic approaches to uncover identities and structures in mathematical analysis. Publications Trends: Recent articles emphasize partition theory, zeta functions, and integrals related to classical polynomials. His collaborations highlight interdisciplinary efforts between pure mathematics and applied sciences. Over 150 refereed papers and conference contributions demonstrate his prolific output across diverse mathematical domains. Education: While specific academic history isn’t detailed, his roles and publications suggest advanced training in mathematics and engineering, typical for a full professor in systems and control.

Melanie Weberمشاهده پروفایل

استادیار

• Geometric Machine Learning
• Optimization on Manifolds
• Non-Euclidean Machine Learning
• +۳ مورد دیگر

Melanie Weber is an Assistant Professor of Applied Mathematics and Computer Science at Harvard University's John A. Paulson School of Engineering and Applied Sciences (SEAS), leading the Geometric Machine Learning Group. Her research focuses on leveraging geometric structures in data for designing efficient machine learning and optimization algorithms with theoretical guarantees. She holds a PhD from Princeton University (2021) and has held fellowships at the Mathematical Institute of Oxford, Brasenose College, and the Simons Institute. Her work bridges geometry, optimization, and machine learning, with funding from NSF, Sloan Foundation, and Harvard initiatives. Education : PhD in Applied Mathematics, Princeton University (2021) BSc/MSc in Mathematics and Physics, University of Leipzig (2016) Research Interests : Dr. Weber's research integrates geometric principles into machine learning and optimization, focusing on non-Euclidean spaces, graph structures, and manifold-based methods. Key areas include optimization on Riemannian manifolds, curvature-based analysis (e.g., Ricci curvature), and developing algorithms resilient to data geometry challenges like over-smoothing in graph neural networks. Her work emphasizes theoretical foundations while addressing practical scalability in high-dimensional data. Awards & Recognition : 2024 Sloan Research Fellowship 2023 Leslie Fox Prize in Numerical Analysis 2023 NSF Grant for Geometric Optimization Grants & Funding : Supported by National Science Foundation (NSF), Alfred P. Sloan Foundation, Aramont Foundation, Harvard Dean’s Fund, and Harvard Data Science Initiative. Labs & Collaborations : Leads the Geometric Machine Learning Group at SEAS, collaborating with institutions like MIT, Max Planck Institute, and industry labs (Facebook, Google, Microsoft). Active in organizing workshops on geometric methods and curvature analysis.

• Dynamical systems
• Ergodic theory
• Homogeneous spaces
• +۴ مورد دیگر

Manfred Einsiedler is a Professor in the Department of Mathematics at ETH Zurich, Switzerland, with office HG G 64.2 at Rämistrasse 101, 8092 Zurich. He teaches undergraduate and graduate courses including Linear Algebra (HS 2019), Analysis I/II, and Functional Analysis I/II, using his co-authored textbook Functional Analysis, Spectral Theory, and Applications . His research centers on dynamical and equidistribution problems in homogeneous spaces, with focus on closed horocycle orbits, geodesic orbits on the modular surface, and measure rigidity. Key contributions include work on effective equidistribution, entropy methods, and connections between ergodic theory and number theory. He has co-authored foundational texts: Ergodic Theory with a view towards Number Theory and Functional Analysis, Spectral Theory, and Applications in Springer's Graduate Texts in Mathematics series, alongside multiple in-progress volumes on entropy, homogeneous dynamics, and unitary representations. Recent publications explore integer points on spheres, rigidity of invariant measures, and Diophantine approximation on fractals, emphasizing collaborations with Lindenstrauss, Ward, Margulis, and Venkatesh. His work demonstrates consistent focus on homogeneous dynamics with applications to arithmetic problems, particularly through effective methods and measure classification theorems. While no specific awards or student lists are documented in the source, his extensive publication record and textbook authorship establish significant scholarly impact.

• Algebra
• Combinatorics
• Number Theory
• +۳ مورد دیگر

Gábor Somlai is a mathematics researcher at Eötvös Loránd University's Faculty of Science, affiliated with the Department of Algebra and Number Theory since 2006. He is a core member of the HUN-REN-ELTE Geometric and Algebraic Combinatorics Research Group (previously MTA-ELTE until 2023) and participates in the Asymptotic Group Theory ERC project. His institutional roles include contributions to the Mathematics Doctoral School and the Institute of Mathematics. His research spans Algebra , Combinatorics , and Number Theory , with emphasis on spectral sets, tiling problems, group theory, and finite geometry. Recent work explores cyclotomic polynomials, the generalized trifference problem, and connections between tiling and spectral properties in finite abelian groups. His publications reveal a strong focus on combinatorial number theory and algebraic methods in discrete geometry. Somlai's publication trends show sustained contributions to theoretical foundations of tiling and spectral sets (testing Fuglede's conjecture in cyclic groups) Cayley graph properties and CI-group classifications polynomial methods in finite geometry and direction problems His work bridges pure algebra with combinatorial applications, often resolving long-standing conjectures in specialized domains. As part of the HUN-REN-ELTE research group, he collaborates on geometric and algebraic combinatorics projects, leveraging ERC funding for asymptotic group theory investigations. His research infrastructure includes access to the Alfréd Rényi Institute of Mathematics (http://www.renyi.hu) resources.

Steven N. Evansمشاهده پروفایل

استاد

• Probability
• Mathematical Analysis
• Applied Mathematics
• +۱۱ مورد دیگر

Steven N. Evans is a Distinguished Professor at the University of California, Berkeley , affiliated with the Department of Statistics and the Center for Computational Biology . With over three decades of service since 1987, his work bridges probability theory , stochastic processes , and their applications in mathematical biology , computational genetics , and phylogenetics . His research spans: Probability on Algebraic Structures , including random matrices and local fields. Measure-Valued Processes and coalescent models in population genetics. Phylogenetic Inference in historical linguistics and ecology. Stochastic Models for gene expression, fitness landscapes, and mutation-selection balance. Markov Processes and their applications in phylodynamics. Recent publications highlight his contributions to phylogenetic networks , Frechet mean sets , and Levy process analysis , with keywords spanning Probability , Computational Biology , and Population Genetics . He has mentored 10 PhD students, including Boyan Xu (2024) and Nicholas Bhattacharya (2022). His email is evans@stat.berkeley.edu .

Zvezdelina Stankovaمشاهده پروفایل

استاد آموزشی

• Algebraic Geometry
• Representation Theory
• Combinatorics
• +۲ مورد دیگر

Zvezdelina Stankova is a Teaching Professor of Mathematics and Director and Founder of the Berkeley Math Circle at the University of California, Berkeley . Her contact details include an office in 713 Evans Hall and the email stankova@math.berkeley.edu . Research Interests: • Algebraic Geometry • Representation Theory • Combinatorics • Olympiad Problem-Solving • Mathematics Education Publications and Research Trends: Her work bridges Combinatorics and Algebraic Geometry , with a focus on permutation patterns, avoidance, and moduli spaces of curves. She has also contributed significantly to Mathematics Education through her leadership in the Berkeley Math Circle, emphasizing problem-solving techniques and outreach programs for students. Teaching and Outreach: Stankova has taught various courses at UC Berkeley, including MATH 52 Calculus II (2025), MATH 110 Linear Algebra , and MATH 74 Transition to Proofs . She actively engages with the Berkeley Math Circle, providing resources for mathematical competitions and advanced training for students.

• Algorithms
• Game Theory
• Automata Theory
• +۷ مورد دیگر

Marcin Jurdzinski is an Associate Professor (Reader) in the Department of Computer Science at the University of Warwick , UK. He has been a faculty member since 2004 and is a core member of the Foundations of Computer Science and Discrete Mathematics and its Applications research groups. University: University of Warwick School: Faculty of Science Department: Department of Computer Science Position: Associate Professor (Reader) Email: Marcin.Jurdzinski@warwick.ac.uk Office: CS2.19 His research lies at the intersection of algorithms, game theory, automata, and logic , with a strong emphasis on formal verification , model checking , and theoretical computer science . He is best known for his foundational work on parity games , including the development of small progress measures and discrete strategy improvement algorithms. The recent publications reveal a consistent focus on computational complexity in games and verification. Key themes include stochastic games, timed automata, bisimilarity, and quantitative analysis . His work often bridges theoretical insights with practical verification challenges, especially in real-time and probabilistic systems. He has supervised several PhD students and hosted postdoctoral researchers such as Laure Daviaud and Alexander Kozachinskiy. He has led EPSRC-funded projects including Solving Parity Games in Theory and Practice and Counter Automata: Verification and Synthesis . PhD Students: Aditya Prakash, Thejaswini K. S., Michail Fasoulakis, John Fearnley, Michal Rutkowski, Ashutosh Trivedi Postdocs: Laure Daviaud, Alexander Kozachinskiy He is actively involved in the academic community, serving on the steering committee of the Highlights of Logic, Games and Automata conference and on program committees for major venues such as CONCUR, ICALP, and LICS. He has also organized workshops including FORMATS and ICALP co-located events.

Victor Beresnevichمشاهده پروفایل

استاد

• Metric Number Theory
• Diophantine Approximation
• Geometry of Numbers
• +۷ مورد دیگر

Professor Victor Beresnevich of the University of York, Department of Pure Mathematics, is a leading researcher in Metric Number Theory and Diophantine Approximation . He leads the Number Theory Research Group and collaborates on problems involving algebraic numbers , manifold approximation , and ergodic theory . PhD and DSc from Minsk EPSRC-funded projects on Duffin-Schaeffer conjecture and rational points near manifolds Organiser of conferences on Diophantine approximation, dynamical systems, and quantum chaos His work connects Diophantine approximation with dynamical systems , fractal geometry , and p-adic analysis . Recent projects focus on inhomogeneous approximation and shrink targets problems . He supervises PhD students and mentors collaborations in analytic number theory and measure theory . Scientific Awards : Advanced Research Fellow Current PhD Student : Dorsa Vakilzadeh Hatefi

Maxim Kontsevichمشاهده پروفایل

استاد

• Mathematical Physics
• Algebraic Geometry
• Deformation Quantization
• +۵ مورد دیگر

Maxim Kontsevich is a permanent professor at the Institut des Hautes Études Scientifiques (IHÉS), holding the AXA Chair for Mathematics since 1995 and a visiting chair at Rutgers University (one month annually since 1997). Born in 1964 in Khimki, USSR, he earned his PhD from Bonn University in 1992. His career includes visiting positions at Harvard, the Institute for Advanced Study, and Berkeley, where he was a professor from 1993 to 1995. His research spans mathematical physics, algebraic geometry, and non-commutative geometry. Notable contributions include deformation quantization, mirror symmetry, and motivic integration. His work bridges algebraic structures with geometric and physical concepts, influencing areas like topological field theories, string theory, and integrable systems. Awardees of Fields Medal (1998), Crafoord Prize (2008), and Breakthrough Prize (2014), he also holds editorial roles at Compositio Mathematica and Publications Mathématiques IHÉS. His over 50 publications explore advanced topics such as quantum cohomology, Hodge theory, and categorical structures in geometry.

Josef Dickمشاهده پروفایل

استاد

• Numerical Integration
• Quasi-Monte Carlo Rules
• Number Theory
• +۵ مورد دیگر

Professor Josef Dick serves as a Professor and Deputy Head in the School of Mathematics & Statistics at the University of New South Wales (UNSW). With a distinguished career in computational mathematics, he has established himself as a leading researcher in numerical integration methods and quasi-Monte Carlo theory. His work bridges theoretical mathematics with practical computational applications across various scientific domains. Dr. Dick earned his PhD in Mathematics from UNSW in 2004 and his MSc in Mathematics from the University of Salzburg in 2001. His academic journey reflects a strong foundation in both theoretical and applied mathematics, which has informed his subsequent research contributions. Professor Dick's research primarily focuses on numerical integration and quasi-Monte Carlo rules , employing techniques from number theory , abstract algebra (particularly finite fields), discrepancy theory , wavelet theory , and statistics . His work provides rigorous analysis of practical algorithms for computational problems, with implementations often provided in Matlab to bridge theory and application. His research has successfully addressed point distributions on the unit cube for numerical integration, completely uniformly distributed sequences for Markov chain quasi-Monte Carlo algorithms, and explicit constructions of uniformly distributed points on the sphere. Analysis of his recent publications (2022-2025) reveals a consistent focus on advancing quasi-Monte Carlo methods, with increasing integration of machine learning techniques and applications to complex computational problems. His work demonstrates strong interdisciplinary connections between pure mathematics, computational science, and practical engineering applications, particularly in uncertainty quantification and high-dimensional numerical integration. Discovery project from Australian Research Council (2012-2014): "Mathematics in the round - the challenge of computational analysis on spheres" Queen Elizabeth II Fellowship from Australian Research Council (2010-2014): "Algebraic methods for Markov Chain Monte Carlo and quasi-Monte Carlo" UNSW Vice Chancellor Fellowship (2006-2009) Professor Dick has supervised numerous PhD and Honours students working on topics including Quasi-Monte Carlo methods, Discrepancy Theory, Markov chain Monte Carlo, and Uncertainty Quantification. His research has been supported by significant grants from the Australian Research Council, including serving as Chief Investigator on multiple projects. Beyond his research, he serves as an Editor for the Journal of Complexity and Journal of Approximation Theory, demonstrating his leadership in the mathematical community. He teaches courses in Algebra and Mathematical Computing for Finance at UNSW.