Related papers: A note on sets avoiding rational distances

Let $q,d\geq 2$ be integers. Define $$ J(q,d):=\frac 1q \Big( \min_{0<x<1} \frac{1-x^q}{1-x} x^{-\frac{q-1}{d}}\Big). $$ Let $\mbox{$\cal G$}\subseteq {\mathbb R}^n$ be an arbitrary subset. We denote by $d(\mbox{$\cal G$})$ the set of…

We characterise purely $n$-unrectifiable subsets $S$ of a complete metric space $X$ with finite Hausdorff $n$-measure by studying arbitrarily small perturbations of elements of the set of all bounded 1-Lipschitz functions $f\colon X \to…

Let F be a subfield of a commutative field extending R. Let phi_n:F^n \times F^n ->F, phi_n((x_1,...,x_n),(y_1,...,y_n))=(x_1-y_1)^2+...+(x_n-y_n)^2. We say that f:R^n->F^n preserves distance d>=0 if for each x,y \in R^n |x-y|=d implies…

A set A of positive integers is called a perfect difference set if every nonzero integer has an unique representation as the difference of two elements of A. We construct dense perfect difference sets from dense Sidon sets. As a consequence…

Let $\mathcal{M}\subset \mathbb{R}^n$ be a compact and sufficiently smooth manifold of dimension $d$. Suppose $\mathcal{M}$ is nowhere completely flat. Let $N_{\mathcal{M}}(\delta,Q)$ denote the number of rational vectors $\mathbf{a}/q$…

We prove that a complete intersection of $c$ very general hypersurfaces of degree at least two in $N$-dimensional complex projective space is not ruled (and therefore not rational) provided that the sum of the degrees of the hypersurfaces…

We obtain box-counting estimates for the pinned distance sets of (dense subsets of) planar discrete Ahlfors-regular sets of exponent $s>1$. As a corollary, we improve upon a recent result of Orponen, by showing that if $A$ is…

We study the distance set problem for pairs of compact sets $A, B\subset \mathbb{R}^n$, $n\geq 2$. We show that if $B$ is contained in a hyperplane and \begin{align*} \dim_{H} A+\dim_{H} B>n, \end{align*} then the distance set $…

A finite subset of a Euclidean space is called an $s$-distance set if there exist exactly $s$ values of the Euclidean distances between two distinct points in the set. In this paper, we prove that the maximum cardinality among all…

We present examples which show that in dimension higher than one or codimension higher than two, there exist toric ideals I_A such that no binomial ideal contained in I_A and of the same dimension is a complete intersection. This result has…

The classical Cantor's intersection theorem states that in a complete metric space $X$, intersection of every decreasing sequence of nonempty closed bounded subsets, with diameter approaches zero, has exactly one point. In this article, we…

Serre famously showed that almost all plane conics over $\mathbb{Q}$ have no rational point. We investigate versions of this over global function fields, focusing on a specific family of conics over $\mathbb{F}_2(t)$ which illustrates new…

The classical concept of bounded completeness and its relation to sufficiency and ancillarity play a fundamental role in unbiased estimation, unbiased testing, and the validity of inference in the presence of nuisance parameters. In this…

We study the problem of deciding whether a point escapes a closed subset of $\mathbb{R}^d$ under the iteration of a continuous map $f \colon \mathbb{R}^d \to \mathbb{R}^d$ in the bit-model of real computation. We give a sound partial…

It was proved by Avramov and Buchweitz that if A is a commutative local complete intersection ring with finitely generated modules M and N, then the Ext groups between M and N vanish from some step if and only if the Ext groups between N…

Let X be an algebraic curve over Q and t a non-constant Q-rational function on X such that Q(t) is a proper subfield of Q(X). For every integer n pick a point P_n on X such that t(P_n)=n. We conjecture that, for large N, among the number…

We look at what type of arguments can rule out the joint reality (or value definiteness) of two observables of a physical system, such as a qubit, and give several strong yet simple no-go results based on assumptions typically weaker than…

We prove in Theorem $2.2$ that the multiplicatively closed subset generated by at most two elements in the set of natural numbers $\mathbb{N}$ has arbitrarily large gaps by explicitly constructing large integer intervals with known prime…

We consider logics derived from Euclidean spaces $\mathbb{R}^n$. Each Euclidean space carries relations consisting of those pairs that are, respectively, distance more than 1 apart, distance less than 1 apart, and distance 1 apart. Each…

Huemer et al. (Discrete Math, 2019) proved that for any two finite point sets $R$ and $B$ in the plane with $|R| = |B|$, the perfect matching that matches points of $R$ with points of $B$, and maximizes the total squared Euclidean distance…