Conferences  >  Mathematics  >  Courses and Events for Math Students and Early Career Researchers  >  United States

Simons Laufer Mathematical Sciences Institute (SLMath)

Networks, graph driven algorithms, and dynamics on graphs such as epidemics, random walks and centrality measures all play a major role, both in our daily lives as well as many scientific and engineering disciplines. This introductory workshop will bring together experts and junior researchers in combinatorics, probability, and statistics to share a broad vision of major challenges and objectives, with a primary focus on models of random graphs and their limits, network inference, dynamic processes on networks and algorithms and optimization on random structures.

Network models and random graphs, statistcal learning and network inference, counting and sampling discrete structures, dynamics on networks, probabilistic analysis of network algorithms

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

Vanderbilt University

The conference will focus on several aspects of constructive function theory, including orthogonal polynomials, potential theory, discrete and continuous energy problems, special functions, polynomial inequalities, as well as various problems relating to optimization and efficiency. The aim is to stimulate collaboration and the exchange of ideas. The conference will be held in conjunction with the 37th Annual Shanks Lecture, to be given by Professor Doron Lubinsky (Georgia Institute of Technology).

Analysis,    Calculus, Differential Equations and Integration

MIP 2025 is supported by the Mixed Integer Programming Society (MIPS), which is a section of the Mathematical Optimization Society (MOS).

The Mixed Integer Programming (MIP) Workshop is a single-track workshop highlighting the latest trends in integer programming and discrete optimization, with speakers chosen by invitation. The 2025 edition of the workshop will be the twenty-second in the MIP series.

Optimization Theory, Operational Research,    Algorithms and Data Structures

This summer school will focus on focus on Legendrian links and the microlocal theory of sheaves and run from June 9th through June 13th, 2025. The summer school will be centered around a mini-course given by Roger Casals (the University of California, Davis). The mini-course will be supplemented by a couple of research talks, opportunities for participants to ask questions and work on problem sets, panel discussions about career paths, and a discussion of open problems.

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.

Graph Theory and Combinatorics,    Algorithms and Data Structures

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

Organised in partnership with the Clay Mathematics Institute

The program will unite researchers from a number of areas: algebraic and complex geometry, arithmetic geometry, Hodge theory, and mathematical physics. It will bring theoretically and computationally oriented researchers together, expecting that computations will illuminate conjectures made by the theorists and that theory will enlarge the range of what can be computed. We intend to develop databases of certain types of K3 surfaces for the L-Functions and Modular Forms Database and promote the development of software for computations on K3 surfaces in Magma, SageMath, or other systems for public release.

Geometry and Topology,    Number Theory, Arithmetic