Results 11 to 20 of about 277,783 (271)
Journal of Statistical Physics, 2000 Tiling models are classical statistical models in which different geometric shapes, the tiles, are packed together such that they cover space completely.
Nienhuis, Bernard
core +6 more sources
Undecidable Translational Tilings with Only Two Tiles, or One Nonabelian Tile [PDF]
Discrete & Computational Geometry, 2023 AbstractWe construct an example of a group$$G = \mathbb {Z}^2 \times G_0$$G=Z2×G0for a finite abelian group $$G_0$$G0, a subsetEof $$G_0$$G0, and two finite subsets$$F_1,F_2$$F1,F2of G, such that it is undecidable in ZFC whether$$\mathbb {Z}^2\times E$$Z2×Ecan be tiled by translations of$$F_1,F_2$$F1,F2.
Rachel Greenfeld, Terence Tao
openaire +5 more sources
Transactions of the American Mathematical Society, 2012 The authors consider the golden Anosov automorphism \(G_A\) on the torus \(\mathbb{T}^2\), defined in such a way that the ratio of its unstable and stable eigenvalues is the golden number \((1+ \sqrt 5)/2\). They study the space \({\mathcal G}\) of all \(C^{1 + \alpha}\) diffeomorphisms that are topologically conjugate to \(G_A\) and possess an ...
Pinto, Alberto A. +2 more
openaire +5 more sources
The Electronic Journal of Combinatorics, 1996 Given a list $1\times 1, 1\times a, 1\times b, \dots, 1\times c$ of rectangles, with $a,b,\dots,c$ non-negative, when can $1\times{t}$ be tiled by positive and negative copies of rectangles which are similar (uniform scaling) to those in the list? We prove that such a tiling exists iff $t$ is in the field $Q(a,b,\dots,c)$.
Keating, Kevin, King, Jonathan L.
openaire +2 more sources
Journal of Symbolic Logic, 2001 AbstractWe 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 withKolmogorov complexity of its (n×n)-squares. We construct tile sets for which this bound is tight: all (n×n)-squares in all tilings have complexity Ω(n).
Durand, Bruno +2 more
openaire +4 more sources
The Mathematical Intelligencer, 2010 21 pages, 50 figures. Based on a Clay Public Lecture by the second author at the IAS/Park City Mathematics Institute in July, 2004.
Ardila, Federico, Stanley, Richard P.
openaire +4 more sources
Hard Tiling Problems with Simple Tiles [PDF]
Discrete & Computational Geometry, 2001 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 tromino alone. In the process, we show that Monotone 1-in-3 Satisfiability is NP-complete for planar cubic graphs.
Moore, C., Robson, J. M.
openaire +2 more sources
Cerâmica, 2012 X-ray fluorescence, themogravimetric-differential thermal analysis, Fourier Transform Infrared spectroscopy, X-ray diffraction, particle size analysis and Atterberg limits were used to study physico-chemical, mineralogical and thermal properties of two ...
C. Manoharan +3 more
doaj +1 more source
, 2014 Tiling is a well-known pattern mining technique. Traditionally, it discovers large areas of ones in binary databases or matrices, where an area is defined by a set of rows and a set of columns. In this paper, we introduce the novel problem of ranked tiling, which is concerned with finding interesting areas in ranked data. In this data, each transaction
Le Van, Thanh +5 more
openaire +2 more sources
SUPPLY –CHAIN AND LOGIC MODELS FOR THE TEXTILE AND CLOTHING COMPANIES [PDF]
Annals of the University of Oradea: Fascicle of Textiles, Leatherwork, 2014 The textile and clothing industry is characterized by specific supply-chain models with companies situated in a complex cluster type structure. Depending on the size, the volume and the variety of production, companies can be classified as follows: large
VISILEANU Emilia +4 more
doaj