Conferences  >  Mathematics  >  Graph Theory and Combinatorics

ICERM

Extremal problems in harmonic analysis recently acquired prominence in questions ranging from optimizers in Fourier restriction results to sharp geometric inequalities to sharp estimates of various singular operators of Calderón–Zygmund type. Sharp inequalities and their stability versions reveal new connections between harmonic analysis, geometric measure theory, additive combinatorics, and stochastic optimal control. There are many examples of sharp estimates by stochastic control approach and the use of special types of convexity and Monge–Ampére equation. There are interesting examples of using the computational tools in proving sharp geometric inequalities for martingales and on Hamming cube and for Fourier restriction inequalities.

Program Staff;     Phone: [1-401-863-5030];     Email: info@icerm.brown.edu

Applied Mathematics (in general),    Geometry and Topology

The Research Institute for Mathematical Sciences (RIMS)

Group Theory,    Algebra

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

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

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

Algebra,    Group Theory

Department of Mathematics, Ramanujan College, University of Delhi

The purpose of ICGNC 2023 is to bring together people from all branches of mathematics and science with interests in graphs, networks and combinatorial mathematics along with their application to allied fields. This conference is an endeavor to enhance the knowledge and technical skills of faculty and research scholars working in these areas.

Convenor;     Email: icgnc2023@ramanujan.du.ac.in

Graphs and hypergraphs, Network theory, Combinatorial optimization, Coding theory, Block designs, Combinatorial geometry, Matroid theory Logic, Computing, Neural networks and any related topics, Algorithms and data structures, Cryptography Computational number theory, The study of randomness

Chulalongkorn University

The workshop will focus on mathematical physics of discrete systems, and in particular its applications to random geometries. Real-life motivations for such studies range from attempts to quantize gravity to problems in condensed matter physics to mathematical modelling of cooperative phenomena in macroscopic communities.

1) Discrete random geometries with applications to gravity quantization, 2) Discrete mathematical models in equilibrium and non-equilibrium statistical physics (the Ising model and its relatives, percolation, lattice gases, etc), 3) Random matrix and tensor models, 4) Random graphs and dynamics of complex networks, 5) Topics in lattice gauge theory (especially with emphasis on analytic approaches), 6) Conformal field theories (especially with connections to the above subjects), 7) Discrete dynamics (cellular automata, spin chains, etc).

Mathematical Physics,    Complex Networks

CIRM – Centre International de Rencontres Mathématiques

Cryptography, Blockchain and Information Security,    Algorithms and Data Structures

The Research Institute for Mathematical Sciences (RIMS)

Institute for Pure and Applied Mathematics (IPAM), UCLA

In recent years, the use of Machine Learning techniques to Operations Research (OR) problems, especially in the Discrete Optimization (DO) a.k.a. Combinatorial Optimization context, opens very interesting scenarios because DO is the “home” of an endless list of decision-making problems that are of fundamental importance in multitude applications. The workshop will bring together experts in mathematics (optimization, graph theory, sparsity, combinatorics, statistics), operations research (assignment problems, routing, planning, Bayesian search, automation, scheduling), machine learning (deep learning, supervised, self-supervised and reinforcement learning) and artificial intelligence at large (including multi-agent systems, interpretability, fairness, etc.).

Neural Networks and Artificial Intelligence, Machine Learning,    Optimization Theory, Operational Research

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

This workshop brings together many of the leading international researchers in the area of reinforcement processes and graphs.

Celebrating its 54th year, the Conference brings together mathematicians and others interested in combinatorics, graph theory and computing, and their interactions. The Conference lectures and contributed papers, as well as the opportunities for informal conversations, have proven to be of great interest to other scientists and analysts employing these mathematical sciences in their professional work in business, industry, and government.

Banff International Research Station (BIRS) for Mathematical Innovation and Discovery

The researchers participating in this workshop come from several mathematical subdisciplines, including combinatorics, algebraic geometry, and theoretical computer science. Their work and common interest here is to investigate new interactions between discrete mathematics, algebra, algebraic geometry, tropical geometry, and combinatorial algorithms. Some participants have collaborated before in smaller groups, but this meeting will provide an opportunity to work together more intensively. Several recent mathematical breakthroughs will be highlighted in the workshop, including the recent resolution of some long-standing open problems about graphs and matroids. These breakthroughs used a surprising combination of interdisciplinary techniques which the organizers expect to have exciting further applications.

Geometry and Topology,    Information Theory, Foundations of Computer Science

American Institute of Mathematics (AIM)

This workshop, sponsored by AIM and the NSF, will be devoted to homotopy theories developed for the study of discrete and combinatorial objects. Many different models of discrete homotopy have emerged in the past 20-30 years, developed largely in isolation from one another. In this workshop, we will study different perspectives on discrete homotopy and explore their connections and differences. Among our goals is to identify important applications, particularly to combinatorics, metric geometry, and geometric group theory. We will also investigate how ideas from abstract homotopy theory (model categories, simplicial and cubical homotopy, infinity categories, etc.) may be used to extend and consolidate the theories.

The main topics of this workshop are: A-theory of graphs and simplicial complexes; Homotopy of digraphs; Digital homotopy ; Discrete homotopy of metric spaces; Homotopy theory in topological categories; Applications of abstract homotopy theory to discrete homotopy; Applications of discrete homotopy to combinatorics, metric geometry, geometric group theory, and other areas.

The Fields Institute

This workshop will bring together those working in pure Borel combinatorics with those studying the ergodic theory, dynamics, and geometry of countable groups. Featured topics will include Gaboriau's theory of cost, Borel and measurable chromatic numbers, Borel matchings, and amenable and hyperfinite equivalence relations.

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

ICERM / Brown University

Combinatorial optimization is an active research field in mathematics, with an immense range of applications. This workshop will bring together researchers and leading experts interested in the mathematical foundations of combinatorial optimization algorithms to discuss new tools and methods, in particular regarding the use of algebraic, analytical, and geometric techniques. Special emphasis will be given on polyhedral methods, since they are at the core of several groundbreaking combinatorial optimization results developed in recent years.

part of EvoStar (Evo*)

The 23rd 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.

Soft Computing, Evolutionary Computation, Metaheuristic Optimization, Fuzzy Logic,    Optimization Theory, Operational Research

The Fields Institute

The study of Lefschetz properties for Artinian algebras was motivated by the Lefschetz theory for projective manifolds, begun by S. Lefschetz, and well established by the late 1950's. Many of the important Artinian graded algebras appear as cohomology rings of an algebraic variety or manifold, though recent important developments have demonstrated important cases of the Lefschetz properties beyond such geometric settings (such as Coxeter groups or matroids). This renews interest in understanding the Lefschetz property, and Artinian algebras that admit them, systematically.

Algebra,    Geometry and Topology

American Institute of Mathematics (AIM)

This workshop, sponsored by AIM and the NSF, is devoted to combinatorial problems about infinite cardinals. There are two types of infinite cardinals to investigate: successors of regular cardinals, most notably ℵ2, and successors of singular cardinals, for example ℵω+1ω+1. The workshop will focus on combinatorial principles such as the tree property, stationary reflection and the effect of consequences on forcing axioms on cardinal arithmetic, in particular what implications they have on the continuum, and the singular cardinal hypothesis (SCH).

The main topics of the workshop are The tree property, its strengthening ITP, stationary reflection how these combinatorial principles interact with SCH; Which consequences of PFA and MM require the continuum to be ℵ2 , and more generally, their effect on cardinal arithmetic; Forcing techniques such as proper iterated forcing and Prikry type forcing.

University of Illinois Urbana-Champaign

University of Illinois Urbana-Champaign

Eurandom – Workshop Centre in the area of Stochastics

The study of matrices with random entries started in the 1950’s and has grown into an immense body of literature until today. While the initial focus was on problems in statistical physics, in recent times random matrices have proven to be an important tool also in a variety of other fields like statistics, network analysis, image processing or machine learning. Moreover, there has been great progess in the study of matrices which arise naturally in random graphs, like the adjacency matrix, the Laplacian matrix, or the transition matrix of the random walk on the graph. The recent theoretical advances in this area are remarkable and one of the key goals of the workshop is to understand the information contained in eigenvalues and eigenvectors of high-dimensional random matrices. A second point of focus are applications of tools stemming from random graphs theory that can be used to study the spectrum of random matrices. In this workshop, we provide a platform where young and more senior researchers from the area of random matrices, random graphs and related topics can come together and exchange their research, find new collaborations and learn about different perspectives on the topic.

University of Illinois Urbana-Champaign

Courses and Events for Math Students and Early Career Researchers,    Algebra

CIRM – Centre International de Rencontres Mathématiques

One of the most striking recent results in model theory is Johnson’s classification, in 2020, of fields of finite dp-rank : under purely combinatorial condition (the finiteness of a certain dimension) infinite non algebraically closed fields must come with a definable henselian topology. This result illustrates (and partially explains) the very strong relationship between valuation theory and model theory that has existed since the 1960’s. Valued fields are also at the center of the interaction between model theory number theory and algebraic geometry which blossomed in the past fifteen years. This conference will bring together specialists from the algebraic, arithmetic and the pure model theory communities that all study valued fields, but with very different tools. Our aim is, by ensuring a continued dialog between these communities, to further exchanges and promote new interactions. Its main focus will be on the arithmetic of valued fields, classification and geometric model theory in valued fields and non archimedean tame geometry.

Banach Center

Classical Fourier analysis uses decompositions of functions in terms of linear phases. In recent years it was discovered that for applications in ergodic theory, combinatorics, and number theory, involving patterns such as arithmetic progressions, one has to study correlations of functions with higher order polynomial phases and other more general phases, called nilsequences, which arise from natural dynamical systems on nilmanifolds. This philosophy has helped to make progress in problems that were previously considered intractable, and has resulted in new impressive applications in the above-mentioned areas. In ergodic theory this approach is used to study the limiting behavior of multiple ergodic averages and related multiple recurrence results, in topological dynamics it has led to new structural results, and in combinatorics and number theory it is used to study patterns that can be found in sets of positive density or the set of primes. Also, very recently it has played a decisive role in progress related to the Chowla and Elliott conjectures on correlations of bounded multiplicative functions and the Mobius disjointness conjecture of Sarnak. The aim of the workshop is to introduce the above topics to a wider audience, report on recent developments, and foster collaborations and new insights.

Algebra,    Geometry and Topology

CIMPA Research School on Graph Structure and Complex Network Analysis will be held in Nesin Mathematics Village, Şirince, İzmir, Turkey on June 4-16, 2023. Since the works of Watts and Strogatz (1998) on one hand, and Barabási and Albert (1999) on the other, graph theory has become a major mathematical field that provides a framework to handle network properties theoretically and enables us with very powerful tools to model and solve problems on networks. Understanding their graph structure is a key point in deriving efficient algorithms in large networks. In this school, we will cover theoretical aspects of graph structure analysis as well as applications on complex network studies.

Courses and Events for Math Students and Early Career Researchers,    Complex Networks

University of Manitoba and University of Winnipeg

The general topic of the conference is the theory and application of discrete structures. Its goal is to highlight the most salient trends in the field. The conference will bring together researchers from the various disciplines with which discrete and algorithmic mathematics interact. Particular areas of interest include graphs and digraphs, hypergraphs, matroids, ordered sets, designs, coding theory, enumeration, combinatorics of words, discrete optimization, discrete and computational geometry, lattice point enumeration, combinatorial algorithms, computational complexity, and applications of discrete and algorithmic mathematics, including (but not limited to) web graphs, computational biology, telecommunication networks, and information processing. The conference will follow its usual format. There will be eight plenary talks, one public interest talk, and invited mini-symposia, as well as contributed mini-symposia and talks

Local Organizing Committee co-chair;     Phone: [+1-204-474-7486];     Email: karen.gunderson@umanitoba.ca

graphs and digraphs, hypergraphs, matroids, ordered sets, designs, coding theory, enumeration, combinatorics of words, discrete optimization, discrete and computational geometry, lattice point enumeration, combinatorial algorithms, computational complexity

University of Ljubljana, Faculty of Mathematics and Physics

The Slovenian Conference on Graph Theory, known also as "the Bled Conference", is returning in its 10th edition in June 2023. This time we again meet in Kranjska Gora. The format of the conference remains largely the same as in the last few incarnations, with a number of distinguished plenary speakers, specialised minisymposia and contributed talks in the general section.

Organizing committee;     Email: SiCGT23@fmf.uni-lj.si

CRM / Université de Montréal

The mini-courses and research talks will address several themes, including: nonpositively-curved cube complexes, median spaces, (coarsely) Helly spaces and groups, and various combinatorial notions of nonpositive curvature. The first week of the workshop involves mini-courses by Elia Fioravanti (MPI Bonn), Thomas Haettel (Université de Montpellier), Nima Hoda (ENS Paris), Nir Lazarovich (Technion). The second week will be devoted to research talks.

Geometry and Topology,    Group Theory

ICMS - International Centre for Mathematical Sciences

The principal objective of the workshop is to bring together researchers in the relevant areas to consolidate recent advances, present new results and encourage collaborations on extensions of recent work or new ideas.

Geometry and Topology,    Complex Networks

Banach Center

.algebraic-geometry, combinatorics, number-theory

Banff International Research Station (BIRS) for Mathematical Innovation and Discovery

The workshop is concerned with geometric objects arising from polynomial equations known as algebraic curves. Such curves have been studied extensively since the 19th century, but recent developments in combinatorics have led to a plethora of new techniques and solutions to major problems in the field. Bringing together experts from classical algebraic geometry and the adjacent combinatorial areas, the workshop aims to bridge the different points of views, identify key open problems in the field, and to examine how progress can be achieved via a combination of old and new tools.

Geometry and Topology,    Calculus, Differential Equations and Integration

Banff International Research Station (BIRS) for Mathematical Innovation and Discovery

Despite the enormous commercial potential that quantum computing presents, the existence of large-scale quantum computers also has the potential to destroy current security infrastructures. Post-quantum cryptography aims to develop new security protocols that will remain secure even after powerful quantum computers are built. This workshop focuses on isogeny-based cryptography, one of the most promising areas in post-quantum cryptography. In particular, we will examine the security, feasibility and development of new protocols in isogeny-based cryptography, as well as the intricate and beautiful pure mathematics of the related isogeny graphs and elliptic curve endomorphism rings. To address the goals of both training and research, the program will be comprised of keynote speakers and working group sessions.

University of Haifa

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.

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

Geometry and Topology,    Algebra