English
Related papers

Related papers: Tiling the field $\mathbb{Q}_p$ of $p$-adic number…

200 papers

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

A simple, yet unifying method is provided for the construction of tilings by tiles obtained from the attractor of an iterated function system (IFS). Many examples appearing in the literature in ad hoc ways, as well as new examples, can be…

Metric Geometry · Mathematics 2013-10-24 Michael Barnsley , Andrew Vince

Let $\Omega \subset \mathbb{R}$ be a compact set with measure $1$. If there exists a subset $\Lambda \subset \mathbb{R}$ such that the set of exponential functions $E_{\Lambda}:=\{e_\lambda(x) = e^{2\pi i \lambda x}|_\Omega :\lambda \in…

Classical Analysis and ODEs · Mathematics 2016-06-16 Debashish Bose , Shobha Madan

We study the problem of finding a function $f$ with ``small support'' that simultaneously tiles with finitely many lattices $\Lambda_1, \ldots, \Lambda_N$ in $d$-dimensional Euclidean spaces. We prove several results, both upper bounds…

Metric Geometry · Mathematics 2022-06-27 Mihail N. Kolountzakis , Effie Papageorgiou

In this paper, we study the structure of the set of tilings produced by any given tile-set. For better understanding this structure, we address the set of finite patterns that each tiling contains. This set of patterns can be analyzed in…

Other Computer Science · Computer Science 2008-02-21 Alexis Ballier , Bruno Durand , Emmanuel Jeandel

A dyadic tile of order n is any rectangle obtained from the unit square by n successive bisections by horizontal or vertical cuts. Let each dyadic tile of order n be available with probability p, independently of the others. We prove that…

Probability · Mathematics 2012-07-24 Omer Angel , Alexander E. Holroyd , Gady Kozma , Johan Wästlund , Peter Winkler

We construct an example of a group $G = \mathbb{Z}^2 \times G_0$ for a finite abelian group $G_0$, a subset $E$ of $G_0$, and two finite subsets $F_1,F_2$ of $G$, such that it is undecidable in ZFC whether $\mathbb{Z}^2\times E$ can be…

Combinatorics · Mathematics 2024-02-15 Rachel Greenfeld , Terence Tao

A combinatorial tiling of the sphere is naturally given by an embedded graph. We study the case that each tile has exactly five edges, with the ultimate goal of classifying combinatorial tilings of the sphere by geometrically congruent…

Combinatorics · Mathematics 2014-05-13 Min Yan

We study self-similar attractors in the space $\mathbb{R}^d$, i.e., self-similar compact sets defined by several affine operators with the same linear part. The special case of attractors when the matrix $M$ of the linear part of affine…

Metric Geometry · Mathematics 2021-02-03 Tatyana Zaitseva

In \cite{BCKM} it was shown that "Tiling implies Spectral" holds for a union of three intervals and the reverse implication was studied under certain restrictive hypotheses on the associated spectrum. In this paper, we reinvestigate the…

Classical Analysis and ODEs · Mathematics 2011-07-27 Debashish Bose , Shobha Madan

Suppose $f\in L^1(\mathbb{R}^d)$, $\Lambda\subset\mathbb{R}^d$ is a finite union of translated lattices such that $f+\Lambda$ tiles with a weight. We prove that there exists a lattice $L\subset{\mathbb{R}}^d$ such that $f+L$ also tiles,…

Combinatorics · Mathematics 2019-10-23 Bochen Liu

In this paper, we study tilings of $\mathbb Z$, that is, coverings of $\mathbb Z$ by disjoint sets (tiles). Let $T=\{d_1,\ldots, d_s\}$ be a given multiset of distances. Is it always possible to tile $\mathbb Z$ by tiles, for which the…

Combinatorics · Mathematics 2024-04-03 Andrey Kupavskii , Elizaveta Popova

We provide a more informal explanation of two results in our manuscript "Tilings of quadriculated annuli". Tilings of a quadriculated annulus $A$ are counted according to volume (in the formal variable q) and flux (in p). The generating…

Combinatorics · Mathematics 2009-09-25 Nicolau C. Saldanha , Carlos Tomei

In the 60's, Berger famously showed that translational tilings of $\mathbb{Z}^2$ with multiple tiles are algorithmically undecidable. Recently, Bhattacharya proved the decidability of translational monotilings (tilings by translations of a…

Combinatorics · Mathematics 2023-10-26 Rachel Greenfeld , Terence Tao

We call a set $K \subset {\mathbb R}^s$ with positive Lebesgue measure a {\it spectral set} if $L^2(K)$ admits an exponential orthonormal basis. It was conjectured that $K$ is a spectral set if and only if $K$ is a tile (Fuglede's…

Functional Analysis · Mathematics 2013-09-17 Xiaoye Fu , Xinggang He , Ka-Sing Lau

Let F be a number field and N an integral ideal in its ring of integers. Let f be a modular newform over F of level Gamma0(N) with rational Fourier coefficients. Under certain additional conditions, Guitart-Masdeu-Sengun constructed a…

Number Theory · Mathematics 2017-01-30 Xavier Guitart , Marc Masdeu

Let $\widetilde{\mathbb{Q}_p}$ be the field of $p$-adic numbers in the language of rings. In this paper we consider the theory of $\widetilde{\mathbb{Q}_p}$ expanded by two predicates interpreted by multiplicative subgroups…

Logic · Mathematics 2019-05-28 Nathanaël Mariaule

We present the stellar resolution, a "flexible" tile system based on Robinson's first-order resolution. After establishing formal definitions and basic properties of the stellar resolution, we show its Turing-completeness and to illustrate…

Logic in Computer Science · Computer Science 2022-07-19 Boris Eng , Thomas Seiller

It is well-known that the question of whether a given finite region can be tiled with a given set of tiles is NP-complete. We show that the same is true for the right tromino and square tetromino on the square lattice, or for the right…

Combinatorics · Mathematics 2007-05-23 Cristopher Moore , John Michael Robson

This short survey of recent work in tile self-assembly discusses the use of simulation to classify and separate the computational and expressive power of self-assembly models. The journey begins with the result that there is a single…

Computational Geometry · Computer Science 2013-09-06 Damien Woods
‹ Prev 1 4 5 6 7 8 10 Next ›