Related papers: Higher topological complexity of planar polygon sp…
We compute the degree complexity of a family of birational mappings of the plane with high order singularities.
The true complexity of a polynomial progression in finite fields corresponds to the smallest-degree Gowers norm that controls the counting operator of the progression over finite fields of large characteristic. We give a conjecture that…
In this paper, we investigate discrete topological complexity $TC(K)$ introduced for situations where the configuration space possesses a simplicial structure. %Simplicial complexes are well-known and commonly used in programming for…
For a linear code $\cC$ of length $n$ and dimension $k$, Wolf noticed that the trellis state complexity $s(\cC)$ of $\cC$ is upper bounded by $w(\cC):=\min(k,n-k)$. In this paper we point out some new lower bounds for $s(\cC)$. In…
The complexity of graph homomorphisms has been a subject of intense study [11, 12, 4, 42, 21, 17, 6, 20]. The partition function $Z_{\mathbf A}(\cdot)$ of graph homomorphism is defined by a symmetric matrix $\mathbf A$ over $\mathbb C$. We…
We study closed orientable manifolds whose topological complexity is at most 3 and determine their cohomology rings. For some of admissible cohomology rings we are also able to identify corresponding manifolds up to homeomorphism.
In this paper, we propose new lower and upper bounds on the linear extension complexity of regular $n$-gons. Our bounds are based on the equivalence between the computation of (i) an extended formulation of size $r$ of a polytope $P$, and…
As time passes, once simple quantum states tend to become more complex. For strongly coupled k-local Hamiltonians, this growth of computational complexity has been conjectured to follow a distinctive and universal pattern. In this paper we…
Topological complexity was first introduced in 2003 by Michael Farber as a homotopy invariant for a connected topological space X, denoted by TC(X). Although the invariant is defined in terms of elementary homotopy theory using well-known…
We show that the problem to decide whether two (convex) polytopes, given by their vertex-facet incidences, are combinatorially isomorphic is graph isomorphism complete, even for simple or simplicial polytopes. On the other hand, we give a…
The geodesic complexity of a metric space X is the smallest k for which there is a partition of X x X into ENRs E_0,...,E_k on each of which there is a continuous choice of minimal geodesic sigma(x_0,x_1) from x_0 to x_1. We prove that the…
The extension complexity $\mathsf{xc}(P)$ of a polytope $P$ is the minimum number of facets of a polytope that affinely projects to $P$. Let $G$ be a bipartite graph with $n$ vertices, $m$ edges, and no isolated vertices. Let…
We construct families of trivial $2$-knots $K_i$ in $\mathbb{R}^4$ such that the maximal complexity of $2$-knots in any isotopy connecting $K_i$ with the standard unknot grows faster than a tower of exponentials of any fixed height of the…
In this paper, we provide sufficient conditions for a space $X$ to satisfy the Ganea conjecture for topological complexity. To achieve this, we employ two auxiliary invariants: weak topological complexity in the sense of Berstein-Hilton,…
In this paper we determine the topological complexity of configuration spaces of graphs which are not necessarily trees, which is a crucial assumption in previous results. We do this for two very different classes of graphs: fully…
We construct homotopically non-trivial maps from the unit m-sphere to the unit (m-1)-sphere with arbitrarily small k-dilation for each k greater than (m + 1)/2. We prove that homotopically non-trivial maps from the unit m-sphere to the unit…
In this work, we show that, for any simply-connected elliptic space $S$ admitting a pure minimal Sullivan model with a differential of constant length, we have ${\rm TC}_0(S)\leq 2{\rm cat}_0(S)+\chi_{\pi}(S)$ where $\chi_{\pi}(S)$ is the…
Let G be a plane graph of n nodes, m edges, f faces, and no self-loop. G need not be connected or simple (i.e., free of multiple edges). We give three sets of coding schemes for G which all take O(m+n) time for encoding and decoding. Our…
Many problems in Discrete and Computational Geometry deal with simple polygons or polygonal regions. Many algorithms and data-structures perform considerably faster, if the underlying polygonal region has low local complexity. One obstacle…
We provide an upper bound on the topological complexity of twisted products. We use it to give an estimate $$TC(X)\le TC(\pi_1(X))+\dim X$$ of the topological complexity of a space in terms of its dimension and the complexity of its…