Six-dimensional sphere packing and linear programming

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.

Building on a recent investigation of the Shastry-Sutherland model [S. Wessel et al., Phys. Rev. B 98, 174432 (2018)], we develop a general strategy to eliminate the Monte Carlo sign problem near the zero-temperature limit in frustrated quantum spin models ...

Systems biology has long been interested in models capturing both metabolism and expression in a cell. We propose here an implementation of the metabolism and expression model formalism (ME-models), which we call ETFL, for Expression and Thermodynamics Flu ...

In this paper we study the regularized Petersson product between a holomorphic theta series associated to a positive definite binary quadratic form and a weakly holomorphic weight-one modular form with integral Fourier coefficients. In [18], we proved that ...

The vertex cover problem is one of the most important and intensively studied combinatorial optimization problems. Khot and Regev [Khot S, Regev O (2008) Vertex cover might be hard to approximate to within 2 - epsilon. J. Comput. System Sci. 74(3): 335-349 ...

In this talk we will speak about recent progress on the sphere packing problem. The packing problem can be formulated for a wide class of metric spaces equipped with a measure. An interesting feature of this optimization problem is that a slight change of ...

We consider linear programming (LP) problems in infinite dimensional spaces that are in general computationally intractable. Under suitable assumptions, we develop an approximation bridge from the infinite-dimensional LP to tractable finite convex programs ...

Modern cloud data centers (DCs) need to tackle efficiently the increasing demand for computing resources and address the energy efficiency challenge. Therefore, it is essential to develop resource provisioning policies that are aware of virtual machine (VM ...

Optimization is a fundamental tool in modern science. Numerous important tasks in biology, economy, physics and computer science can be cast as optimization problems. Consider the example of machine learning: recent advances have shown that even the most s ...

High level of detail renders microscopic traffic models impractical for control purposes and local control schemes cannot coordinate actions over large scale heterogeneously congested urban networks. Developing efficient models and control methods for larg ...

This paper addresses a multiprocessor generalization of the preemptive open-shop scheduling problem. The set of processors is partitioned into two groups and the operations of the jobs may require either single processors in either group or simultaneously ...

Six-dimensional sphere packing and linear programming

Chat with Graph Search

Reduction of the sign problem near T=0 in quantum Monte Carlo simulations

The ETFL formulation allows multi-omics integration in thermodynamics-compliant metabolism and expression models

Petersson inner products of weight-one modular forms

No Small Linear Program Approximates Vertex Cover Within a Factor 2-epsilon

Sharp sphere packings

From Infinite to Finite Programs: Explicit Error Bounds with Applications to Approximate Dynamic Programming

Integrating Heuristic and Machine-Learning Methods for Efficient Virtual Machine Allocation in Data Centers

New Algorithmic Paradigms for Discrete Problems using Dynamical Systems and Polynomials

Hierarchical control of heterogeneous large-scale urban road networks via path assignment and regional route guidance

Preemptive open shop scheduling with multiprocessors: polynomial cases and applications