English
Related papers

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

200 papers

A Betti splitting $I=J+K$ of a monomial ideal $I$ ensures the recovery of the graded Betti numbers of $I$ starting from those of $J,K$ and $J \cap K$. In this paper, we introduce this condition for simplicial complexes, and, by using…

Combinatorics · Mathematics 2018-04-30 Davide Bolognini , Ulderico Fugacci

We study a variation of Bagchi and Datta's $\sigma$-vector of a simplicial complex $C$, whose entries are defined as weighted averages of Betti numbers of induced subcomplexes of $C$. We show that these invariants satisfy an…

Combinatorics · Mathematics 2020-08-25 Giulia Codenotti , Francisco Santos , Jonathan Spreer

Identifying clusters of similar objects in data plays a significant role in a wide range of applications. As a model problem for clustering, we consider the densest k-disjoint-clique problem, whose goal is to identify the collection of k…

Optimization and Control · Mathematics 2015-03-20 Brendan P. W. Ames

Our earlier article proved that if $n > 1$ translates of sublattices of $Z^d$ tile $Z^d$, and all the sublattices are Cartesian products of arithmetic progressions, then two of the tiles must be translates of each other. We re-prove this…

Combinatorics · Mathematics 2010-06-04 David Feldman , James Propp , Sinai Robins

This paper studies random lozenge tilings of general non-convex polygonal regions. We show that the pairwise interaction of the non-convexities leads asymptotically to new kernels and thus to new statistics for the tiling fluctuations. The…

Mathematical Physics · Physics 2018-11-21 Mark Adler , Kurt Johansson , Pierre van Moerbeke

Each simplicial complex and integer vector yields a vector configuration whose combinatorial properties are important for the analysis of contingency tables. We study the normality of these vector configurations including a description of…

Combinatorics · Mathematics 2016-01-08 Daniel Irving Bernstein , Seth Sullivant

For every fixed dimension $d$ and sufficiently large $n$, we determine the maximum possible diameter of a strongly connected $d$-dimensional simplicial complex on $n$ vertices. This improves on a sequence of previous results and settles a…

Combinatorics · Mathematics 2026-02-25 Stefan Glock , Olaf Parczyk , Silas Rathke , Tibor Szabó

We introduce a concept for random tilings which, comprising the conventional one, is also applicable to tiling ensembles without height representation. In particular, we focus on the random tiling entropy as a function of the tile…

Statistical Mechanics · Physics 2008-08-28 Christoph Richard , Moritz Hoeffe , Joachim Hermisson , Michael Baake

We study the minimal complexity of tilings of a plane with a given tile set. We note that every tile set admits either no tiling or some tiling with O(n) Kolmogorov complexity of its n-by-n squares. We construct tile sets for which this…

Computational Complexity · Computer Science 2018-12-03 Bruno Durand , Leonid A. Levin , Alexander Shen

Let $G=(V,E)$ be a simple graph with $|V|=n$ nodes and $|E|=m$ links, a subset $K \subseteq V$ of \emph{terminals}, a vector $p=(p_1,\ldots,p_m) \in [0,1]^m$ and a positive integer $d$, called \emph{diameter}. We assume nodes are perfect…

Computational Complexity · Computer Science 2014-04-15 Eduardo Canale , Pablo Romero

Over thirty years ago, Kalai proved a beautiful $d$-dimensional analog of Cayley's formula for the number of $n$-vertex trees. He enumerated $d$-dimensional hypertrees weighted by the squared size of their $(d-1)$-dimensional homology…

Combinatorics · Mathematics 2018-01-09 Nati Linial , Yuval Peled

The Set Packing problem is, given a collection of sets $\mathcal{S}$ over a ground set $\mathcal{U}$, to find a maximum collection of sets that are pairwise disjoint. The problem is among the most fundamental NP-hard optimization problems…

Computational Complexity · Computer Science 2023-02-28 Ameet Gadekar

In 1983 Kalai proved an incredible generalisation of Cayley's formula for the number of trees on a labelled vertex set to a formula for a class of $r$-dimensional simplicial complexes. These simplicial complexes generalise trees by means of…

Combinatorics · Mathematics 2019-12-05 Lewis Mead

In this paper we discuss two general models of random simplicial complexes which we call the lower and the upper models. We show that these models are dual to each other with respect to combinatorial Alexander duality. The behaviour of the…

Algebraic Topology · Mathematics 2022-01-05 Michael Farber , Lewis Mead , Tahl Nowik

We define the uniform face ideal of a simplicial complex with respect to an ordered proper vertex colouring of the complex. This ideal is a monomial ideal which is generally not squarefree. We show that such a monomial ideal has a linear…

Combinatorics · Mathematics 2013-08-07 David Cook

Symmetric tensor decomposition is an important problem with applications in several areas for example signal processing, statistics, data analysis and computational neuroscience. It is equivalent to Waring's problem for homogeneous…

Symbolic Computation · Computer Science 2019-09-12 Matías Bender , Jean-Charles Faugère , Ludovic Perret , Elias Tsigaridas

A group-theoretical approach to the construction of quasiperiodic tilings of a Euclidean plane, possessing five-fold symmetry, is applied. Of the infinitely many of variants of quasiperiodic partitions of the plane, possessing the dihedral…

General Mathematics · Mathematics 2019-08-08 Alexander S. Prokhoda

Our objective in this article is to show a possibly interesting structure of homotopic nature appearing in persistent (co)homology. Assuming that the filtration of the (say) simplicial set embedded in a finite dimensional vector space…

Algebraic Topology · Mathematics 2014-12-08 Estanislao Herscovich

We prove that the asymptotic of the bulk local statistics in models of random lozenge tilings is universal in the vicinity of straight boundaries of the tiled domains. The result applies to uniformly random lozenge tilings of large…

Probability · Mathematics 2017-12-29 Vadim Gorin

We consider numeration systems based on a $d$-tuple $\mathbf{U}=(U_1,\ldots,U_d)$ of sequences of integers and we define $(\mathbf{U},\mathbb{K})$-regular sequences through $\mathbb{K}$-recognizable formal series, where $\mathbb{K}$ is any…

Combinatorics · Mathematics 2021-01-07 Émilie Charlier , Célia Cisternino , Manon Stipulanti