Calendar of upcoming scientific conferences

Home | Conference Management System | Conference Listings | Advertise | Contact | About
German French English
You are in: HomeConference ListingsMathematics → Graph Theory and Combinatorics

Conference Management Software

Our Conference Management Software (COMS) can be used for online:

  • registration
  • payment
  • paper submission
  • review process
  • paper selection
  • production of the book of abstracts

Read more ...
Try our demo online

Conferences and Meetings on Graph Theory and Combinatorics offers, as part of our business activities, a directory of upcoming scientific and technical meetings. The calendar is published for the convenience of conference participants and we strive to support conference organisers who need to publish their upcoming events. Although great care is being taken to ensure the correctness of all entries, we cannot accept any liability that may arise from the presence, absence or incorrectness of any particular information on this website. Always check with the meeting organiser before making arrangements to participate in an event!

Meeting organisers can submit meetings free of charge for inclusion into the listing.


1.ICERM Semester Program on "Network Science and Graph Algorithms"
 Dates 03 Feb 2014 → 09 May 2014
[ID=517235] Go to top of page
 LocationICERM, Providence, Rhode Island, United States
 Abstract The study of computational problems on graphs has long been a central area of research in computer science. However, recent years have seen qualitative changes in both the problems to be solved and the tools available to do so. Application areas such as computational biology, the web, social networks, and machine learning give rise to large graphs and complex statistical questions that demand new algorithmic ideas and computational models. At the same time, techniques such as semidefinite programming and combinatorial preconditioners have been emerging for addressing these challenges.
 Related subject(s) Courses and Events for Math Students; Applied Maths: Complex Networks
2.Algebraic Techniques for Combinatorial and Computational Geometry
 Dates 10 Mar 2014 → 13 Jun 2014
[ID=564443] Go to top of page
 LocationInstitute for Pure and Applied Mathematics (IPAM),, United States
 Abstract In the past four years, the landscape of combinatorial geometry has considerably changed due to the work of Guth and Katz. More recently, Green and Tao stunningly solved the long-standing conjecture of Dirac and Motzkin on the number of ordinary lines. What these results have in common is algebraic geometry. The application of algebraic geometry to problems in incidence geometry has been a rather surprising development. This interdisciplinary work is still at its infancy, and a major goal of this program is to provide a venue for deepening and widening the interaction between combinatorial geometry, algebraic geometry, Fourier analysis, and hopefully other mathematical disciplines too. An application and registration form are available online.
 Related subject(s) Geometry and Topology; Algebra
3.Combinatorial representation theory
 Dates 21 Apr 2014 → 25 Apr 2014
[ID=609948] Go to top of page
 LocationCentre de recherches mathématiques, Université de , Canada
 Abstract The representation theory of Lie algebras, quantum groups and algebraic groups represents a major area of mathematical research in the twenty-first century with numerous applications in other areas of mathematics (geometry, number theory, combinatorics, finite and infinite groups,) and mathematical physics(conformal field theory, statistical mechanics, integrable systems).
4.AIM Workshop: Exact crossing numbers
 Dates 28 Apr 2014 → 02 May 2014
[ID=564499] Go to top of page
 LocationAmerican Institute of Mathematics, Palo Alto, United States
 Abstract This workshop, sponsored by AIM and the NSF, will be devoted to tackling several long-standing open problems in the field of crossing numbers of graphs.
5.Eigenvectors in Graph Theory and Related Problems in Numerical Linear Algebra
 Dates 05 May 2014 → 09 May 2014
[ID=579469] Go to top of page
 LocationProvidence, United States
 Abstract The analysis of problems modeled by large graphs is greatly hampered by a lack of efficient computational tools. The purpose of the workshop is to explore possibilities for designing appropriate computational methods that draw on recent advances in numerical methods and scientific computation. Specifically, the questions of how to form the matrices representing graph Laplacians, and how to compute the leading eigenvectors of such matrices will be addressed. It seems likely that these problems will be amenable to algorithms based on randomized projections that dramatically reduce the effective dimensionality of the underlying problems. Such techniques has recently proven highly effective for the related problems of how to find approximate lists of nearest neighbors for clouds of points in high dimensional spaces, and for constructing approximate low-rank factorizations of large matrices. In both cases, a key observation is that the problem of distortions of distances that is inherent to randomized projection techniques can be overcome by using the randomized projections only as pre-conditioners; they inform the algorithm of where to look, and then highly accurate deterministic techniques are used to compute the actual output. The resulting algorithms scale extra-ordinarily well on modern parallel and multicore architectures. To successfully address the enormous problems arising in the analysis of graphs, it is expected that additional machinery will be needed, such as the use of multi-resolution data structures, and more efficient scalable randomized projections.
 Related subject(s) Algebra; Applied Maths: Numerical Analysis, Algebra and Computational Mathematics
6.Colloquia in Combinatorics
 Dates 14 May 2014 → 15 May 2014
[ID=620719] Go to top of page
 LocationLondon, United Kingdom
 Abstract Two consecutive one-day events hosted by QMUL and LSE
7.Finding Algebraic Structures in Extremal Combinatorial Configurations
 Dates 19 May 2014 → 23 May 2014
[ID=564504] Go to top of page
 LocationInstitute for Pure and Applied Mathematics (IPAM),, United States
 Abstract Understanding the fine structure of extremal configurations is a key step in the solution of many problems in extremal combinatorics. For example, in many cases a group action underlies the structure found in an extremal scenario, making the problem amenable to algebraic methods. This principle is illustrated by recent work which has applied techniques from algebra, algebraic geometry, model theory and additive combinatorics to obtain important new results in discrete geometry. We expect this fusion of algebraic geometry and combinatorics to become a very active area of research in the coming months and years. It is our aim to showcase the most exciting results, techniques and recent trends in this workshop. This workshop will include a poster session; a request for posters will be sent to registered participants in advance of the workshop. An application and registration form are available online.
 Related subject(s) Algebra
8.IWCIA 2014 — 16th Internation Workshop on Combinational Image Analysis
 Dates 28 May 2014 → 30 May 2014
[ID=544242] Go to top of page
 LocationBrno, Czech Republic
 Abstract The Internation Workshop on Combinational Image Analysis will be hosted by the Brno University of Technology, Faculty of Mechanical Engineering. The researchers from all areas of image analysis and its applications are cordially invited to participate.
 Topics Combinatorial problems in the discrete plane and space related to image analysis; lattice polygons and polytopes, Discrete/combinatorial geometry and topology and their use in image analysis, Digital geometry of curves and surfaces, Tilings and patterns; combinatorial pattern matching, Image representation, segmentation, grouping, and reconstruction, Methods for image compression, Discrete tomography, Applications of integer programming, linear programming, and computational geometry to problems of image analysis, Parallel architectures and algorithms for image analysis, Fuzzy and stochastic image analysis, Grammars and models for image or scene analysis and recognition; cellular automata, Mathematical morphology and its applications to image analysis, Applications in medical imaging, biometrics, and others
 Contact Pavla Sehnalova, Institute of Mathematics, Faculty of Mechanical Engineering, Brno University of Technology, Brno, Czech Republic; Phone: [00420 541 142 800]; Email:
 Related subject(s) Geometry and Topology; Applied Maths: Pattern Recognition and Image Processing
9.Combinatorics, Geometry, and Physics
 Dates 02 Jun 2014 → 31 Jul 2014
[ID=616797] Go to top of page
 LocationErwin Schrödinger Institute, Vienna, Austria
 Abstract The goal of this thematic program is to bring together researchers in mathematics, computer science and theoretical physics in order to make significant progress on the outstanding problems at the interface of combinatorics, geometry and physics. The first point of focus of this program concerns statistical physics on graphs drawn on two-dimensional surfaces. This will be studied in three stages: on a fixed graph, on a random graph, and finally through the study of the interplay between the last two situations as exemplified by the paradigmatic KPZ relation.
 Related subject(s) Geometry and Topology; Mathematical Physics
10.Categorification and Geometric Representation Theory
 Dates 09 Jun 2014 → 13 Jun 2014
[ID=609924] Go to top of page
 LocationCentre de recherches mathématiques, Université de , Canada
 Abstract Categorification and geometric representation theory are two of the most active and exciting branches of modern representation theory and are gradually increasing their importance in the field. These approaches have led to the introduction of new and powerful tools and a deeper understanding of underlying structures.
11.Mediterranean School of Complex Networks
 Dates 09 Jun 2014 → 14 Jun 2014
[ID=597494] Go to top of page
 LocationSalina, Sicily, Italy
 Related subject(s) Applied Maths: Complex Networks
12.Representations, Dynamics, Combinatorics: In the Limit and Beyond. A conference in honor of Anatoly Vershik's 80th birthday
 Dates 09 Jun 2014 → 14 Jun 2014
[ID=610315] Go to top of page
 LocationSaint-Petersburg, Russia
 Abstract The conference will focus on the areas of mathematics where Anatoly Vershik has made important contributions, including representation theory, dynamical systems, ergodic theory, asymptotic combinatorics, operator algebras, and measure theory. It will feature invited talks by leading experts in these fields.
13.3rd Stochastic Modeling Techniques and Data Analysis conferemce
 Dates 11 Jun 2014 → 14 Jun 2014
[ID=597504] Go to top of page
 LocationLisbon, Portugal
 Related subject(s) Probability and Statistics
14.CPM 2014 - 25th Annual Symposium on Combinatorial Pattern Matching
 Dates 16 Jun 2014 → 18 Jun 2014
[ID=582992] Go to top of page
 LocationMoscow, Russia
15.Conference on Graph Theory, Matrix Theory and Interactions: A Conference to celebrate the scholarship of David Gregory
 Dates 20 Jun 2014 → 21 Jun 2014
[ID=611018] Go to top of page
 LocationKingston, ON, Canada
 Abstract This conference is meant to be a celebration of the scholarship of the late David A. Gregory, a long-serving Professor in the Department of Mathematics at Queen's University. David Gregory explored mathematical problems that bridged two areas of mathematics: linear algebra and discrete mathematics, especially graph theory. His insights, careful approach and writing influenced many mathematicians, especially in combinatorial matrix theory. The conference will be of interest to the linear algebra community, especially those in combinatorial matrix theory, but researchers representing any aspect of David Gregory's mathematical scholarship are invited to attend and propose a presentation.
 Topics combinatorial matrix theory, graph spectra, graph decompositions, matrix ranks, matchings and tournaments
 Related subject(s) Algebra
16.Summer school — Graph limits, groups and stochastic processes
 Dates 22 Jun 2014 → 28 Jun 2014
[ID=597480] Go to top of page
 LocationBudapest, Hungary
 Related subject(s) Group Theory; Probability and Statistics
17.IPCO 2014 — 17th Conference on Integer Programming and Combinatorial Optimization
 Dates 23 Jun 2014 → 25 Jun 2014
[ID=553497] Go to top of page
 LocationUniversity of Bonn, Bonn, Germany
 Abstract The IPCO-conference 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 in these areas.
 Related subject(s) Applied Maths: Numerical Analysis, Algebra and Computational Mathematics; Algorithms
18.GASCom 2014 — Random and exhaustive generation of combinatorial structures and enumerative combinatorics
 Dates 23 Jun 2014 → 25 Jun 2014
[ID=597578] Go to top of page
 LocationBertinoro (FC), Italy
19.Algebraic Combinatorics: Spectral Graph Theory, Erdos-Ko-Rado Theorems and Quantum Information Theory
 Dates 23 Jun 2014 → 27 Jun 2014
[ID=549536] Go to top of page
 LocationWaterloo, Canada
 Abstract This will be a conference in honour of Chris Godsil's 65th birthday. His imprint on mathematics goes beyond his traditional mathematical area of algebraic combinatorics, merging theory and application, problems and solutions, emerging research areas and well-developed mathematical tools. The goal of this conference is not just to honour his contributions and his impact on mathematics, but to also bring together researchers in discrete math whose work he has influenced, to share recent advances, and to forge stronger connections between researchers. This conference will be a celebration for the Canadian mathematical community and we invite researchers in combinatorics, matrix theory, and quantum information theory from all over the world to join us.
 Topics Godsil, algebraic combinatorics, association schemes, EKR, quantum information
 Related subject(s) Quantum Mechanics and Quantum Information Theory
20.Integrability and Combinatorics (in memory of Yuri Stroganov)
 Dates 23 Jun 2014 → 27 Jun 2014
[ID=597555] Go to top of page
 LocationGiens, France
21.WG 2014 - 40th International Workshop on Graph-Theoretic Concepts in Computer Science
 Dates 25 Jun 2014 → 27 Jun 2014
[ID=583063] Go to top of page
 LocationNouan-le-Fuzelier, France
 Related subject(s) Information Theory, Foundations of Computer Science
22.FPSAC — 26th International Conference on Formal Power Series and Algebraic Combinatorics
 Dates 29 Jun 2014 → 03 Jul 2014
[ID=488398] Go to top of page
 LocationChicago, IL, United States
 Topics Topics include all aspects of combinatorics and their relations with other parts of mathematics, physics, computer science, and biology.
 Contact Bridget Tenner; Email:
23.IWONT 2014 — The 6th International Workshop on Optimal Network Topologies
 Dates 30 Jun 2014 → 04 Jul 2014
[ID=609219] Go to top of page
 LocationBratislava, Slovakia
 Abstract The focus of this year's workshop will be on the Cage and Degree/Diameter Problems. We invite 20 minute contributions closely related to these focus areas, with the topics possibly including upper and lower bounds, constructions, structural properties and restrictions to special classes of graphs.
 Topics Cage problem, Degree/Diameter Problem
 Contact Email:
24.ICGT 2014 — 9th International colloquium on graph theory and combinatorics
 Dates 30 Jun 2014 → 05 Jul 2014
[ID=518162] Go to top of page
 LocationGrenoble, France
 Abstract This conference is the 9th edition of a well-known event initiated by Claude Berge in 1976, and organized by the french community in Graph Theory every 4 or 5 years since then. The most recent editions were held in Orsay in 2010 (8FCC), Hyères in 2005 (ICGT05), and Marseille in 2000 (ICGT 2000). The 2014 version will be organized by members from different research groups of Grenoble.
 Topics Graph theory, combinatorics
25.25th British Combinatorial Conference
 Dates 06 Jul 2014 → 10 Jul 2014
[ID=597645] Go to top of page
 LocationCoventry, United Kingdom
26.5th SIGMAP (Symmetries In Graphs, Maps And Polytopes) Workshop
 Dates 07 Jul 2014 → 11 Jul 2014
[ID=597608] Go to top of page
 LocationWest Malvern, United Kingdom
27.Sum(m)it 2440
 Dates 07 Jul 2014 → 11 Jul 2014
[ID=568286] Go to top of page
 LocationBudapest, Hungary
 Abstract Birthday conference of Péter Frankl, Zoltán Füredi, Ervin Györi and János Pach.
 Topics (extremal) combinatorics
 Contact Email:
28.Algebraic design theory and Hadamard matrices
 Dates 08 Jul 2014 → 11 Jul 2014
[ID=597606] Go to top of page
 LocationLethbridge, Alberta, Canada
 Related subject(s) Algebra
29.CSC14 — SIAM Workshop on Combinatorial Scientific Computing
 Dates 21 Jul 2014 → 23 Jul 2014
[ID=597344] Go to top of page
 LocationÉcole Normale Supérieure de Lyon, Lyon, France
 Organizer Society for Industrial and Applied Mathematics (SIAM)
 Related subject(s) Applied Mathematics (in general)
30.MNM@CASON'14 — Multiplex network Mining - Special session @ CASON'14
 Dates 30 Jul 2014 → 01 Aug 2014
[ID=617711] Go to top of page
 LocationPorto, Portugal
 Abstract Complex networks used to model interactions in real-world phenomena are often heterogeneous network with different types of nodes and edges. Focusing on a single type of nodes, a complex network would be better described by a multiplex: a set of nodes related to each other with different types of relations. This representation is much richer than simple complex networks often used to model complex interaction systems. However, this poses the challenge to provide adequate answers to all basic network analysis tasks that have been studied and provided in the recent few years for the case of homogeneous networks. This include for instance: the problem of node ranking (computing nodes centralities), community detection, link prediction, information diffusion models and network visualization. Almost all work in the field of multiplex network analysis are based on transforming the problem, in a way or another to the classical case of homogeneous network analysis. Existing approaches include: layer aggregation based approaches or applying ensemble methods on results obtained on each layer aside. Little work has focused on analysing all layers at once. The goal of this session is make the point on new approaches for multiplex network mining.
 Topics Models and measures for multiplex networks. - Co-evolution of layers in multiplex networks. - Layer aggregation approaches. - Vertex similarity in multiplex network - Community detection in multiplex network - Link prediction in multiplex network - Multiplex network evolution models - Multiplex network and dynamic network mining - Ensemble learning for multiplex network mining - Applications of multiplex network mining and modeling.
 Contact Rushed Kanawati ; Phone: [33670517233]; Email:
 Related subject(s) Applied Maths: Complex Networks
31.Satellite conference of ICM 2014 — Extremal and Structural Graph Theory
 Dates 05 Aug 2014 → 09 Aug 2014
[ID=598238] Go to top of page
 LocationGyeongju, South Korea
32.ICM Satellite Conference on "Topology of Torus Actions and Applications to Geometry and Combinatorics"
 Dates 07 Aug 2014 → 11 Aug 2014
[ID=597927] Go to top of page
 Location Daejeon Convention Center, Daejeon, South Korea
 Related subject(s) Geometry and Topology
33.JCCA 2014 — The Japanese Conference on Combinatorics and its Applications
 Dates 25 Aug 2014 → 29 Aug 2014
[ID=617372] Go to top of page
 LocationTsukuba, Ibaraki, Japan
 Abstract The Japanese Center for Combinatorics and its Applications is now organizing a regular international conference, JCCA 2014. This conference is planned to be held every two years at a certain place in Japan. JCCA 2014 is the first of such conference, to be held from August 25 - 29, 2014, at the University of Tsukuba, Tsukuba City, Japan. This conference focuses on research topics across all areas in combinatorics and their applications.
 Topics Graph Theory, Enumerative Combinatorics, Algebraic Combinatorics, Combinatorial Designs, Combinatorial Optimization, Coding Theory, Cryptography and Other
 Contact Ryoh Fuji-Hara, Ph.D. , University of Tsukuba; Phone: [+81298535088]; Email:
34.Integrability and Cluster Algebras: Geometry and Combinatorics
 Dates 25 Aug 2014 → 29 Aug 2014
[ID=575440] Go to top of page
 LocationProvidence, United States
 Abstract This workshop focuses on certain kinds of discrete dynamical systems that are integrable and have interpretations in terms of cluster algebras. Some such systems, like the pentagram map and the octahedral recurrence, are motivated by concrete algebraic constructions (taking determinants) or geometric constructions based on specific configurations of points and lines in the projective plane. The systems of interest in this workshop have connections to Poisson and symplectic geometry, classical integrable PDE such as the KdV and Boussinesq equations and also to cluster algebras. The aim of the workshop is to explore geometric, algebraic, and computational facets of these systems, with a view towards uncovering new phenomena and unifying the work to date.
 Related subject(s) Geometry and Topology; Algebra
35.7th Cracow Conference on Graph Theory
 Dates 14 Sep 2014 → 19 Sep 2014
[ID=597626] Go to top of page
 LocationRytro, Poland
36.IWOCA 2014 — International Workshop on Combinatorial Algorithms
 Dates 15 Oct 2014 → 17 Oct 2014
[ID=621950] Go to top of page
 LocationDuluth, Minnesota, United States
 Abstract IWOCA 2014 continues the long and well-established tradition of encouraging high-quality research in theoretical computer science and bringing together specialists and young researchers working in the area. The scientific program will include invited lectures covering the areas of main interest, accepted contributed talks, posters, and a problems session.
 Topics Algorithms and Data Structures, Applications (including Bioinformatics, Networking, etc.), Combinatorial Enumeration, Combinatorial Optimization, Complexity Theory (Structural and Computational), Computational Biology, Databases (Security, Compression and Information Retrieval), Decompositions and Combinatorial Designs, Discrete and Computational Geometry (including Graph Drawing), Graph Theory and Combinatorics
37.Current topics in three-manifolds
 Dates 17 Oct 2014 → 19 Oct 2014
[ID=615890] Go to top of page
 LocationMinneapolis, Minnesota, United States
38.28th Midwest Conference on Combinatorics and Combinatorial Computing
 Dates 22 Oct 2014 → 24 Oct 2014
[ID=610456] Go to top of page
 LocationUniversity of Nevada, Las Vegas, United States
 Abstract The Midwest Conferences on Combinatorics and Combinatorial Computing (MCCCC) are of small size (50 to 70 participants) and have been growing slowly. Papers cover a spectrum of pure and applied combinatorics, including graph theory, design theory, enumeration, and combinatorial computing. For 28th MCCCC, the invited speakers are: Brian Alspach; Saad El-Zanati; Futaba Fujie-Okamoto; Joseph Gallian; Margaret Readdy; Ian Wanless. Contributed papers (15-20 minutes talks) are very welcomed.
39.Probability, Trees and Algorithms
 Dates 02 Nov 2014 → 08 Nov 2014
[ID=591629] Go to top of page
 LocationOberwolfach, Germany
 Organizer Mathematisches Forschungsinstitut Oberwolfach
 Related subject(s) Probability and Statistics
40.AIM Workshop — Combinatorics and complexity of Kronecker coefficients
 Dates 03 Nov 2014 → 07 Nov 2014
[ID=611267] Go to top of page
 LocationPalo Alto, CA, United States
 Organizer American Institute of Mathematics
 Abstract This workshop, sponsored by AIM and the NSF, will be devoted to the study of Kronecker coefficients which describe the decomposition of tensor products of irreducible representations of a symmetric group into irreducible representations. We concentrate on their combinatorial interpretation, computational aspects and applications to other fields.
 Related subject(s) Algebra; Group Theory
41.Combinatorial Optimization
 Dates 09 Nov 2014 → 15 Nov 2014
[ID=591561] Go to top of page
 LocationOberwolfach, Germany
 Organizer Mathematisches Forschungsinstitut Oberwolfach
42.Inverse Moment Problems: The Crossroads of Analysis, Algebra, Discrete Geometry and Combinatorics
 Dates 11 Nov 2014 → 25 Jan 2015
[ID=553525] Go to top of page
 LocationInstitute for Mathematical Sciences, National Univ, Singapore
 Abstract Applications of moments of measures in polynomial optimization led to a number of breakthroughs in optimization and real algebraic geometry, as well as to better understanding of ways to encode measures. Other similar threads are recently seen in the theory of integration on polytopes and counting of integer points in polytopes, as well as in quantum computing. The aim of the program is to futher investigate relations between these topics and inverse moment problems, i.e., questions of reconstructing measures from a set of its moments, which are traditionally attacked by purely analytic tools. Activities will include two 4-5 day research conferences, one quantum computing workshop, and one graduate student winter school/workshops.
 Related subject(s) Analysis; Algebra
43.38th Australasian Conference on Combinatorial Mathematics and Combinatorial Computing
 Dates 01 Dec 2014 → 05 Dec 2014
[ID=597657] Go to top of page
 LocationWellington, New Zealand
44.ANALCO15 — Analytic Algorithmics and Combinatorics
 Start date04 Jan 2015
[ID=597373] Go to top of page
 LocationSan Diego, California, United States
 Organizer Society for Industrial and Applied Mathematics (SIAM)
 Related subject(s) Applied Mathematics (in general); Algorithms
 Dates 05 Jan 2015 → 09 Jan 2015
[ID=609538] Go to top of page
 LocationMarseille, France
 Organizer Centre International de Rencontres Mathématiques (CIRM)
46.International workshop on graph decomposition
 Dates 19 Jan 2015 → 23 Jan 2015
[ID=609569] Go to top of page
 LocationMarseille, France
 Organizer Centre International de Rencontres Mathématiques (CIRM)
47.ICERM Semester Program: Phase Transitions and Emergent Properties
 Dates 02 Feb 2015 → 08 May 2015
[ID=592219] Go to top of page
 LocationProvidence, United States
 Abstract Emergent phenomena are properties of a system of many components which are only evident or even meaningful for the collection as a whole. A typical example is a system of many molecules, whose bulk properties may change from those of a fluid to those of a solid in response to changes in temperature or pressure. The basic mathematical tool for understanding emergent phenomena is the variational principle, most often employed via entropy maximization. The difficulty of analyzing emergent phenomena, however, makes empirical work essential; computations generate conjectures and their results are often our best judge of the truth.

The semester will include three workshops that will concentrate on di fferent aspects of current interest, including unusual settings such as complex networks and quasicrystals, the onset of emergence as small systems grow, and the emergence of structure and shape as limits in probabilistic models. The workshops will (necessarily) bring in researchers in combinatorics and probability as well as statistical physics and related areas. We aim to have experimental contributors for workshops 1 and 2 where we will highlight the comparison between computational and theoretical modeling and the real world. This will be combined with computational modules for the student participants.

 Related subject(s) Courses and Events for Math Students
48.ICERM Workshop: Crystals, Quasicrystals and Random Networks
 Dates 09 Feb 2015 → 13 Feb 2015
[ID=592218] Go to top of page
 LocationProvidence, United States
 Abstract The prototypical emergent phenomena are the bulk 'phases' of large collections of molecules, such as the fluid and solid phases. The solid phase is understood to emerge from an energy minimizing ideal crystal by the addition of random defects as energy increases from its minimum, the crucial/amazing fact being that the phase preserves something from the ideal crystal that unambiguously distinguishes it from the fluid phase. In this workshop we will focus on two significant variants of this classic picture: quasicrystals, and complex networks/random graphs. The analogue of energy minimizing crystals for quasicrystals are aperiodic tilings, such as the kite and dart tilings of Penrose, and for complex networks the analogue of energy minimizing crystals are (multi-partite) extremal graphs, graphs which minimize the number of subgraphs of some type. The workshop will focus on extremal graphs and aperiodic tilings and on the 'solid' phases they are believed to yield when random defects are introduced. It is hoped that progress can be made by pooling the expertise of researchers interested in the various aspects of these subjects.
 Related subject(s) Applied Maths: Complex Networks
49.Random Geometry — Random Graphs, Random Trees and Applications
 Dates 16 Mar 2015 → 20 Mar 2015
[ID=611695] Go to top of page
 LocationCambridge, United Kingdom
 Organizer Isaac Newton Institute for Mathematical Sciences
 Related subject(s) Courses and Events for Math Students; Geometry and Topology
50.ICERM Workshop: Small Clusters, Polymer Vesicles and Unusual Minima
 Dates 16 Mar 2015 → 20 Mar 2015
[ID=592239] Go to top of page
 LocationProvidence, United States
 Abstract This workshop will explore emergent phenomena in the context of small clusters, supramolecular self-assembly and the shape of self-assembled structures such as polymer vesicles. The emphasis will be on surprises which arise when common conditions are not satisfied, for instance when the number of components is small, or they are highly non-spherical, or there are several types of components. Interactions vary from hard sphere repulsion to competition between coarse-grained liquid-crystalline ordering competing with shape deformation. Examples of this behavior are common in materials such as bulk homopolymers (rubber), copolymers, liquid crystals and colloidal aggregates. A basic mathematical setting would be to consider small clusters of hard spheres with isotropic short-range attractions and study the shape of the clusters as a function of the number of components. One known surprise is that highly symmetric structures are suppressed by rotational entropy. This emphasizes the need to accurately count the number of particle configurations that lead to the same final state. Small clusters can also generate anisotropic building blocks which can in turn serve as nano- or meso-scale building blocks for supermolecules and bulk materials (supramolecular chemistry) freed from the limited scope of atoms and quantum-mechanical bonding. These structures frequently possess topological defects in their ground states because they lower the energy. The challenge is to determine the shape and equilibrium defect structure of such superatoms and the number and geometry of their arrangement. The number of defects determines the effective valence of the super atoms and the global geometry of their arrangement determines the types of directional bonding possible when defects are linked together. The phenomenon of the appearance of singularities/defects because they are minimizers not necessarily required by topology or boundary conditions is also encountered in the study of harmonic maps. Moving up to self-assembly of large numbers of units, block copolymers self-assemble into a wide variety of structures including vesicles, nano-fibers and tori. Many of the structures formed are essentially two-dimensional surfaces embedded in R3. The mathematical challenge is to find both the shape and the order of the assembled object. This requires minimizing of a functional that depends on both the local and global order of the relevant matter fields and the shape of the surface.
51.ICERM Workshop: Limit Shapes
 Dates 13 Apr 2015 → 17 Apr 2015
[ID=592227] Go to top of page
 LocationProvidence, United States
 Abstract Since the days of Boltzmann, it has been well accepted that natural phenomena, when described using tools of statistical mechanics, are governed by various "laws of large numbers." For practitioners of the field this usually means that certain empirical means converge to constants when the limit of a large system is taken. However, evidence has been amassed that such laws apply also to geometric features of these systems and, in particular, to many naturally-defined shapes. Earlier examples where such convergence could be proved include certain interacting particle systems, invasion percolation models and spin systems in equilibrium statistical mechanics.

The last decade has seen a true explosion of "limit-shape" results. New tools of combinatorics, random matrices and representation theory have given us new models for which limit shapes can be determined and further studied: dimer models, polymer models, sorting networks, ASEP (asymmetric exclusion processes), sandpile models, bootstrap percolation models, polynuclear growth models, etc. The goal of the workshop is to attempt to confront this "ZOO" of combinatorial examples with older foundational work and develop a better understanding of the general limit shape phenomenon.

52.GME'2015 — Graph Modelling in Engineering
 Dates 22 Jun 2015 → 24 Jun 2015
[ID=613553] Go to top of page
 LocationBielsko-Biala, Poland
 Abstract The 3-rd Conference on graph theory applications and modelling in versatile engineering sciences. Continuation of traditions of the conferences Graphs and Mechanics 1993 and 1999. The idea of the conference is to unite all graph applications in mechanial engineering, civil engineering, organization of production, logistics and mechatronics. All graphs and graph related stuctures are taken into account e.g. matroids, generalized networks, Petri networks, graph grammars e.t.c. Graph is an idea connecting fields and simultaneously it is more narrow then 'general indstrial mathematics' or 'mathematical modelling' - using e.g. differential equations. There are some conferences for bond graphs or graph grammars - only. We would like to join all these directions of investigations.
 Topics mechanical engineering, civil engineering, mechatronics, biomechanics, design theory, robotics, graphs, hypergraphs, bond graphs, graph grammars, enumeration, analysis, synthesis, design, isomorphism, decomposition, decision trees, computer tools for graphs, graphs and CAD interaction
 Contact Professor Stan Zawislak, PhD, DSc. , Faculty of Mechanical Engineering and Computer Science , University of Bielsko-Biala; Phone: [+48 608 487 179]; Email:
 Related subject(s) Modeling and Simulation; Applied Mathematics (in general)
53.Additive Combinatorics in Marseille 2015
 Dates 07 Sep 2015 → 11 Sep 2015
[ID=609724] Go to top of page
 LocationMarseille, France
 Organizer Centre International de Rencontres Mathématiques (CIRM)
54.Spectrum of random graphs
 Dates 09 Nov 2015 → 13 Nov 2015
[ID=609761] Go to top of page
 LocationMarseille, France
 Organizer Centre International de Rencontres Mathématiques (CIRM)

Last updated: 14 April 2014