Related papers: Geometries with trialities arising from linear spa…
We describe symmetry structure of a general singular theory (theory with constraints in the Hamiltonian formulation), and, in particular, we relate the structure of gauge transformations with the constraint structure. We show that any…
Gravitational and electromagnetic interactions are Hamiltonian systems with forces between pairs of particles. We propose an alternative: Hamiltonian dynamics with triplet interactions between point particles. Our system has a potential…
The search for universality in random triangulations of manifolds, like those featuring in (Euclidean) Dynamical Triangulations, is central to the random geometry approach to quantum gravity. In case of the 3-sphere, or any other manifold…
We define flag structures on a real three manifold M as the choice of two complex lines on the complexified tangent space at each point of M. We suppose that the plane field defined by the complex lines is a contact plane and construct an…
We define a triangle design as a partition of the set of lines of a projective space into triangles, where a triangle consists of three pairwise intersecting lines with no common point. A triangle design is balanced if all points are…
In this work we study line arrangements consisting in lines passing through three non-aligned points. We call them triangular arrangements. We prove that any combinatorics of a triangular arrangement is always realized by a…
This is the first in a pair of articles that classify the configuration space and kinematic symmetry groups for $N$ identical particles in one-dimensional traps experiencing Galilean-invariant two-body interactions. These symmetries explain…
The spaces of triangulations of a given manifold have been widely studied. The celebrated theorem of Pachner~\cite{Pachner} says that any two triangulations of a given manifold can be connected by a sequence of bistellar moves, or Pachner…
We develop the basic and new tools for classifying non-side-to-side tilings of the sphere by congruent triangles. Then we prove that, if the triangle has any irrational angle in degree, such tilings are: a sequence of 1-parameter families…
An $N$-tiling of triangle $ABC$ by triangle $T$ (the `tile') is a way of writing $ABC$ as a union of $N$ copies of $T$ overlapping only at their boundaries. Let the tile $T$ have angles $(\alpha,\beta,\gamma)$, and sides $(a,b,c)$. This…
A trigraph is a graph where each pair of vertices is labelled either 0 (a non-arc), 1 (an arc) or $\star$ (both an arc and a non-arc). In a series of papers, Hell and co-authors proposed to study the complexity of homomorphisms from graphs…
In this thesis we analyze a very simple model of two dimensional quantum gravity based on causal dynamical triangulations (CDT). We present an exactly solvable model which indicates that it is possible to incorporate spatial topology…
This book is addressed to students, professors and researchers of geometry, who will find herein many interesting and original results. The originality of the book The Geometry of Homological Triangles consists in using the homology of…
Let $P$ be a set of $n$ points in the plane. A crossing-free structure on $P$ is a plane graph with vertex set $P$. Examples of crossing-free structures include triangulations of $P$, spanning cycles of $P$, also known as polygonalizations…
Many interesting geometric structures can be described as regular infinitesimal flag structures, which occur as the underlying structures of parabolic geometries. Among these structures we have for instance conformal structures, contact…
This article is concerned with the rigidity properties of geometric realizations of incidence geometries of rank two as points and lines in the Euclidean plane; we care about the distance being preserved among collinear points. We discuss…
A generic rectangulation is a partition of a rectangle into finitely many interior-disjoint rectangles, such that no four rectangles meet in a point. In this work we present a versatile algorithmic framework for exhaustively generating a…
We develop a full theoretical approach to clustering in complex networks. A key concept is introduced, the edge multiplicity, that measures the number of triangles passing through an edge. This quantity extends the clustering coefficient in…
There are four characteristic circles for each triangle on a plane. All for are tangential to the three straight lines containing the triangles' three sides. Three are exterior circles, the fourth is the in-circle. When the triangle is…
Stack triangulations appear as natural objects when defining an increasing family of triangulations by successive additions of vertices. We consider two different probability distributions for such objects. We represent, or "draw" these…