Related papers: Topological complexity of planar polygon spaces wi…

A frame is a generalization of a basis of a vector space to a redundant overspanning set whose vectors are linearly dependent. Frames find applications in signal processing and quantum information theory. We present a genetic algorithm that…

We prove that the number of curves of a fixed genus g over finite fields is a polynomial function of the size of the field if and only if g is at most 8. Furthermore, we determine for each positive genus g the smallest n such that the…

The complexity of algorithms solving the motion planning problem is measured by a homotopy invariant TC(X) of the configuration space X of the system. Previously known lower bounds for TC(X) use the structure of the cohomology algebra of X.…

In this article, we construct the reduced genus-two Gromov-Witten invariants for certain almost K\"{a}hler manifold $(X, \omega, J)$ such that $J$ is integrable and satisfies some regularity conditions. In particular, the standard…

In this paper we give a characterization of the possible homology groups that can occur for compact simply connected cohomogeneity one manifolds in dimensions seven and lower.

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…

This paper gives a uniform, self-contained and direct approach to a variety of obstruction-theoretic problems on manifolds of dimension 7 and 6. We give necessary and sufficient cohomological criteria for the existence of various…

We obtain a combinatorial expression for the coefficients of the boundary map of real isotropic and odd orthogonal Grassmannians providing a natural generalization of the formulas already obtained for Lagrangian and maximal isotropic…

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 show that there exist an upper bound and a lower bound for the number of non-degenerate central configurations of the n-body problem in the plane with a homogeneous potential. In particular, both bounds are independent of the homogeneous…

Let $p$ be a prime number, let $d$ be an integer and let $G$ be a $d$-generated finite $p$-group of nilpotency class smaller than $p$. Then the number of possible isomorphism types for the mod $p$ cohomology algebra $H^*(G;{\mathbb F}_p)$…

In a previous paper we have suggested a number of ideas to attack circuit size complexity with cohomology. As a simple example, we take circuits that can only compute the AND of two inputs, which essentially reduces to SET COVER. We show a…

This paper considers affine analogues of the isoperimetric inequality in the sense of piecewise linear topology. Given a closed polygon P embedded in R^d having n edges, we give upper and lower bounds for the minimal number of triangles…

In this paper we study topology of the variety of closed planar polygons with given side lengths. We describe the Betti numbers of the moduli spaces as functions of the length vector. We also find sharp upper bounds on the sum of Betti…

A small polygon is a polygon of unit diameter. The maximal perimeter and the maximal width of a convex small polygon with $n=2^s$ vertices are not known when $s \ge 4$. In this paper, we construct a family of convex small $n$-gons, $n=2^s$…

We prove that the geodesic complexity of a regular tetrahedron exceeds its topological complexity by 1 or 2. The proof involves a careful analysis of minimal geodesics on the tetrahedron.

For a closed 4-manifold X and closed 3-manifold M we investigate the smallest integer n (perhaps infinity) such that M embeds in the connected sum of n copies of X. It is proven that any lens space (or homology lens space) embeds…

We derive a mixed integer nonlinear programming formulation for the problem of finding a convex polygon with a given number of vertices that is small (diameter at most one) and has maximum perimeter. The formulation is based on a geometric…

These expository notes are dedicated to the study of the topology of configuration spaces of manifolds. We give detailed computations of many invariants, including the fundamental group of the configuration spaces of $\mathbb{R}^2$, the…

Deterministic and probabilistic communication protocols are introduced in which parties can exchange the values of polynomials (rather than bits in the usual setting). It is established a sharp lower bound $2n$ on the communication…