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

Slim Essidمشاهده پروفایل

استاد

• Machine Learning
• Artificial Intelligence
• Signal Processing
• +۷ مورد دیگر

Slim Essid is a Full Professor at Télécom Paris, leading the Audio Data Analysis and Signal Processing (ADASP) group. He holds a Doctorat (Ph.D.) and Habilitation from Université Pierre et Marie Curie (UPMC). With 15+ years of research experience, he has advised 15 PhD graduates and currently co-advises 10 others. His work focuses on machine learning, signal processing, and multimodal systems, publishing over 150 peer-reviewed papers. He serves as a reviewer for top journals/conferences (e.g., IEEE Transactions) and research funding agencies. Education: State Engineering Degree, École Nationale d’Ingénieurs de Tunis (2001) M.Sc. (D.E.A.) in Digital Communication Systems, École Nationale Supérieure des Télécommunications, Paris (2002) Ph.D., Université Pierre et Marie Curie (2005) Habilitation (HDR), UPMC (2015) Research Interests: Multimodal learning, self-supervised representations, audio-visual segmentation, music structure analysis, domain generalization, and speech enhancement. Recent publications highlight innovations like TACO (training-free sound-prompted segmentation) and CLOUDS (domain-generalized semantic segmentation framework using foundation models). His work bridges audio processing with vision and language models, emphasizing unsupervised/zero-shot approaches. Key achievements include state-of-the-art methods in sound event detection, speaker diarization, and music segmentation. He collaborates with 14 post-docs and leads projects funded by French/EU agencies.

• Differential Algebra
• Model Theory
• Number Theory
• +۷ مورد دیگر

James Freitag is a Professor in the Department of Mathematics, Statistics, and Computer Science at the University of Illinois at Chicago (UIC). He earned his PhD from UIC in 2012, specializing in Model Theory and Differential Algebraic Geometry . Prior to his current role, he held postdoctoral positions at UC Berkeley and UCLA and served as a research member at the Mathematical Sciences Research Institute (MSRI) and Fields Institute. His research integrates model theory , differential algebra , and number theory , with recent emphasis on functional transcendence, geometric stability theory, and applications to machine learning. Key themes include: Strong minimality in differential equations and stability theory Ax-Lindemann-Weierstrass theorems for Fuchsian groups Combinatorial and algorithmic aspects of query learning His publications (2017–2025) predominantly explore differential-algebraic geometry, model-theoretic classification, and computational learning. Recurring topics include Painlevé equations, Littlestone dimension, nonminimality bounds, and geometric invariants in differential systems. He advises doctoral students in differential algebra and machine learning and directs the Young Scholar Program —a summer camp for Chicago high school students. His research is funded by NSF grants, including CAREER #1945251 and #2452197.

• Zeta Functions
• Group Theory
• Representation Theory
• +۴ مورد دیگر

Prof. Dr. Christopher Voll is a full Professor at the Faculty of Mathematics, Bielefeld University , Germany. He leads multiple subprojects in the Transregional Collaborative Research Center TRR 358 'Integral Structures in Geometry and Representation Theory' , including A1 (lattices), A4 (Euler products), and A6 (quiver zeta functions). His research bridges algebra, number theory, and combinatorics through zeta functions, subgroup growth, and representation theory.

Yizao Wangمشاهده پروفایل

استاد

• Probability Theory
• Stochastic Processes
• Extreme Value Theory
• +۴ مورد دیگر

Yizao Wang is a Professor in the Department of Mathematical Sciences at the University of Cincinnati. He holds a Ph.D. from the University of Michigan (2012) and specializes in Probability Theory, Stochastic Processes, and their applications, with a focus on extreme value theory, long-range dependence, and random fields. His research includes studies on asymmetric exclusion processes, fractional Brownian motion, and self-similar processes. Education : Ph.D. in Mathematics, University of Michigan, 2012. Research Interests : Probability theory, stochastic processes, extreme value theory, long-range dependence, random fields, limit theorems, and applications in finance and statistics. His work frequently explores the interplay between combinatorial structures and stochastic models, such as random partitions and operator-scaling processes. Grants : He has led and co-led multiple grants, including: DoD Army Research Laboratory: Advances in Extreme Value Theory with Long-Range Dependence ($84,229, 2020–2023) National Security Agency: From Random Partitions to Self-Similar Processes ($40,000, 2016–2018) National Science Foundation: Cincinnati Symposium on Probability Theory and Applications ($20,000, 2018–2019) Students and Advising : Mentored numerous graduate and undergraduate students in capstone projects and independent studies, focusing on topics like random walks, branching processes, and stochastic differential equations. Notable advisees include Connor McClellan, Yiyang Yu, and Weiqing Yu (recipient of the Charles Phelps Taft Senior Thesis Fellowship). Labs/Teams : Active in collaborative research groups within the department, contributing to interdisciplinary projects in stochastic modeling and mathematical finance. Teaches advanced courses in probability, stochastic processes, and financial mathematics.

Joy Morrisمشاهده پروفایل

استاد

• Combinatorics
• Algebraic Graph Theory
• Group Theory
• +۴ مورد دیگر

Joy Morris is a Professor at the Department of Mathematics & Computer Science at the University of Lethbridge. She earned her BSc from Trent University in 1992 and her PhD from Simon Fraser University in 2000 under Brian Alspach. Her academic journey includes tenure in 2005, promotion to Associate Professor, and full Professor status in 2015. Research Focus: Interactions between group theory and graph theory, with emphasis on Cayley graphs and automorphisms Key Contributions: Solving the distinguishing number problem for various graph families, advancing DCI/CI group theory Research Overview Her work bridges abstract algebra with graph theory through Cayley graphs. She investigates automorphism groups, Hamilton cycles, and graph symmetry properties. Notable contributions include resolving the DCI property for specific groups, analyzing Praeger-Xu graphs, and studying color-preserving automorphisms. Academic Leadership As a co-author of two influential open-access textbooks ( Proofs and Concepts with Dave Morris and her own Combinatorics text), she has shaped curriculum development and mathematical education outreach programs for parents in Alberta. Her teaching portfolio includes foundational courses like Math 2000 and advanced combinatorial theory instruction. Collaborative Impact With over 30 publications since 1996, her collaborations span international researchers including C. Praeger, P. Spiga, and E. Dobson. Current projects involve hypercube distinguishing costs and automorphism group analysis of vertex-transitive digraphs. She maintains active research into graphical regular representations and graph isomorphism problems.

• Mathematics of Voting and Choice
• Algebraic Geometry
• Representation Theory
• +۱۵ مورد دیگر

Karl-Dieter Crisman is Professor of Mathematics and Computer Science at Gordon College, where he also serves as Campus Organist. He is affiliated with the School of Science and Health and the Herschend School of Education. His academic work bridges pure mathematics, pedagogy, and interdisciplinary scholarship. Education: PhD in Mathematics, University of Chicago; M.Mus., Roosevelt University; Undergraduate, Northwestern University. Research: Focuses on the mathematics of voting and choice, algebraic geometry (especially zero-cycles and hyperplane arrangements), representation theory in social choice, and the history of mathematics (notably Marin Mersenne). Open Source & Education: Lead developer and author of the open textbook Number Theory: In Context and Interactive , widely used and praised. Active contributor to SageMath and PreTeXt projects. His research in voting theory explores generalized voting procedures on posets and cyclic orders, often using representation-theoretic techniques. His pedagogical scholarship promotes inquiry-based learning, service-learning, and technology integration, particularly through Sage cells. He has written extensively on the connections between mathematics, music, and theology. He has been recognized with the 2024 MAA Northeastern Section Award for Distinguished Teaching. He serves as Vice Chair (and future Chair) of the MAA Northeastern Section and was Associate Editor for PRIMUS. Professional Service: Organizes the Gordon Math Forum, Faculty Forum colloquium, and the North Shore Undergraduate Mathematics Conference; previously chaired the Pike Honors Program. Advising: Mentors undergraduate research in voting theory, algebra, topology, and the history of mathematics. Grants: Received support from the American Institute of Mathematics' SQuaREs program for collaborative research. He frequently gives talks on voting theory, SageMath, open textbooks, and the life of Marin Mersenne.

Jamshid Mooriمشاهده پروفایل

استاد

• Finite Simple Groups
• Computational Group Theory
• Representation Theory of Finite Groups
• +۳ مورد دیگر

Jamshid Moori is a Senior Research Professor of Mathematics at the School of Mathematical Sciences, North-West University (Mafikeng Campus, South Africa). He also holds the position of Honorary Senior Research Fellow at the School of Mathematics, University of Birmingham since 2006, and is a life fellow of the University of Kwa-Zulu Natal since 2010. His educational background includes: PhD in Mathematics, University of Birmingham, 1975 MSc in Mathematics, University of Birmingham, 1973 BSc in Mathematics, University of Meshed, Iran (Summa Cum Laude), 1971 Diploma in Mathematics, Nowrooz High School, Iran, 1964 Moori is an internationally recognized expert in Finite Group Theory, with research focusing on Finite Simple Groups, Computational Group Theory, Representation Theory of Finite Groups, and Applications of Finite Groups to Combinatorial Designs and Geometries. His work has been published in prestigious journals such as Journal of London Mathematical Society, Journal of Algebra, Communications in Algebra, Journal of Group Theory, Representation Theory, Discrete Mathematics, and the European Journal of Combinatorics. His recent publications (2019-2023) demonstrate a continued focus on designs, codes, and graphs from finite groups, particularly Janko groups and Ree groups, with significant contributions to Fischer-Clifford theory and character tables of group extensions. He was awarded the Research Distinction in 2015 by the South African Mathematical Society at the 58th Annual Congress. Moori is a member of the London Mathematical Society (since 1978), the American Mathematical Society (since 1983), and the South African Mathematical Society (since 1983), where he served as Vice-President during 2010-2014. His editorial roles include: Associate Editor: Bulletin of Iranian Mathematical Society Editor: International Journal of Group Theory Editor: Transactions on Combinatorics Associate Editor: Afrika Matematika Editor: Khayyam Journal of Mathematics Moori has supervised 25 postgraduate students (6 PGDiploma, 9 MSc, and 10 PhD) and 9 post-doctoral students. He is currently supervising 1 MSc and 1 PhD student. His research activities have been fully supported by various grants from the National Research Foundation (NRF) of South Africa, where he has also served as a panel member and Convener of the Specialist Committee for Mathematical Sciences.

Greg Kuperbergمشاهده پروفایل

استاد

• Quantum Computing
• Computational Complexity
• Geometric Topology
• +۳ مورد دیگر

Dr. Greg Kuperberg is a Distinguished Professor of Mathematics and Computer Science at the University of California, Davis. His research bridges quantum computing, computational complexity, geometric topology, and algebraic combinatorics. He has contributed to foundational work in topological quantum computing, knot theory, and the application of geometric methods to algorithm design. His research interests include the interplay between quantum mathematics and computational problems, such as algorithmic topology and complexity classifications. Notable work includes polynomial-time algorithms for 3-manifold identification and studies on the complexity of knot invariants. He has also explored topics in convex geometry, quantum error correction, and the theoretical limits of computational models. Recent work focuses on a research triangle connecting quantum mathematics, computational complexity, and geometric topology, as well as foundational studies in quantum algorithms and their efficiency. His 2023 papers advance methods for optimizing quantum circuits and analyzing computational barriers in topological contexts. Dr. Kuperberg has been funded by NSF grants including FET projects exploring quantum-complexity-geometry intersections. His work on arXiv usage highlights his engagement with scholarly communication practices. No specific awards are listed in the provided data.

• Computational Algebra
• Group Theory
• Finite Groups
• +۴ مورد دیگر

John J Cannon is a Professor in the School of Mathematics and Statistics at the University of Sydney. He is a member of the Computational Algebra research group and maintains an office in Room 618 of the Carslaw Building. His work has significantly contributed to the field of computational group theory and algebraic computation. University: University of Sydney School: School of Mathematics and Statistics Department: Computational Algebra Position: Professor Professor Cannon's research primarily focuses on computational algebra, group theory, and finite groups. His work has been instrumental in developing algorithms for permutation groups, matrix groups, and computational representation theory. He has made substantial contributions to the understanding of subgroup structures, conjugacy classes, and modular representations in finite groups. His publications demonstrate a consistent trajectory from foundational work in the 1970s through to cutting-edge research in computational algebra up to 2020. The trend in his recent work shows a continued focus on structural computations in large finite groups, with increasing sophistication in handling modular representations and computational challenges in group theory. Professor Cannon is best known as one of the principal developers of the Magma computational algebra system, which has become a standard tool in computational algebra and number theory. His work on Magma has enabled researchers worldwide to perform complex algebraic computations that were previously infeasible. Throughout his career, Professor Cannon has maintained extensive collaborations with leading researchers in computational algebra including Derek Holt, William Unger, Allan Steel, and others. These collaborations have resulted in numerous influential publications that have shaped the field of computational group theory.

Rudi Pendavinghمشاهده پروفایل

استادیار

• Matroid Theory
• Topological Graph Theory
• Discrete Mathematics
• +۴ مورد دیگر

Rudi Pendavingh is an Assistant Professor at the Department of Mathematics and Computer Science at Eindhoven University of Technology. Affiliated since 1999, he specializes in matroid theory , combinatorics , and topological graph theory within the Combinatorial Optimization group. Research Interests include: Matroid theory with focus on excluded minors and representability over partial fields Topological graph theory, particularly Colin de Verdière invariants for surface-embedded graphs Discrete optimization modeling and algorithmic complexity Geometric combinatorics in polyhedral complexes like Dressians Recent Publications highlight his work on: Stable tournament formats using finite projective planes (2025) Bounding topological graph parameters via combinatorial methods (2024) Computational enumeration of matroid minors (2024) Asymptotic analysis of Dressian dimensions (2024) Contact : Email: r.a.pendavingh@tue.nl Phone: +31 40 247 4235 Office: MetaForum 4.105, TU/e Campus

Drew Nobileمشاهده پروفایل

دانشیار

• Popular Music Analysis
• Music Theory
• Rock Music Form
• +۵ مورد دیگر

Drew Nobile serves as Associate Professor of Music Theory at the University of Oregon's School of Music and Dance. His academic appointments include previous faculty positions at the University of Chicago (2013–15) and Brooklyn College (2010–13). He earned his Ph.D. in Music Theory from CUNY Graduate Center in 2014, with additional degrees from University of Washington (M.A., 2009) and Brown University (Sc.B. in Mathematics and Music, 2007). Nobile specializes in the theory and analysis of popular music, with research focusing on rock and pop song structure, harmonic function, voice leading, and the relationship between vocal delivery and formal design. His work bridges traditional music theory with popular music studies, particularly examining how timbre, texture, and lyrical narrative interact with harmonic structures to create formal teleology in popular songs. He advocates for expanding music theory curricula beyond traditional Western art music canons. His publications include the award-winning monograph Form as Harmony in Rock Music (Oxford University Press, 2020), which received the Society for Music Theory's Emerging Scholar Award. Current research includes his NEH-funded second book project Voicing Form in Rock and Pop, 1991–2020 , analyzing vocal delivery's structural role in contemporary popular music. His articles appear in leading journals including Music Theory Spectrum , Journal of Music Theory , and Music Theory Online , where he serves as Associate Editor since November 2022. National Endowment for the Humanities Summer Stipend (2022) Society for Music Theory Emerging Scholar Book Award (2021) Adam Krims Award, SMT Popular Music Interest Group (2017) Oregon Humanities Center Faculty Research Fellowship (2022 & 2016) UO Faculty Research Award (2022 & 2017) Nobile is a dedicated pedagogue who has overhauled the first-year theory curriculum to be more inclusive regarding both repertoire and teaching methodologies. He implements progressive techniques such as ungrading, universal design, and peer instruction. His scholarly work demonstrates how structural listening reveals essential features of popular music that challenge simplistic notions about the genre's musical complexity.

Kevin Igaمشاهده پروفایل

استاد

• Mathematical Physics
• Supersymmetry
• Differential Topology
• +۴ مورد دیگر

Kevin Iga is a Professor of Mathematics at Pepperdine University's Seaver College, part of the Natural Science Division. He has been teaching since 1998 and holds a PhD from Stanford University (1998) and dual BS degrees in Mathematics and Physics from MIT (1992). His research focuses on supersymmetry, particularly using Adinkra diagrams, differential topology, general relativity, and cryptography. He has contributed to geometric interpretations of supersymmetry algebras and combinatorial analysis of Adinkras. Iga serves as Public Information Officer for the MAA's Philosophy of Mathematics SIG and is active in professional organizations like the AMS, ASA, and MAA. His work spans over 25 years, with significant contributions to mathematical physics, including structural theory of Adinkras, cohomological applications, and cryptographic hardness problems. He teaches courses such as Algebraic Structures, Automata Theory, and Real Analysis. Iga is also involved in community activities, singing in the Pepperdine Concert Choir and participating in Malibu Presbyterian Church.

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

استاد

• Analytic Number Theory
• Combinatorial Number Theory
• Diophantine Equations
• +۸ مورد دیگر

Thomas Stoll is a tenured Professor at the Faculty of Science and Technology , University of Lorraine, Nancy, France. He leads research in Analytic and Combinatorial Number Theory , focusing on Diophantine equations , digital expansions , and sum-of-digits functions . He is affiliated with the IECL (Institut Élie Cartan de Lorraine) and has coordinated ANR-FWF research projects like MuDeRa and ArithRand .

Nicholas Ramseyمشاهده پروفایل

استادیار

• Mathematical Logic
• Model Theory
• Classification Theory
• +۴ مورد دیگر

Nicholas Ramsey is an Assistant Professor in the Department of Mathematics at the University of Notre Dame, affiliated with the College of Science. He holds a Ph.D. from the University of California, Berkeley (2018), an M2 from Université Paris Diderot (2013), and an A.B. from the University of Chicago (2012). His research focuses on mathematical logic, particularly model theory, with an emphasis on Shelah’s classification theory and its applications to algebra and combinatorics. **Education:** A.B., University of Chicago, 2012 M2, Université Paris Diderot - Paris 7, 2013 Ph.D., University of California - Berkeley, 2018 **Research Interests:** His work explores classification theory in model theory, including NSOP1 theories, Kim-independence, and applications to algebraic structures like nilpotent groups and Lie algebras. He investigates combinatorial aspects such as PAC fields, permutation groups, and quadratic geometries. Recent trends in his publications emphasize foundational questions in model theory, including measures, saturation, and transitivity properties. **Grants & Advising:** No specific grants or advisees are listed in the provided texts. He maintains an active research program centered at Notre Dame’s Department of Mathematics. **Labs/Teams:** His research is conducted within the Department of Mathematics, contributing to the broader logic group at Notre Dame.

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.