In short
Symmetry was a conference on Computer Science & AI held in , from 24–26 Jun 2026.
About this event
In recent years, fundamental results in combinatorics and discrete mathematics have been obtained and advanced through effective computations involving computer algebra and numerical methods: kissing numbers and optimal sphere packings, independence ratios and Lovasz numbers, as well as graph homomorphisms. In the majority of cases, new progress relies on the exploitation of algebraic structure. The workshop focuses on computational methods based on algebra and symmetry to solve problems in graph theory. Emphasize lies on sums of squares-based optimization hierarchies that make use of lattice-based symmetry exploitation, group actions or sparsity. We connect experts who are working on the intersections of combinatorics, optimization and algebra. This will enable synergies and open opportunities for future work.
Daniel Brosch: Symmetry-Reduction for Extremal Combinatorics - Conic optimization plays a central role in asymptotic extremal combinatorics through the sum-of-squares framework of flag algebras. Although flag algebras were originally developed using tools from model theory, combinatorics, and probability, this talk approaches the subject from the perspective of polynomial optimization in a growing number of variables. While symmetry reduction and representation stability are essential for deriving the flag algebra formalism in this setting, alternative symmetry-reduction techniques based on Möbius transforms lead to simpler reductions and computationally more effective hierarchies. I will discuss these methods and their applications to limits of trees and the computation of Ramsey numbers. Nidhi Kaihnsa : Rational Univariate Representation in Reaction Networks - In reaction networks, the dynamics of the system is determined by parametric polynomial systems that are vertically parameterised. These are special class of polynomial systems. Often we are interested in the real positive solutions of these systems. In particular, the questions focus on determining maximum number of positive solutions attained by these systems over the space of parameters. In case of some reaction networks, the Chow form of this sytem can be obtained as a determinant of a symmetric matrix and the zeros of the Chow form are given by eigenvalues of the pair of symmetric matrices. The problem to determine the positive solutions of a given system can be then formulated as an optimisation problem. This is based on a joint work with Carles Checa. Nando Leijenhorst: Traceless projections of tensors with applications in discrete geometry - A spherical code is a set of points on the sphere with a certain pair-wise minimum distance. We find upper bounds on the maximum size of a spherical code, given the dimension and the minimum distance, using a generalization of the moment/SOS hierarchy for polynomial optimization to packing problems in discrete geometry. As part of this optimization problem, we require a description of O(n)-invariant kernels. To compute these kernels, we give a new, explicit isomorphism between representations of \(GL(t)\) and \(O(n-t)\) invariant subspaces of representations of \(O(n)\). This allows us to improve the relaxation order of our problem and to prove a new optimality result for spherical codes. Philippe Moustrou: Polarization of structured lattices - We consider the problem of finding the minimum of inhomogeneous Gaussian lattice sums: Given a lattice \(L\) in an \(n\)-dimensional Euclidean space \(V\) and a positive constant \(a\), the goal is to find the points \(z \in V\) that minimize the sum of the potential \( \exp(-a \, \|x - z\|^2) \) over all the points \(x \in L\). By a result of Bétermin and Petrache from 2017, it is known that for steep potential energy functions (when \(a\) tends to infinity) the minimum in the limit goes to a deep hole of the lattice. The goal of this talk is to strengthen this result for lattices with a lot of symmetries: We prove that the deep holes of root lattices are already the exact minimizers for all \( a \ge a_0 \) for some finite \(a_0\). Moreover, we prove that such a stability result can only occur for lattices with strong algebraic structure. After introducing the problem, we will discuss how to design and solve exactly an LP bound for spherical designs, which allows to prove that the deep holes are local minimizers. The end of the argument follows from a covering argument involving a precise control of the parameters around the lattice points. If time permits, we will discuss the case where the parameter \(a\to 0\) which, after applying the Poisson Summation Formula, provides another optimization problem over the Voronoi cell of the lattice \(L\). Based on joint works with C. Bachoc, F. Vallentin and M. Zimmermann. Sven Polak: Sum-of-squares certificates for symmetric polynomials on the hypercube: A counterexample to an optimality conjecture of De Klerk and Laurent - De Klerk and Laurent (SIAM J. Optim., 2010) conjectured that, for even \(n\), the smallest constant \(C_n\) such that the polynomial \(x_1\cdots x_n+C_n\) is contained in the degree-\(n\) truncated quadratic module \(M_{n,n}(x_1-x_1^2,\ldots,x_n-x_n^2)\) of the hypercube is \(C_n=1/(n(n+2))\). We specialize symmetry reduction techniques for finding sum-of-squares certificates to the hypercube, where the generators \(x_i-x_i^2\) are not individually invariant under the symmetric group but form an invariant set, and apply them to this conjecture. Combining this reduction with a further (heuristic) sparsity reduction, a rational rounding step, and an exact verification over \(\mathbb{Q}\), we prove the bound \(C_8\leq 11/1000
Listed by the organizer on 7 Nov 2026, last updated . Check dates and fees on the official website before booking travel. Report a problem with this listing.