Related papers: A Generalized Cross Ratio
Given a Poisson process on a bounded interval, its random geometric graph is the graph whose vertices are the points of the Poisson process and edges exist between two points if and only if their distance is less than a fixed given…
The problem of maximizing the average cross section through a point within a shape is introduced. This idea is extended into arbitrary dimensions. However, the average cross sectional volume cannot be maximized unless the cross sections…
A generalized bridge is the law of a stochastic process that is conditioned on N linear functionals of its path. We consider two types of representations of such bridges: orthogonal and canonical. The orthogonal representation is…
We give a practical formula for counting irreducible nodal genus-three plane curves that a fixed generic complex structure on the normalization. As an intermediate step, we enumerate rational plane curves that have a $(3,4)$-cusp.
Let $\{P_1, P_2, P_3, P_4\}$ be a quadruplet of points in $S^3$ . We define a ``dual'' quadruplet of it in a conformal geometric way. We show that the dual of a dual quadruplet coincides with the original one. We also show that the cross…
The increasing demand for Fourier transforms on geometric algebras has resulted in a large variety. Here we introduce one single straight forward definition of a general geometric Fourier transform covering most versions in the literature.…
The crossing number of a graph is the minimum number of double points over all generic immersions of the graph into the plane. In this paper we investigate the behavior of crossing number under a graph transformation, called $\mathsf{\Delta…
The biplanar crossing number of a graph $G$ is the minimum number of crossings over all possible drawings of the edges of $G$ in two disjoint planes. We present new bounds on the biplanar crossing number of complete graphs and complete…
Kontsevich's formula is a recursion that calculates the number of rational degree $d$ curves in $\mathbb{P}_{\mathbb{C}}^2$ passing through $3d-1$ general positioned points. Kontsevich proved it by considering curves that satisfy extra…
We develop a general framework for reasoning about distances between transition systems with quantitative information. Taking as starting point an arbitrary distance on system traces, we show how this leads to natural definitions of a…
Fractional graph isomorphism is the linear relaxation of an integer programming formulation of graph isomorphism. It preserves some invariants of graphs, like degree sequences and equitable partitions, but it does not preserve others like…
Congruences, or $2$-parameter families of lines in $3$-space are of interest in many situations, in particular in geometric optics. In this paper we consider elements of their geometry which are invariant under affine changes of…
The paper explains how a unit generalized quaternion is used to represent a rotation of a vector in 3-dimensional space. We review of some algebraic properties of generalized quaternions and operations between them and then show their…
Let $\mathbb{F}_q$ be a field with $q$ elements. In this note, we study some generalized arcs, that is, sets of $\mathbb{F}_q$-points in the projective plane $\mathbb{P}^2(\mathbb{F}_q)$ such that no six of them are on a conic. First, we…
A \emph{complete geometric graph} consists of a set $P$ of $n$ points in the plane, in general position, and all segments (edges) connecting them. It is a well known question of Bose, Hurtado, Rivera-Campo, and Wood, whether there exists a…
An election over a finite set of candidates is called single-crossing if, as we sweep through the list of voters from left to right, the relative order of every pair of candidates changes at most once. Such elections have many attractive…
Let X be a (possibly nodal) K-trivial threefold moving in a fixed ambient space P. Suppose X contains a continuous family of curves, all of whose members satisfy certain unobstructedness conditions in P. A formula is given for computing the…
A graph is said to be globally rigid in $d$-dimensional space if almost all of its embeddings are unique up to isometries. If a graph has enough automorphisms to send any of its vertices into any other, then it is called vertex-transitive.…
The poster presents an analytic formalism describing metric properties of undirected random graphs with arbitrary degree distributions and statistically uncorrelated (i.e. randomly connected) vertices. The formalism allows to calculate the…
A geometric graph is a graph whose vertices are points in general position in the plane and its edges are straight line segments joining these points. In this paper we give an $O(n^2 \log n)$ algorithm to compute the number of pairs of…