Related papers: Rational distance sets on a parabola using Pythago…

Let $X$ be an algebraic variety, defined over the rationals. This paper gives upper bounds for the number of rational points on $X$, with height at most $B$, for the case in which $X$ is a curve or a surface. In the latter case one excludes…

This work proposes an algorithm to bound the minimum distance between points on trajectories of a dynamical system and points on an unsafe set. Prior work on certifying safety of trajectories includes barrier and density methods, which do…

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}…

We study the minimization of fixed-degree polynomials over the simplex. This problem is well-known to be NP-hard, as it contains the maximum stable set problem in graph theory as a special case. In this paper, we consider a rational…

In this paper, we investigate the existence of a point in the plane of a unit polygon, that is at rational distance from each vertex of the polygon. A negative answer is obtained in almost all cases.

Given $\eta=\begin{pmatrix} a&b\\c&d \end{pmatrix}\in \text{GL}_2(\mathbb{Q})$, we consider the number of rational points on the genus one curve \[H_\eta:y^2=(a(1-x^2)+b(2x))^2+(c(1-x^2)+d(2x))^2.\] We prove that the set of $\eta$ for which…

Metric embeddings traditionally study how to map $n$ items to a target metric space such that distance lengths are not heavily distorted; but what if we only care to preserve the relative order of the distances (and not their length)? In…

This paper makes a deep study of regular two-distance sets. A set of unit vectors $X$ in Euclidean space $\RR^n$ is said to be regular two-distance set if the inner product of any pair of its vectors is either $\alpha$ or $\beta$, and the…

In the distance query model, we are given access to the vertex set of a $n$-vertex graph $G$, and an oracle that takes as input two vertices and returns the distance between these two vertices in $G$. We study how many queries are needed to…

Dyadic rationals are rationals whose denominator is a power of 2. A dyadic n-dimensional convex set is defined as the intersection with n-dimensional dyadic space of an n-dimensional real convex set. Such a dyadic convex set is said to be a…

A triangle with rational sides and rational area is called a rational triangle. In this paper we consider three problems of finding pairs of rational triangles which have a common circumradius as well as either a common perimeter or a…

Assume we are given a set of items from a general metric space, but we neither have access to the representation of the data nor to the distances between data points. Instead, suppose that we can actively choose a triplet of items (A,B,C)…

According to a classical result of Szemer\'{e}di, every dense subset of $1,2,...,N$ contains an arbitrary long arithmetic progression, if $N$ is large enough. Its analogue in higher dimensions due to F\"urstenberg and Katznelson says that…

This paper revisits datasets and evaluation criteria for Symbolic Regression (SR), specifically focused on its potential for scientific discovery. Focused on a set of formulas used in the existing datasets based on Feynman Lectures on…

In this paper, we establish improved effective irrationality measures for certain numbers of the form $\sqrt[3]{n}$, using approximations obtained from hypergeometric functions. These results are very close to the best possible using this…

The Orbit Problem consists of determining, given a matrix $A\in \mathbb{R}^{d\times d}$ and vectors $x,y\in \mathbb{R}^d$, whether there exists $n\in \mathbb{N}$ such that $A^n=y$. This problem was shown to be decidable in a seminal work of…

The study of rational point sets on circles over the Euclidean plane is discussed in a more general framework, i.e. we generalize the notion rational and consider these circular point sets over arbitrary fields. We also determine the…

The concept of $n$-distance was recently introduced to generalize the classical definition of distance to functions of $n$ arguments. In this paper we investigate this concept through a number of examples based on certain geometrical…

In this paper, we study how to find rational motions that move a line along a given rational ruled surface. Our goal is to find motions with the lowest possible degree using dual quaternions. While similar problems for point trajectories…

Let \({\mathbb K}\) be any field, let \(X\subset {\mathbb P}^{k-1}\) be a set of \(n\) distinct \({\mathbb K}\)-rational points, and let \(a\geq 1\) be an integer. In this paper we find lower bounds for the minimum distance \(d(X)_a\) of…