Related papers: Good Distance Lattices from High Dimensional Expan…
We introduce a refinement of the Gorenstein flat dimension for complexes over an associative ring--the Gorenstein flat-cotorsion dimension--and prove that it, unlike the Gorenstein flat dimension, behaves as one expects of a homological…
Reducing parameter spaces via exploiting symmetries has greatly accelerated and increased the quality of electronic-structure calculations. Unfortunately, many of the traditional methods fail when the global crystal symmetry is broken, even…
Following G.~Gr\"atzer and E.~Knapp, 2009, a planar semimodular lattice $L$ is \emph{rectangular}, if~the left boundary chain has exactly one doubly-irreducible element, $c_l$, and the right boundary chain has exactly one doubly-irreducible…
Maxwell lattices are characterized by an equal number of degrees of freedom and constraints. A subset of them, dubbed topological lattices, are capable of localizing stress and deformation on opposing edges, displaying a polarized…
A two-dimensional grid with dots is called a \emph{configuration with distinct differences} if any two lines which connect two dots are distinct either in their length or in their slope. These configurations are known to have many…
In previous papers by A. Kameyama and by J. Kigami distances on fractals have been discussed having two different but similar properties. One property is that the maps defining the fractal are Lipschitz of prescribed constants less than 1,…
We consider the set of all linear combinations with integer coefficients of the vectors of a unit tight equiangular $(k,n)$ frame and are interested in the question whether this set is a lattice, that is, a discrete additive subgroup of the…
Diffusion Limited Aggregation (DLA) has served for forty years as a paradigmatic example for the creation of fractal growth patterns. In spite of thousands of references no exact result for the fractal dimension $D$ of DLA is known. In this…
Length-constrained expander decompositions are a new graph decomposition that has led to several recent breakthroughs in fast graph algorithms. Roughly, an $(h, s)$-length $\phi$-expander decomposition is a small collection of length…
We study a model of spinless fermions on the honeycomb lattice with nearest-neighbor exclusion and extended repulsive interactions that exhibits `lattice supersymmetry' [P. Fendley, K. Schoutens, and J. de Boer, Phys. Rev. Lett. 90, 120402…
We develop a new degree theory for 4-dimensional, asymptotically conical gradient expanding solitons. Our theory implies the existence of gradient expanding solitons that are asymptotic to any given cone over $S^3$ with non-negative scalar…
We undertake a detailed study of the $L^2$ discrepancy of rational and irrational 2-dimensional lattices either with or without symmetrization. We give a full characterization of lattices with optimal $L^2$ discrepancy in terms of the…
The coincidence site lattices (CSLs) of prominent 4-dimensional lattices are considered. CSLs in 3 dimensions have been used for decades to describe grain boundaries in crystals. Quasicrystals suggest to also look at CSLs in dimensions…
We introduce an asymptotic notion of positivity in algebraic geometry that turns out to be related to some high-dimensional convex sets. The dimension of the convex sets grows with the number of birational operations. In the case of complex…
In this paper we introduce a notion of dimension and codimension for every element of a distributive bounded lattice $L$. These notions prove to have a good behavior when $L$ is a co-Heyting algebra. In this case the codimension gives rise…
We generalize upper bounds for constant dimension codes containing a lifted maximum rank distance code first studied by Etzion and Silberstein. The proof allows to construct several improved codes.
We establish a parametric extension $h$-principle for overtwisted contact structures on manifolds of all dimensions, which is the direct generalization of the $3$-dimensional result from \cite{Eli89}. It implies, in particular, that any…
We prove the following result: Let K be a lattice, let D be a distributive lattice with zero, and let $\phi$: Con K $\to$ D be a {∨, 0}-homomorphism, where Conc K denotes the {∨, 0}-semilattice of all finitely generated…
In this paper, we study the large-scale structure of dense regular graphs. This involves the notion of robust expansion, a recent concept which has already been used successfully to settle several longstanding problems. Roughly speaking, a…
Following Gromov, the coboundary expansion of building-like complexes is studied. In particular, it is shown that for any $n \geq 1$, there exists a constant $\epsilon(n)>0$ such that for any $0 \leq k <n$ the $k$-th coboundary expansion…