Related papers: Triangular fractal approximating graphs and their …
The pinwheel triangle of Conway and Radin is a standard example for tilings with self-similarity and statistical circular symmetry. Many modifications were constructed, all based on partitions of triangles or rectangles. The fractal example…
The recently developed concept of refracting profiles and that of refraction holodiagrams are combined so that the classical Abramson holodiagrams can be generalized taking into account a wider class of wave fronts and refraction at an…
High triangle density -- the graph property stating that a constant fraction of two-hop paths belong to a triangle -- is a common signature of social networks. This paper studies triangle-dense graphs from a structural perspective. We prove…
We propose that the phases of all vicinal surfaces can be characterized by four fixed lines, in the renormalization group sense, in a three-dimensional space of coupling constants. The observed configurations of several Si surfaces are…
To any finite simplicial complex X, we associate a natural filtration starting from Chari and Joswig's discrete Morse complex and abutting to the matching complex of X. This construction leads to the definition of several homology theories,…
A classification is given for factorizations of almost simple groups with at least one factor solvable, and it is then applied to characterize $s$-arc-transitive Cayley graphs of solvable groups, leading to a striking corollary: Except the…
We examine domino tilings of rectangular boards, which are in natural bijection with perfect matchings of grid graphs. This leads to the study of their associated perfect matching polytopes, and we present some of their properties, in…
Graphs are a central object of study in various scientific fields, such as discrete mathematics, theoretical computer science and network science. These graphs are typically studied using combinatorial, algebraic or probabilistic methods,…
The permutation associated with the decimal expression of the binary reflected Gray code with $N$ bits is considered. Its cycle structure is studied. Considered as a set of points, its self-similarity is pointed out. As a fractal, it is…
The mapping class group of a closed surface of genus $g$ is an extension of the Torelli group by the symplectic group. This leads to two natural problems: (a) compute (stably) the symplectic decomposition of the lower central series of the…
The paper deals with Henselian valued field with analytic structure. Actually, we are focused on separated analytic structures, but the results remain valid for strictly convergent analytic ones as well. A classical example of the latter is…
We determine asymptotically the two extremal constructions for the tiling problem of the $H$-shaped tree. In particular, the first extremal construction is close to the complement of two cliques, in contrast to previously studied bipartite…
This work studies certain aspects of graphs embedded on surfaces. Initially, a colored graph model for a map of a graph on a surface is developed. Then, a concept analogous to (and extending) planar graph is introduced in the same spirit as…
Edge-to-edge tilings of the sphere by congruent quadrilaterals are completely classified in a series of three papers. This second one applies the powerful tool of trigonometric Diophantine equations to classify the case of…
We present an unified approach on the behavior of two random growth models (external DLA and internal DLA) on infinite graphs, the second one being an internal counterpart of the first one. Even though the two models look pretty similar,…
In a search for triangle-free graphs with arbitrarily large chromatic numbers, Mycielski developed a graph transformation that transforms a graph into a new graph which is called the Mycielskian of that graph. In this paper we provide some…
In this paper we consider the concept of preintersection numbers of a graph. These numbers are determined by the spectrum of the adjacency matrix of the graph, and generalize the intersection numbers of a distance-regular graph. By using…
We generalise a fundamental graph-theoretical fact, stating that every element of the cycle space of a graph is a sum of edge-disjoint cycles, to arbitrary continua. To achieve this we replace graph cycles by topological circles, and…
We consider the dynamics of light rays in triangle tilings where triangles are transparent and adjacent triangles have equal but opposite indices of refraction. We find that the behavior of a trajectory on a triangle tiling is described by…
Self-similar sets with open set condition, the linear objects of fractal geometry, have been considered mainly for crystallographic data. Here we introduce new symmetry classes in the plane, based on rotation by irrational angles. Examples…