Related papers: On Flat Polyhedra deriving from Alexandrov's Theor…
We study the problem of deciding whether a crease pattern can be folded by simple folds (folding along one line at a time) under the infinite all-layers model introduced by [Akitaya et al., 2017], in which each simple fold is defined by an…
A previously proposed two-step algorithm for calculating the expectation values of Chern-Simons graphs fails to determine certain crucial signs. The step which involves calculating tetrahedra by solving certain non- linear equations is…
We show that the existence of a homomorphism from an $n$-vertex graph $G$ to an $h$-vertex graph $H$ can be decided in time $2^{O(n)}h^{O(1)}$ and polynomial space if $H$ comes from a family of graphs that excludes a topological minor. The…
This is a survey paper on various results relates to the following theorem first proved by A.D. Alexandrov: \textit{Let $S$ be an analytic convex sphere-homeomorphic surface in $\mathbb R^3$ and let $k_1(\boldsymbol{x})\leqslant…
A well-known result in the study of convex polyhedra, due to Minkowski, is that a convex polyhedron is uniquely determined (up to translation) by the directions and areas of its faces. The theorem guarantees existence of the polyhedron…
This paper is a continuation of our previous work in which we defined the notion of a polytope complex and its $K$-theory. In this paper we produce formulas for the delooping of a simplicial polytope complex and the cofiber of a morphism of…
The classical polynomial interpolation problem in several variables can be generalized to the case of points with greater multiplicities. What is known, as yet, is essentially concentrated in the Alexander-Hirschowitz Theorem which says…
We develop a new algorithm for factoring a bivariate polynomial $F\in \mathbb{K}[x,y]$ which takes fully advantage of the geometry of the Newton polygon of $F$. Under a non degeneracy hypothesis, the complexity is…
We make two improvements upon Joyce's gluing theorems of for compact special Lagrangian submanifolds with isolated conical singularities. Firstly, we get rid of a few technical hypotheses of them. Secondly, we replace another hypothesis by…
We investigate the problem of determining if a given graph corresponds to the dual of a triangulation of a simple polygon. This is a graph recognition problem, where in our particular case we wish to recognize a graph which corresponds to…
Planarity Testing is the problem of determining whether a given graph is planar while planar embedding is the corresponding construction problem. The bounded space complexity of these problems has been determined to be exactly Logspace by…
We introduce an algorithm to decide isomorphism between tensors. The algorithm uses the Lie algebra of derivations of a tensor to compress the space in which the search takes place to a so-called densor space. To make the method practicable…
By extending the author's prior work to the family case, this paper presents a new proof of the gluing formula for the analytic torsion forms, considerably simplifying the proof given by Puchol-Zhang-Zhu.
We show that if two 3-manifolds with toroidal boundary are glued via a `sufficiently complicated' map then every Heegaard splitting of the resulting 3-manifold is weakly reducible. Additionally, if Z is a manifold obtained by gluing X and…
We obtain the first polynomial-time algorithm for exact tensor completion that improves over the bound implied by reduction to matrix completion. The algorithm recovers an unknown 3-tensor with $r$ incoherent, orthogonal components in…
We formulate and prove a necessary condition for a sequence of analytic trigonometric polynomials with real non-negative coefficients to be flat a.e.
We revisit a standard polygon containment problem: given a convex $k$-gon $P$ and a convex $n$-gon $Q$ in the plane, find a placement of $P$ inside $Q$ under translation and rotation (if it exists), or more generally, find the largest copy…
We prove a new result allowing to construct Anosov flows in dimension 3 by gluing building blocks. By a building block, we mean a compact 3-manifold with boundary $P$, equipped with a $C^1$ vector field $X$, such that the maximal invariant…
Let $P$ be a (non necessarily convex) embedded polyhedron in $\R^3$, with its vertices on an ellipsoid. Suppose that the interior of $P$ can be decomposed into convex polytopes without adding any vertex. Then $P$ is infinitesimally rigid.…
We give new and rather general gluing theorems for anti-self-dual (ASD) conformal structures, following the method suggested by Floer. The main result is a gluing theorem for pairs of conformally ASD manifolds `joined' across a common piece…