Related papers: A Congruence Condition For The Four-Distance Probl…

A non-complete \drg $\Gamma$ is called geometric if there exists a set $\mathcal{C}$ of Delsarte cliques such that each edge of $\Gamma$ lies in a unique clique in $\mathcal{C}$. In this paper, we determine the non-complete distance-regular…

We study the set of visible lattice points in multidimensional hypercubes. The problems we investigate mix together geometric, probabilistic and number theoretic tones. For example, we prove that almost all self-visible triangles with…

We solve the so far open problem of constructing all spatial rational curves with rational arc length functions. More precisely, we present three different methods for this construction. The first method adapts a recent approach of (Kalkan…

We prove fixed point theorems in a space with a distance function that takes values in a partially ordered monoid. On the one hand, such an approach allows one to generalize some fixed point theorems in a broad class of spaces, including…

Rational quartic spectrahedra in 3-space are semialgebraic convex subsets in $\mathbb{R}^3$ of semidefinite, real symmetric $(4 \times 4)$-matrices, whose boundary admits a rational parameterization. The Zariski closure in…

We prove that a perfect four-feet square table, posed in a continuous irregular ground with a local slope of at most 15 degrees can be put in equilibrium on the ground by a "rotation" of less than 90 degrees. We also discuss the case of…

Let $k$ be a field with char $k \not= 2$, $X$ be an affine surface defined by the equation $z^2=P(x)y^2+Q(x)$ where $P(x), Q(x) \in k[x]$ are separable polynomials. We will investigate the rationality problem of $X$ in terms of the…

Let $f,g\in\mathbb{Z}[u_1,u_2]$ be binary quadratic forms. We provide upper bounds for the number of rational points $(u,v)\in\mathbb{P}^1(\mathbb{Q})\times\mathbb{P}^1(\mathbb{Q})$ such that the ternary conic \[ X_{(u,v)}: f(u_1,u_2)x^2 +…

We give a complete description of the distance relation on the graph of $4$-ary simplex codes of dimension $2$. This is a connected graph of diameter $3$. For every vertex we determine the sets of all vertices at distance $i\in\{1,2,3\}$…

Erd\H{o}s and Fishburn studied the maximum number of points in the plane that span $k$ distances and classified these configurations, as an inverse problem of the Erd\H{o}s distinct distances problem. We consider the analogous problem for…

Let $P$ be a convex polygon in the plane, and let $T$ be a triangulation of $P$. An edge $e$ in $T$ is called a diagonal if it is shared by two triangles in $T$. A flip of a diagonal $e$ is the operation of removing $e$ and adding the…

This article focuses on the occurrence of 3-point configurations in subsets of $\mathbb{R}^d$ of sufficient thickness. We prove that a compact set $A\subset \mathbb{R}^d$ contains a similar copy of any linear $3$-point configuration (such…

We consider the distance minimization problem to a real algebraic variety $X \subseteq \RR^n$ when the metric is induced by a polyhedral norm. Each point in the variety has a Voronoi cell whose geometry depends on the normal space at the…

We obtain the solution of the fourth order difference equation $$ x_{n+1}=\frac{ \alpha x_{n-3}}{A+B x_{n-1}x_{n-3}}$$ with the initial conditions; $x_{-3}=d,$ $x_{-2}=c,$ $x_{-1}=b,$ and $x_{0}=a$ are arbitrary nonzero real numbers,…

Criterion for a companion matrix to have a certain number of flat portions on the boundary of its numerical range is given. The criterion is specialized to the cases of 3-by-3 and 4-by-4 matrices. In the latter case, it is proved that a…

In this note, we establish an asymptotic formula for the number of rational points of bounded height on the singular cubic surface $$ x_0(x_1^2 + x_2^2)=x_3^3 $$ with a power-saving error term, which verifies the Manin-Peyre conjectures for…

A cubic hypersurface in $\mathbb{P}^n$ defined over $\mathbb{Q}$ is given by the vanishing locus of a cubic form $f$ in $n+1$ variables. It is conjectured that when $n \geq 4$, such cubic hypersurfaces satisfy the Hasse principle. This is…

We consider the problem of computing the Fr\'echet distance between two curves for which the exact locations of the vertices are unknown. Each vertex may be placed in a given uncertainty region for that vertex, and the objective is to place…

Let $F$ denote a field and let $V$ denote a vector space over $F$ with finite positive dimension. We consider a pair of linear transformations $A:V \to V$ and $A^*:V \to V$ that satisfy the following conditions: (i) each of $A,A^*$ is…

We propose a general convex optimization problem for computing regularized geodesic distances. We show that under mild conditions on the regularizer the problem is well posed. We propose three different regularizers and provide analytical…