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

Mariana Smit Vega Garciaمشاهده پروفایل

استاد

• Geometric Analysis
• Partial Differential Equations
• Free Boundary Problems
• +۲ مورد دیگر

Mariana Smit Vega Garcia is a Professor of Mathematics at Western Washington University (WWU), located in Bellingham, Washington. She holds a PhD from Purdue University (2014) and master's and bachelor's degrees from the Universidade de São Paulo, Brazil. Her academic journey includes postdoctoral positions at Heinrich Heine University Düsseldorf and the University of Duisburg-Essen in Germany, as well as a postdoctoral fellowship at the Mittag-Leffler Institute in Sweden. Prior to WWU, she served as an Acting Assistant Professor at the University of Washington (2016–2018). Her research focuses on Geometric Analysis, Partial Differential Equations, and Free Boundary Problems, with recent forays into Combinatorics. Key interests include the regularity theory of free boundaries, fractional obstacle problems, and discrete harmonic functions. She has also contributed to the study of Stirling permutations and signed permutations in combinatorial mathematics. Dr. Smit Vega Garcia has received significant recognition, including an NSF Analysis RUI Grant (2024–2027), Karen EDGE Fellowship (2024–2027), and the Peter J. Elich Excellence in Teaching Award (2023). She has organized numerous conferences, including the 2024 Geometry of Measures and Free Boundaries conference honoring Tatiana Toro and the 2023 Summer Research in Mathematics program at SLMath. Her grants total over $400,000 in funding for research and educational initiatives. In teaching, she has instructed courses such as Fourier Series, Proofs in Elementary Analysis, and Differential Equations at WWU, consistently receiving high student evaluations. She actively promotes equity in mathematics through leadership roles in SACNAS, AWM, and mentorship programs. Her service includes roles on editorial boards, grant review panels, and departmental committees at WWU and Purdue University.

Jason Smithمشاهده پروفایل

مدرس ارشد

• Combinatorics
• Topology
• Topological Data Analysis
• +۱۲ مورد دیگر

Jason Smith is a Senior Lecturer in Mathematics at the Department of Physics and Mathematics, Nottingham Trent University. His work bridges pure mathematics and neuroscience, focusing on combinatorial and topological methods for analyzing brain networks and functional data. His educational background includes: PhD in Computer and Information Science, University of Strathclyde (2015) MMath, University of Bath (2012) His research lies at the intersection of combinatorics, topology, and neuroscience. He applies tools from graph theory, topological data analysis (TDA), and algebraic topology to study the structure and function of neural systems. Key areas include the analysis of connectomes (such as C. Elegans and Drosophila), modeling brain network dynamics, and developing theoretical frameworks for understanding neural coding through combinatorial and topological lenses. His work often involves collaborations with neuroscientists and computational biologists. His recent publications demonstrate a strong trend toward interdisciplinary research, combining deep mathematical theory with applications in neuroscience. The articles span topics from the topology of directed flag complexes and tournaplexes to the combinatorics of permutation patterns and the Abelian sandpile model, all unified by their relevance to understanding complex biological networks. There is a clear progression from theoretical combinatorics toward computational and applied neurotopology. He has collaborated extensively with researchers from the University of Aberdeen, EPFL (including the Laboratory for Topology and Neuroscience and the Blue Brain Project), and other institutions. He has developed several open-source software tools such as Flagser-count, Tournser, and Deltser for computing persistent homology in directed networks, reflecting his commitment to computational reproducibility and tool development. He has presented his work in various venues, with talks and posters on topics including permutation posets, tournaplexes, and functional brain data classification. His research is supported by collaborative projects focusing on the topological analysis of neural systems and the mathematical foundations of pattern posets.

David Bevanمشاهده پروفایل

مدرس

• Enumerative Combinatorics
• Asymptotic Combinatorics
• Probabilistic Combinatorics
• +۷ مورد دیگر

David Bevan is a Lecturer in the Department of Mathematics and Statistics at the University of Strathclyde, Faculty of Science. His research is centered on combinatorics, particularly in the areas of enumerative, asymptotic, probabilistic, and extremal combinatorics, with a focus on permutations and permutation classes. His research interests include: Permutation patterns and avoidance Limit shapes and permutons Monotone grid classes and structural combinatorics Random integer compositions and probabilistic models Graph theory and network structures Analytic combinatorics and asymptotic enumeration The trends in his recent publications (2025–2017) reflect a deep and consistent focus on the structural and asymptotic behavior of discrete combinatorial objects, especially permutations. His work often combines probabilistic reasoning, analytic techniques, and extremal analysis to derive enumeration results and characterise limiting behaviors. He frequently collaborates with researchers such as Dan Threlfall, Robert Brignall, and Sergey Kitaev. David Bevan has served in key professional roles, including: Guest Editor, Discrete Mathematics and Theoretical Computer Science (2023) Guest Editor, Enumerative Combinatorics and Applications (2021) Organiser, Permutation Patterns 2021 Virtual Workshop Organiser, Scottish Combinatorics Meeting 2023 Peer Reviewer, Combinatorial Theory (2023) He is the Principal Investigator on the Maths DTP 2020 project at the University of Strathclyde (2020–2025), focusing on combinatorial research with PhD student Daniel Threlfall. He has delivered numerous invited talks at international workshops and conferences, including at Oberwolfach, Dagstuhl, and the Permutation Patterns series. David Bevan leads research within the Strathclyde Combinatorics Group and maintains an active research blog. He teaches courses in graph theory, networks in finance, logic, computation, and computer systems, reflecting his interdisciplinary expertise bridging mathematics and computer science.

Arun Sharmaمشاهده پروفایل

مدرس

• Combinatorics
• Ramsey Theory
• Error-Correcting Codes
• +۱ مورد دیگر

Arun Sharma is a Lecturer in the Department of Mathematics at the University of California, Berkeley. He has been teaching at Berkeley since 2010 and is known for his work in combinatorics, Ramsey theory, error-correcting codes, and graph colorings. His research explores structural problems in discrete mathematics. Education: Ph.D. in Mathematics (2009) from UC Berkeley, B.A. in Mathematics (2001) from Washington University in St. Louis. Sharma’s research focuses on combinatorial structures, particularly permutations and sequences avoiding arithmetic progressions. His work intersects with Ramsey theory and applications in error-correcting codes, addressing foundational problems in discrete mathematics. His publications primarily investigate patterns in permutations and integer sequences, emphasizing avoidance of arithmetic progressions. These studies contribute to broader combinatorial theory and its applications. Scientific Awards: Outstanding Instructor Award, UC Berkeley (2017) Outstanding GSI Award, UC Berkeley (2009) Putnam Prize, Washington University (2001) VIGRE Fellowship (2001) Compton Fellow, Washington University (1997) Sharma has served as a referee for Discrete Mathematics and the American Mathematical Monthly . His own thesis, The Structure of 3-Free Permutations (2009), was advised by Ronald Graham and Mark Haiman. Contact: asharma18@berkeley.edu | Personal Website

Jeff Clarkمشاهده پروفایل

استاد

• Mathematics
• Algebra
• Geometry
• +۷ مورد دیگر

Jeff Clark is a Professor in the Department of Mathematics and Statistics at Elon University , where he has taught since 1988. He earned his B.S., M.S., and Ph.D. in Mathematics from Yale University (1982-1987). His leadership roles include multiple terms as department chair, state director of the Southeastern Section of the Mathematical Association of America, and current Faculty Ombudsperson since 2019. Education: B.S., M.S., Ph.D. in Mathematics (Yale University) Current Roles: Professor, Faculty Ombudsperson Clark's research focuses on undergraduate research mentorship and mathematical education , particularly integrating technology (LaTeX, Python, Mathematica) and art into mathematics instruction. His publications span topics from term rewriting systems to pedagogical innovations, with recent projects exploring term rewriting and permutation group analysis . He has supervised numerous student research projects since 1998, covering cryptography, fractal geometry, game theory, and machine learning applications to Rubik's Cube. His awards include the Distinguished Service Award from the Southeastern Section of the MAA (2015) and Elon's Service-Leadership Award (2015). Scientific Awards: Distinguished Service Award, Southeastern MAA (2015) Elon Service-Leadership Award (2015) Clark actively presents at national conferences like MathFest and Joint Mathematics Meetings, with recent talks on topics including symmetry operations , derivative sign patterns , and Python in numerical analysis . He is fluent in LaTeX and Python, with a background in C, Perl, APL, and Fortran.

• Probability Theory
• Random Walks
• Percolation Theory
• +۳ مورد دیگر

Christopher Hoffman is a Professor in the Department of Mathematics at the University of Washington. He holds a PhD from Stanford University (1996) and specializes in probability theory, stochastic processes, and related areas such as percolation, ergodic theory, and combinatorics. His research explores topics including activated random walks, first-passage percolation, and self-organized criticality. He teaches courses like Math 124 Calculus I and maintains active involvement in academic outreach through Google Scholar and LinkedIn. Education: PhD in Mathematics, Stanford University, 1996 Research focuses on probabilistic models with applications to statistical physics and graph theory. Key interests include analyzing phase transitions, geodesic paths in percolation models, and properties of interacting particle systems. Recent work addresses critical density thresholds in activated random walks and scaling limits of stochastic processes. Hoffman frequently collaborates on interdisciplinary projects involving combinatorics and ergodic theory. Teaching responsibilities include foundational calculus courses and maintaining detailed lecture notes for students. His work has been supported by grants from the National Science Foundation and other institutions.

Aveek Duttaمشاهده پروفایل

دانشیار

• Wireless Communications
• Cognitive Radio
• Signal Processing
• +۲ مورد دیگر

Aveek Dutta is an Associate Professor in the Department of Electrical and Computer Engineering at the University at Albany's College of Nanotechnology, Science, and Engineering. He co-directs the Mobile Emerging Systems and Application (MESA) Lab and holds a PhD in Electrical Engineering from the University of Colorado Boulder (2013), an MS from the same institution (2008), and a Bachelor of Technology from Kalyani University (2002). Dr. Dutta's research spans wireless communications, cognitive radio, signal processing, and radio astronomy. His work focuses on developing advanced techniques for interference cancellation, spectrum sharing, and signal processing in non-stationary wireless environments, with applications in 5G networks, radio astronomy, and vehicular communications. His publications demonstrate consistent focus on wireless system optimization, featuring recent work on reconfigurable intelligent surfaces, MU-MIMO capacity optimization, eigenwave multiplexing, and blockchain applications for spectrum management. Research often bridges theoretical foundations with practical implementations in communication platforms.

Sergey Beregمشاهده پروفایل

استاد

• Computational Biology and Bioinformatics
• Computational Geometry
• Geometric Optimization
• +۴ مورد دیگر

Sergey Bereg is a Professor of Computer Science at the University of Texas at Dallas (UTD), affiliated with the Erik Jonsson School of Engineering and Computer Science. He has held this position since 2018. His research focuses on computational geometry, combinatorial optimization, and algorithm design, with applications in computational biology, geographic information systems, and network communications. He earned his Ph.D. in Computer Science from the Minsk Institute of Mathematics in 1992. His research interests include computational geometry and geometric optimization, with notable contributions to permutation arrays, convex partitions, and geometric algorithms. He has also explored applications in bioinformatics, such as genome rearrangement visualization, and robotics, including multi-drone coordination and coverage problems. His work often bridges theoretical foundations with practical implementations in areas like sensor networks and vehicular systems. Bereg’s publications span a wide range of topics, emphasizing combinatorial algorithms and geometric problems. Recent trends in his work include permutation arrays under various metrics, drone-based coverage algorithms, and robust synchronization in multi-agent systems. His research demonstrates a strong focus on both theoretical advancements and real-world applications. Though no specific awards are mentioned in the provided text, his extensive publication record underscores his contributions to the field. He has advised numerous students through his academic career, though specific names are not listed here. His projects include work on graph rigidity and Voronoi diagrams, reflecting his interdisciplinary approach to computational challenges.

Reuven Hodgesمشاهده پروفایل

استادیار

• Algebraic Combinatorics
• Representation Theory
• Lie Theory
• +۶ مورد دیگر

Reuven Hodges is an Assistant Professor at the University of Kansas, Department of Mathematics, within the College of Liberal Arts & Sciences. His research focuses on algebraic combinatorics, representation theory, and Lie theory, particularly on flag varieties, Schubert varieties, and their applications in geometric complexity theory. He has held previous academic positions at UC San Diego, UIUC, and the Max Planck Institute for Informatics. Hodges earned his Ph.D. in Mathematics from Northeastern University under Venkatramani Lakshmibai. Education: Ph.D. in Mathematics, Northeastern University (2017) M.S. in Mathematics, Northeastern University (2012) B.A. in Mathematics and Computer Science, Goshen College (2004) Research Interests: His work investigates flag varieties and Schubert varieties using representation-theoretic and combinatorial tools, with a focus on straightening relations, plethysms, and Coxeter groups. He has contributed to the classification of Levi-spherical Schubert varieties and explored geometric complexity theory through Kohnert polynomials and orbit structures. Academic Service: Co-organizer of the AMS Special Session on Combinatorial Lie Theory (2023) Co-organizer of the Schubert Summer School at UIUC (2023) Advisor to the University of Kansas Math Club Awards: AMS-Simons Travel Grant (2020–2022) Listed as an Excellent Teacher by UIUC students (2020, 2021) Teaching: Has taught courses ranging from introductory mathematics to advanced topics like Algebraic Combinatorics, Graph Theory, and Modern Algebra. Mentored undergraduate researchers in projects like the Summer REU at Northeastern University and independent studies at UCSD/KU. Labs/Teams: Actively involved in collaborative research initiatives such as the Graduate Workshop in Combinatorics and the Algebra-Geometry-Combinatorics Seminar at UIUC.

Vandita Patelمشاهده پروفایل

مدرس

• Number Theory
• Diophantine Equations
• Arithmetic Progressions
• +۴ مورد دیگر

Vandita Patel is a Lecturer in Pure Mathematics at the University of Manchester's School of Mathematics, specializing in Number Theory and Diophantine Equations. Her research focuses on arithmetic progressions, perfect powers, polynomial theory, and modular forms. Key areas include studying sums of consecutive powers, Lebesgue-Ramanujan-Nagell equations, and properties of the Ramanujan tau function. Patel holds a Doctoral Thesis (2017) titled 'Perfect powers that are sums of consecutive like powers.' She has presented invited talks on topics such as Fermat's Last Theorem, Bernoulli polynomials, and generalised Lebesgue equations. Her work often intersects with algebraic number theory and analytic methods, with applications to cryptography and combinatorics. No scientific awards are explicitly mentioned in the provided texts. Patel's research outputs include over 14 publications, with recent focus on power sums, polynomial behavior in finite fields, and Diophantine analysis. She collaborates internationally, exploring topics like Fibonacci number properties and shifted powers in Lucas-Lehmer sequences. No lab affiliations or student advisement details are disclosed.

Joshua P. Swansonمشاهده پروفایل

استادیار

• Algebraic Combinatorics
• Representation Theory
• Quantum Groups
• +۵ مورد دیگر

Joshua P. Swanson is an RTPC Assistant Professor of Mathematics at the University of Southern California (USC). Previously, he held a Stefan E. Warshawski Visiting Assistant Professorship at the University of California, San Diego (UCSD). He earned his PhD in Mathematics from the University of Washington under advisor Sara Billey, focusing on major index statistics and asymptotics. His research spans algebraic combinatorics with an emphasis on web bases for quantum group representations, plabic graphs, invariant theory, and analytic combinatorics. Education: PhD in Mathematics, University of Washington (2018) Bachelor's degree (implied, details not specified) Research Interests: Algebraic combinatorics, quantum group representations, plabic graphs, Coxeter groups, q-analogues, limit laws, and supercoinvariant algebras. He co-organizes workshops such as ICERM's Topical Workshop on Webs in Algebra, Geometry, Topology, and Combinatorics (2025). Publications: Over 20 peer-reviewed articles in top journals including Algebraic Combinatorics , European Journal of Combinatorics , and Advances in Mathematics . Recent work focuses on web bases, q-Stirling numbers, and harmonic differential forms. Awards: NSF Grant DMS-2348843 ($180,000) AMS-Simons Travel Grant ($5,000) Personal prize from Doron Zeilberger ($300) McKibben & Merner Fellowship ($10,000) Teaching: Taught over 20 courses at USC and UCSD, including Probability Theory (Math 407), Linear Algebra (Math 225), and Combinatorics (Math 184). Active in mentoring undergraduate researchers via USC's SURF program. Professional Engagement: Co-organizes seminars like the USC Combinatorics Seminar and serves on conference committees for FPSAC and CanaDAM. Maintains active collaborations with researchers such as Christian Gaetz, Oliver Pechenik, and Jessica Striker.

Wong Kok Sheikمشاهده پروفایل

دانشیار

• Multimedia Signal Processing
• Cybersecurity
• Digital Health
• +۳ مورد دیگر

Associate Professor Wong Kok Sheik is the Deputy Head (Research) at the School of Information Technology, Monash University Malaysia. He holds a Doctor of Engineering from Shinshu University (Japan) and advanced degrees in Computer Science and Mathematics from Utah State University (USA). His research focuses on multimedia signal processing, cybersecurity, and digital health, with contributions to data hiding, encryption, and smart grid security. He leads a EU-funded WAge project on post-pandemic workplace health interventions. Education: PhD in Engineering, Shinshu University, Japan (2009) Masters in Computer Science & Mathematics, Utah State University, USA (2005-2004) Bachelor of Science, Utah State University, USA (2002) Professional Roles: Associate Editor, IEEE Signal Processing Letters Member, IEEE Signal Processing Society’s IFS Technical Committee Board Member, APSIPA Multimedia Security and Forensics (MSF) Committee His research interests span multimedia forensics, encrypted domain processing, and cybersecurity frameworks. Notable projects include recovery of missing coefficients in compression standards and HDR imaging enhancement. Recent work integrates digital health, addressing workplace mental/physical health in post-pandemic environments. Publications reflect expertise in watermarking, encryption, and biometric security. Key contributions include encryption-resistant data embedding and secure smart grid analytics. Awards include IEEE CES Service Awards (2015, 2016) and Best Paper recognitions. He supervises over 20 PhD/MSc students, focusing on topics like biometric recognition, data hiding, and anomaly detection. Grants include a €2M EU Horizon 2020 project (IDENTITY) and a RM146k smart grid initiative. His teaching emphasizes foundational IT research methods and theoretical computer science.

Gianna Del Corsoمشاهده پروفایل

دانشیار

• Quantum Computing
• Numerical Linear Algebra
• Spectral Analysis
• +۳ مورد دیگر

Gianna Del Corso is an Associate Professor at the Department of Computer Science, University of Pisa. Her research interests span Quantum Computing, Numerical Linear Algebra, and Spectral Analysis. She has advised PhD students in quantum computing topics such as quantum algorithms and machine learning. Her teaching includes courses on Numerical Calculus, Parallel Scientific Computing, and Introduction to Quantum Computing, delivered across multiple academic years at the University of Pisa. She has also contributed to advanced courses in the PhD program in Computer Science. Her research focuses on quantum algorithms for machine learning, quantum walks, eigenvalue computation of structured matrices, and spectral techniques for web analysis. Recent work includes applications of quantum k-means clustering and variance estimation subroutines. Her publications span quantum computing, numerical methods, and scientific citation models. Her articles highlight contributions to PageRank computation, matrix factorization for recommendation systems, and analysis of citation-based research evaluation models. She has actively engaged in international conferences, presenting on topics such as orthogonal iterations for nonlinear eigenvalue problems and quantum hitting time algorithms. Labs/Teams: Research conducted within the Department of Computer Science at the University of Pisa, focusing on quantum computing and numerical methods.

• Combinatorics on Words
• String Algorithms
• Data Mining
• +۳ مورد دیگر

Gabriele Fici is an Associate Professor at the Department of Mathematics and Computer Science, University of Palermo (Unipa). His research focuses on combinatorics on words, string algorithms, and algorithmic pattern matching. He teaches courses in text sequence analysis, data mining, and software development. Research Interests : Combinatorial pattern matching, Abelian repetitions, digital convexity, and theoretical foundations of string processing. Key Contributions : Pioneering work on Lyndon words, de Bruijn sequences, and jumbled pattern matching algorithms. Publications : Extensive publications in top-tier conferences like CPM and journals, with a focus on 2013-2025 trends in algorithmic complexity and computational linguistics.

Stéphan Thomasséمشاهده پروفایل

استاد

• Graph Theory
• Combinatorics
• Algorithms
• +۳ مورد دیگر

Stéphan Thomassé is a Professor in the Computer Science Department at Ecole Normale Supérieure de Lyon, where he is affiliated with the Parallel Computing Laboratory (LIP) and leads the Computational Models, Complexity, Combinatorics (MC2) research team (2023-2025). He was a Member of the University Institute of France from 2016-2021 and has held significant administrative roles including Head of M2 Fundamental Computer Science (2013-2015) and Deputy Director of the Computer Science Department (2013-2015). Thomassé's research focuses on graph theory, combinatorics, algorithms, and theoretical computer science. His work spans structural graph theory , parameterized complexity , graph coloring , and combinatorial optimization . He is particularly known for his groundbreaking work on twin-width, a graph parameter that has revolutionized understanding of sparse and dense graph classes and their algorithmic properties. His research connects combinatorial structures with computational complexity, often bridging theoretical insights with practical algorithmic applications. His recent publications demonstrate a strong focus on structural graph theory, with the twin-width series representing a major contribution to the field. These papers have established connections between graph parameters, model theory, and algorithm design, particularly for problems that were previously thought to be intractable on dense graph classes. Thomassé's work on graph coloring, particularly regarding dense triangle-free graphs and the Erdős-Hajnal conjecture, has resolved long-standing open problems. Member of University Institute of France (2016-2021) ANR projects: GRAAL, AGAPE, STINT, COMPA, Digraphs, TWIN-WIDTH, GODASse As an advisor and educator, Thomassé has taught numerous advanced courses including Algorithmics, Optimization and Approximation, Tree Decompositions and FPT Algorithms, and Graph Decompositions. His teaching reflects his research expertise, emphasizing both theoretical foundations and practical applications of discrete mathematics. His administrative leadership in the MC2 team and the Computer Science Department demonstrates his commitment to advancing research and education in theoretical computer science. Thomassé maintains active collaborations with researchers worldwide, as evidenced by his extensive publication record with co-authors from various institutions. His work continues to shape the landscape of structural graph theory and parameterized algorithms, with recent results opening new avenues for research in combinatorics and theoretical computer science.