English
Related papers

Related papers: Planar coincidences for N-fold symmetry

200 papers

Planar coincidence site lattices and modules with N-fold symmetry are well understood in a formulation based on cyclotomic fields, in particular for the class number one case, where they appear as certain principal ideals in the…

Metric Geometry · Mathematics 2007-05-23 Michael Baake , Uwe Grimm

The relationship between the coincidence indices of a lattice $\Gamma_1$ and a sublattice $\Gamma_2$ of $\Gamma_1$ is examined via the colouring of $\Gamma_1$ that is obtained by assigning a unique colour to each coset of $\Gamma_2$. In…

Metric Geometry · Mathematics 2013-02-21 Manuel Joseph C. Loquias , Peter Zeiner

The investigation of colour symmetries for periodic and aperiodic systems consists of two steps. The first concerns the computation of the possible numbers of colours and is mainly combinatorial in nature. The second is algebraic and…

Disordered Systems and Neural Networks · Physics 2007-05-23 Michael Baake , Uwe Grimm , Max Scheffer

The first step in investigating colour symmetries for periodic and aperiodic systems is the determination of all colouring schemes that are compatible with the symmetry group of the underlying structure, or with a subgroup of it. For an…

Combinatorics · Mathematics 2007-05-23 Michael Baake , Uwe Grimm

A first step in investigating colour symmetries of periodic and nonperiodic patterns is determining the number of colours which allow perfect colourings of the pattern under consideration. A perfect colouring is one where each symmetry of…

Combinatorics · Mathematics 2008-07-30 Dirk Frettlöh

Computing modular coincidences can show whether a given substitution system, which is supported on a point lattice in R^d, consists of model sets or not. We prove the computatibility of this problem and determine an upper bound for the…

Metric Geometry · Mathematics 2008-03-11 D. Frettlöh , B. Sing

A submodule of a $\mathbb{Z}$-module determines a coloring of the module where each coset of the submodule is associated to a unique color. Given a submodule coloring of a $\mathbb{Z}$-module, the group formed by the symmetries of the…

Metric Geometry · Mathematics 2017-04-11 Manuel Joseph C. Loquias , Lilibeth D. Valdez , Ma. Lailani B. Walo

It is shown that the coincidence isometries of certain modules in Euclidean $n$-space can be decomposed into a product of at most $n$ coincidence reflections defined by their non-zero elements. This generalizes previous results obtained for…

Metric Geometry · Mathematics 2009-08-05 Christian Huck

Even though a lattice and its sublattices have the same group of coincidence isometries, the coincidence index of a coincidence isometry with respect to a lattice $\Lambda_1$ and to a sublattice $\Lambda_2$ may differ. Here, we examine the…

Metric Geometry · Mathematics 2015-12-02 Manuel Joseph C. Loquias , Peter Zeiner

Can you decide if there is a coincidence in the numbers counting two different combinatorial objects? For example, can you decide if two regions in $\mathbb{R}^3$ have the same number of domino tilings? There are two versions of the…

Combinatorics · Mathematics 2024-09-16 Swee Hong Chan , Igor Pak

Discrete point sets $\mathcal{S}$ such as lattices or quasiperiodic Delone sets may permit, beyond their symmetries, certain isometries $R$ such that $\mathcal{S}\cap R\mathcal{S}$ is a subset of $\mathcal{S}$ of finite density. These are…

Metric Geometry · Mathematics 2007-05-23 Michael Baake

The problem of computing the index of a coincidence isometry of the hyper cubic lattice $\mathbb{Z}^{n}$ is considered. The normal form of a rational orthogonal matrix is analyzed in detail, and explicit formulas for the index of certain…

Group Theory · Mathematics 2007-05-23 Yi Ming Zou

We consider the coincidence problem for the square lattice that is translated by an arbitrary vector. General results are obtained about the set of coincidence isometries and the coincidence site lattices of a shifted square lattice by…

Metric Geometry · Mathematics 2013-02-21 Manuel Joseph C. Loquias , Peter Zeiner

The groups of (linear) similarity and coincidence isometries of certain modules in d-dimensional Euclidean space, which naturally occur in quasicrystallography, are considered. It is shown that the structure of the factor group of…

Group Theory · Mathematics 2019-08-15 Svenja Glied

An effective way to design structured coherent wave interference patterns that builds on the theory of coherent lattices, is presented. The technique combines prime number factorization in the complex plane with moir\'e theory to provide a…

Pattern Formation and Solitons · Physics 2020-11-19 Dmitry Kouznetsov , Qingzhong Deng , Pol Van Dorpe , Niels Verellen

The structure of the coincidence symmetry group of an arbitrary $n$-dimensional lattice in the $n$-dimensional Euclidean space is considered by describing a set of generators. Particular attention is given to the coincidence isometry…

Group Theory · Mathematics 2007-05-23 Yi Ming Zou

The coincidence site lattice (CSL) problem and its generalization to Z-modules in Euclidean 3-space is revisited, and various results and conjectures are proved in a unified way, by using maximal orders in quaternion algebras of class…

Metric Geometry · Mathematics 2008-01-19 Michael Baake , Peter Pleasants , Ulf Rehmann

Recently, Bern et al observed that a certain class of next-to-planar Feynman integrals possess a bonus symmetry that is closely related to dual conformal symmetry. It corresponds to a projection of the latter along a certain lightlike…

High Energy Physics - Theory · Physics 2018-09-26 Dmitry Chicherin , Johannes M. Henn , Emery Sokatchev

A geometric study of twin and grain boundaries in crystals and quasicrystals is achieved via coincidence site lattices (CSLs) and coincidence site modules (CSMs), respectively. Recently, coincidences of shifted lattices and multilattices…

Metric Geometry · Mathematics 2014-08-19 Jeanine Concepcion H. Arias , Evelyn D. Gabinete , Manuel Joseph C. Loquias

Edge-matching problems, also called edge matching puzzles, are abstractions of placement problems with neighborhood conditions. Pieces with colored edges have to be placed on a board such that adjacent edges have the same color. The problem…

Data Structures and Algorithms · Computer Science 2017-03-29 Martin Ebbesen , Paul Fischer , Carsten Witt
‹ Prev 1 2 3 10 Next ›