Related papers: A Generalized Cross Ratio
The classical theory of the cross-ratio is a beautiful case study of the moduli of ordered points of the projective line and of invariants of the action of $PGL_2$. We generalize the theory of the cross-ratio to the setting of $S$-valued…
In this paper, we introduce a generalized concept of vertex transitivity in graphs called generalized vertex transitivity. We put forward a new invariant called transitivity number of a graph. The value of this invariant in different…
We introduce the triple crossing number, a variation of crossing number, of a graph, which is the minimal number of crossing points in all drawings with only triple crossings of the graph. It is defined to be zero for a planar graph, and to…
We define a family of four-point invariants for Shilov boundaries of bounded symmetric domains of tube type, which generalizes the classical four-point cross ratio on the unit circle. This generalization, which is based on a similar…
For a certain class of configurations of points in space, Eves' Theorem gives a ratio of products of distances that is invariant under projective transformations, generalizing the cross-ratio for four points on a line. We give a…
The crossing number of a graph is the minimum number of crossings over all of its drawings on the plane. The Crossing Lemma, proved more than 40 years ago, is a tight lower bound on the crossing number of a graph in terms of the number of…
A geometric graph is a graph embedded in the plane with vertices at points and edges drawn as curves (which are usually straight line segments) between those points. The average transversal complexity of a geometric graph is the number of…
The generalized distance matrix of a graph is the matrix whose entries depend only on the pairwise distances between vertices, and the generalized distance spectrum is the set of eigenvalues of this matrix. This framework generalizes many…
Consider a random geometric graph over a random point process in $\mathbb{R}^d$. Two points are connected by an edge if and only if their distance is bounded by a prescribed distance parameter. We show that projecting the graph onto a two…
The paper introduces cycles cross ratio, which extends the classic cross ratio of four points to various settings: conformal geometry, Lie spheres geometry, etc. Just like its classic counterpart cycles cross ratio is a measure of…
Consider a plane graph G, drawn with straight lines. For every pair a,b of vertices of G, we compare the shortest-path distance between a and b in G (with Euclidean edge lengths) to their actual distance in the plane. The worst-case ratio…
The main result is a wall crossing formula for central projections defined on submanifolds of a real projective space. Our formula gives the jump of the degree of such a projection when the center of the projection varies. The fact that the…
This paper introduces advances in the geometry of the transforms for cross ratio of four points in a line in the Desargues affine plane. The results given here have a clean, based Desargues affine plan axiomatic's and definitions of…
Cross-ratio degrees count configurations of points $z_1,\ldots, z_n \in \mathbb{P}^1$ satisfying $n - 3$ cross-ratio constraints, up to isomorphism. These numbers arise in multiple contexts in algebraic and tropical geometry, and may be…
A generalization of von Staudt's theorem that every permutation of the projective line that preserves harmonic quadruples is a projective semilinear map is given. It is then concluded that any proper supergroup of permutations of the…
A tripartite-circle drawing of a tripartite graph is a drawing in the plane, where each part of a vertex partition is placed on one of three disjoint circles, and the edges do not cross the circles. The tripartite-circle crossing number of…
Generalized dimensions of multifractal measures are usually seen as static objects, related to the scaling properties of suitable partition functions, or moments of measures of cells. When these measures are invariant for the flow of a…
The paper presents a new cross-ratio of hypercomplex numbers based on projective geometry. We discuss the essential properties of the projective cross-ratio, notably its invariance under Mobius transformations. Applications to the geometry…
In a simple drawing of a graph, any two edges intersect in at most one point (either a common endpoint or a proper crossing). A simple drawing is generalized twisted if it fulfills certain rather specific constraints on how the edges are…
When considering geometry, one might think of working with lines and circles on a flat plane as in Euclidean geometry. However, doing geometry in other spaces is possible, as the existence of spherical and hyperbolic geometry demonstrates.…