English
Related papers

Related papers: Tilings, packings and expected Betti numbers in si…

200 papers

The theory of $k$-regular graphs is closely related to group theory. Every $k$-regular, bipartite graph is a Schreier graph with respect to some group $G$, a set of generators $S$ (depending only on $k$) and a subgroup $H$. The goal of this…

Combinatorics · Mathematics 2016-07-27 Alexander Lubotzky , Zur Luria , Ron Rosenthal

For a given pair of numbers $(d,k)$, we establish the minimal number of vertices in pure $d$-dimensional simplicial complexes with non-trivial homology in dimension $k$. Furthermore, we solve the problem under the additional constraint of…

Combinatorics · Mathematics 2025-12-02 Jon V. Kogan

In this paper, we prove that the $L^2$ Betti numbers of an amenable covering space can be approximated by the average Betti numbers of a regular exhaustion, proving a conjecture that we made in an earlier paper. We also prove that an…

dg-ga · Mathematics 2008-02-03 Jozef Dodziuk , Varghese Mathai

We consider $d$-dimensional simplicial complexes which can be PL embedded in the $2d$-dimensional euclidean space. In short, we show that in any such complex, for any three vertices, the intersection of the link-complexes of the vertices is…

Computational Geometry · Computer Science 2020-01-28 Salman Parsa

Given a finite subset $F$ of integer points in $\mathbb Z^d$, it is of interest to seek conditions on $F$ that allow it to multi-tile $\mathbb Z^d$ by translations. To this end, we give a discretized version of the Bombieri-Siegel formula,…

Number Theory · Mathematics 2024-09-17 Michel Faleiros Martins , Sinai Robins

Let K be a simplicial complex with vertex set V = {v_1,..., v_n}. The complex K is d-representable if there is a collection {C_1,...,C_n} of convex sets in R^d such that a subcollection {C_{i_1},...,C_{i_j}} has a nonempty intersection if…

Combinatorics · Mathematics 2011-07-07 Martin Tancer

We study a higher-dimensional analogue of the {Random Travelling Salesman Problem}: let the complete $d$-dimensional simplicial complex $K_n^{d}$ on $n$ vertices be equipped with i.i.d.\ volumes on its facets, uniformly random in $[0,1]$.…

Probability · Mathematics 2024-09-04 Agelos Georgakopoulos , John Haslegrave , Joel Larsson Danielsson

We use the Cayley Trick to study polyhedral subdivisions of the product of two simplices. For arbitrary (fixed) $l$, we show that the numbers of regular and non-regular triangulations of $\Delta^l\times\Delta^k$ grow, respectively, as…

Combinatorics · Mathematics 2007-05-23 Francisco Santos

We study when co-evolving (or adaptive) higher-order networks defined on directed hypergraphs admit a simplicial description. Binary and triadic couplings are modelled by time-dependent weight tensors. Using representation theory of the…

Combinatorics · Mathematics 2025-12-02 Christian Kuehn , Fergal Murphy

The ability to design and synthesize ever more complicated colloidal particles opens the possibility of self-assembling a zoo of complex structures, including those with one or more self-limited length scales. An undesirable feature of…

Soft Condensed Matter · Physics 2022-03-02 Thomas E. Videbæk , Huang Fang , Daichi Hayakawa , Botond Tyukodi , Michael F. Hagan , W. Benjamin Rogers

We announce new results concerning the asymptotic behavior of the Betti numbers of higher rank locally symmetric spaces as their volumes tend to infinity. Our main theorem is a uniform version of the L\"uck Approximation Theorem…

It is known that there are finitely many simplicial complexes (up to isomorphism) with a given number of vertices. Translating to the language of $h$-vectors, there are finitely many simplicial complexes of bounded dimension with $h_1=k$…

Combinatorics · Mathematics 2020-09-29 Federico Castillo , Jose Alejandro Samper

Let $K \subset \mathbb R^n$ be a convex body with barycenter at the origin. We show there is a simplex $S \subset K$ having also barycenter at the origin such that $\left(\frac{vol(S)}{vol(K)}\right)^{1/n} \geq \frac{c}{\sqrt{n}},$ where…

Metric Geometry · Mathematics 2019-07-18 Daniel Galicer , Mariano Merzbacher , Damián Pinasco

The diameter of a strongly connected $d$-dimensional simplicial complex is the diameter of its dual graph. We provide a probabilistic proof of the existence of $d$-dimensional simplicial complexes with diameter $ (\frac{1}{d \cdot d!} -…

Combinatorics · Mathematics 2022-04-27 Tom Bohman , Andrew Newman

We investigate the sets of uniform limits $A(\bar{B}_n)$, $A(\bar{D}^I)$ of polynomials on the closed unit ball $\bar{B}_n$ of $\mathbb{C}^n$ and on the cartesian product $\bar{D}^I$ where $I$ is an arbitrary set and $\bar{D}$ is the closed…

Complex Variables · Mathematics 2013-04-22 K. Makridis , V. Nestoridis

We give a bound for the Betti numbers of the Stanley-Reisner ring of a stellar subdivision of a Gorenstein* simplicial complex by applying unprojection theory. From this we derive a bound for the Betti numbers of iterated stellar…

Commutative Algebra · Mathematics 2016-01-14 Janko Boehm , Stavros Argyrios Papadakis

We show that in any $d$-dimensional real normed space, unit balls can be packed with density at least \[\frac{(1-o(1))d\log d}{2^{d+1}},\] improving a result of Schmidt from 1958 by a logarithmic factor and generalizing the recent result of…

Metric Geometry · Mathematics 2025-04-23 Carl Schildkraut

This note concerns the asymptotics of the expected total Betti numbers of the nodal set for an important class of Gaussian ensembles of random fields on Riemannian manifolds. By working with the limit random field defined on the Euclidean…

Probability · Mathematics 2021-09-08 Igor Wigman

We prove upper bounds for the graded Betti numbers of Stanley-Reisner rings of balanced simplicial complexes. Along the way we show bounds for Cohen-Macaulay graded rings $S/I$, where $S$ is a polynomial ring and $I\subseteq S$ is an…

Combinatorics · Mathematics 2018-11-12 Martina Juhnke-Kubitzke , Lorenzo Venturello

We consider a subclass of tilings, the tilings obtained by cut and projection. Under somewhat standard assumptions, we show that the natural complexity function has polynomial growth. We compute its exponent \alpha in terms of the ranks of…

Dynamical Systems · Mathematics 2008-12-18 Antoine Julien