Results 21 to 30 of about 105,118 (315)
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
Tilings and tiling systems are an abstract concept that arise both as a computational model and as a dynamical system. In this paper, we characterize the sets of periods that a tiling system can produce. We prove that up to a slight recoding, they correspond exactly to languages in the complexity classes $\nspace{n}$ and $\cne$.
Jeandel, Emmanuel, Vanier, Pascal
openaire +2 more sources
Effect of Injecting Epoxy Resin Adhesive into Cement Mortar on Tile Adhesion Performance
Large porcelain tiles have attracted increased demand owing to their cost-effectiveness and superior esthetics. Here, an epoxy resin adhesive was injected into cement mortar, which was then applied to tiles.
Sangkyu Lee +6 more
doaj +1 more source
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)$.
Kevin Keating, Jonathan L. King
openaire +2 more sources
The HL-LHC Upgrade of the ATLAS hadronic Tile Calorimeter
The High-Luminosity phase of LHC, scheduled to begin in late 2027, will deliver five times the LHC nominal instantaneous luminosity to the experiments. To ensure sound performance under the higher pile-up and radiation conditions, the ATLAS hadronic Tile
ATLAS Tile Collaboration
core +2 more sources
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
Hard Tiling Problems with Simple Tiles [PDF]
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.
Cristopher Moore, J. M. Robson
openaire +2 more sources
Formulated New Identities of Fibonacci Numbers with James Abacus Diagram
This paper focuses on developing a strategy to represent a new Fibonacci identity using James abacus. The idea of a Graphical chain with respect to the beta numbers and abacus was established to count the number of ways to tile a James diagram chain ...
Eman F. Mohommed
doaj +1 more source
Beginning in the eighteenth century, French manufacturers of ceramic products were largely present in the Argentinian market. In the nineteenth century, as Buenos Aires experienced high levels of urban growth, Argentinian developers relied ever more ...
Thibault Bechini
doaj +1 more source

