English
Related papers

Related papers: No Weak Local Rules for the 4p-Fold Tilings

200 papers

In 1980 Provan and Billera defined the notion of weak $k$-decomposability for pure simplicial complexes. They showed the diameter of a weakly $k$-decomposable simplicial complex $\Delta$ is bounded above by a polynomial function of the…

Combinatorics · Mathematics 2012-03-09 Jesus A. De Loera , Steven Klee

A set $\Omega \subset \mathbb{R}^d$ is said to be spectral if the space $L^2(\Omega)$ admits an orthogonal basis of exponential functions. Fuglede (1974) conjectured that $\Omega$ is spectral if and only if it can tile the space by…

Classical Analysis and ODEs · Mathematics 2023-10-24 Mihail N. Kolountzakis , Nir Lev , Máté Matolcsi

We say that a triangle $T$ tiles a polygon $A$, if $A$ can be dissected into finitely many nonoverlapping triangles similar to $T$. We show that if $N>42$, then there are at most three nonsimilar triangles $T$ such that the angles of $T$…

Metric Geometry · Mathematics 2020-02-28 M. Laczkovich

Conway and Lagarias observed that a triangular region T(m) in a hexagonal lattice admits signed tiling by three-in-line polyominoes (tribones) if and only if m=9d-1 or m=9d for some integer d. We apply the theory of Groebner bases over…

Combinatorics · Mathematics 2014-09-10 Manuela Muzika Dizdarević , Marinko Timotijević , Rade T. Živaljević

O. H. Keller conjectured in 1930 that in any tiling of $\Bbb R^n$ by unit $n$-cubes there exist two of them having a complete facet in common. O. Perron proved this conjecture for $n\le 6$. We show that for all $n\ge 10$ there exists a…

Metric Geometry · Mathematics 2016-09-06 Jeffrey C. Lagarias , Peter W. Shor

We develop the basic and new tools for classifying non-side-to-side tilings of the sphere by congruent triangles. Then we prove that, if the triangle has any irrational angle in degree, such tilings are: a sequence of 1-parameter families…

Combinatorics · Mathematics 2025-05-23 Wen Chen , Jinjin Liang , Erxiao Wang

In 1946 Fine and Niven posed problem E724, asking to demonstrate that every hypercube can be tiled by any number of hypercubic tiles larger than some value. This requires only basic number theory, but the problem of finding the smallest…

Combinatorics · Mathematics 2019-10-15 Benjamin Prather

We answer an open problem raised by Chen and Zhang in 2008 and prove that, for any minimal projective 3-fold $X$ of general type with the geometric genus $\geq 5$, $X$ is birationally fibred by a pencil of $(1,2)$-surfaces (i.e. $c_1^2=1$,…

Algebraic Geometry · Mathematics 2018-06-19 Meng Chen , Yong Hu

In 1994, Thomassen famously proved that every planar graph is 5-choosable, resolving a conjecture initially posed by Vizing and, independently, Erd\H{os}, Rubin, and Taylor in the 1970s. Later, Thomassen proved that every planar graph of…

Combinatorics · Mathematics 2022-12-12 Luke Postle , Evelyne Smith-Roberge

The notion of weak tiling played a key role in the proof of Fuglede's spectral set conjecture for convex domains, due to the fact that every spectral set must weakly tile its complement. In this paper, we revisit the notion of weak tiling…

Classical Analysis and ODEs · Mathematics 2025-09-17 Mihail N. Kolountzakis , Nir Lev , Máté Matolcsi

Weak degeneracy is a variation of degeneracy which shares many nice properties of degeneracy. In particular, if a graph $G$ is weakly $d$-degenerate, then for any $(d + 1)$-list assignment $L$ of $G$, one can construct an $L$-coloring of…

Combinatorics · Mathematics 2023-03-15 Ming Han , Tao Wang , Jianglin Wu , Huan Zhou , Xuding Zhu

As well known, weak K4 and the difference logic DL do not enjoy the Craig interpolation property. Our concern here is the problem of deciding whether any given implication does have an interpolant in these logics. We show that the…

Logic in Computer Science · Computer Science 2024-06-18 Agi Kurucz , Frank Wolter , Michael Zakharyaschev

An equilateral triangle cannot be dissected into finitely many mutually incongruent equilateral triangles [Tutte 1948]. Therefore Tuza [Tuza 1991] asked for the largest number $s=s(n)$ such that there is a tiling of an equilateral triangle…

Metric Geometry · Mathematics 2019-03-26 Christian Richter

We present a new explicit formula for the determinant that contains superexponentially fewer terms than the usual Leibniz formula. As an immediate corollary of our formula, we show that the tensor rank of the $n \times n$ determinant tensor…

Combinatorics · Mathematics 2025-01-07 Robin Houston , Adam P. Goucher , Nathaniel Johnston

In this paper we study colorings (or tilings) of the two-dimensional grid $\mathbb{Z}^2$. A coloring is said to be valid with respect to a set $P$ of $n\times m$ rectangular patterns if all $n\times m$ sub-patterns of the coloring are in…

Discrete Mathematics · Computer Science 2022-06-06 Jarkko Kari , Etienne Moutot

A map is a cellular decomposition of a closed surface. In the framework of classifying all regular maps by their supporting surface, it is an open problem to find all closed surfaces that support no regular maps. Classification of regular…

Group Theory · Mathematics 2026-01-19 Xiaogang Li , Yao Tian

Let $ABC$ be an equilateral triangle. For certain triangles $T$ (the "tile") and certain $N$, it is possible to cut $ABC$ into $N$ copies of $T$. It is known that only certain shapes of $T$ are possible, but until now very little was known…

Combinatorics · Mathematics 2024-05-30 Michael Beeson

We show $ 10/8$-type inequalities for some end-periodic $4$-manifolds which have positive scalar curvature metrics on the ends. As an application, we construct a new family of closed $4$-manifolds which do not admit positive scalar…

Differential Geometry · Mathematics 2021-06-29 Hokuto Konno , Masaki Taniguchi

In 2016, Dowden initiated the study of planar Tur\'an-type problems, which has since attracted considerable attention. Recently, Bekos et al. proved that every $K_3$-free $1$-planar graph on $n\ge 4$ vertices has at most $3n-6$ edges. In…

Combinatorics · Mathematics 2026-04-27 Licheng Zhang , Yuanqiu Huang , Fengming Dong

The number of domino tilings of a region with reflective symmetry across a line is combinatorially shown to depend on the number of domino tilings of particular subregions, modulo 4. This expands upon previous congruency results for domino…

Combinatorics · Mathematics 2009-05-12 Bridget Eileen Tenner