Five-fold symmetry in crystalline quasicrystal lattices

To demonstrate that crystallographic methods can be applied to index and interpret diffraction patterns from well-ordered quasicrystals that display non-crystallographic 5-fold symmetry, we have characterized the properties of a series of periodic two-dimensional lattices built from pentagons, called Fibonacci pentilings, which resemble aperiodic Penrose tilings. The computed diffraction patterns from periodic pentilings with moderate size unit cells show decagonal symmetry and are virtually indistinguishable from that of the infinite aperiodic pentiling. We identify the vertices and centers of the pentagons forming the pentiling with the positions of transition metal atoms projected on the plane perpendicular to the decagonal axis of quasicrystals whose structure is related to crystalline η phase alloys. The characteristic length scale of the pentiling lattices, evident from the Patterson (autocorrelation) function, is ∼τ2 times the pentagon edge length, where τ is the golden ratio. Within this distance there are a finite number of local atomic motifs whose structure can be crystallographically refined against the experimentally measured diffraction data.

Long-range effects on optical absorption in quasiperiodic lattices

We consider exciton optical absorption in quasiperiodic lattices, focusing our attention on the Fibonacci case as a typical example. The absorption spectrum is evaluated by solving numerically the equation of motion of the Frenkel-exciton problem on the lattice, in which on-site energies take on two values according to the Fibonacci sequence. We find that the quasiperiodic order causes the occurrence of well-defined characteristic features in the absorption spectra. We also develop an analytical method that relates satellite lines with the Fourier pattern of the lattice. Our predictions can be used to determine experimentally the long-range quasiperiodic order from optical measurements.

Can fractal-like spectra be experimentally observed in aperiodic superlattices?

We numerically investigate the effects of inhomogeneities in the energy spectrum of aperiodic semiconductor superlattices, focusing our attention on Thue-Morse and Fibonacci sequences. In the absence of disorder, the corresponding electronic spectra are self-similar. The presence of a certain degree of randomness, due to imperfections occurring during the growth processes, gives rise to a progressive loss of quantum coherence, smearing out the finer details of the energy spectra predicted for perfect aperiodic superlattices and spurring the onset of electron localization. However, depending on the degree of disorder introduced, a critical size for the system exists, below which peculiar transport properties, related to the pre-fractal nature of the energy spectrum, may be measured.

LR property of non-well-formed scales

This article studies generated scales having exactly three different step sizes within the language of algebraic combinatorics on words. These scales and their corresponding step-patterns are called non well formed. We prove that they can be naturally inserted in the Christoffel tree of well-formed words. Our primary focus in this study is on the left- and right-Lyndon factorization of these words. We will characterize the non-well-formed words for which both factorizations coincide. We say that these words satisfy the LR property and show that the LR property is satisfied exactly for half of the non-well-formed words. These are symmetrically distributed in the extended Christoffel tree. Moreover, we find a surprising connection between the LR property and the Christoffel duality. Finally, we prove that there are infinitely many Christoffel–Lyndon words among the set of non-well-formed words and thus there are infinitely many generated scales having as step-pattern a Christoffel–Lyndon word.

Golden proportion: do divino à medicina dentária

Dissertação para obtenção do grau de Mestre no Instituto Superior de Ciências da Saúde Egas Moniz

Formal group laws and hypergraph colorings

Thesis (Ph.D.)--University of Washington, 2016-06

Decompositions of complete tripartite graphs into triangles with an edge attached

Let K(r, s, t) denote the complete tripartite graph with partite sets of size r, s and t, where r less than or equal to s less than or equal to t. Let D be the graph consisting of a triangle with an edge attached. We show that K(r, s, t) may be decomposed into copies of D if and only if 4 divides rs + st + rt and t less than or equal to 3rs/(r + s).

Balanced critical sets in Latin squares

In this note we first introduce balanced critical sets and near balanced critical sets in Latin squares. Then we prove that there exist balanced critical sets in the back circulant Latin squares of order 3n for n even. Using this result we decompose the back circulant Latin squares of order 3n, n even, into three isotopic and disjoint balanced critical sets each of size 3n. We also find near balanced critical sets in the back circulant Latin squares of order 3n for n odd. Finally, we examine representatives of each main class of Latin squares of order up to six in order to determine which main classes contain balanced or near balanced critical sets.

A census of critical sets in the Latin squares of order at most six

A critical set in a Latin square of order n is a set of entries from the square which can be embedded in precisely one Latin square of order n, Such that if any element of the critical set. is deleted, the remaining set can be embedded, in more than one Latin square of order n.. In this paper we find all the critical sets of different sizes in the Latin squares of order at most six. We count the number of main and isotopy classes of these critical sets and classify critical sets from the main classes into various strengths. Some observations are made about the relationship between the numbers of classes, particularly in the 6 x 6 case. Finally some examples are given of each type of critical set.

Common multiples of complete graphs and a 4-cycle

A graph G is a common multiple of two graphs H-1 and H-2 if there exists a decomposition of G into edge-disjoint copies of H-1 and also a decomposition of G into edge-disjoint copies of H-2. In this paper, we consider the case where H-1 is the 4-cycle C-4 and H-2 is the complete graph with n vertices K-n. We determine, for all positive integers n, the set of integers q for which there exists a common multiple of C-4 and K-n having precisely q edges. (C) 2003 Elsevier B.V. All rights reserved.

Cube factorizations of complete graphs

A cube factorization of the complete graph on n vertices, K-n, is a 3-factorization of & in which the components of each factor are cubes. We show that there exists a cube factorization of & if and only if n equivalent to 16 (mod 24), thus providing a new family of uniform 3 -factorizations as well as a partial solution to an open problem posed by Kotzig in 1979. (C) 2004 Wiley Periodicals, Inc.

On the forced matching numbers of bipartite graphs

Let G be a graph that admits a perfect matching. A forcing set for a perfect matching M of G is a subset S of M, such that S is contained in no other perfect matching of G. This notion has arisen in the study of finding resonance structures of a given molecule in chemistry. Similar concepts have been studied for block designs and graph colorings under the name defining set, and for Latin squares under the name critical set. There is some study of forcing sets of hexagonal systems in the context of chemistry, but only a few other classes of graphs have been considered. For the hypercubes Q(n), it turns out to be a very interesting notion which includes many challenging problems. In this paper we study the computational complexity of finding the forcing number of graphs, and we give some results on the possible values of forcing number for different matchings of the hypercube Q(n). Also we show an application to critical sets in back circulant Latin rectangles. (C) 2003 Elsevier B.V. All rights reserved.