相关论文: The distance between two separating, reducing slop…

For a set $E \subseteq \mathbb{F}_q^d$, the distance set is defined as $\Delta(E) := \{\|\mathbf{x} - \mathbf{y}\| : \mathbf{x}, \mathbf{y} \in E\}$, where $\|\cdot\|$ denotes the standard quadratic form. We investigate the…

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…

Let K be a knot in a closed orientable irreducible 3-manifold M and let P be a Heegaard splitting of the knot complement of genus at least two. Suppose Q is a bridge surface for K. Then either \begin{itemize} \item $d(P)\leq 2-\chi(Q-K)$,…

We derive a formula which is a lower bound on the dimension of trivariate splines on a tetrahedral partition which are continuously differentiable of order $r$ in large enough degree. While this formula may fail to be a lower bound on the…

We study maximal distances in the commuting graphs of matrix algebras defined over algebraically closed fields. In particular, we show that the maximal distance can be attained only between two nonderogatory matrices. We also describe…

Let $\mathbb{F}_p$ be a prime field, and ${\mathcal E}$ a set in $\mathbb{F}_p^2$. Let $\Delta({\mathcal E})=\{||x-y||: x,y \in {\mathcal E} \}$, the distance set of ${\mathcal E}$. In this paper, we provide a quantitative connection…

Let $\Omega$ be a domain in a smooth complete Finsler manifold, and let $G$ be the largest open subset of $\Omega$ such that for every $x$ in $G$ there is a unique closest point from $\partial \Omega$ to $x$ (measured in the Finsler…

It is shown that the smallest possible distance between two disjoint lattice polytopes contained in the cube $[0,k]^3$ is exactly $$ \frac{1}{\sqrt{2(2k^2-4k+5)(2k^2-2k+1)}} $$ for every integer $k$ at least $4$. The proof relies on…

In orbifold vacua containing an $S^q/\Gamma$ factor, we compute the relative order of scale separation, $r$, defined as the ratio of the eigenvalue of the lowest-lying $\Gamma$-invariant state of the scalar Laplacian on $S^q$, to the…

The subtree prune-and-regraft (SPR) distance metric is a fundamental way of comparing evolutionary trees. It has wide-ranging applications, such as to study lateral genetic transfer, viral recombination, and Markov chain Monte Carlo…

Let f:S ->B be a relatively minimal fibred surface. In this note we give a partial affirmative answer to a conjecture of Xiao, proving that the direct image of the relative dualizing sheaf of $f$ is ample when the slope of the fibration is…

Let M be a closed, irreducible, genus two 3-manifold, and F a maximal collection of pairwise disjoint, closed, orientable, incompressible surfaces embedded in M. Then each component manifold M_i of M-F has handle number at most one, i.e.…

We construct families of locally recoverable codes with availability $t\geq 2$ using fiber products of curves, determine the exact minimum distance of many families, and prove a general theorem for minimum distance of such codes. The paper…

\textit{Minimum distance diagrams}, also known as \textit{\textsf{L}--shapes}, have been used to study some properties related to \textit{weighted Cayley digraphs} of \textit{degree} two and \textit{embedding dimension three numerical…

A diagonal surface in a link exterior M is a properly embedded, incompressible, boundary incompressible surface which furthermore has the same number of boundary components and same slope on each component of the boundary of M. We derive a…

Given integers b, c, g, and n, we construct a manifold M containing a c-component link L so that there is a bridge surface Sigma for (M,L) of genus g that intersects L in 2b points and has distance at least n. More generally, given two…

Let $\mathcal{G}_{\alpha}$ be a hereditary graph class (i.e, every subgraph of $G_{\alpha}\in \mathcal{G}_{\alpha}$ belongs to $\mathcal{G}_{\alpha}$) such that every graph $G_{\alpha}$ in $\mathcal{G}_{\alpha}$ has minimum degree at most…

We define and investigate the Fr\'{e}chet edit distance problem. Given two polygonal curves $\pi$ and $\sigma$ and a threshhold value $\delta>0$, we seek the minimum number of edits to $\sigma$ such that the Fr\'{e}chet distance between the…

We study the problem of finding a triangulation T of a planar point set S such as to minimize the expected distance between two points x and y chosen uniformly at random from S. By distance we mean the length of the shortest path between x…

We consider the discretization q(t+\epsilon)+q(t-\epsilon)-2q(t)=\epsilon^{2}\sin\big(q(t)\big), $\epsilon>0$ a small parameter, of the pendulum equation $ q '' = \sin (q) $; in system form, we have the discretization…