English
Related papers

Related papers: Distances between realizations of order types

200 papers

Consider a string of $n$ positions, i.e. a discrete string of length $n$. Units of length $k$ are placed at random on this string in such a way that they do not overlap, and as often as possible, i.e. until all spacings between neighboring…

Probability · Mathematics 2007-05-23 Chris A. J. Klaassen , J. Theo Runnenburg

There are several notions of duality between lines and points. In this note, it is shown that all these can be studied in a unified way. Most interesting properties are independent of specific choices. It is also shown that either dual…

Computational Geometry · Computer Science 2025-08-22 Sanjeev Saxena

We determine the maximal number of steps required to sort $n$ labeled points on a circle by adjacent swaps. Lower bounds for sorting by all swaps, not necessarily adjacent, are given as well.

Combinatorics · Mathematics 2025-08-07 Ron M. Adin , Noga Alon , Yuval Roichman

Given a code from a shift space to an irreducible sofic shift, any two of the following three conditions -- open, constant-to-one, (right or left) closing -- imply the third. If the range is not sofic, then the same result holds when…

Dynamical Systems · Mathematics 2009-09-24 Uijin Jung

A polynomial transformation of the real plane $\Bbb R^2$ is a mapping $\Bbb R^2\to\Bbb R^2$ given by two polynomials of two variables. Such a transformation is called cubic if the degrees of its polynomials are not greater than three. In…

Algebraic Geometry · Mathematics 2015-08-20 Ruslan Sharipov

The concept of natural pseudo-distance has proven to be a powerful tool for measuring the dissimilarity between topological spaces endowed with continuous real-valued functions. Roughly speaking, the natural pseudo-distance is defined as…

Differential Geometry · Mathematics 2009-06-26 Andrea Cerri , Barbara Di Fabio

Suppose that all groups of order $n$ are defined on the same set $G$ of cardinality $n$, and let the \emph{distance} of two groups of order $n$ be the number of pairs $(a,b)\in G\times G$ where the two group operations differ. Given a group…

Group Theory · Mathematics 2015-09-21 Petr Vojtěchovský , Ian M. Wanless

Consider a set $X\subseteq \mathbb{R}^d$ which is 1-dense, namely, it intersects every unit ball. We show that we can get from any point to any other point in $\mathbb{R}^d$ in $n$ steps so that the intermediate points are in $X$, and the…

Combinatorics · Mathematics 2023-11-03 Endre Csóka

In this paper we show that the number of distinct distances determined by a set of $n$ points on a constant-degree two-dimensional algebraic variety $V$ (i.e., a surface) in $\mathbb R^3$ is at least $\Omega\left(n^{7/9}/{\rm polylog}…

Combinatorics · Mathematics 2016-04-07 Micha Sharir , Noam Solomon

We provide an upper bound on the number of ordered Reidemeister moves required to pass between two diagrams of the same link. This bound is in terms of the number of unordered Reidemeister moves required.

Geometric Topology · Mathematics 2014-10-01 Julian Gold

We show that there are sets of $n$ points in the plane with $n$ arbitrarily large that contain more than $n^{1.014}$ pairs of points separated by a distance exactly $1$. This improves on very recent work of a team at OpenAI, who proved the…

Combinatorics · Mathematics 2026-05-21 Will Sawin

For a pair of points in a smooth locally convex surface in 3-space, its mid-plane is the plane containing its mid-point and the intersection line of the corresponding pair of tangent planes. In this paper we show that the limit of…

Differential Geometry · Mathematics 2017-05-08 Ady Cambraia Junior , Marcos Craizer

We define a concept which we call multiplicity. First, multiplicity of a morphism is defined. Then the multiplicity of an object over another object is defined to be the minimum of the multiplicities of all morphisms from one to another.…

Category Theory · Mathematics 2015-03-17 Kouki Taniyama

We consider the curves whose all normal planes are at the same distance from a fixed point and obtain some characterizations of them in the 3-dimensional Euclidean space.

General Mathematics · Mathematics 2016-05-12 Yasemin Alagoz

Let P_1 and P_2 be two sets of points in the plane, so that P_1 is contained in a line L_1, P_2 is contained in a line L_2, and L_1 and L_2 are neither parallel nor orthogonal. Then the number of distinct distances determined by the pairs…

Combinatorics · Mathematics 2013-06-04 Micha Sharir , Adam Sheffer , József Solymosi

We propose a geometric method for quantifying the difference between parametrized curves in Euclidean space by introducing a distance function on the space of parametrized curves up to rigid transformations (rotations and translations).…

Differential Geometry · Mathematics 2014-09-12 Jaap Eldering , Joris Vankerschaver

We consider the problem of upper bounding the number of circular transpositions needed to sort a permutation. It is well known that any permutation can be sorted using at most $n(n-1)/2$ adjacent transpositions. We show that, if we allow…

Discrete Mathematics · Computer Science 2014-02-21 Anke van Zuylen , James Bieron , Frans Schalekamp , Gexin Yu

A solvable many-body problem in the plane is exhibited. It is characterized by rotation-invariant Newtonian (``acceleration equal force'') equations of motion, featuring one-body (``external'') and pair (``interparticle'') forces. The…

Mathematical Physics · Physics 2015-06-26 Francesco Calogero

Given a fixed number field K, we give non-trivial lower bounds for the distance between the conjugates of any number a from K in terms of the Mahler measure M(a) of a. In the case that K is a cubic field, our bound is best possible in terms…

Number Theory · Mathematics 2023-09-19 Jan-Hendrik Evertse

A knot K in 1-bridge position with respect to a genus-g Heegaard surface in a 3-manifold can be moved by isotopy through knots in 1-bridge position until it lies in a union of n parallel genus-g surfaces tubed together by n-1 straight…

Geometric Topology · Mathematics 2009-01-13 Sangbum Cho , Darryl McCullough , Arim Seo