English
Related papers

Related papers: High-dimensional holeyominoes

200 papers

We introduce polyhedra circuits. Each polyhedra circuit characterizes a geometric region in $\mathbb{R}^d$. They can be applied to represent a rich class of geometric objects, which include all polyhedra and the union of a finite number of…

Computational Geometry · Computer Science 2018-06-18 Bin Fu , Pengfei Gu , Yuming Zhao

Let $\mathcal{D}=\{D_0,\ldots,D_{n-1}\}$ be a set of $n$ topological disks in the plane and let $\mathcal{A} := \mathcal{A}(\mathcal{D})$ be the arrangement induced by $\mathcal{D}$. For two disks $D_i,D_j\in\mathcal{D}$, let $\Delta_{ij}$…

Combinatorics · Mathematics 2026-03-11 Aida Abiad , Boris Aronov , Mark de Berg , Julian Golak , Alexander Grigoriev , Freija van Lent

This paper characterizes when an $m \times n$ rectangle, where $m$ and $n$ are integers, can be tiled (exactly packed) by squares where each has an integer side length of at least 2. In particular, we prove that tiling is always possible…

Computational Geometry · Computer Science 2023-08-30 MIT CompGeom Group , Zachary Abel , Hugo A. Akitaya , Erik D. Demaine , Adam C. Hesterberg , Jayson Lynch

We characterize separable multidimensional permutations in terms of forbidden patterns and enumerate them by means of generating function, recursive formula and explicit formula. We find a connection between multidimensional permutations…

Combinatorics · Mathematics 2008-03-25 Andrei Asinowski , Toufik Mansour

For a natural number d and a d-dimensional real vector r let Tau(r) denote the (d-dimensional) shift radix system associated with r. Tau(r) is said to have the finiteness property iff all orbits of Tau(r) end up in the zero vector; the set…

Number Theory · Mathematics 2014-01-22 Mario Weitzer

It has been common knowledge since 1950 that seven colours can be assigned to tiles of an infinite honeycomb with cells of unit diameter such that no two tiles of the same colour are closer than $d(7)=\frac{\sqrt{7}}{2}$ apart. Various…

Combinatorics · Mathematics 2022-06-28 Aubrey D. N. J. de Grey , Jaan Parts

For fixed weights w_1,...,w_n, and for d>0, we let B denote a collection of d*n balls, with d balls of weight w_i for each i=1,...,n. We consider the problem of assigning the balls to n bins with capacities C_1,...,C_n, in such a way that…

Combinatorics · Mathematics 2019-09-06 Claudiu Raicu

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

The second part of Hilbert's 16th problem concerns determining the maximum number $H(m)$ of limit cycles that a planar polynomial vector field of degree $m$ can exhibit. A natural extension to the three-dimensional space is to study the…

Dynamical Systems · Mathematics 2025-04-21 Lucas Queiroz Arakaki , Douglas D. Novaes

We study the tiling of a two-dimensional region of the plane by $K$-cell one-dimensional tiles, or $K$-mers. Unlike previous studies, which typically allowed for one single value of $K$ or sometimes a small assortment of fixed values, here…

Statistical Mechanics · Physics 2026-02-25 Eduardo J. Aguilar , Valmir C. Barbosa , Raul Donangelo , Welles A. M. Morgado , Sergio R. Souza

Multidimensional persistence has been proposed to study the persistence of topological features in data indexed by multiple parameters. In this work, we further explore its algebraic complications from the point of view of higher…

Representation Theory · Mathematics 2020-12-07 Mickaël Buchet , Emerson G. Escolar

J.-P. Roudneff conjectured in 1991 that every arrangement of $n \ge 2d+1\ge 5$ pseudohyperplanes in the real projective space $\mathbb{P}^d$ has at most $\sum_{i=0}^{d-2} \binom{n-1}{i}$ complete cells (i.e., cells bounded by each…

Combinatorics · Mathematics 2023-03-28 Rangel Hernández-Ortiz , Kolja Knauer , Luis Pedro Montejano , Manfred Scheucher

We identify pairs of positive integers $(t, d)$ with the property that the integer sequence with general term $\lfloor{n^t/d\rfloor}$ contains at most finitely many primes.

Number Theory · Mathematics 2025-01-10 Dan Ismailescu , Yunkyu James Lee

It has recently been shown that the uniqueness theorem for stationary black holes cannot be extended to five dimensions. However, uniqueness is an important assumption of the string theory black hole entropy calculations. This paper…

High Energy Physics - Theory · Physics 2014-11-18 Harvey S. Reall

Lomonaco and Kauffman introduced a knot mosaic system to give a definition of a quantum knot system which can be viewed as a blueprint for the construction of an actual physical quantum system. A knot $n$-mosaic is an $n \times n$ matrix of…

Geometric Topology · Mathematics 2014-11-11 Kyungpyo Hong , Ho Lee , Hwa Jeong Lee , Seungsang Oh

Let $p_{\textrm{dsd}} (n)$ be the number of partitions of $n$ into distinct squarefree divisors of $n$. In this note, we find a lower bound for $p_{\textrm{dsd}} (n)$, as well as a sequence of $n$ for which $p_{\textrm{dsd}} (n)$ is…

Number Theory · Mathematics 2024-02-14 Noah Lebowitz-Lockard , Joseph Vandehey

Let D be a division ring finite dimensional over its center F. The goal of this paper is to prove that for any positive integer n there exists a in D^(n); the n-th multiplicative derived subgroup, such that F(a) is a maximal subfield of D.…

Rings and Algebras · Mathematics 2019-05-20 Mehdi Aaghabali , Mai Hoang Bien

As a generalization of polyominoes we consider edge-to-edge connected nonoverlapping unions of regular $k$-gons. For $n\le 4$ we determine formulas for the number $a_k(n)$ of generalized polyominoes consisting of $n$ regular $k$-gons.…

Combinatorics · Mathematics 2007-05-23 Matthias Koch , Sascha Kurz

We introduce topological prismatoids, a combinatorial abstraction of the (geometric) prismatoids recently introduced by the second author to construct counter-examples to the Hirsch conjecture. We show that the `strong $d$-step Theorem'…

Combinatorics · Mathematics 2022-08-05 Francisco Criado , Francisco Santos

For $d \geq 2$ and $n \in \mathbb{N}$ even, let $p_n = p_n(d)$ denote the number of length $n$ self-avoiding polygons in $\mathbb{Z}^d$ up to translation. The polygon cardinality grows exponentially, and the growth rate $\lim_{n \in…

Probability · Mathematics 2018-08-29 Alan Hammond