Results 21 to 30 of about 69,230 (236)
A short guide to pure point diffraction in cut-and-project sets [PDF]
We briefly review the diffraction of quasicrystals and then give an elementary alternative proof of the diffraction formula for regular cut-and-project sets, which is based on Bochner's theorem from Fourier analysis. This clarifies a common view that the
Richard, Christoph, Strungaru, Nicolae
core +3 more sources
A cut-and-project perspective for linearized Bregman iterations [PDF]
The linearized Bregman iterations (LBreI) and its variants are powerful tools for finding sparse or low-rank solutions to underdetermined linear systems.
Zhang, Hui, Deng, Kangkang, Dai, Yu-Hong
core +4 more sources
Cut‐and‐project quasicrystals, lattices and dense forests [PDF]
This version includes a picture provided by the referee and a subsection relating the theory developed in this paper to the properties of twisted bilayer graphene in ...
Adiceam, Faustin +2 more
openaire +3 more sources
The Meyer property of cut-and-project sets [PDF]
Summary: We consider cut-and-project sets \(\Sigma(\Omega)\) with compact acceptance window \(\Omega\subset\mathbb{R}^d\). It is known that \(\Sigma(\Omega)\) satisfies the Meyer property, i.e., it is a Delone set and there exists a finite set \(F\) such that \(\Sigma(\Omega)-\Sigma (\Omega)\subset \Sigma(\Omega) +F\). The investigation of the set \(F\)
Balková, L'ubomíra +2 more
openaire +2 more sources
Complexity and cohomology for cut-and-projection tilings [PDF]
AbstractWe consider a subclass of tilings: the tilings obtained by cut-and-projection. Under somewhat standard assumptions, we show that the natural complexity function has polynomial growth. We compute its exponentαin terms of the ranks of certain groups which appear in the construction. We give bounds forα. These computations apply to some well-known
openaire +3 more sources
Quasicrystal Tilings in Three Dimensions and Their Empires
The projection method for constructing quasiperiodic tilings from a higher dimensional lattice provides a useful context for computing a quasicrystal’s vertex configurations, frequencies, and empires (forced tiles).
Dugan Hammock, Fang Fang, Klee Irwin
doaj +1 more source
Non-Local Game of Life in 2D Quasicrystals
On a two-dimensional quasicrystal, a Penrose tiling, we simulate for the first time a game of life dynamics governed by non-local rules. Quasicrystals have inherently non-local order since any local patch, the emperor, forces the existence of a large ...
Fang Fang +3 more
doaj +1 more source
Sharp density discrepancy for cut and project sets an approach via lattice point counting [PDF]
Cut and project sets are obtained by taking an irrational slice of a lattice and projecting it to a lower dimensional subspace. We seek to quantify fluctuations from the asymptotic mean for point counts.
Koivusalo, Henna L L +9 more
core +5 more sources
The CUT&RUN suspect list of problematic regions of the genome
Background Cleavage Under Targets and Release Using Nuclease (CUT&RUN) is an increasingly popular technique to map genome-wide binding profiles of histone modifications, transcription factors, and co-factors.
Anna Nordin +3 more
doaj +1 more source
Cut-and-project quasicrystals, lattices, and dense forests
Dense forests are discrete subsets of Euclidean space which are uniformly close to all sufficiently long line segments. The degree of density of a dense forest is measured by its visibility function.
Solomon, Yaar +2 more
core +7 more sources

