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

Lara Pudwellمشاهده پروفایل

استاد

• Enumerative Combinatorics
• Permutation Patterns
• Combinatorics
• +۳ مورد دیگر

Lara Pudwell is a Full Professor and the Dixon W. and Herta E. Benz Professor in the Department of Mathematics & Statistics at Valparaiso University. She specializes in enumerative combinatorics, permutation patterns, and undergraduate research mentoring. Her work often explores pattern avoidance in permutations, rook monoids, and combinatorial structures. Education: Ph.D. in Mathematics, Rutgers University (2008) B.S. and B.A., Valparaiso University (2003) Research Interests: Lara’s research focuses on permutation patterns, combinatorial enumeration, and the application of combinatorial methods to problems in algebra, geometry, and theoretical computer science. She is particularly known for her work on pattern-avoiding permutations and enumeration schemes, as well as her contributions to undergraduate research and mentoring. Professional Activities: Lara has been an invited speaker at conferences such as the Sonia Kovalevsky Day and has participated in organizing events like MathPath. She actively contributes to mathematical communities through talks, journal articles, and mentoring programs. Labs/Teams: She collaborates with interdisciplinary teams and mentors students in research projects, including those supported by NSF grants. Her work often involves experimental mathematics and computational tools for combinatorial analysis.

Ruth Hoffmannمشاهده پروفایل

مدرس

• Computational Combinatorics
• Graph Theory
• Permutation Classes
• +۴ مورد دیگر

Dr. Ruth Hoffmann is a Lecturer at the University of St Andrews, affiliated with the School of Computer Science and the St Andrews GAP Centre. Her research focuses on computational combinatorics, graph theory, permutation classes, computational group theory, and formal verification. She has contributed to improving combinatorial search algorithms for graph and group problems, including subgraph isomorphism and stabiliser chains. Research Interests Engineering efficient algorithms for graph and group problems Constraint programming applications in permutation enumeration and puzzle solving Formal verification of autonomous systems and memory models Combinatorial search optimization and algorithm design Teaching Current modules: Foundations of Computation (CS2001), Programming with Data (CS1003) Past roles: Overseer of BSc Data Science Graduate Apprenticeship and instructor for Computational Complexity (CS3052) and Information Security Management (IS5104) Recent Research Trends Dr. Hoffmann’s recent work emphasizes constraint modeling innovations, including permutation enumeration frameworks and automated puzzle-solving explanations. Her publications address formal verification challenges in autonomous systems and memory consistency protocols, alongside combinatorial search advancements for graph problems. Collaborative projects include EPSRC-funded efforts to enhance group search techniques using graph-based methods. Grants & Projects Enhancing Group Search with Graph Techniques (EPSRC, 2023–2025) C3+: Constraint-based Collaboration (EPSRC, 2018) Labs & Teams Active contributor to the St Andrews GAP Centre, focusing on computational algebra and combinatorics.

Nikolay Stoyanov Kaleyskiمشاهده پروفایل

دانشیار

• Cryptographic Boolean Functions
• APN Functions
• Finite Fields
• +۴ مورد دیگر

Nikolay Stoyanov Kaleyski is an Associate Professor at the Department of Informatics, University of Bergen. His research focuses on cryptographic Boolean functions, particularly APN (Almost Perfect Nonlinear) functions and their applications in symmetric cryptography. He explores algorithm design for function analysis and hardware architectures for efficient cryptographic implementations. He has taught courses including Advanced Cybersecurity (INF249), Applied Cryptography (INF143A), and Information Theory (INF242) across multiple semesters. His research interests include the construction, classification, and properties of Boolean functions with optimal cryptographic criteria. He investigates hardware-friendly implementations of APN permutations and contributes to understanding equivalence relations among functions (EA/CCZ-equivalence). Notable work includes studies on planar functions in finite fields and low-complexity hardware architectures using TU-decomposition. Publications span topics like APN function generalizations, 0-APN monomials, and partial APN properties. Collaborations with institutions like the Naval Postgraduate School and Sungkyunkwan University highlight his international research network. His doctoral dissertation (2021) deepened insights into longstanding APN-related problems.

Gary Royden Watson Greavesمشاهده پروفایل

استادیار

• Algebraic Graph Theory
• Combinatorial Design Theory
• Computational Discrete Mathematics
• +۳ مورد دیگر

Dr. Gary Royden Watson Greaves is an Assistant Professor in the Division of Mathematical Sciences at the School of Physical and Mathematical Sciences, Nanyang Technological University (NTU), Singapore. His research focuses on algebraic graph theory, combinatorial design theory, and computational discrete mathematics. He has held academic positions including Lecturer (2016) and Senior Lecturer (2020) before becoming an Assistant Professor in 2024. Greaves' research contributions span topics such as Neumaier graphs, equiangular lines, chromatic polynomials of signed graphs, and spectral graph theory. He has been recognized with awards including the Nanyang Education Award (College) in 2024 and a monetary award for solving parts of Wei-Hsuan Yu's conjecture in 14, 16, and 17 dimensions. His work often intersects with combinatorics, linear algebra, and computational methods. Key research activities include collaborations on graph constructions, matrix models, and design theory. He has presented at international conferences such as the Australasian Combinatorics Conference and Combinatorics in Christchurch. His publications reflect a strong emphasis on theoretical results with applications in discrete geometry and algebraic structures.

Scott Harperمشاهده پروفایل

استادیار

• Group Theory
• Representation Theory
• Geometric Group Theory
• +۵ مورد دیگر

Dr. Scott Harper is an Assistant Professor in the School of Mathematics at the University of Birmingham and a 125th Anniversary Fellow. His research focuses on group theory, with grants from EPSRC and Leverhulme. He holds a PhD from the University of Bristol (2019) and MMath from the University of St Andrews (2015). Research Interests: Group theory, including generating sets, subgroup structures, derangements, and their connections to representation theory, geometric group theory, Lie theory, and combinatorics. Also interests in proof formalisation, mathematics education, and the philosophy of mathematical practice. Publications: Recent work includes studies on Kronecker classes, normal coverings, and minimal cover groups. His research emphasizes symmetry and its applications in finite and infinite groups. Awards: Gold Medal at STEM for Britain (2021), EPSRC Postdoctoral Fellowship, Leverhulme Early Career Fellowship. Grants & Teaching: Funded by EPSRC and Leverhulme. Previously taught at University of St Andrews and University of Bristol, focusing on advanced group theory and LaTeX for mathematics.

• Control Systems
• Machine Learning
• Optimization Algorithms
• +۳ مورد دیگر

Pedro Manuel Quintas Aguiar is an Associate Professor at the Department of Electrical and Computer Engineering, Instituto Superior Técnico (University of Lisbon), specializing in Systems, Decision, and Control. His work integrates optimization, machine learning, and computer vision with applications in distributed systems, 3D reconstruction, and robotics. He leads research in structured prediction and distributed algorithms for sensor networks. Education: PhD in Electrical Engineering (assumed based on role) Not explicitly stated but inferred from academic rank Research Interests: Optimization algorithms for distributed systems Machine learning for computer vision (attention mechanisms, shape representation) 3D reconstruction from video and motion estimation Robotic perception and bin-picking applications His recent work emphasizes scalable distributed optimization (e.g., D-ADMM algorithms) and robust visual attention models. Grants & Labs: Collaborations on sensor networks and underwater communications Focus on real-time systems and low-light video processing Labs/Teams: Involved with ISR (Institute for Systems and Robotics) at IST.

• Geometric Galois Actions
• Operads
• Finite Type Invariants of Knots
• +۵ مورد دیگر

Vasily Dolgushev is a Professor in the Department of Mathematics at Temple University, where he maintains his office in Wachman Hall. His research program bridges several sophisticated areas of modern mathematics, with a particular focus on the deep connections between algebraic structures and geometric phenomena. His primary research interests include geometric Galois actions, operad theory, and finite type invariants of knots. Much of his recent work centers on the Grothendieck-Teichmueller group (GT), GT-shadows, and their connections to the absolute Galois group of rational numbers. His investigations explore how these structures relate to embedding spaces, the theory of motives, and Grothendieck's dessins d'enfants (child's drawings). As a US-based participant in the International Research Network for Arithmetic & Homotopic Galois Theory, he contributes to cutting-edge research at the intersection of number theory and topology. Analysis of his recent publications reveals a consistent focus on computational and theoretical aspects of GT-shadows, with increasing attention to their action on combinatorial structures related to Galois theory. His work demonstrates the power of operadic methods in understanding deep arithmetic phenomena, connecting seemingly disparate areas of mathematics through innovative structural frameworks. Dolgushev actively mentors graduate students, including Jingfeng Xia who completed a master's thesis on GT-shadows for the gentle version of the Grothendieck-Teichmueller group. He has established significant collaborative relationships with researchers including Ivan Bortnovskyi, Jacob Guynee, K.Q. Le, A.A. Lorenz, and Geoffrey Schneider. His technical contributions include developing software packages for working with GT-shadows and their action on child's drawings, demonstrating his commitment to making advanced mathematical concepts computationally accessible. His presentations at institutions including Bar-Ilan University, University of Minnesota, Penn, and University of Angers reflect his active engagement with the international mathematical community.

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

استادیار

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

Jiuya Wang is an Assistant Professor in the Department of Mathematics at the University of Georgia. His research lies at the intersection of algebraic and analytic number theory , focusing on problems related to Malle's conjecture , class group statistics , and Galois theory . Previously, he was a Phillip Griffiths Research Assistant Professor at Duke University and completed his PhD at the University of Wisconsin-Madison under the supervision of Melanie Matchett Wood. Education: PhD in Mathematics, University of Wisconsin-Madison (2018) Research Interests: Wang's work spans algebraic number theory and arithmetic geometry , with a particular emphasis on: Counting number fields and their asymptotic distributions Class group torsion and Cohen-Lenstra-Martinet heuristics Galois representations and their applications to conjectures like Brumer-Stark Energy minimization and potential theory in analysis Publications Overview: His recent publications (2020-2023) cover a broad spectrum including counterexamples to conjectures, improved bounds for field counts, sharp inequalities in analysis, and advanced algebraic structures. Notable works include proving cases of Malle's conjecture , establishing pointwise bounds for ℓ-torsion , and resolving the sharp Erdős-Turán inequality . Teaching & Mentorship: Current Courses: Math 2250 (Fall 2022) Previous Courses: Math 3000, Math 3300 (UGA), Math 401, Math 212 (Duke), Math 234 (UW-Madison) Student Mentorship: Co-led undergraduate research (DoMath at Duke, 2020) Organizational Roles: Organizer, Spring 2022 reading seminar on algebraic number theory (UGA) Co-organizer, AMS special session on counting methods (2019)

• Geometric Group Theory
• Topological Groups
• Homeomorphism Groups
• +۳ مورد دیگر

James Hyde is an Assistant Professor in the Department of Mathematical Sciences at Binghamton University (SUNY), part of the Harpur College of Arts and Sciences. He holds a Ph.D. from the University of St. Andrews (2017) and joined Binghamton in 2024. His research focuses on geometric group theory, particularly groups of homeomorphisms, exploring properties such as simplicity, finite generation, finite presentation, and left-orderability. He investigates how these groups interact with geometric and topological structures, including their role in dynamical systems and renormalization processes. Hyde’s work includes constructing novel examples of groups with unique combination properties, such as embedding ℚ into finitely presented groups or analyzing stabilizers in Higman-Thompson groups. His recent studies (2023–2025) address Boone-Higman embeddings, Ulam widths of infinite simple groups, and periodic homeomorphisms under renormalization. He teaches calculus and topology courses, including Math 226/227 (Integration Techniques and Infinite Series) and Math 565 (Topology Seminar). No specific grants or awards are listed, but his research contributes to foundational questions in geometric group theory and topological dynamics. His work often intersects with algebraic structures and combinatorial methods, reflecting a broad expertise in abstract mathematical systems.

Vincent Lostanlenمشاهده پروفایل

پژوهشگر

• Machine Learning
• Audio Content Analysis
• Computer Music
• +۱۱ مورد دیگر

Vincent Lostanlen is a Researcher (chargé de recherche) at CNRS, affiliated with the LS2N laboratory located at Centrale Nantes engineering school. He also serves as a visiting scholar at New York University. His research focuses on developing artificial intelligence for audio analysis, emphasizing machine listening systems, bioacoustic monitoring, and computer music. Key projects include the BirdVox platform for avian migration monitoring and the Kymatio Python library for wavelet scattering transforms. Education: Ph.D. in Mathematics from École Normale Supérieure (2017), supervised by Stéphane Mallat; MSc in Acoustics & Music Informatics from Université Pierre-et-Marie-Curie (2013); Dipl. Ing. in Signal Processing from Télécom ParisTech (2013). Research interests span audio representation learning, environmental sensor networks, and generative models for sound. Notable contributions include the SONYC-UST urban sound dataset and the PCEN signal frontend for robust acoustic sensing. Scientific awards include the 2019 AFIM Young Researcher Award, 2016 SFA Best Poster Prize, and 2015 IEEE MLSP Best Paper Award. He advises graduate students across computer science and music technology domains, with former advisees working in academia and industry. Current activities include developing green AI for audio processing and collaborating on bioacoustic sensor networks for biodiversity monitoring. His work bridges signal processing theory with practical applications in music, ecology, and biomedical engineering.

Assaf Libmanمشاهده پروفایل

مدرس ارشد

• Algebraic Topology
• Homotopy Theory
• Fusion Systems
• +۷ مورد دیگر

Assaf Libman is a Reader in the School of Natural and Computing Sciences at the University of Aberdeen. His research lies at the intersection of algebraic topology, homotopy theory, and group theory, with a focus on fusion systems, p-local compact groups, and their connections to representation theory. He also contributes to mathematical finance and argumentation theory, demonstrating interdisciplinary breadth. Research Interests: Homotopy Theory and its relations with Homological Algebra and Representation Theory The homotopy theory of fusion systems Applications to modular representation theory Mathematical finance and discrete market models Argumentation theory and logical semantics Recent publications reveal a sustained research output in both pure mathematics and applied domains. His work on fusion systems, boundedness of groups, and homotopy limits reflects deep theoretical engagement, while his papers on super-hedging, option pricing, and argumentation semantics show applied versatility. Trends indicate ongoing collaborations, particularly with Jarek Kędra and Nir Oren. Scientific Funding: Nuffield Foundation (2004) EPSRC (2006) – Project: "Combinatorial and Homotopy Theory of Classifying Spaces of Fusion Systems" Libman teaches undergraduate courses including Probability Theory (MA2505), Engineering Analysis and Methods (EG3006), and Understanding Data (ST1506). He has no listed advisees in the provided text. He maintains an active research profile with publications up to 2025.

• Group Theory
• Algebra
• Geometry
• +۵ مورد دیگر

Francesco Fournier-Facio is a Herchel Smith Fellow at the Department of Pure Mathematics and Mathematical Statistics (DPMMS) within the Faculty of Mathematics at the University of Cambridge, concurrently holding a Henslow Fellowship from the Cambridge Philosophical Society based at Wolfson College. His research bridges algebra, geometry, topology, and dynamics through the lens of group theory—the mathematical language of symmetry. His academic foundation includes a Bachelors degree from EPFL in Lausanne and Masters/PhD from ETH Zurich, Switzerland. Key research areas encompass: Bounded cohomology applications in geometric topology Rigidity theory and metric approximations of groups Stability phenomena in group structures Analysis of his 15 most recent publications reveals dominant themes in geometric group theory, particularly bounded cohomology (appearing in 60% of works), stability theory (53%), and hyperbolic geometry applications (47%). His research demonstrates strong interdisciplinary connections between algebraic structures and geometric interpretations, with increasing emphasis on computational aspects since 2023. Notable recognitions include: Herchel Smith Fellowship at DPMMS Henslow Fellowship of the Cambridge Philosophical Society As an early-career researcher actively seeking a permanent position for autumn 2026, he collaborates within Henry Wilton's research group at DPMMS while developing independent projects. His current focus involves exploring connections between group symmetries and topological rigidity phenomena, with potential applications in theoretical physics and computer science. Francesco maintains active affiliation with Wolfson College's academic community and participates in the Cambridge Philosophical Society's research initiatives, contributing to seminars on geometric structures and group-theoretic methods.

Lars Jaffkeمشاهده پروفایل

استادیار

• Graph Algorithms
• Parameterized Complexity
• Structural Graph Theory
• +۲ مورد دیگر

Lars Jaffke is an Assistant Professor in Informatics at NHH Norwegian School of Economics, Bergen, Norway. Previously, he held postdoctoral positions at IT University of Copenhagen (2024), University of Warsaw (2021-2022), and University of Bergen (2020-2021). He earned his PhD in Computer Science from the University of Bergen in 2020. Research Interests: His work focuses on algorithmic and structural aspects of graphs, particularly width measures (treewidth, pathwidth, mim-width) and their applications to graph classes. He investigates parameterized complexity, optimization problems, and algorithm design for graphs with bounded width parameters. Key Publications Trends: Recent works include algorithmic meta-theorems for mim-width, structural analysis of planar graphs, and complexity studies in graph coloring and domination problems. He develops dynamic programming techniques on specialized decompositions and explores logical characterizations of graph algorithms. Scientific Awards: IPEC Best Paper Award (2022) Travel Grant from L. Meltzer Fund (2021) Scholarship in Applied Computer Science, State of NRW (2012) Teaching & Service: He has served as course co-instructor for Algorithms and Programming with Python (2024) and taught Complexity Theory and graph algorithms at University of Bergen. He has been on program committees for IPEC 2024 and ESA 2023, and regularly reviews for top-tier conferences and journals like FOCS, STOC, SIAM Journal on Computing, and Theoretical Computer Science.

• Probabilistic Combinatorics
• Extremal Combinatorics
• Random Combinatorial Structures
• +۲ مورد دیگر

Guillem Perarnau Llobet is an Associate Professor at the Department of Mathematics, Universitat Politècnica de Catalunya (UPC), affiliated with CRM (Centre de Recerca Matemàtica), IMTech (Institut de Matemàtiques de la UPC), and BGSMath (Barcelona Graduate School of Mathematics). His academic journey includes a PhD at UPC under Oriol Serra, followed by a CARP Postdoc Fellowship at McGill University with Bruce Reed and Louigi Addario-Berry (2013–2015), and a Lecturer position at the University of Birmingham (2016–2019). Current Role: Associate Professor, UPC Past Roles: Lecturer, University of Birmingham; Postdoc, McGill University Affiliations: CRM, IMTech, BGSMath Research Focus: Probabilistic and Extremal Combinatorics, Random Combinatorial Structures, Discrete Stochastic Processes, and Analysis of Randomized Algorithms. His work bridges theoretical rigor with practical algorithmic insights, particularly in graph theory and random graph dynamics. Article Trends: Recent publications emphasize algorithmic combinatorics, probabilistic methods in random graphs, and hypergraph Hamiltonicity. Key themes include mixing times, synchronization, and percolation phenomena across diverse graph models. Scientific Awards: CARP Postdoc Fellowship Grants & Collaborations: COCOA Grant (coPI) RandNET MSCA Exchange Programme Participant Spanish Discrete and Algorithmic Mathematics Network Coordinator

Roman Hornungمشاهده پروفایل

پژوهشگر ارشد

• Random Forests
• Statistical Methodology for Cross-Lab Prediction
• Statistical Methodology for Multi-Omics Data
• +۵ مورد دیگر

Dr. Roman Hornung is a Research Fellow at the Institute of Medical Informatics, Biometry and Epidemiology (IBE) within Ludwig-Maximilians-Universität Munich (LMU), specializing in Biometry in Molecular Medicine. His work focuses on advancing statistical and machine learning methodologies for biomedical applications. Academic Rank: Research Fellow Key Research Areas: Random Forests, Multi-Omics Data Integration, Interpretable Machine Learning, Cross-Validation Techniques, Biomedical Informatics, and Meta-Research on Prognostic Modeling Teaching: Leads seminars on applied statistics in epidemiology and contributes to clinical epidemiology tutorials Software Contributions: Maintainer of R packages like diversityForest and prioritylasso His research bridges statistical theory and practical biomedical applications, with a particular emphasis on reproducibility and robustness in predictive modeling. He has developed novel random forest variants for multi-class outcomes and multi-omics data. Hornung’s recent publications and submitted work highlight trends in benchmarking machine learning methods, improving cross-study prediction, and understanding the impact of data preparation on model performance. Notably, he has contributed to methodologies for generalization error estimation, variable importance measures, and diversity-enhanced forest algorithms. As a member of the Biometry in Molecular Medicine working group, he collaborates on interdisciplinary projects integrating clinical and omics data. His habilitation at LMU Munich (2024) and editorial roles at Biometrical Journal and Scientific Reports underscore his academic leadership in statistical methodology for health sciences.