English
Related papers

Related papers: Good Distance Lattices from High Dimensional Expan…

200 papers

In this article we apply the machinery developed in Guo-Iyer[1] together with a new compactness estimate and an object called the degree in order to prove validity of steady Prandtl layer expansions with external forcing.

Analysis of PDEs · Mathematics 2018-10-17 Yan Guo , Sameer Iyer

We investigate a connection between two important classes of Euclidean lattices: well-rounded and ideal lattices. A lattice of full rank in a Euclidean space is called well-rounded if its set of minimal vectors spans the whole space. We…

Number Theory · Mathematics 2012-04-10 Lenny Fukshansky , Kathleen Petersen

Recently, Venkatesh improved the best known lower bound for lattice sphere packings by a factor $\log\log n$ for infinitely many dimensions $n$. Here we prove an effective version of this result, in the sense that we exhibit, for the same…

Number Theory · Mathematics 2017-05-02 Philippe Moustrou

In this article, we introduce and study a natural notion of coarse separation for metric spaces, with an emphasis on coarse separation by subspaces of polynomial or subexponential growth. For instance, we show that symmetric spaces of…

Group Theory · Mathematics 2024-04-19 Oussama Bensaid , Anthony Genevois , Romain Tessera

Powering the adjacency matrix of an expander graph results in a better expander of higher degree. In this paper we seek an analogue operation for high-dimensional expanders. We show that the naive approach to powering does not preserve…

Combinatorics · Mathematics 2023-12-12 Tali Kaufman , Ori Parzanchevski

Despite extensive research on distance oracles, there are still large gaps between the best constructions for spanners and distance oracles. Notably, there exist sparse spanners with a multiplicative stretch of $1+\varepsilon$ plus some…

Data Structures and Algorithms · Computer Science 2023-07-24 Davide Bilò , Shiri Chechik , Keerti Choudhary , Sarel Cohen , Tobias Friedrich , Martin Schirneck

In my masters thesis I prove a square root bound on the distance of homological codes that come from two dimensional surfaces, as a result of the systolic inequality. I also give a detailed version of M.H. Freedman's proof that due to…

Differential Geometry · Mathematics 2011-08-16 Ethan Fetaya

Methods were developed in Ref. [1] for constructing reference metrics (and from them differentiable structures) on three-dimensional manifolds with topologies specified by suitable triangulations. This note generalizes those methods by…

General Relativity and Quantum Cosmology · Physics 2024-01-03 Lee Lindblom , Oliver Rinne

A lattice is called well-rounded, if its lattice vectors of minimal length span the ambient space. We show that there are interesting connections between the existence of well-rounded sublattices and coincidence site lattices (CSLs).…

Metric Geometry · Mathematics 2012-10-03 Peter Zeiner

In this paper, we study a classical construction of lattices from number fields and obtain a series of new results about their minimum distance and other characteristics by introducing a new measure of algebraic numbers. In particular, we…

Number Theory · Mathematics 2017-03-08 Arturas Dubickas , Min Sha , Igor E. Shparlinski

In the context of nanowire heterostructures we perform a discrete to continuum limit of the corresponding free energy by means of $\Gamma$-convergence techniques. Nearest neighbours are identified by employing the notions of Voronoi…

Analysis of PDEs · Mathematics 2016-12-08 G. Lazzaroni , M. Palombaro , A. Schlömerkemper

We study the fine distribution of lattice points lying on expanding circles in the hyperbolic plane $\mathbb{H}$. The angles of lattice points arising from the orbit of the modular group $PSL_{2}(\mathbb{Z})$, and lying on hyperbolic…

Number Theory · Mathematics 2020-09-23 Dimitrios Chatzakos , Par Kurlberg , Stephen Lester , Igor Wigman

We construct the first explicit two-sided vertex expanders that bypass the spectral barrier. Previously, the strongest known explicit vertex expanders were given by $d$-regular Ramanujan graphs, whose spectral properties imply that every…

Combinatorics · Mathematics 2024-11-19 Jun-Ting Hsieh , Ting-Chun Lin , Sidhanth Mohanty , Ryan O'Donnell , Rachel Yun Zhang

This paper introduces proximal path cycles, which lead to the main results in this paper, namely, extensions of the Mitsuishi-Yamaguchi Good Coverning Theorem with different forms of Tanaka good cover of an Alexandrov space equipped with a…

Algebraic Topology · Mathematics 2022-01-21 J. F. Peters , T. Vergili

We study ideal lattices in $\mathbb{R}^2$ coming from real quadratic fields, and give an explicit method for computing all well-rounded twists of any such ideal lattice. We apply this to ideal lattices coming from Markoff numbers to…

Number Theory · Mathematics 2018-09-21 Mohamed Taoufiq Damir , David Karpuk

Elastic quantum bound-state reflection from a hard-wall boundary provides direct information regarding the structure and compressibility of quantum bound states. We discuss elastic quantum bound-state reflection and derive a general theory…

Nuclear Theory · Physics 2013-01-18 Michelle Pine , Dean Lee

New series of $2^{2m}$-dimensional universally strongly perfect lattices $\Lambda_I $ and $\Gamma_J $ are constructed with $$2BW_{2m} ^{\#} \subseteq \Gamma _J \subseteq BW_{2m} \subseteq \Lambda _I \subseteq BW _{2m}^{\#} .$$ The lattices…

Number Theory · Mathematics 2021-11-15 Sihuang Hu , Gabriele Nebe

We prove that there exists a gradient expanding Ricci soliton asymptotic to any given cone over the product of a round sphere and a Ricci flat manifold. In particular we obtain asymptotically conical expanding Ricci solitons with positive…

Differential Geometry · Mathematics 2024-10-04 Jan Nienhaus , Matthias Wink

The Swing Lemma of the second author describes how a congruence spreads from a prime interval to another in a slim (having no $M_3$ sublattice), planar, semimodular lattice. We generalize the Swing Lemma to planar semimodular lattices.

Rings and Algebras · Mathematics 2022-08-04 Gábor Czédli , George Grätzer , Harry Lakser

Recent work has shown that properly designed protograph-based LDPC codes may have minimum distance linearly increasing with block length. This notion rests on ensemble arguments over all possible expansions of the base protograph. When…

Information Theory · Computer Science 2012-02-17 Brian K. Butler , Paul H. Siegel