Related papers: Some conditionally hard problems on links and 3-ma…
We study the computational complexity of the general network satisfaction problem for a finite relation algebra $A$ with a normal representation $B$. If $B$ contains a non-trivial equivalence relation with a finite number of equivalence…
We consider the problem of finding a 1-planar drawing for a general graph, where a 1-planar drawing is a drawing in which each edge participates in at most one crossing. Since this problem is known to be NP-hard we investigate the…
We resolve three long-standing open problems, namely the (algorithmic) decidability of network coding, the decidability of conditional information inequalities, and the decidability of conditional independence implication among random…
We investigate the computational complexity of edge-deletion and edge-contraction problems in fuzzy graphs. For any graph property {\Pi} that is hereditary under contractions (or deletions) and determined by 3-connected components, the…
This is a first in a series of papers, devoted to the relation betwwen three-manifolds and number fields. The present paper studies first homology of finite coverings of a three-manifold with primary interest in the Thurston $b_1$…
Let L be a link in the 3-sphere that is in thin position but not in bridge position and let P be a thin level sphere. We generalize a result of Wu by giving a bound on the number of disjoint irreducible compressing disks that P can have,…
We establish upper bounds for the complexity of Seifert fibered manifolds with nonempty boundary. In particular, we obtain potentially sharp bounds on the complexity of torus knot complements.
Suppose $K$ is a knot in a 3-manifold $Y$, and that $Y$ admits a pair of distinct contact structures. Assume that $K$ has Legendrian representatives in each of these contact structures, such that the corresponding Thurston-Bennequin…
About a decade ago Thurston proved that a vast collection of 3-manifolds carry metrics of constant negative curvature. These manifolds are thus elements of {\em hyperbolic geometry}, as natural as Euclid's regular polyhedra. For a closed…
A Heegaard diagram for a 3-manifold is regarded as a pair of simplexes in the complex of curves on a surface and a Heegaard splitting as a pair of subcomplexes generated by the equivalent diagrams. We relate geometric and combinatorial…
We establish a lower bound on the complexity orientable locally orientable geometric 3-orbifolds in terms of Delzant's T-invariants of their orbifold-fundamental groups, generalizing previously known bounds for complexity of 3-manifolds.
When doing representation learning on data that lives on a known non-trivial manifold embedded in high dimensional space, it is natural to desire the encoder to be homeomorphic when restricted to the manifold, so that it is bijective and…
We will simplify the earlier proofs of Perelman's collapsing theorem of 3-manifolds given by Shioya-Yamaguchi and Morgan-Tian. Among other things, we use Perelman's semi-convex analysis of distance functions to construct the desired local…
We prove tight network topology dependent bounds on the round complexity of computing well studied $k$-party functions such as set disjointness and element distinctness. Unlike the usual case in the CONGEST model in distributed computing,…
One of the main problems in random network coding is to compute good lower and upper bounds on the achievable cardinality of the so-called subspace codes in the projective space $\mathcal{P}_q(n)$ for a given minimum distance. The…
In an article [3] published recently in this journal, it was shown that when k >= 3, the problem of deciding whether the distinguishing chromatic number of a graph is at most k is NP-hard. We consider the problem when k = 2. In regards to…
It is known that every closed oriented 3-manifold is homology cobordant to a hyperbolic 3-manifold. By contrast we show that many homology cobordism classes contain no Seifert fibered 3-manifold. This is accomplished by determining the…
We show that only finitely many links in a closed 3-manifold share the same complement, up to twists along discs and annuli. Using the same techniques, we prove that by adding 2-handles on the same link we get only finitely many smooth…
We give a short, self-contained, and easily verifiable proof that determining the outerthickness of a general graph is NP-hard. This resolves a long-standing open problem on the computational complexity of outerthickness. Moreover, our…
We characterize f-vectors of sufficiently large three-dimensional flag Gorenstein* complexes, essentially confirming a conjecture of Gal [Discrete Comput. Geom., 34 (2), 269--284, 2005]. In particular, this characterizes f-vectors of large…