Related papers: Topological complexity of planar polygon spaces wi…

We study equivariant embeddings with small boundary of a given homogeneous space $G/H$, where $G$ is a connected, linear algebraic group with trivial Picard group and only trivial characters, and $H \subset G$ is an extension of a connected…

We compute for all orientable irreducible geometric 3-manifolds certain complexity functions that approximate from above Matveev's natural complexity, known to be equal to the minimal number of tetrahedra in a triangulation. We can show…

The extension complexity of a polytope measures its amenability to succinct representations via lifts. There are several versions of extension complexity, including linear, real semidefinite, and complex semidefinite. We focus on the last…

Genetic Programming (GP) has found various applications. Understanding this type of algorithm from a theoretical point of view is a challenging task. The first results on the computational complexity of GP have been obtained for problems…

We treat the boundary problem for complex varieties with isolated singularities, of complex dimension greater than or equal to 3, non necessarily compact, which are contained in strongly convex, open subsets of a complex Hilbert space H. We…

Based on work of R. Lazarsfeld and M. Popa, we use the derivative complex associated to the bundle of the holomorphic p-forms to provide inequalities for all the Hodge numbers of a special class of irregular compact Kaehler manifolds. For…

Call a pure Hodge structure geometric if it is contained in the cohomology of a smooth complex projective variety. The main goal is to show that for any set of Hodge numbers (subject to the obvious constraints), there exists a geometric…

We study the topology of the link $M^{\mathrm{trop}}_{g,n}[1]$ of the tropical moduli spaces of curves when g=2. Tropical moduli spaces can be identified with boundary complexes for $\mathcal{M}_{g,n}$, as shown by…

A polygon is \textit{small} if it has unit diameter. The maximal area of a small polygon with a fixed number of sides $n$ is not known when $n$ is even and $n\geq14$. We determine an improved lower bound for the maximal area of a small…

We introduce and study Hodge-de Rham numbers for compact almost complex 4-manifolds, generalizing the Hodge numbers of a complex surface. The main properties of these numbers in the case of complex surfaces are extended to this more general…

Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. In the context of a branch-and-bound framework for solving these packing problems to optimality, it is…

We consider a notion of relative homology (and cohomology) for surfaces with two types of boundaries. Using this tool, we study a generalization of Kitaev's code based on surfaces with mixed boundaries. This construction includes both…

Given a simplicial complex $K$, we consider several notions of geometric complexity of embeddings of $K$ in a Euclidean space ${\mathbb R}^d$: thickness, distortion, and refinement complexity (the minimal number of simplices needed for a PL…

For a closed orientable connected 3-manifold $M$, its complexity $\boldsymbol{T}(M)$ is defined to be the minimal number of tetrahedra in its triangulations. Under the assumption that $M$ is prime (but not necessarily atoroidal), we…

The paper deals with planar polynomial vector fields. We aim to estimate the number of orbital topological equivalence classes for the fields of degree n. An evident obstacle for this is the second part of Hilbert's 16th problem. To…

We study the quantum query complexity of minor-closed graph properties, which include such problems as determining whether an $n$-vertex graph is planar, is a forest, or does not contain a path of a given length. We show that most…

We show that the size of a minimal simplicial cover of a polytope $P$ is a lower bound for the size of a minimal triangulation of $P$, including ones with extra vertices. We then use this fact to study minimal triangulations of cubes, and…

Topological complexity is a homotopy invariant that measures the minimal number of continuous rules required for motion planning in a space. In this work, we introduce persistent analogs of topological complexity and its cohomological lower…

We give a new complexity bound for calculating the complex dimension of an algebraic set. Our algorithm is completely deterministic and approaches the best recent randomized complexity bounds. We also present some new, significantly sharper…

We apply polynomial techniques (linear programming) to obtain lower and upper bounds on the covering radius of spherical designs as function of their dimension, strength, and cardinality. In terms of inner products we improve the lower…