English
Related papers

Related papers: Necessary conditions for tiling finitely generated…

200 papers

We prove that for any infinite countable amenable group $G$, any $\epsilon > 0$ and any finite subset $K\subset G$, there exists a tiling (partition of $G$ into finite "tiles" using only finitely many "shapes"), where all the tiles are $(K;…

Group Theory · Mathematics 2015-02-10 Tomasz Downarowicz , Dawid Huczek , Guohua Zhang

We establish a sufficient condition for a finitely generated pro-$p$ group to be accessible in terms of finite generation of the module of ends.

Group Theory · Mathematics 2020-07-16 Gareth Wilkes

A set is said to tile the integers if and only if the integers can be written as a disjoint union of translates of that set. We consider the problem of finding necessary and sufficient conditions for a finite set to tile the integers. For…

Combinatorics · Mathematics 2007-05-23 Ethan M. Coven , Aaron D. Meyerowitz

Deciding if a given set of Wang tiles admits a tiling of the plane is decidable if the number of Wang tiles (or the number of colors) is bounded, for a trivial reason, as there are only finitely many such tilesets. We prove however that the…

Formal Languages and Automata Theory · Computer Science 2012-08-15 Emmanuel Jeandel , Nicolas Rolin

We prove that any finite set $F\subset {\mathbb{Z}^2}$ that tiles ${\mathbb{Z}^2}$ by translations also admits a periodic tiling. As a consequence, the problem whether a given finite set $F$ tiles ${\mathbb{Z}^2}$ is decidable.

Combinatorics · Mathematics 2016-02-19 Siddhartha Bhattacharya

One of the most fundamental problems in tiling theory is the domino problem: given a set of tiles and tiling rules, decide if there exists a way to tile the plane using copies of tiles and following their rules. The problem is known to be…

Discrete Mathematics · Computer Science 2024-02-08 Nathalie Aubrun , Manon Blanc , Olivier Bournez

Motivated by applications in reliable and secure communication, we address the problem of tiling (or partitioning) a finite constellation in $\mathbb{Z}_{2^L}^n$ by subsets, in the case that the constellation does not possess an abelian…

Information Theory · Computer Science 2021-05-13 Maiara F. Bollauf , Øyvind Ytrehus

We study fundamental groups of non compact Riemannian manifolds. We find conditions which ensure that the fundamental group is trivial, finite or finitely generated.

Differential Geometry · Mathematics 2007-05-23 Nader Yeganefar

We show that under certain conditions the Gelfand-Kazhdan criterion for the Gelfand property is a necessary condition. We work in the generality of finite groups, however part of the argument carries over to p-adic and real groups.

Representation Theory · Mathematics 2020-09-10 Avraham Aizenbud

The finiteness problem for automaton groups and semigroups has been widely studied, several partial positive results are known. However we prove that, in the most general case, the problem is undecidable. We study the case of automaton…

Formal Languages and Automata Theory · Computer Science 2014-03-21 Pierre Gillibert

In this paper we study algorithms for tiling problems. We show that the conditions $(T1)$ and $(T2)$ of Coven and Meyerowitz, conjectured to be necessary and sufficient for a finite set $A$ to tile the integers, can be checked in time…

Number Theory · Mathematics 2008-10-27 Mihail N. Kolountzakis , Mate Matolcsi

Necessary and sufficient conditions for a group to possess a faithful irreducible representation are investigated

Representation Theory · Mathematics 2016-11-01 Fernando Szechtman , Anatoliy Tushev

We obtain structural results on translational tilings of periodic functions in $\mathbb{Z}^d$ by finite tiles. In particular, we show that any level one tiling of a periodic set in $\mathbb{Z}^2$ must be weakly periodic (the disjoint union…

Classical Analysis and ODEs · Mathematics 2021-09-27 Rachel Greenfeld , Terence Tao

We develop a method to study sufficient conditions for perfect mixed tilings. Our framework allows the embedding of bounded degree graphs $H$ with components of sublinear order. As a corollary, we recover and extend the work of K\"uhn and…

Combinatorics · Mathematics 2024-10-24 Eoin Hurley , Felix Joos , Richard Lang

We establish conditions under which the fundamental group of a graph of finite $p$-groups is necessarily residually $p$-finite. The technique of proof is independent of previously established results of this type, and the result is also…

Group Theory · Mathematics 2018-11-01 Gareth Wilkes

In this paper, we introduce a necessary condition for the existence of characteristic zero liftings of certain smooth, proper varieties in positive characteristic, using etale homotopy theory and Wall's finiteness obstruction. For a variety…

Algebraic Topology · Mathematics 2025-09-19 Ruida Di , Runjie Hu , Siqing Zhang

The following theorem is proved: Let $G$ be a finite group and $\pi_e(G)$ be the set of element orders in $G$. If $\pi_e(G) \cap \{2\}=\emptyset$; or $\pi_e(G) \cap \{3, 4\}=\emptyset$; or $\pi_e(G) \cap \{3,5\}=\emptyset$, then $G$ is…

Group Theory · Mathematics 2017-04-06 Wujie Shi

We continue our work on the model theory of free lattices, solving two of the main open problems from our first paper on the subject. Our main result is that the universal (existential) theory of infinite free lattices is decidable. Our…

Logic · Mathematics 2025-12-16 J. B. Nation , Gianluca Paolini

We find necessary and sufficient conditions for the finite separability of monogenic rings. As a corollary, we prove that a finitely generated torsion-free PI-ring is finitely separable if and only if its additive group is finitely…

Rings and Algebras · Mathematics 2023-10-03 Stanislav Kublanovsky

A particular, two-dimensional, tiling model, composed by the so called Wang tiles has been studied at finite temperature by Monte Carlo numerical simulations. In absence of any thermal bath the Wang tiles give the opportunity of building a…

Disordered Systems and Neural Networks · Physics 2009-10-31 L. Leuzzi , G. Parisi
‹ Prev 1 2 3 10 Next ›