Conférences - Théorie des graphes et combinatoire

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

Algèbre,    Géométrie et topologie

Augusta University, Augusta, Georgia

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

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

Mathematical forum of Montenegro and Faculty of Information Studies, Novo mesto, Slovenia

MESIGMA is a symposium that brings together researchers from several fields of mathematics and computer science. As the scientific framework for MESIGMA is widely set, we consider it to be an incentive environment for finding “shared territory” of diverse scientific disciplines.

Géométrie et topologie,    Algèbre

All aspects of string processing, information retrieval, computational biology, and related applications are covered.

Mathématiques appliquées (en général),    Gestion des connaissances, Big Data Computing

Hosted at the University of Nevada, Las Vegas

The Midwestern Conference on Combinatorics and Combinatorial Computing (MCCCC) originally started as the Carbondale Combinatorics Conferences and were held (1986-1990) at the Southern Illinois University, Carbondale. The conference has since evolved to a prestigious national conference in the areas of Combinatorics and Computing and has achieved recognition and attracted scholars and researchers of various backgrounds from different institutions. Here they coalesce their individual contributions into a collection of ideas and inspirations for the advancement of combinatorics and combinatorial computing.

Dynamics is the study of systems that evolve over time. Combinatorics is the study of discrete structures such as binary strings, well-formed expressions in simple languages, data trees, colorings of graphs, etc. In Dynamical Algebraic Combinatorics, we study key parameters associated with these systems as they evolve, which helps us make sense of the underlying dynamics.

CMM - Center for Mathematical Modeling | FCFM | Universidad de Chile

The LAWCG 2020 edition is supported by the Center for Mathematical Modeling. It will take place at the Termas del Corazón resort located near the city of Los Andes, Chile. The official languages are English, Portuguese, and Spanish. Originally the workshop mostly focused on research in cliques and clique graphs, but now includes all areas of graph theory. We expect mostly Latin-American participants, but everybody is welcome!

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

Cours et évènements pour étudiants en mathématiques,    Géométrie et topologie

Two groups of mathematicians, who specialize either in topological combinatorics or in combinatorial commutative algebra, are organizing a workshop in order to identify and to work on problems in the intersection of both fields. Topological combinatorics uses tools from topology to study discrete structures, while combinatorial commutative algebra also studies discrete structures but uses algebraic tools. As a result, the two groups of mathematicians may be studying the exact same problem about discrete structures, but using completely different tools and mathematical language. As an example, questions about the enumeration of the faces of a topological object called a Cohen--Macaulay flag complex can be translated into questions about Hilbert functions of ideals. The goal of this workshop is to bring together 21 mathematicians in both fields to facilitate discussions and encourage new collaborations between these two groups. The organizers have identified five possible themes that will bring an additional focus to the direction of the workshop.

The University of Melbourne

Previously known as the Australasian Conference on Combinatorial Mathematics and Combinatorial Computing (ACCMCC), the Australasian Combinatorics Conference (ACC) is the annual conference of the Combinatorial Mathematics Society of Australasia. It covers all areas of combinatorics in mathematics and computer science.

Email.: 43acc@ms.unimelb.edu.au

The Department of Mathematics, School of Engineering, Amrita Vishwa Vidyapeetham, Coimbatore, is organizing an "International Conference on Graph Theory and its Applications" during December 16-19, 2020.

This will be a four-day Conference in Graph Theory, Graph Algorithms and its applications. It will be focusing on all the topics graph theory and its applications in Optimization, Computing Techniques, Image Processing and Network Communications. The goal of this conference is to bring top researchers in this area to Amrita to foster collaboration and to expose students to important problems in the growing field.

CIRM – Centre International de Rencontres Mathématiques

ICERM

Research in combinatorial algebraic geometry utilizes combinatorial techniques to answer questions about geometry. Typical examples include predictions about singularities, construction of degenerations, and computation of geometric invariants such as Gromov-Witten invariants, Euler characteristics, the number of points in intersections, multiplicities, genera, and many more. The study of positivity properties of geometric invariants is one of the driving forces behind the interplay between geometry and combinatorics. Flag manifolds and Schubert calculus are particularly rich sources of invariants with positivity properties.

Tél.: [4018635030];     Email.: info@icerm.brown.edu

ICERM

This workshop will focus on the development of software to facilitate research in combinatorial algebraic geometry, based on the SAGE Mathematical Software System and the OSCAR Computer Algebra System. Special attention will be given to efficient computations with multi-variate polynomials, which is a critical part of many algorithms in combinatorial algebraic geometry. Aside from development of software, the workshop will feature a series of talks about polynomial computations, as well as introductory lectures about Sage and Oscar.

Email.: info@icerm.brown.edu

Algèbre,    Géométrie et topologie

Institute of Pure and Applied Mathematics (IPAM), UCLA

In recent years, deep learning has significantly improved the fields of computer vision, natural language processing and speech recognition. Beyond these traditional fields, deep learning has been expended to quantum chemistry, physics, neuroscience, and more recently to combinatorial optimization (CO). Well-known CO problems are Travelling Salesman Problem, assignment problems, routing, planning, Bayesian search, and scheduling. CO is basically used every day in finance and revenue management, transportation, manufacturing, supply chain, public policy, hardware design, computing and information technology. The workshop will bring together experts in mathematics (optimization, graph theory, sparsity, combinatorics, statistics), CO (assignment problems, routing, planning, Bayesian search, scheduling), machine learning (deep learning, supervised, self-supervised and reinforcement learning) and specific applicative domains (e.g. finance, transportation, hardware design, computing and information technology) to establish the current state of these emerging techniques and discuss the next directions. Besides, such generalization of deep learning techniques to CO problems will also push forward the mathematical analysis of the properties of these learning systems like generalization and transfer, stochastic optimization and dynamic predictivity that make the success of these techniques.

Réseaux de neurones et intelligence artificielle, apprentissage automatique,    Recherche opérationnelle

CIRM – Centre International de Rencontres Mathématiques

ICERM

The purpose of the workshop is to bring together a diverse group of researchers working on combinatorial and geometric aspects related to spaces with symmetries. The workshop will cover problems arising from various flavors of Schubert Calculus and enumerative geometry on flag manifolds, and problems from geometric representation theory and combinatorial Hodge theory. The topics covered include the study of Littlewood-Richardson coefficients, quantum cohomology and quantum K theory of flag manifolds, Maulik-Okounkov stable envelopes and characteristic classes, conformal blocks, and combinatorics related to moduli spaces, Macdonald theory, and quiver polynomials, Soergel bimodules, Hodge theory of matroids. These are trends in a rapidly developing area, and our aim is to facilitate interactions among researchers who work on different problems but employ similar techniques, at the intersection of algebraic geometry, combinatorics, and representation theory.

Email.: info@icerm.brown.edu

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

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.

Cours et évènements pour étudiants en mathématiques,    Théorie de l'information, fondations de l'informatique

Algorithms and complexity: algorithms and computational complexity; approximation algorithms; randomized algorithms; computational geometry; parameterized complexity. Operations Research and Mathematical Programming: combinatorial optimization; integer programming; polyhedral combinatorics; operations research and management science. Graph Theory: cliques, dominating and independent sets; colorings; covering and packing, factorization, matching; digraphs, tournaments; graph algorithms; graphs and matrices; hypergraphs; perfect graphs; random graphs; structural characterization of graph classes. Applications to real-world problems: mathematical programming, combinatorial optimization, continuous optimization, heuristics, and metaheuristics.

Recherche opérationnelle,    Algorithmes

American Institute of Mathematics, San Jose

This workshop, sponsored by AIM and the NSF, will be devoted to bringing researchers with expertise in asymptotic integrals, computer algebra and topology of complex varieties into contact with those working on analytic combinatorics in several variables (ACSV), in order to make progress on the technical infrastructure of ACSV results.

CIRM – Centre International de Rencontres Mathématiques

Applied and computational topology, one of the most rapidly growing branches of mathematics, is becoming a key tool in applied sciences. It is making impact not only in mathematics, but on the wide interdisciplinary environment including material and medical sciences, data science, robotics.

CIRM – Centre International de Rencontres Mathématiques

Indian Institute of Science, Bangalore

FPSAC/SFCA is a series of annual international conferences on Formal Power Series and Algebraic Combinatorics. The principal topics featured during FPSAC conferences are algebraic and enumerative combinatorics and their applications and relations with other areas of mathematics, physics, biology and computer science. This interdisciplinary nature is reinforced by the choice of plenary speakers.

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

The systematic study of random graphs commenced with the seminal work of Erd" os and Renyi in the 1960s. Beyond the classical connections and synergies between random graphs and computer science, over the last few years a new exciting connection between random graphs and statistical inference has been discovered. These connections have led to important new insights on computational problems and statistical inference problems and to new methods for the analysis of random graphs or random discrete structures in general. In addition, since the late 1990s an insightful approach called the cavity method by physicists has been applied to put forward predictions on structural properties of random graphs and their phase transitions. More recently, it has inspired new algorithms for statistical inference problems such as message passing algorithms and novel spectral algorithms. With this workshop we hope to stimulate research and foster new exciting interdisciplinary collaborations between researchers with different backgrounds and expertise in random graphs, computer science, probability, statistics, statistical inference and information theory.

Cours et évènements pour étudiants en mathématiques,    Statistique, Théorie des jeux

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

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.

Cours et évènements pour étudiants en mathématiques,    Cryptographie, blockchain et sécurité de l'information

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

Advances in data collection and social media have led to network and graph data becoming available in many areas, including social sciences, biological sciences, and engineering. Understanding and modeling network structure, as well as conducting rigorous statistical inference to assess uncertainty, can provide crucial insights into the dynamics and interaction mechanisms of the system. Statistical network analysis to date has largely focused on the setting where a single network is observed as a noisy version of some underlying structure of interest. This setting in itself is challenging, requiring adaptation of existing statistical frameworks to networks and bridging the gap between theoretically optimal performance and computational feasibility. The workshop will start by covering recent advances in this setting.

Cours et évènements pour étudiants en mathématiques,    Statistique, Théorie des jeux

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

Cours et évènements pour étudiants en mathématiques,    Recherche opérationnelle

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

Graphs are the standard mathematical model of many real-world entities: computer networks, road and highway networks, drainage systems, river networks, electrical networks, and so on. In some cases, these highly-complicated graphs are contained in the product of two or more much simpler graphs. In a recent breakthrough, it was shown that this is the case for planar or near-planar graphs like those that model river, road, and highway networks; any such graph is contained in the product of a simple tree-like graph and a path. This product structure gives deep insight into these graphs and their properties, allowing a host of mathematical and algorithmic tools to be applied to these graphs. The goal of this workshop is to continue the search for product structure in more general classes of graphs as well as to find new methods to exploit such product structure mathematically and algorithmically, when it is present.

CIRM – Centre International de Rencontres Mathématiques

CIRM – Centre International de Rencontres Mathématiques

CONFERENCE