Publication

Mean value theorems for collections of lattices with a prescribed group of symmetries

Related publications (42)

Tighter thermodynamic bound on the speed limit in systems with unidirectional transitions

Daniel Maria Busiello, Deepak Gupta

We consider a general discrete state-space system with both unidirectional and bidirectional links. In contrast to bidirectional links, there is no reverse transition along the unidirectional links Herein, we first compute the statistical length and the th ...
2020

New Results in Integer and Lattice Programming

Christoph Hunkenschröder

An integer program (IP) is a problem of the form min{f(x):Ax=b, lxu, xZn}\min \{f(x) : \, Ax = b, \ l \leq x \leq u, \ x \in \Z^n\}, where AZm×nA \in \Z^{m \times n}, bZmb \in \Z^m, l,uZnl,u \in \Z^n, and f:ZnZf: \Z^n \rightarrow \Z is a separable convex objective function. The problem o ...
EPFL2020

Automorphisms of even unimodular lattices and equivariant Witt groups

Eva Bayer Fluckiger

We characterize the irreducible polynomials that occur as the characteristic polynomial of an automorphism of an even unimodular lattice of a given signature, generalizing a theorem of Gross and McMullen. As part of the proof, we give a general criterion i ...
EUROPEAN MATHEMATICAL SOC2020

New dense superball packings in three dimensions

Maria Margarethe Dostert

We construct a new family of lattice packings for superballs in three dimensions (unit balls for the l(3)(p) norm) with p epsilon (1, 1.58]. We conjecture that the family also exists for p epsilon (1.58, log(2) 3 = 1.5849625 ...]. Like in the densest latti ...
WALTER DE GRUYTER GMBH2020

Optimistic Distributionally Robust Optimization for Nonparametric Likelihood Approximation

Daniel Kuhn, Viet Anh Nguyen, Soroosh Shafieezadeh Abadeh, Wolfram Wiesemann

The likelihood function is a fundamental component in Bayesian statistics. However, evaluating the likelihood of an observation is computationally intractable in many applications. In this paper, we propose a non-parametric approximation of the likelihood ...
2019

A construction of the Stable Web

Thomas Mountford

We provide a process on the space of collections of coalescing cadlag stable paths and show convergence in an appropriate topology for coalescing stable random walks on the integer lattice. ...
IMPA2019

The sphere packing problem in dimension 24

Maryna Viazovska, Abhinav Kumar

Building on Viazovska’s recent solution of the sphere packing problem in eight dimensions, we prove that the Leech lattice is the densest packing of congruent spheres in twenty-four dimensions and that it is the unique optimal periodic packing. In particul ...
2017

A variational investigation of the SU(N) Heisenberg model in antisymmetric irreducible representations

Jérôme Dufour

Motivated by recent experimental progress in the context of ultra-cold multi-colour fermionic atoms in optical lattices, this thesis investigates the properties of the antiferromagnetic SU(N) Heisenberg models with fully antisymmetric irreducible represent ...
EPFL2016

Universe and Matter Conjectured as a 3-Dimensional Lattice with Topological Singularities

Gérard Gremaud

One fundamental problem of modern physics is the search for a theory of everything able to explain the nature of space-time, what matter is and how matter interacts. There are various propositions, as Grand Unified Theory, Quantum Gravity, Supersymmetry, S ...
2016

Multilevel and weighted reduced basis method for stochastic optimal control problems constrained by Stokes equations

Alfio Quarteroni, Gianluigi Rozza, Peng Chen

In this paper we develop and analyze a multilevel weighted reduced basis method for solving stochastic optimal control problems constrained by Stokes equations. We prove the analytic regularity of the optimal solution in the probability space under certain ...
Springer Heidelberg2016

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.