Related papers: Topological complexity of planar polygon spaces wi…
There are multiple mappings that can be used to generate what we call the 'edge geometry' of a regular N-gon, but they are all based on piecewise isometries acting on the extended edges of N to form a 'singularity' set W. This singularity…
Following Ghomi and Tabachnikov we study topological obstructions to totally skew embeddings of a smooth manifold M in Euclidean spaces. This problem is naturally related to the question of estimating the geometric dimension of the stable…
We study Farber's topological complexity for monotone symplectic manifolds. More precisely, we estimate the topological complexity of 4-dimensional spherically monotone manifolds whose Kodaira dimension is not $-\infty$.
Parametrized motion planning algorithms have high degree of flexibility and universality, they can work under a variety of external conditions, which are viewed as parameters and form part of the input of the algorithm. In this paper we…
It is well known that isoperimetric regions in a smooth compact $(n+1)$-manifold are smooth, up to a closed set of codimension at most $6$. In this note, we first construct an $8$-dimensional compact smooth manifold whose unique…
In this article we consider the moduli space of smooth $n$-pointed non-hyperelliptic curves of genus 3. In the pursuit of cohomological information about this space, we make $\mathbb{S}_n$-equivariant counts of its numbers of points defined…
We construct examples of non-isotrivial algebraic families of smooth complex projective curves over a curve of genus 2. This solves a problem from Kirby's list of problems in low-dimensional topology. Namely, we show that 2 is the smallest…
Codes defined on graphs and their properties have been subjects of intense recent research. On the practical side, constructions for capacity-approaching codes are graphical. On the theoretical side, codes on graphs provide several…
We classify real Poisson structures on complex toric manifolds of type $(1,1)$ and initiate an investigation of their Poisson cohomology. For smooth toric varieties, such structures are necessarily algebraic and are homogeneous quadratic in…
Suppose that a polygon $P$ is given as an array containing the vertices in counterclockwise order. We analyze how many vertices (including the index of each of these vertices) we need to know before we can bound $P$, i.e., report a bounded…
A design is a finite set of points in a space on which every "simple" functions averages to its global mean. Illustrative examples of simple functions are low-degree polynomials on the Euclidean sphere or on the Hamming cube. We prove lower…
In this note we investigate the role of Lloyd's computational bound in holographic complexity. Our goal is to translate the assumptions behind Lloyd's proof into the bulk language. In particular, we discuss the distinction between…
The computational complexity of the Maximum Likelihood decoding algorithm in [1], [2] for orthogonal space-time block codes is smaller than specified.
We investigate the space complexity of certain perfect matching problems over bipartite graphs embedded on surfaces of constant genus (orientable or non-orientable). We show that the problems of deciding whether such graphs have (1) a…
Recently, a lower bound was established on the size of linear sets in projective spaces, that intersect a hyperplane in a canonical subgeometry. There are several constructions showing that this bound is tight. In this paper, we generalize…
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. We bridge this gap for a natural and important special case, planar graph isomorphism,…
One measure of the complexity of a 3-manifold is its triangulation complexity: the minimal number of tetrahedra in a triangulation of it. A natural question is whether we can relate this quantity to its topology. We determine the…
This work deals with the topological classification of germs of singular foliations on $(\mathbb C^{2},0)$. Working in a suitable class of foliations we fix the topological invariants given by the separatrix set, the Camacho-Sad indices and…
We obtain new lower bounds of the minimal genus of a locally flat surface representing a 2-dimensional homology class in a topological 4-manifold with boundary, using the von Neumann-Cheeger-Gromov $\rho$-invariant. As an application our…
We define the \emph{visual complexity} of a plane graph drawing to be the number of basic geometric objects needed to represent all its edges. In particular, one object may represent multiple edges (e.g., one needs only one line segment to…