Conférences  >  Mathématiques  >  Théorie des graphes et combinatoire  >  États-Unis

Sélecionner un pays
1
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:
1641741
2
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:
1571320
3
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:
1654004
4
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:
1653994
5
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:
1649191
6
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:
1649499
7
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:
1654013
8
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:
1653981
9
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:
1649155
10
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:
1656610
11
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:
1649479
12
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:
1655484
13
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:
1655519
Sujets apparentés:
14
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:
1655383
Sujets apparentés:
15
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:
1655293
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