Related papers: On Saxe's theorems about the complexity of the Dis…
We present a one-to-one correspondence between equivalence classes of embeddings of a manifold (into a larger manifold of the same dimension) and equivalence classes of certain distances on the manifold. This correspondence allows us to use…
Segre's theorem on ovals in projective spaces is an ingenious result from the mid-twentieth century which requires surprisingly little background to prove. This note, suitable for undergraduates with experience of linear and abstract…
In the following paper we continue the work of Bimonte-Lizzi-Sparano on distances on a one dimensional lattice. We succeed in proving analytically the exact formulae for such distances. We find that the distance to an even point on the…
Our main interest in this paper is chiefly concerned with the conditions characterizing \textit{orthogonal and symplectic abstract differential geometries}. A detailed account about the sheaf-theoretic version of the \textit{symplectic…
The concept of pseudo-distance-regularity around a vertex of a graph is a natural generalization, for non-regular graphs, of the standard distance-regularity around a vertex. In this note, we prove that a pseudo-distance-regular graph…
This text highlights issues present in the proof of Lemma 6.10 of the Baumgartner (1943 -- 2011) article "Almost disjoint sets, the dense set problem and the partition calculus" of 1976, and intends to present a correction at the same time…
The Cook-Reckhow 1979 paper defined the area of research we now call Proof Complexity. There were earlier papers which contributed to the subject as we understand it today, the most significant being Tseitin's 1968 paper, but none of them…
We study a large family of graph covering problems, whose definitions rely on distances, for graphs of bounded cyclomatic number (that is, the minimum number of edges that need to be removed from the graph to destroy all cycles). These…
In this work, the relativistic phenomena of Lorentz contraction and time dilation are derived using a modified distance formula appropriate for discrete space. This new distance formula is different than Pythagoras's theorem but converges…
In this work authors significantly improved previous estimates of the number of edges in subgraphs of the special distance graph.
In 2020, a paper [arXiv:2010.13443] appeared in the arXiv claiming to prove that a Moore graph of diameter 2 and degree 57 does not exist. (The paper is in Russian; we include a link to a translation of this paper kindly provided to us by…
The second author previously discussed how classical complexity separation conjectures, we call them "axioms", have implications in three manifold topology: polynomial length stings of operations which preserve certain Jones polynomial…
This note completes a talk given at the conference Curves over Finite Fields: past, present and future celebrating the publication the book {\em Rational Points on Curves over Finite Fields by J.-P. Serre and organised at Centro de ciencias…
We prove that if $P$ is a set of $n$ points in $\mathbb{C}^2$, then either the points in $P$ determine $\Omega(n^{1-\epsilon})$ complex distances, or $P$ is contained in a line with slope $\pm i$. If the latter occurs then each pair of…
Distances play important roles in cosmological observations, especially in gravitational lens systems, but there is a problem in determining distances because they are defined in terms of light propagation, which is influenced…
Contraction analysis considers the distance between two adjacent trajectories. If this distance is contracting, then trajectories have the same long-term behavior. The main advantage of this analysis is that it is independent of the…
By the methods of the synthetic geometry we investigate properties of objects generated from a complete quadrangle and a line, which lies in its plane. We start with a problem from the book of Sharygin "Problems in Plane Geometry". We…
We consider a problem posed by Erd\H{o}s, Herzog and Piranian on the maximum product of distances of a point set of order $n$ with a given diameter. We prove that it is sufficient to consider convex polygons and obtain results on the…
This text is the English translation, due to Naoufal Bouchareb, of an unpublished manuscript of 1969 (the French version is available on HAL as hal-00384928) inspired by Zariski's theory of saturation. Its publication is justified by the…
We revisit the minimum-link path problem: Given a polyhedral domain and two points in it, connect the points by a polygonal path with minimum number of edges. We consider settings where the vertices and/or the edges of the path are…