English
Related papers

Related papers: Embedding $FD(\omega)$ into $\mathcal{P}_s$ densel…

200 papers

We develop a framework for discrete p-density and compression-radius profiles of lattice knots. For lattice polygons representing a fixed knot type, we define scale-free density quantities by dividing lattice length by chord-length spread…

Geometric Topology · Mathematics 2026-05-29 Makoto Ozawa

We give a method for constructing dense and free subgroups in real Lie groups. In particular we show that any dense subgroup of a connected semisimple real Lie group G contains a free group on two generators which is still dense in G, and…

Group Theory · Mathematics 2007-05-23 Emmanuel Breuillard , Tsachik Gelander

A numbering of a countable family $S$ is a surjective map from the set of natural numbers $\omega$ onto $S$. The paper studies Rogers semilattices, i.e. upper semilattices induced by the reducibility between numberings, for families…

Logic · Mathematics 2020-10-05 Nikolay Bazhenov , Manat Mustafa

Let $K$ be a convex body in $\mathbb{R}^n$, let $L$ be a lattice with covolume one, and let $\eta>0$. We say that $K$ and $L$ form an $\eta$-smooth cover if each point $x \in \mathbb{R}^n$ is covered by $(1 \pm \eta) vol(K)$ translates of…

Number Theory · Mathematics 2023-11-09 Or Ordentlich , Oded Regev , Barak Weiss

Let $p$ be a prime, and $F$ a non-archimedean local field with residue characteristic $p$ and ring of integers $\mathcal{O}_{F}$. Set $G_{S}:={\rm SL}_{2}(F)$and $K_{0}:={\rm SL}_{2}(\mathcal{O}_{F})$ . For a smooth irreducible…

Representation Theory · Mathematics 2025-10-21 Arpan Das

For a left vector space V over a totally ordered division ring F, let Co(V) denote the lattice of convex subsets of V. We prove that every lattice L can be embedded into Co(V) for some left F-vector space V. Furthermore, if L is finite…

General Mathematics · Mathematics 2007-05-23 Friedrich Wehrung , Marina V. Semenova

Much of the vast literature on the integral during the last two centuries concerns extending the class of integrable functions. In contrast, our viewpoint is akin to that taken by Hassler Whitney [{\it Geometric integration theory},…

Differential Geometry · Mathematics 2016-09-06 Jenny Harrison

Let $G$ be a simply connected, solvable Lie group and $\Gamma$ a lattice in $G$. The deformation space $\mathcal{D}(\Gamma,G)$ is the orbit space associated to the action of $\Aut(G)$ on the space $\mathcal{X}(\Gamma,G)$ of all lattice…

Differential Geometry · Mathematics 2014-02-26 Oliver Baues , Benjamin Klopsch

Various embedding problems of lattices into complete lattices are solved. We prove that for any join-semilattice S with the minimal join-cover refinement property, the ideal lattice IdS of S is both algebraic and dually algebraic.…

General Mathematics · Mathematics 2007-05-23 Friedrich Wehrung

A variant of the Erd\H{o}s-S\'os conjecture, posed by Havet, Reed, Stein and Wood, states that every graph with minimum degree at least $\lfloor 2k/3 \rfloor$ and maximum degree at least $k$ contains a copy of every tree with $k$ edges.…

Combinatorics · Mathematics 2025-12-19 Alexey Pokrovskiy , Leo Versteegen , Ella Williams

By a 1997 result of R. Freese, an $n$-element lattice has at most $2^{n-1}$ congruences. This motivates us to define the congruence density cd$(L)$ of a finite $n$-element lattice as $|$Con$(L)|/2^{n-1}$, where $|$Con$(L)|$ is the number of…

Rings and Algebras · Mathematics 2026-02-05 Gábor Czédli

Spectral densities encode non-perturbative information crucial in computing physical observables in strongly coupled field theories. Using lattice gauge theory data, we perform a systematic study to demonstrate the potential of recent…

For a set $S$ of vertices of a graph $G$, we define its density $0 \leq \sigma(S) \leq 1$ as the ratio of the number of edges of $G$ spanned by the vertices of $S$ to ${|S| \choose 2}$. We show that, given a graph $G$ with $n$ vertices and…

Combinatorics · Mathematics 2018-07-06 Alexander Barvinok , Anthony Della Pella

We describe and analyze the joint source/channel coding properties of a class of sparse graphical codes based on compounding a low-density generator matrix (LDGM) code with a low-density parity check (LDPC) code. Our first pair of theorems…

Information Theory · Computer Science 2007-07-13 Martin J. Wainwright , Emin Martinian

Given a weighted graph $G=(V,E,w)$, a partition of $V$ is $\Delta$-bounded if the diameter of each cluster is bounded by $\Delta$. A distribution over $\Delta$-bounded partitions is a $\beta$-padded decomposition if every ball of radius…

Data Structures and Algorithms · Computer Science 2024-01-09 Arnold Filtser

We formulate a family of scalar softening laws by setting the stored-energy density $\psi(\eta)=\int_{0}^{\eta}[1-F(s)]d s$, where $F$ ranges over exponential, Cauchy, logistic, half-normal, Gudermannian, hypergeometric, radical, rational,…

Analysis of PDEs · Mathematics 2025-06-10 Huilong Ren

Jech proved that every partially ordered set can be embedded into the cardinals of some model of $ZF$. We extend this result to show that every partially ordered set can be embedded into the cardinals of some model of $ZF+DC_{<\kappa}$ for…

Logic · Mathematics 2014-06-17 Asaf Karagila

The fourth listed author and Hans Parshall (\cite{IosevichParshall}) proved that if $E \subset {\mathbb F}_q^d$, $d \ge 2$, and $G$ is a connected graph on $k+1$ vertices such that the largest degree of any vertex is $m$, then if $|E| \ge C…

Combinatorics · Mathematics 2023-08-21 Paige Bright , Xinyu Fang , Barrett Heritage , Alex Iosevich , Maxwell Sun

It follows from the Marcus-Spielman-Srivastava proof of the Kadison-Singer conjecture that if $G=(V,E)$ is a $\Delta$-regular dense expander then there is an edge-induced subgraph $H=(V,E_H)$ of $G$ of constant maximum degree which is also…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-03-09 Luca Becchetti , Andrea Clementi , Emanuele Natale , Francesco Pasquale , Luca Trevisan

A lattice $L$ is said lowly finite if the set $[\mathsf{0},a]$ is finite for every element $a$ of $L$. We mainly aim to provide a complete proof that, if $M$ is a subset of a complete lowly finite distributive lattice $L$ containing its…

Combinatorics · Mathematics 2021-01-19 Hery Randriamaro