Konferenzen  >  Mathematik  >  Graphentheorie und Kombinatorik

CIRM – Centre International de Rencontres Mathématiques

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.

Geometrie und Topologie,    Algebra

The Integers conferences are international conferences held for the purpose of bringing together mathematicians, students, and others interested in number theory and combinatorics.

In Honor of the 80th Birthdays of Melvyn Nathanson and Carl Pomerance

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.

Banach Center

Simons Laufer Mathematical Sciences Institute (SLMath)

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.

Simons Laufer Mathematical Sciences Institute (SLMath)

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.

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.

Geometrie und Topologie,    Kurse und Veranstaltungen für Studenten der Mathematik

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.

Finite Geometry, Crptology, Algegraic Combinatorics, Coding Theory, Combinatorial Designs

Informationstheorie und Grundlagen der Informatik,    Kryptographie, Blockchain und Informationssicherheit

Simons Laufer Mathematical Sciences Institute (SLMath)

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.

Kurse und Veranstaltungen für Studenten der Mathematik,    Statistik, Spieltheorie

Trier University, Computer Science Department

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.

PC Chairs;     Tel.: [(not so relevant)];     Email: fernau@uni-trier.de; kindermann@uni-trier.de

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.

Trier University, Computer Science Department

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.

PC Chairs;     Tel.: [(not so relevant)];     Email: fernau@uni-trier.de; kindermann@uni-trier.de

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.

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.

Kurse und Veranstaltungen für Studenten der Mathematik,    Algorithmen und Datenstrukturen

Simons Laufer Mathematical Sciences Institute (SLMath)

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.

IAS/Park City Mathematics Institute

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.

Research Theme: Extremal and Probabilistic Combinatorics

University of St Andrews

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.

permutation, patterns, combinatorics

hosted in Haifa, Israel

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.

Alfréd Rényi Institute of Mathematics

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.

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

Mathematisches Forschungsinstitut Oberwolfach (MFO, Oberwolfach Research Institute for Mathematics)

Statistik, Spieltheorie ,    Informationstheorie und Grundlagen der Informatik

Institute for Computational and Experimental Research in Mathematics, Brown University, Providence, RI (ICERM)

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.

AGH University of Krakow, Poland

This will be a subsequent event in the series of conferences organized by the Faculty of Applied Mathematics of AGH University of Krakow.

Email: graphs@agh.edu.pl

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.

American Institute of Mathematics, Pasadena, California (AIM)

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.

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).

Algorithmen und Datenstrukturen,    Optimierungsrechnung, Entscheidungsunterstützung

Institute for Computational and Experimental Research in Mathematics, Brown University, Providence, RI (ICERM)

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.

Victoria University of Wellington, School of Mathematics and Statistics

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.

Organisers;     Email: 47AustCombCon@gmail.com

Institute for Computational and Experimental Research in Mathematics, Brown University, Providence, RI (ICERM)

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.

Gruppentheorie,    Algebra

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.

Geometry, Combinatorics, Commutative Algebra.

Geometrie und Topologie,    Algebra