Related papers: Bridge decompositions with distances at least two
This paper presents a decomposition method for solving elliptic boundary value problems in one-dimension. The method is an improvement to an existing technique for approximating elliptic systems. It is demonstrated to be computationally…
We consider the problem of decomposing a given (di)graph into paths of length 2 with the additional restriction that no two such paths may have more than one vertex in common. We establish its NP-hardness by a reduction from 3-SAT,…
We improve the best known upper bound on the number of edges in a unit-distance graph on $n$ vertices for each $n\in\{16,\ldots,30\}$. When $n\leq 21$, our bounds match the best known lower bounds, and we fully enumerate the densest…
We present an approach to constructing broken Lefschetz fibrations (BLFs) $f:X\rightarrow S^2$ from a handle decomposition of a 4-manifold $X$. Given a handle decomposition as input these techniques yield explicit descriptions of the BLFs,…
Using Connes distance formula in noncommutative geometry, it is possible to retrieve the Euclidean distance from the canonical commutation relations of quantum mechanics. In this note, we study modifications of the distance induced by a…
The three distance theorem (also known as the three gap theorem or Steinhaus problem) states that, for any given real number $\alpha$ and integer $N$, there are at most three values for the distances between consecutive elements of the…
We formulate closed-form Hessian distances of information entropies in one-dimensional probability density space embedded with the L2-Wasserstein metric.
Gallai's path decomposition conjecture states that the edges of any connected graph on n vertices can be decomposed into at most (n+1)/2 paths. We confirm that conjecture for all graphs with maximum degree at most five.
Decompositions on manifolds appear in various geometric structures. Necessary and sufficient conditions for quotient spaces of decompositions to be manifolds are widely characterized. We characterize necessary and sufficient conditions to…
We consider the moduli spaces $\mathcal{M}_d(\ell)$ of a closed linkage with n links and prescribed lengths in d-dimensional Euclidean space. For d>3 these spaces are no longer manifolds generically, but they have the structure of a…
In this paper, we show that, for any integers $n\geq 2$ and $g\geq 2$, there exist genus-$g$ Heegaard splittings of compact 3-manifolds with distance exactly $n$.
We study the computational complexity of determining the Hausdorff distance of two polytopes given in halfspace- or vertex-presentation in arbitrary dimension. Subsequently, a matching problem is investigated where a convex body is allowed…
Nested code pairs play a crucial role in the construction of ramp secret sharing schemes [Kurihara et al. 2012] and in the CSS construction of quantum codes [Ketkar et al. 2006]. The important parameters are (1) the codimension, (2) the…
This paper provides short proofs of two fundamental theorems of finite semigroup theory whose previous proofs were significantly longer, namely the two-sided Krohn-Rhodes decomposition theorem and Henckell's aperiodic pointlike theorem,…
We introduce a numerical isomorphism invariant p(T) for any triangulation T of S^3. Although its definition is purely topological (inspired by the bridge number of knots), p(T) reflects the geometric properties of T. Specifically, if T is…
Given two maps f_1, f_2 : M^m \longrightarrow N^n between manifolds of the indicated arbitrary dimensions, when can they be deformed away from one another? More generally: what is the minimum number MCC (f_1, f_2) of pathcomponents of the…
The rhombus tilings of a simply connected domain of the Euclidean plane are known to form a flip-connected space (a flip is the elementary operation on rhombus tilings which rotates 180{\deg} a hexagon made of three rhombi). Motivated by…
We show some properties of a Seifert matrix of an $n$-component Brunnian link. In particular, we give a necessary and sufficient condition for a matrix to be a Seifert matrix of a 2-component Brunnian link up to S-equivalence.
A point set $P \subset {\Bbb{R}}^d$ is {\it separated} if the minimum distance between any two points in $P$ is at least $1$. For $d \ne 4,5,$ we determine, for every $t_1,t_2 \ge 1$, and for $n$ at least a suitable $n_d$, the maximum…
In this paper, we give a complete classification of exceptional Dehn surgeries on a component of a hyperbolic two-bridge link in the 3-sphere.