Conférences  >  Mathématiques  >  Théorie des graphes et combinatoire

Sélecionner un pays
TOUS LES PAYS (40)
1
RESEARCH IN RESIDENCE — Ky Fan type theorems, their relatives and generalizations
24 mar 2025 - 04 avr 2025 • CIRM (Marseille Luminy), France
Organisateur:
CIRM – Centre International de Rencontres Mathématiques
Résumé:
Combinatorial statements, such as theorems of Caratheodory, Radon, Helly, Sperner, Tucker, Ky Fan, etc., are fundamental results of combinatorial (algebraic) topology, accessible to non-specialists, which are immediately applicable to mathematical economics, data science, game theory, graph theory, mathematical optimization, computational geometry, and other fields. The aim of our project is to study the “Ky Fan correspondence » between the topology of triangulated spherical bundles and combinatorics of generalized labelings (coloring) of the associated simplicial complexes. Guided by the review of De Loera et. al. (Bull. Amer. Math. Soc., 2019) we explore the consequences of this correspondence for the envy-free and fair division problem, Tverberg-type theorems, and other related problems of topological combinatorics.
Identifiant de l'évènement:
1633970
2
WORDS 2025 — Workshop on Randomness and Discrete Structures
07 avr 2025 - 09 avr 2025 • University of Groningen, Pays-Bas
Résumé:
WORDS 2025 will delve into various topics related to discrete structures and randomness, including but not limited to percolation, random graphs, and stochastic geometry. Participants will have the opportunity to discuss current trends, share research findings, and collaborate on innovative approaches to understanding random phenomena. The program will also leave ample time for in-depth discussions and networking among attendees.
Identifiant de l'évènement:
1649298
Sujets apparentés:
3
Geometry of Materials
07 avr 2025 - 11 avr 2025 • Providence, RI, États-Unis
Organisateur:
Institute for Computational and Experimental Research in Mathematics (ICERM)
Résumé:
The geometric arrangement of a material’s constituents plays an important role in governing its behavior. Concepts from discrete mathematics to describe these geometric arrangements, including notions of rigidity and flexibility, can bring fundamental insight into how a material might respond to stress, be designed, be reconfigured, etc. Beyond materials, the notions of network rigidity can be applied to more abstract networks and geometries, such as those found in data science. This workshop aims to build connections between the field of mathematical rigidity theory, other topics in applied mathematics, and related areas of science and engineering.
Contact:
ICERM;     Email.: info@icerm.brown.edu
Identifiant de l'évènement:
1641829
4
EuroCG'25 — European Workshop on Computational Geometry
09 avr 2025 - 11 avr 2025 • Liblice Castle, République tchèque
Organisateur:
Charles University, Faculty of Mathematics and Physics
Résumé:
EuroCG is an annual workshop that combines a strong scientific tradition with a friendly and informal atmosphere. The workshop is a forum where established researchers and students can meet, discuss their work, present their results, and establish scientific collaborations. The goal is to present recent results and to identify and explore directions for future research.
Identifiant de l'évènement:
1649211
Sujets apparentés:
5
Detection, Estimation, and Reconstruction in Networks
21 avr 2025 - 25 avr 2025 • Berkeley, Californie, États-Unis
Organisateur:
Simons Laufer Mathematical Sciences Institute (SLMath)
Résumé:
In a growing number of applications, one needs to analyze and interpret data coming from massive networks. The statistical problems arising from such applications lead to important mathematical challenges: building novel probabilistic models, understanding the possibilities and limitations for statistical detection and inference, designing efficient algorithms, and understanding the inherent limitations of fast algorithms. The workshop will bring together leading researchers in combinatorial statistics, machine learning, and random graphs in the hope of cross-fertilization of ideas.
Sujets:
combinatorial statistics, random graphs, network inference, network reconstruction, detection, estimation
Identifiant de l'évènement:
1571419
6
ESI Workshop — Uniform Distribution of Sequences
22 avr 2025 - 25 avr 2025 • Universität Wien, Autriche
Organisateur:
Erwin Schrödinger International Institute for Mathematics and Physics (ESI)
Résumé:
This workshop is devoted to interactions between continued fraction algorithms (in dimension one and mostly higher) and arithmetic, automatic and uniformly distributed sequences. Problems in this area inspired a lot of work in dynamical systems in general, and the techniques that were developed over the years found applications well beyond their original motivation. Milestones in the theory were achieved by Austrian and Dutch mathematicians and collaborations between them: Hlawka-Koksma and Kuipers-Niederreiter.
Identifiant de l'évènement:
1648990
Sujets apparentés:
7
evocop* — 25th European Conference on Evolutionary Computation in Combinatorial Optimisation
23 avr 2025 - 25 avr 2025 • Trieste, Italie
Résumé:
The 25th European Conference on Evolutionary Computation in Combinatorial Optimisation is a multidisciplinary conference that brings together researchers working on applications and theory of evolutionary computation methods and other metaheuristics for solving difficult combinatorial optimisation problems appearing in various industrial, economic, and scientific domains. Successfully solved problems include, but are not limited to, multi-objective, uncertain, dynamic and stochastic problems in the context of scheduling, timetabling, network design, transportation and distribution, vehicle routing, stringology, graphs, satisfiability, energy optimisation, cutting, packing, planning and search-based software engineering. Successfully addressed theoretical and translational challenges encompass, but are not limited to, the development and analysis of novel (components of) evolutionary and other metaheuristic algorithms, work on neighbourhood and landscape structures, problem-agnostic and problem-specific variation operators, parallelisation strategies, and hybridizations. ⁠
Identifiant de l'évènement:
1649223
8
Seminar — Chancellor Professor Course: Interdisciplinary Topics in Mathematics: Theory of Combinatorial Limits
29 avr 2025 • UC Berkeley, États-Unis
Organisateur:
Simons Laufer Mathematical Sciences Institute (SLMath)
Résumé:
The course will present basic concepts of the theory of combinatorial limits related to various combinatorial objects such as graphs, permutations, and hypergraphs, and discuss analytic representations of their limits. We will discuss how the theory of combinatorial limits is related to regularity decompositions and how its analytic tools can be applied to various problems in computer science and mathematics, in particular, in extremal combinatorics where Razborov's flag algebra method has led to advances on long-standing open problems (with solutions of the Erdős-Rademacher Problem and the Erdős Pentagon Problem being among the first results obtained using the method). We will demonstrate how the flag algebra arguments can be applied both directly and in a computer-assisted way, including non-asymptotic settings, e.g., to compute particular Ramsey numbers.
Identifiant de l'évènement:
1653960
9
Seminar — Chancellor Professor Course: Interdisciplinary Topics in Mathematics: Theory of Combinatorial Limits
01 mai 2025 • UC Berkeley, États-Unis
Organisateur:
Simons Laufer Mathematical Sciences Institute (SLMath)
Résumé:
The course will present basic concepts of the theory of combinatorial limits related to various combinatorial objects such as graphs, permutations, and hypergraphs, and discuss analytic representations of their limits. We will discuss how the theory of combinatorial limits is related to regularity decompositions and how its analytic tools can be applied to various problems in computer science and mathematics, in particular, in extremal combinatorics where Razborov's flag algebra method has led to advances on long-standing open problems (with solutions of the Erdős-Rademacher Problem and the Erdős Pentagon Problem being among the first results obtained using the method). We will demonstrate how the flag algebra arguments can be applied both directly and in a computer-assisted way, including non-asymptotic settings, e.g., to compute particular Ramsey numbers.
Identifiant de l'évènement:
1654016
10
Frieze patterns in algebra, combinatorics and geometry
12 mai 2025 - 16 mai 2025 • CIRM (Marseille Luminy), France
Organisateur:
CIRM – Centre International de Rencontres Mathématiques
Résumé:
Friezes, introduced 50 years ago by Coxeter, are patterns of integers defined by a simple, local condition. They consist of a finite (or infinite) number of rows written in a lattice, starting with a row of 0s and a row of 1s and satisfying a local SL2-rule: for any four neighbours a, b, c, d forming a diamond we require ad − bc = 1. Since the discovery of links to cluster algebras of type A, a plethora of generalisations have been studied in the last decades. With this workshop, we will provide a platform to establish new links between friezes and research areas in geometry, algebra and combinatorics.
Identifiant de l'évènement:
1634084
Sujets apparentés:
11
INTEGERS CONFERENCE 2025
14 mai 2025 - 17 mai 2025 • University of Georgia, Athens, Georgia, États-Unis
Résumé:
The Integers conferences are international conferences held for the purpose of bringing together mathematicians, students, and others interested in number theory and combinatorics.
Sujets:
In Honor of the 80th Birthdays of Melvyn Nathanson and Carl Pomerance
Identifiant de l'évènement:
1649235
12
34th Cumberland Conference
17 mai 2025 - 18 mai 2025 • Auburn University, Auburn, AL, États-Unis
Résumé:
The series of Cumberland Conferences on Combinatorics, Graph Theory, and Computing began with the intention of meeting a regional need. The conferences bring together internationally known researchers, university and college professors from throughout the southeastern region, some industrial mathematicians and computer scientists, graduate students in these fields, and some undergraduate students. Particular efforts are made to include faculty and students from smaller institutions throughout the region. These conferences are typically held during the month of May, immediately after the end of the spring semester, and the location rotates among universities in the Cumberland region.
Identifiant de l'évènement:
1649444
13
GRASTA 2025 — 12th Workshop on GRAph Seaching, Theory and Applications
18 mai 2025 - 23 mai 2025 • Będlewo, Pologne
Organisateur:
Banach Center
Identifiant de l'évènement:
1633419
14
Seminar — Chancellor Professor Course: Interdisciplinary Topics in Mathematics: Theory of Combinatorial Limits
22 mai 2025 • UC Berkeley, États-Unis
Organisateur:
Simons Laufer Mathematical Sciences Institute (SLMath)
Résumé:
The course will present basic concepts of the theory of combinatorial limits related to various combinatorial objects such as graphs, permutations, and hypergraphs, and discuss analytic representations of their limits. We will discuss how the theory of combinatorial limits is related to regularity decompositions and how its analytic tools can be applied to various problems in computer science and mathematics, in particular, in extremal combinatorics where Razborov's flag algebra method has led to advances on long-standing open problems (with solutions of the Erdős-Rademacher Problem and the Erdős Pentagon Problem being among the first results obtained using the method). We will demonstrate how the flag algebra arguments can be applied both directly and in a computer-assisted way, including non-asymptotic settings, e.g., to compute particular Ramsey numbers.
Identifiant de l'évènement:
1654079
15
Seminar — Chancellor Professor Course: Interdisciplinary Topics in Mathematics: Theory of Combinatorial Limits
24 mai 2025 • UC Berkeley, États-Unis
Organisateur:
Simons Laufer Mathematical Sciences Institute (SLMath)
Résumé:
The course will present basic concepts of the theory of combinatorial limits related to various combinatorial objects such as graphs, permutations, and hypergraphs, and discuss analytic representations of their limits. We will discuss how the theory of combinatorial limits is related to regularity decompositions and how its analytic tools can be applied to various problems in computer science and mathematics, in particular, in extremal combinatorics where Razborov's flag algebra method has led to advances on long-standing open problems (with solutions of the Erdős-Rademacher Problem and the Erdős Pentagon Problem being among the first results obtained using the method). We will demonstrate how the flag algebra arguments can be applied both directly and in a computer-assisted way, including non-asymptotic settings, e.g., to compute particular Ramsey numbers.
Identifiant de l'évènement:
1654036
16
Hadamard 2025 — 8th Workshop on Design Theory, Hadamard Matrices and Applications
26 mai 2025 - 30 mai 2025 • Sevilla , Espagne
Résumé:
The purpose of the workshop is to bring together researchers and students interested in design theory, especially as it relates to Hadamard matrices and their applications, as well as in related areas in coding theory, association schemes, sequences, finite geometry, difference sets, quantum information theory, theoretical physics and computer security. The audiences would learn about the latest developments in these areas, discuss the latest findings, take stock of what remains to be done on classical problems and explore different visions for setting the direction for future work.
Identifiant de l'évènement:
1649258
Sujets apparentés:
17
Summer School at Iowa State University — Topological Methods in Combinatorics
27 mai 2025 - 31 mai 2025 • Ames, IA, Royaume-Uni
18
13th Graph Theory and Algebraic Combinatorics Conference
28 mai 2025 - 29 mai 2025 • University, Lavizan, Tehran, Iran
Résumé:
The Graph Theory and Algebraic Combinatorics Conference (GTACC) is a conference that is organized every year. The aim of this conference is to exchange research ideas among the algebraic combinatorics and graph theory. In addition, specialists in the subject of graph theory and combinatorics can present their latest research works and encourage interested students to progress and widen their knowledge of combinatorics and graph theory. The 13th Conference on Graph Theory and Algebraic Combinatorics will be held in the Department of Mathematics, Shahid Rajaee Teacher Training University, Tehran, Iran on 28-29 May 2025. We welcome all mathematicians around the world to participate in the conference as speakers and listeners.
Identifiant de l'évènement:
1649172
19
5th Pythagorean conference
01 jui 2025 - 06 jui 2025 • Kalamata, Grèce
Sujets:
Finite Geometry, Crptology, Algegraic Combinatorics, Coding Theory, Combinatorial Designs
Identifiant de l'évènement:
1649239
20
School — Local Limits of Random Graphs
02 jui 2025 - 13 jui 2025 • Paris-Saclay University, France
Organisateur:
Simons Laufer Mathematical Sciences Institute (SLMath)
Résumé:
Random graphs are ubiquitous in modern probability theory. Besides their intrinsic mathematical beauty, they are also used to model complex networks. In the early 2000’s, I. Benjamini and O. Schramm introduced a mathematical framework in which they endowed the set of locally finite rooted connected graphs with the structure of a Polish space, called the local topology. The goal of this summer school is to introduce the framework of local limits of random graphs, the concepts of Benjamini-Schramm (or unbiased) limits and unimodularity, as well as the most important applications. The lectures will be delivered by Nicolas Curien (Prof. Paris-Saclay University) and Justin Salez (Prof. Université Paris-Dauphine) and will be complemented by many problem sessions, where students will work in small groups under the guidance of teaching assistants, who are researchers in the field.
Identifiant de l'évènement:
1656285
21
WG — 51st International Workshop on Graph-Theoretic Concepts in Computer Science
11 jui 2025 - 13 jui 2025 • Otzenhausen, Allemagne
Organisateur:
Trier University, Computer Science Department
Résumé:
WG conferences aim to connect theory and applications by demonstrating how graph-theoretic concepts can be applied in various areas of computer science. This conference series has a long tradition and bridges discrete mathematics and computer science. WG is mainly concerned with efficient algorithms of various types (e.g., sequential, parallel, distributed, randomized, parameterized) for problems on graphs and networks. The goal is to present recent results and to identify and explore directions for future research.
Contact:
PC Chairs;     Tél.: [(not so relevant)];     Email.: fernau@uni-trier.de; kindermann@uni-trier.de
Sujets:
design and analysis of sequential, parallel, randomized, parameterized algorithms, distributed graph and network algorithms, structural graph theory with algorithmic or complexity applications, computational complexity of graph and network problems, graph grammars, graph rewriting systems and graph modeling, graph drawing and layouts, computational geometry, computational biology, graph mining, random graphs and models of the web and scale-free networks, support of the above concepts by suitable implementations and applications.
Identifiant de l'évènement:
1646603
22
WG — 51st International Workshop on Graph-Theoretic Concepts in Computer Science
11 jui 2025 - 13 jui 2025 • Otzenhausen, Allemagne
Organisateur:
Trier University, Computer Science Department
Résumé:
WG conferences aim to connect theory and applications by demonstrating how graph-theoretic concepts can be applied in various areas of computer science. This conference series has a long tradition and bridges discrete mathematics and computer science. WG is mainly concerned with efficient algorithms of various types (e.g., sequential, parallel, distributed, randomized, parameterized) for problems on graphs and networks. The goal is to present recent results and to identify and explore directions for future research.
Contact:
PC Chairs;     Tél.: [(not so relevant)];     Email.: fernau@uni-trier.de; kindermann@uni-trier.de
Sujets:
design and analysis of sequential, parallel, randomized, parameterized algorithms, distributed graph and network algorithms, structural graph theory with algorithmic or complexity applications, computational complexity of graph and network problems, graph grammars, graph rewriting systems and graph modeling, graph drawing and layouts, computational geometry, computational biology, graph mining, random graphs and models of the web and scale-free networks, support of the above concepts by suitable implementations and applications.
Identifiant de l'évènement:
1647314
23
IPCO 2025 — 26th Conference on Integer Programming and Combinatorial Optimization
11 jui 2025 - 13 jui 2025 • Johns Hopkins University in Baltimore, Maryland, États-Unis
Résumé:
IPCO (Integer Programming and Combinatorial Optimization) is a conference that is sponsored by the Mathematical Programming Society. IPCO is a forum for researchers and practitioners working on various aspects of integer programming and combinatorial optimization. The aim is to present recent developments in theory, computation, and applications of integer programming and combinatorial optimization. The conference and summer school will take place at Johns Hopkins University in Baltimore, Maryland, USA.
Identifiant de l'évènement:
1649100
24
CPM 2025 — 36th Annual Symposium on Combinatorial Pattern Matching
17 jui 2025 - 19 jui 2025 • Milan, Italie
Date limite de soumission des résumés:
21 fév 2025
Identifiant de l'évènement:
1649156
25
Combinatorics around the q-Onsager Algebra — celebrating the 70th birthday of Paul Terwilliger
23 jui 2025 - 28 jui 2025 • Kranjska Gora, Slovénie
Identifiant de l'évènement:
1625050
Sujets apparentés:
26
Summer School — Graphical Models in Algebraic Combinatorics
23 jui 2025 - 03 jul 2025 • Moraga, CA, États-Unis
Organisateur:
Simons Laufer Mathematical Sciences Institute (SLMath)
Résumé:
This school will introduce students to a range of powerful combinatorial tools used to understand algebraic objects ranging from the homogeneous coordinate ring of the Grassmannian to symmetric functions. The summer school will center around two main lecture series "Webs and Plabic Graphs" and "Vertex Models and Applications". While the exact applications differ, both courses will center on graphical models for algebraic problems closely related to Grassmannian and its generalizations. This school will be accessible to a wide range of students. Students will leave the school with a solid grasp of the combinatorics of webs, plabic graphs, and the six-vertex model, an understanding of their algebraic applications, and a taste of current research directions.
Identifiant de l'évènement:
1656709
27
PCMI Summer Session — Probabilistic and Extremal Combinatorics
06 jul 2025 - 26 jul 2025 • Institute for Advanced Study, Park City, Utah, États-Unis
Organisateur:
IAS/Park City Mathematics Institute
Résumé:
Extremal graph theory and Ramsey theory are two of the central branches of modern extremal combinatorics, which seeks to understand the size and structure of discrete objects under certain natural constraints. In this course we will explore these topics, seeing both some of the beautiful techniques developed to study such problems, as well as many innocent-looking problems that seem completely out of reach of the currently-known techniques. We will also see some of the many connections these questions have to other areas of mathematics, including geometry, number theory, probability, and theoretical computer science.
Sujets:
Research Theme: Extremal and Probabilistic Combinatorics
Identifiant de l'évènement:
1649402
28
PP25 — Permutation Patterns 2025
07 jul 2025 - 11 jul 2025 • St Andrews, Royaume-Uni
Organisateur:
University of St Andrews
Résumé:
This conference series was established in 2003 and has been held annually since then. It is centred around the study of patterns in permutations and other combinatorial objects. The keynote speakers will be David Bevan (University of Strathclyde) and Natasha Blitvić (Queen Mary University of London). We will welcome submissions of extended abstracts in all research fields related to patterns in permutations and other combinatorial objects.
Sujets:
permutation, patterns, combinatorics
Identifiant de l'évènement:
1652413
29
ICECA 2025 — International Conference on Enumerative Combinatorics and Applications
25 aou 2025 - 27 aou 2025 • Virtual, Virtuel (en ligne)
Organisateur:
hosted in Haifa, Israel
Résumé:
Enumerative combinatorics is a dynamic subfield of the mathematical sciences with many challenging research problems, ingenious and sophisticated techniques, and important applications in various scientific fields. Questions from a broad range of areas, including algebra, topology, probability, computer science, physical, chemical and biological sciences, have some surprising hidden combinatorial structures that require enumerative methods for their solution.
Date limite de soumission des résumés:
30 mai 2025
Identifiant de l'évènement:
1649117
30
EuroComb'25 — European Conference on Combinatorics, Graph Theory and Applications
25 aou 2025 - 29 aou 2025 • Budapest, Hongrie
Organisateur:
Alfréd Rényi Institute of Mathematics
Résumé:
Eurocomb, the European Conference on Combinatorics, Graph Theory and Applications, is an academic conference in the mathematical field of combinatorics. Topics include algebraic combinatorics, combinatorial geometry, combinatorial number theory, combinatorial optimization, designs and configurations, enumerative combinatorics, extremal combinatorics, graph theory, ordered sets, random methods, and topological combinatorics.
Identifiant de l'évènement:
1641133
31
12th PhD Summer School in Discrete Mathematics
07 sep 2025 - 13 sep 2025 • Koper, Slovénie
Organisateur:
Organized by: UP FAMNIT - University of Primorska, Faculty of Mathematics, Natural Sciences and Information Technologies; UP IAM - University of Primorska, Andrej Marušič Institute; SDAMS - Slovenian Discrete and Applied Mathematics Society; IMFM - Institute of Mathematics Physics and Mechanics
Identifiant de l'évènement:
1649107
32
Combinatorics, Probability and Computing
14 sep 2025 - 19 sep 2025 • Oberwolfach, Allemagne
Sujets:
Mathematisches Forschungsinstitut Oberwolfach (MFO, Oberwolfach Research Institute for Mathematics)
Identifiant de l'évènement:
1605445
33
Category Theory, Combinatorics, and Machine Learning
15 sep 2025 - 19 sep 2025 • Providence, RI, États-Unis
Organisateur:
Institute for Computational and Experimental Research in Mathematics, Brown University, Providence, RI (ICERM)
Résumé:
Can machines prove theorems? Can they have mathematical ideas? On one hand, category theory offers a formalism for axiomatising ideas from machine learning. On the other hand, mathematicians are excited about the prospect of utilising machine learning techniques to spot new patterns in vast swathes of combinatorial data and hence formulate new conjectures. The purpose of this workshop is to bring together experts from across algebraic combinatorics, category theory, and machine learning in order to make headway on topics at the intersection of these fields.
Identifiant de l'évènement:
1655495
34
10 CCGT — 10th Cracow Conference on Graph Theory
21 sep 2025 - 26 sep 2025 • Cracovie, Pologne
Organisateur:
AGH University of Krakow, Poland
Résumé:
This will be a subsequent event in the series of conferences organized by the Faculty of Applied Mathematics of AGH University of Krakow.
Contact:
Email.: graphs@agh.edu.pl
Sujets:
Algebraic Graph Theory, Algorithmic Graph Theory, Design Theory, Domination Graph Theory, Extremal Graph Theory, Graphs Colouring, Graph Product, Labelings of Graphs, Probabilistic Methods and Random Graphs.
Identifiant de l'évènement:
1647680
35
AIM workshop: Flag algebras and extremal combinatorics
13 oct 2025 - 17 oct 2025 • Pasadena, California, États-Unis
Organisateur:
American Institute of Mathematics, Pasadena, California (AIM)
Résumé:
This workshop, sponsored by AIM and the NSF, will be devoted to further developing the method of flag algebras and its applications. Flag algebras, developed by Razborov in 2007, allows one to solve problems in combinatorics via streamlined calculations that combine elements from computer engineering and optimization. It led to many recent breakthroughs on long-standing open problems of Erdős, Sós, Turán, Gromov and Zarankiewicz, to name a few. The technique is versatile and can be applied in other settings than graphs and hypergraphs including permutations, oriented graphs, point sets, embedded graphs, and phylogenetic trees.
Identifiant de l'évènement:
1655431
Sujets apparentés:
36
LAGOS 2025 — XIII Latin American Algorithms, Graphs, and Optimization Symposium
10 nov 2025 - 14 nov 2025 • Universidad de Buenos Aires, Buenos Aires, Argentine
Résumé:
The Latin American Algorithms, Graphs, and Optimization Symposium (LAGOS) is a biennial event that brings together researchers and practitioners from around the world. Since 2001, LAGOS has served as a key forum for the exchange of ideas and collaboration. It is the merger of two Latin American conferences: the Brazilian Symposium on Graphs, Algorithms, and Combinatorics (GRACO) and the Latin American Conference on Combinatorics, Graphs, and Applications (LACGA).
Date limite de soumission des résumés:
30 avr 2025
Identifiant de l'évènement:
1649042
37
Computation in Representation Theory
10 nov 2025 - 14 nov 2025 • Providence, RI, États-Unis
Organisateur:
Institute for Computational and Experimental Research in Mathematics, Brown University, Providence, RI (ICERM)
Résumé:
This workshop encompasses three major aspects of computation within Representation Theory and Algebraic Combinatorics. One concerns the development of efficient algorithms to compute important quantities in order to understand and classify them better. Such problems include structure constants and representation theoretic multiplicities, mutation invariants in cluster algebras, computing dimensions of coinvariant rings, characters of finite-dimensional representations, coefficients of Kazhdan-Lusztig polynomials, web bases etc. This is closely related to understanding what optimality we could expect and in particular the computational complexity aspects of those problems. Their computational complexity class can also be used to understand the existence of combinatorial interpretations, in particular for major structure constants lacking positive formulas like Kronecker and plethysm coefficients. On the other hand, representation theory has seen important applications within computational complexity theory, in the context of Geometric Complexity Theory and Quantum Information Theory.
Identifiant de l'évènement:
1655405
Sujets apparentés:
38
47ACC — 47th Australasian Combinatorics Conference
01 dec 2025 - 05 dec 2025 • Wellington, Nouvelle-Zélande
Organisateur:
Victoria University of Wellington, School of Mathematics and Statistics
Résumé:
The Australasian Combinatorics Conference (ACC) is the annual conference of the CMSA, and covers all areas of combinatorics in mathematics and computer science. Any researchers in these areas are encouraged to attend and contribute a talk.
Contact:
Organisers;     Email.: 47AustCombCon@gmail.com
Identifiant de l'évènement:
1645223
39
Webs in Algebra, Geometry, Topology and Combinatorics
08 dec 2025 - 12 dec 2025 • Providence, RI, États-Unis
Organisateur:
Institute for Computational and Experimental Research in Mathematics, Brown University, Providence, RI (ICERM)
Résumé:
Webs are diagrammatic tools for representing complex calculations graphically. These diagrams first arose from the representation theory of classical groups, and they have since become important in disparate areas of mathematics. In representation theory, they encode morphisms of quantum groups. In topology, webs give rise to powerful link invariants. In algebra and geometry, Kuperberg's \(mathrm{sl}(3)\) web bases have important relationships with the theory of cluster algebras and affine buildings. In combinatorics, they explain certain dynamics on Young tableaux. Recent work by Gaetz--Pechenik--Pfannerer--Striker--Swanson introduced an \(\mathrm{sl}(4)\) web basis that has exploited and extended exciting connections between webs, plabic graphs, and crystals. There are further connections to total positivity, duality conjectures for cluster algebras and mirror symmetry.
Identifiant de l'évènement:
1655337
Sujets apparentés:
40
Combinatorics and Geometry in Ioannina
02 sep 2026 - 06 sep 2026 • Ioannina, Grèce
Résumé:
Our meeting will bring together researchers in various fields of mathematics such as Geometry, Combinatorics and Algebra. Through scientific talks new directions will be given and open problems will be proposed aiming at new collaborations among the participants.
Sujets:
Geometry, Combinatorics, Commutative Algebra.
Identifiant de l'évènement:
1624349
Sujets apparentés:


Conference-Service.com met à la disposition de ses visiteurs des listes de conférences et réunions dans le domaine scientifique. Ces listes sont publiées pour le bénéfice des personnes qui cherchent une conférence, mais aussi, bien sûr, pour celui des organisateurs. Noter que, malgré tout le soin que nous apportons à la vérification des données entrées dans nos listes, nous ne pouvons accepter de responsabilité en ce qui concerne leur exactitude ou étendue. Pensez donc à vérifier les informations présentées avec les organisateurs de la conférence ou de la réunion avant de vous engager à y participer!

Y'a pas de suivi | Y'a pas de pop-ups | Y'a pas d'animations
Dernière mise à jour: 22 février 2025