English
Related papers

Related papers: On the two-parameter Erd\H{o}s-Falconer distance p…

200 papers

Let ${\cal T}$ be a triangulation of a set ${\cal P}$ of $n$ points in the plane, and let $e$ be an edge shared by two triangles in ${\cal T}$ such that the quadrilateral $Q$ formed by these two triangles is convex. A {\em flip} of $e$ is…

Data Structures and Algorithms · Computer Science 2016-10-05 Iyad Kanj , Eric Sedgwick , Ge Xia

We give a complete characterization of closed sets $F \subset \mathbb{R}^2$ whose distance function $d_F:= \mathrm{dist}(\cdot,F)$ is DC (i.e., is the difference of two convex functions on $\mathbb{R}^2$). Using this characterization, a…

Classical Analysis and ODEs · Mathematics 2020-06-09 Dušan Pokorný , Luděk Zajíček

In this paper we determine the maximum number of points in $\mathbb{R}^d$ which form exactly $t$ distinct triangles, where we restrict ourselves to the case of $t = 1$. We denote this quantity by $F_d(t)$. It was known from the work of…

Suppose that $E$ and $E'$ denote real Banach spaces with dimension at least $2$ and that $D\subset E$ and $D'\subset E'$ are domains. In this paper, we establish, in terms of the $j_D$ metric, a necessary and sufficient condition for the…

Complex Variables · Mathematics 2019-02-20 Y. Li , S. Ponnusamy , M. Vuorinen

Let $p$ and $q$ be anisotropic quadratic forms over a field $F$ of characteristic $\neq 2$, let $s$ be the unique non-negative integer such that $2^s < \mathrm{dim}(p) \leq 2^{s+1}$, and let $k$ denote the dimension of the anisotropic part…

Commutative Algebra · Mathematics 2017-10-10 Stephen Scully

Let $\mathbb{F}_q^d$ be a $d$-dimensional vector space over a finite field $\mathbb{F}_q$ with $q$ elements. For $x\in \mathbb{F}_q^d$, let $\|x\| = x_1^2+\dots+x_d^2$. By abuse of terminology, we shall call $\|\cdot\|$ a norm on…

Combinatorics · Mathematics 2026-01-05 Daewoong Cheong , Hunseok Kang , Jinbeom Kim

A finite difference method (FDM) applicable to a two dimensional (2D) quantum dot was developed as a non-conventional approach to the theoretical understandings of quantum devices. This method can be applied to a realistic potential with an…

Mesoscale and Nanoscale Physics · Physics 2013-12-16 Jai Seok Ahn

Consider a linear program of the form $\max\;c^{\top}x:Ax\leq b$, where $A$ is an $m\times n$ integral matrix. In 1986 Cook, Gerards, Schrijver, and Tardos proved that, given an optimal solution $x^{*}$, if an optimal integral solution…

Optimization and Control · Mathematics 2021-11-03 Marcel Celaya , Stefan Kuhlmann , Joseph Paat , Robert Weismantel

A set of points $S$ in $d$-dimensional Euclidean space $\mathbb{R}^d$ is called a 2-distance set if the set of pairwise distances between the points has cardinality two. The 2-distance set is called spherical if its points lie on the unit…

Combinatorics · Mathematics 2026-02-04 Iliyas Noman , Yuan Yao

For a field $\mathbb{F}$ and integers $d, k$ and $\ell$, a set $A \subseteq \mathbb{F}^d$ is called $(k,\ell)$-nearly orthogonal if all vectors in $A$ are non-self-orthogonal and every $k+1$ vectors in $A$ contain $\ell + 1$ pairwise…

Combinatorics · Mathematics 2025-05-30 Rajko Nenadov , Lander Verlinde

We establish uniformization results for metric spaces that are homeomorphic to the euclidean plane or sphere and have locally finite Hausdorff 2-measure. Applying the geometric definition of quasiconformality, we give a necessary and…

Complex Variables · Mathematics 2016-08-29 Kai Rajala

{\it .}We completely characterize pairs of lattice points $P_1\neq P_2$ in the plane with the property that there are infinitely many lattice points $Q$ whose distance from both $P_1$ and $P_2$ is integral. In particular we show that it…

Number Theory · Mathematics 2021-03-30 Umberto Zannier

We investigate the computational complexity of computing the Hausdorff distance. Specifically, we show that the decision problem of whether the Hausdorff distance of two semi-algebraic sets is bounded by a given threshold is complete for…

Computational Geometry · Computer Science 2022-08-26 Paul Jungeblut , Linda Kleist , Tillmann Miltzow

Let $D_n(x;a)$ and $E_n(x;a)\in\mathbb F_q[x]$ be Dickson polynomials of first and second kind respectively, where $\mathbb F_q$ is a finite field with $q$ elements. In this article we show explicitly the irreducible factors these…

Number Theory · Mathematics 2019-08-16 F. E. Brochero Martínez , Nelcy Esperanza Arévalo Baquero

Let $E_d(n)$ be the maximum number of pairs that can be selected from a set of $n$ points in $R^d$ such that the midpoints of these pairs are convexly independent. We show that $E_2(n)\geq \Omega(n\sqrt{\log n})$, which answers a question…

Combinatorics · Mathematics 2011-08-26 Konrad J. Swanepoel , Pavel Valtr

We define two notions of discrete dimension based on the Minkowski and Hausdorff dimensions in the continuous setting. After proving some basic results illustrating these definitions, we apply this machinery to the study of connections…

Combinatorics · Mathematics 2007-07-10 Alex Iosevich , Misha Rudnev , Ignacio Uriarte-Tuero

A variant of the Falconer distance problem asks for fixed $k\geq 1$ and $d\geq k+1$, how large does the Hausdorff dimension of a Borel set $E\subset\mathbb{R}^d$ need to be to guarantee that there exist $x_0,\ldots,x_{k}\in E$ such that…

Classical Analysis and ODEs · Mathematics 2026-05-22 José Gaitan Montejo , Eyvindur Ari Palsson

The two-parametric quantum superalgebra $U_{p,q}[gl(2/2)]$ and its induced representations are considered. A method for constructing all finite-dimensional irreducible representations of this quantum superalgebra is also described in…

Quantum Algebra · Mathematics 2015-06-26 Nguyen Anh Ky

Let $q$ be an odd prime power and let $X(m,q)$ be the set of symmetric bilinear forms on an $m$-dimensional vector space over $\mathbb{F}_q$. The partition of $X(m,q)$ induced by the action of the general linear group gives rise to a…

Combinatorics · Mathematics 2014-10-28 Kai-Uwe Schmidt

We give a reduction from $(1+\varepsilon)$-approximate Earth Mover's Distance (EMD) to $(1+\varepsilon)$-approximate Closest Pair (CP). As a consequence, we improve the fastest known approximation algorithm for high-dimensional EMD. Here,…

Data Structures and Algorithms · Computer Science 2025-08-27 Lorenzo Beretta , Vincent Cohen-Addad , Rajesh Jayaram , Erik Waingarten