Related papers: Generic Unlabeled Global Rigidity

Let $T(n)$ denote the maximum number of unit distances that a set of $n$ points in the Euclidean plane $\mathbb{R}^2$ can determine with the additional condition that the distinct unit length directions determined by the configuration must…

In this article we obtain a rigid isotopy classification of generic pointed quartic curves $(A,p)$ in $\mathbb{R}\mathbb{P}^{2}$ by studying the combinatorial properties of dessins. The dessins are real versions, proposed by S. Orevkov, of…

Using the possibility of computationally determining points on a finite cover of a unirational variety over a finite field, we determine all possibilities for direct Gorenstein linkages between general sets of points in P^3 over an…

We describe the spectrum of an ergodic invariant measure by examining the behaviour of its generic points. We define regular Wiener--Wintner generic points for a measure to generalise the characterisation of generic points for discrete…

Fixed point theorems are one of the many tools used to prove existence and uniqueness of differential equations. When the data involved contains products of distributions, some of these tools may not be useful. Thus rises the necessity to…

A graph $G$ is $\textit{universal}$ for a (finite) family $\mathcal{H}$ of graphs if every $H \in \mathcal{H}$ is a subgraph of $G$. For a given family $\mathcal{H}$, the goal is to determine the smallest number of edges an…

Generalized distance-squared mappings are quadratic mappings of $\mathbb{R}^m$ into $\mathbb{R}^\ell$ of special type. In the case that matrices $A$ constructed by coefficients of generalized distance-squared mappings of $\mathbb{R}^2$ into…

A $d$-dimensional tensegrity framework $(T,p)$ is an edge-labeled geometric graph in ${\mathbb R}^d$, which consists of a graph $T=(V,B\cup C\cup S)$ and a map $p:V\to {\mathbb R}^d$. The labels determine whether an edge $uv$ of $T$…

Our main result states that every fixed-point free continuous self-map of ${\mathbb R}^{n}$ is colorable. This result can be re-formulated as follows: A continuous map $f: {\mathbb R}^{n}\to {\mathbb R}^{n}$ is fixed-point free iff…

A one-degree-of-freedom graph is a graph obtained from a minimally rigid graph in the plane and removing an edge. For such graph, the set of realisations with fixed edge length, modulo rotations and reflections, is an algebraic curve. The…

Let $G$ be a graph on $n$ nodes. In this note, we prove that if $G$ is $(r+1)$-vertex connected, $1 \leq r \leq n-2$, then there exists a configuration $p$ in general position in $R^r$ such that the bar framework $(G,p)$ is universally…

We study the problem of recovering a globally consistent Euclidean embedding of data, given only a local distance graph and propose a method that optimally represents these distances. The method operates solely on a neighborhood graph…

Motivated by the Cauchy-Davenport theorem for sumsets, and its interpretation in terms of Cayley graphs, we prove the following main result : There is a universal constant e > 0 such that, if G is a connected, regular graph on n vertices,…

Starting from an arbitrary sequence of polygons whose total perimeter is $2n$, we can build an (oriented) surface by pairing their sides in a uniform fashion. Chmutov and Pittel (arXiv:1503.01816) have shown that, regardless of the…

We provide a way of determining the infinitesimal rigidity of rod configurations realizing a rank two incidence geometry in the Euclidean plane. We model each rod with a cone over its point set and prove that the resulting geometric…

Getting inspired by the famous no-three-in-line problem and by the general position subset selection problem from discrete geometry, the same is introduced into graph theory as follows. A set $S$ of vertices in a graph $G$ is a general…

The computation of the dimension of linear systems of plane curves through a bunch of given multiple points is one of the most classic issues in Algebraic Geometry. In general, it is still an open problem to understand when the points fail…

The all-terminal reliability of a graph $G$ is the probability that $G$ remains connected when each edge fails independently with probability $p$. For fixed $n$ and $m$, the uniformly most reliable problem asks which graph with $n$ vertices…

The weight hierarchy of generalized Reed-Muller codes over arbitrary finite fields was determined by Heijnen and Pellikaan. In this paper we produce curves over finite fields with many points which are closely related to this weight…

We conjecture that a convex polytope is uniquely determined up to isometry by its edge-graph, edge lengths and the collection of distances of its vertices to some arbitrary interior point, across all dimensions and all combinatorial types.…