Related papers: Triangular dissections, aperiodic tilings and Jone…
A dissection of a convex d-polytope is a partition of the polytope into d-simplices whose vertices are among the vertices of the polytope. Triangulations are dissections that have the additional property that the set of all its simplices…
Aperiodic tilings are non-periodic tilings defined by local rules. They are widely used to model quasicrystals, and a central question is to understand which of the non-periodic tilings are actually aperiodic. Among tilings, those by rhombi…
For a finite-dimensional gentle algebra, it is already known that the functorially finite torsion classes of its category of finite-dimensional modules can be classified using a combinatorial interpretation, called maximal non-crossing sets…
Consider a plane branch, that is, an irreducible germ of curve on a smooth complex analytic surface. We define its blow-up complexity as the number of blow-ups of points necessary to achieve its minimal embedded resolution. We show that…
A dyadic tile of order n is any rectangle obtained from the unit square by n successive bisections by horizontal or vertical cuts. Let each dyadic tile of order n be available with probability p, independently of the others. We prove that…
We consider the set of all 2-step recurrences (difference equations) that are given by linear fractional maps. These give birational maps of the plane. We determine the degree growth of these birational maps. We find the all the maps in…
Symmetrically self-similar graphs are an important type of fractal graph. Their Green functions satisfy order one iterative functional equations. We show when the branching number of a generating cell is two, either the graph is a star…
We develop a recursive formula for counting the number of rectangulations of a square, i.e the number of combinatorially distinct tilings of a square by rectangles. Our formula specializes to give a formula counting generic rectangulations,…
The chapter presents mathematical models intended for creating a topological drawing of a non-separable non-planar graph based on the methods of G. Ringel's vertex rotation theory. The induced system of cycles generates a topological…
A simple graph is called triangular if every edge of it belongs to a triangle. We conjecture that any graphical degree sequence all terms of which are greater than or equal to 4 has a triangular realisation, and establish this conjecture…
We customize the existing models for the bounded derived category of gentle algebras to obtain simple graph theoretic tools to analyze indecomposable objects, Auslander-Reiten triangles, and their interaction with the associated homological…
Fractal geometry, defined by self-similar patterns across scales, is crucial for understanding natural structures. This work addresses the fractal inverse problem, which involves extracting fractal codes from images to explain these…
Divisibility sequences are defined by the property that their elements divide each other whenever their indices do. The divisibility sequences that also satisfy a linear recurrence, like the Fibonacci numbers, are generated by polynomials…
In this paper, we study the structure of the set of tilings produced by any given tile-set. For better understanding this structure, we address the set of finite patterns that each tiling contains. This set of patterns can be analyzed in…
Every triangle-free planar graph on n vertices has an independent set of size at least (n+1)/3, and this lower bound is tight. We give an algorithm that, given a triangle-free planar graph G on n vertices and an integer k>=0, decides…
It is well-known that the triangulations of the disc with $n+2$ vertices on its boundary are counted by the $n$th Catalan number $C(n)=\frac{1}{n+1}{2n \choose n}$. This paper deals with the generalisation of this problem to any arbitrary…
There is a natural construction which associates to a finitely generated, countable, discrete group $G$ and a 3-cocycle $\omega$ of $G$ an inclusion of II$_1$ factors, the so-called diagonal subfactors (with cocycle). In the case when the…
In this paper, we propose new understandings for recently discovered hidden zeros and novel splittings, by utilizing Feynman diagrams. The study focus on ordered tree level amplitudes of three theories, which are ${\rm Tr}(\phi^3)$,…
We study fishnet Feynman diagrams defined by a certain triangulation of a planar n-gon, with massless scalars propagating along and across the cuts. Our solution theory uses the technique of Separation of Variables, in combination with the…
The regular 2n-gon (square, hexagon, octagon, ...) is subdivided into smaller polygons (tiles) by the subset of diagonals which run parallel to any of the 2n sides. The manuscript reports on the number of tiles up to the 78-gon.