Konferenzen  >  Mathematik  >  Graphentheorie und Kombinatorik  >  Vereinigte Staaten

Simons Laufer Mathematical Sciences Institute (SLMath)

This workshop will feature leading experts in several major areas of graph theory, including extremal, probabilistic and structural aspects of the field. Introductory lectures will form an important part of the program, providing background and motivation, and aimed at a general mathematical audience. Complementing these, research talks will share exciting recent developments in graph theory.

extremal graph theory, random graphs, probabilistic methods, structural graph theory, Ramsey theory

Institute for Pure & Applied Mathematics (IPAM)

Over the last half a century, Algebra, Combinatorics, and Discrete Geometry have undergone transformations due, in part, to the connections each of these areas have to other fields and the growth of computational approaches used in the study of theoretical mathematics. These areas are closely intertwined, with various algebraic, combinatorial, and geometric objects playing pivotal roles. These objects include monomial ideals, affine semigroup rings, Stanley-Reisner rings, Ehrhart rings, toric rings, Cox Rings, Chow Rings, Gröbner bases on the algebraic side; graphs, matroids, simplicial complexes, polytopes and polyhedral complexes, convex bodies, posets, lattices, arrangements of hyperplanes on the combinatorial and discrete geometry side.

Algebra,    Numerische Analysis

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

Researchers working on graph algorithms use a broad range of different criteria for deciding what makes an algorithm efficient. While in theory the dominant benchmark is the asymptotic running time, in practice the story is more nuanced: an algorithm needs to be simple enough to be implementable, fast on graphs of bounded size, space efficient, cache-friendly, and easy to test. While many of these requirements motivate interesting algorithmic questions that are highly relevant in practice, they are often overlooked by the theory community. The goal of the workshop is to foster the exchange of ideas between researchers working on graph algorithms, which have high practical relevance. The workshop will include overview talks on the various perspectives, research talks, an open problem session, and structured time for collaboration.

ICERM Program Staff;     Tel.: [+1 (401) 863-5030];     Email: info@icerm.brown.edu

graph algorithms, data science, networks

Algorithmen und Datenstrukturen,    Wissenschaftliches Rechnen und Datenwissenschaft

Celebrating its 56th 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. The Conference continues to promote better understanding of the roles of modern applied mathematics, combinatorics, and computer science to acquaint the investigator in each of these areas with the various techniques and algorithms which are available to assist in his or her research. Each discipline has contributed greatly to the others, and the purpose of the Conference is to decrease even further the gaps between the fields.

Simons Laufer Mathematical Sciences Institute (SLMath)

Many exciting breakthroughs in combinatorics involve innovative applications of techniques from a wide range of areas such as harmonic analysis, polynomial and linear algebraic methods, spectral graph theory, and representation theory. This workshop will present recent developments in this area and facilitate discussions of research problems.

extremal combinatorics, extremal graph theory, probabilistic combinatorics, discrete geometry, additive combinatorics, combinatorial geometry, incidence geometry, arithmetic progressions, Discrete analysis

Algebra,    Analysis

Institute for Computational and Experimental Research in Mathematics (ICERM)

This workshop will be centered on recent advances in graph rigidity and interactions between rigidity, algebraic statistics, and matroid theory. Three major advances are the recent resolution of the matroid maximality conjecture, the newly developed link to maximum likelihood estimation in Gaussian graphical models, and the recent positive resolution of Lovasz and Yemini's connectivity conjecture for generic rigidity. The workshop will showcase a diverse sample of current work addressing fundamental problems in graph rigidity, algebraic matroids, and algebraic statistics.

ICERM;     Email: info@icerm.brown.edu

Institute for Computational and Experimental Research in Mathematics (ICERM)

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.

ICERM;     Email: info@icerm.brown.edu

Geometrie und Topologie,    Chemikalien und Materialwissenschaft

Simons Laufer Mathematical Sciences Institute (SLMath)

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.

combinatorial statistics, random graphs, network inference, network reconstruction, detection, estimation

Komplexe Netzwerke,    Wissenschaftliches Rechnen und Datenwissenschaft

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.

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

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