On the number of lattice points in a small sphere and a recursive lattice decoding algorithm

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.

We provide new explicit examples of lattice sphere packings in dimensions 54, 55, 162, 163, 486 and 487 that are the densest known so far, using Kummer families of elliptic curves over global function fields. In some cases, these families of elliptic curve ...

Geometric properties of lattice quantum gravity in two dimensions are studied numerically via Monte Carlo on Euclidean Dynamical Triangulations. A new computational method is proposed to simulate gravity coupled with fermions, which allows the study of int ...

Chaos sets a fundamental limit to quantum-information processing schemes. We study the onset of chaos in spatially extended quantum many-body systems that are relevant to quantum optical devices. We consider an extended version of the Tavis-Cummings model ...

This data set provides a computer-assisted proof for the kernel inequalities needed to prove universal optimality in the paper "Universal optimality of the E_8 and Leech lattices and interpolation formulas" (by Cohn, Kumar, Miller, Radchenko, and Viazovska ...

This thesis is a study of the global well-posedness of the Cauchy problems for half-wave maps from the Minkowski space of dimension n+1 to the 2-dimensional sphere and the hyperbolic plane. The work is mainly based on the results from Krieger-Sire 17' in ...

We provide faster algorithms and fine-grained reductions for lattice problems in general norms. ...

Total Flow Analysis (TFA) is a method for the worst-case analysis of time-sensitive networks. It uses service curve characterizations of the network nodes and arrival curves of flows at their sources; for tractability, the latter are often taken to be line ...

The corner transfer matrix renormalization group (CTMRG) algorithm has been extensively used to investigate both classical and quantum two-dimensional (2D) lattice models. The convergence of the algorithm can strongly vary from model to model depending on ...

A correspondence functor is a functor from the category of finite sets and correspondences to the category of k-modules, where k is a commutative ring. By means of a suitably defined duality, new correspondence functors are constructed, having remarkable p ...

Recently, substantial progress has been made in the understanding of microresonators frequency combs based on dissipative Kerr solitons (DKSs). However, most of the studies have focused on the single-resonator level. Coupled resonator systems can open new ...

We study the elliptic curves given by y(2) = x(3) + bx + t(3n+1) over global function fields of characteristic 3 ; in particular we perform an explicit computation of the L-function by relating it to the zeta function of a certain superelliptic curve u(3) ...

The connectedness percolation threshold (phi(c)) for spherically symmetric, randomly distributed fractal aggregates is investigated as a function of the fractal dimension (d(F)) of the aggregates through a mean-field approach. A pair of aggregates (each of ...

Graph sparsification has been studied extensively over the past two decades, culminating in spectral sparsifiers of optimal size (up to constant factors). Spectral hypergraph sparsification is a natural analogue of this problem, for which optimal bounds on ...

We obtain new Fourier interpolation and uniqueness results in all dimensions, extending methods and results by the first author and M. Sousa [11] and the second author [12]. We show that the only Schwartz function which, together with its Fourier transform ...

We introduce a local adaptive discontinuous Galerkin method for convection-diffusion-reaction equations. The proposed method is based on a coarse grid and iteratively improves the solution's accuracy by solving local elliptic problems in refined subdomains ...

Let K be a totally real number field of degree n >= 2. The inverse different of K gives rise to a lattice in Rn. We prove that the space of Schwartz Fourier eigenfunctions on R-n which vanish on the "component-wise square root" of this lattice, is infinite ...

We propose a new approach for normalization and simplification of logical formulas. Our approach is based on algorithms for lattice-like structures. Specifically, we present two efficient algorithms for computing a normal form and deciding the word problem ...

The calculations performed for the design and operation of a Nuclear Power Plant (NPP) are a key factor for their safety analyses. The standard for the computational analysis of NPPs is the so called conventional approach, which relies on coarse mesh diffu ...

It is generally assumed that the parent-twin interface is a fully invariant plane. The calculations of the rational interfaces of the type I twins and irrational interfaces of the type II twins are based on this hypothesis. Recently, some asymmetric facets ...

We show that a constant factor approximation of the shortest and closest lattice vector problem in any l(p)-norm can be computed in time 2((0.802 + epsilon)n). This matches the currently fastest constant factor approximation algorithm for the shortest vect ...

On the number of lattice points in a small sphere and a recursive lattice decoding algorithm

Chat with Graph Search

Some Mordell-Weil lattices and applications to sphere packings

Hausdorff dimension of fermions on a random lattice

Transition to chaos in extended systems and their quantum impurity models

Computer-assisted proof of kernel inequalities

Well-posedness Issues For the Half-Wave Maps Equation With Hyperbolic And Spherical Targets

Geometric Considerations in Lattice Programming

Efficient and Accurate Handling of Periodic Flows in Time-Sensitive Networks

Critical line of the triangular Ising antiferromagnet in a field from a C3-symmetric corner transfer matrix algorithm

Correspondence functors and duality

Nonlinear dynamics and Kerr frequency comb formation in lattices of coupled microresonators

On the Mordell-Weil lattice of y(2) = x(3) + bx plus t(3n+1) in characteristic 3

Geometric Percolation of Spherically Symmetric Fractal Aggregates

Spectral Hypergraph Sparsifiers of Nearly Linear Size

Perturbed Fourier uniqueness and interpolation results in higher dimensions

A local adaptive discontinuous Galerkin method for convection-diffusion-reaction equations

Fourier non-uniqueness sets from totally real number fields

Formula Normalizations in Verification

Multi-physics modeling of VVERs with high fidelity high-resolution codes

The concept of axial weak twins

Approximate CVPp in time 2(0.802n)