Related papers: The distance between two separating, reducing slop…
The distinguishing number $D(G)$ of a graph $G$ is the least integer $d$ such that $G$ has a vertex labeling with $d$ labels that is preserved only by a trivial automorphism. In this paper we characterize all trees with radius at most three…
We consider problems of the following type: given a graph $G$, how many edges are needed in the worst case for a sparse subgraph $H$ that approximately preserves distances between a given set of node pairs $P$? Examples include pairwise…
A multiplicative $\alpha$-spanner $H$ is a subgraph of $G=(V,E)$ with the same vertices and fewer edges that preserves distances up to the factor $\alpha$, i.e., $d_H(u,v)\leq\alpha\cdot d_G(u,v)$ for all vertices $u$, $v$. While many…
We show that computing the interleaving distance between two multi-graded persistence modules is NP-hard. More precisely, we show that deciding whether two modules are $1$-interleaved is NP-complete, already for bigraded, interval…
In [Hastings et al 2014] it is stated that the code distance of a logical qubit stored using dislocations is 2L + O(1), where L is the separation between the dislocation twists. This code distance assumed only physical X and Z errors are…
In this work, we study conditions for the existence of length-constrained path-cycle decompositions, that is, partitions of the edge set of a graph into paths and cycles of a given minimum length. Our main contribution is the…
The set of points in a metric space is called an $s$-distance set if pairwise distances between these points admit only $s$ distinct values. Two-distance spherical sets with the set of scalar products $\{\alpha, -\alpha\}$,…
A link in the 3-sphere is called (smoothly) slice if its components bound disjoint smoothly embedded disks in the 4-ball. More generally, given a 4-manifold M with a distinguished circle in its boundary, a link in the 3-sphere is called…
In this paper, we study the Erd\H{o}s-Falconer distance problem in five dimensions for sets of Cartesian product structures. More precisely, we show that for $A\subset \mathbb{F}_p$ with $|A|\gg p^{\frac{13}{22}}$, then…
We develop combinatorial methods for computing the rotation distance between binary trees, i.e., equivalently, the flip distance between triangulations of a polygon. As an application, we prove that, for each n, there exist size n trees at…
A perfect straight-line matching $M$ on a finite set $P$ of points in the plane is a set of segments such that each point in $P$ is an endpoint of exactly one segment. $M$ is non-crossing if no two segments in $M$ cross each other. Given a…
A behavior of one class of mappings with finite distortion at a neighborhood of the origin is investigated. There is proved a lower estimate of distortion of a distance under mappings mentioned above.
A result of Ben-Or, Coppersmith, Luby and Rubinfeld on testing whether a map be two groups is close to a homomorphism implies a tight lower bound on the distance between the multiplication tables of two non-isomorphic groups.
The simple interpretation of the minimum distance of a linear code obtained by De Boer and Pellikaan, and later refined by the second author, is further developed through the study of various finitely generated graded modules. We use the…
Let $M$ be a surface sum of 3-manifolds $M_1$ and $M_2$ along a bounded connected surface $F$ and $\partial_i$ be the component of $\partial M_i$ containing $F$. If $M_i$ has a high distance Heegaard splitting, then any minimal Heegaard…
We show that for $m$ points and $n$ lines in the real plane, the number of distinct distances between the points and the lines is $\Omega(m^{1/5}n^{3/5})$, as long as $m^{1/2}\le n\le m^2$. We also prove that for any $m$ points in the…
A pair of non-adjacent edges is said to be separated in a circular ordering of vertices, if the endpoints of the two edges do not alternate in the ordering. The circular separation dimension of a graph $G$, denoted by $\pi^\circ(G)$, is the…
In analogy with the Nilsson model, we calculate the splitting of spherical single-particle levels in a deformed field, but for cluster potentials. We study applications to alpha-cluster nuclei with two, three and four alpha particles, in…
The distance of a graph from being triangle-free is a fundamental graph parameter, counting the number of edges that need to be removed from a graph in order for it to become triangle-free. Its corresponding computational problem is the…
Suppose that $M$ is a $2$-dimensional oriented Riemannian manifold, and let $\gamma$ be a simple closed curve on $M$. Let $m \gamma$ denote the curve formed by tracing $\gamma$ $m$ times. We prove that if $m \gamma$ is contractible through…