Related papers: An upper bound for higher topological complexity a…

Let $B$ be a Borel subgroup of $\mathrm{GL}_n(\mathbb{C})$ and $\mathbb{T}$ a maximal torus contained in $B$. Then $\mathbb{T}$ acts on $\mathrm{GL}_{n}(\mathbb{C})/B$ and every Schubert variety is $\mathbb{T}$-invariant. We say that a…

We prove a double-exponential upper bound on the degree and on the complexity of constructing a Janet basis of a $D$-module. This generalizes a well known bound on the complexity of a Gr\"obner basis of a module over the algebra of…

It has been common wisdom among mathematicians that Extended Topological Field Theory in dimensions higher than two is naturally formulated in terms of n-categories with n> 1. Recently the physical meaning of these higher categorical…

We present a version of higher Hochschild homology for spaces equipped with principal bundles for a structure group $G$. As coefficients, we allow $E_\infty$-algebras with $G$-action. For this homology theory, we establish an equivariant…

In this paper we improve the upper bound of the number $N_{K, n}(X)$ of degree $n$ extensions of a number field $K$ with absolute discriminant bounded by $X$. This is achieved by giving a short $\mathcal{O}_K$-basis of an order of an…

We introduce higher-order Poincar'e constants for compact weighted manifolds and estimate them from above in terms of subsets. These estimates imply upper bounds for eigenvalues of the weighted Laplacian and the first nontrivial eigenvalue…

Let $G$ be a compact connected Lie group and let $\xi,\nu$ be complex vector bundles over the classifying space $BG$. The problem we consider is whether $\xi$ contains a subbundle which is isomorphic to $\nu$. The necessary condition is…

A 2+1-dimensional topological quantum field theory (TQFT) may or may not admit topological (gapped) boundary conditions. A famous necessary, but not sufficient, condition for the existence of a topological boundary condition is that the…

We treat the boundary problem for complex varieties (with isolated singularities) of dimension greater than one, which are contained in a suitable class of strictly pseudoconvex, unbounded domains of C^n.

We define a new topological invariant of line arrangements in the complex projective plane. This invariant is a root of unity defined under some combinatorial restrictions for arrangements endowed with some special torsion character on the…

Based on [1], we study the complexity of horizontality in each twistor space $\hat{E}_{\varepsilon}$ associated with an oriented vector bundle $E$ of rank $4$ with a positive-definite metric over the $2$-torus $T^2$, and obtain…

Let $Y\to X$ be a finite normal cover of a wedge of $n\geq 3$ circles. We prove that for any $v\neq 0\in H_1(Y;\mathbb{Q})$ there exists a lift $\widetilde{F}$ to $Y$ of a homotopy equivalence $F:X\to X$ so that the set of iterates…

We prove that for every $n$-vertex graph $G$, the extension complexity of the correlation polytope of $G$ is $2^{O(\mathrm{tw}(G) + \log n)}$, where $\mathrm{tw}(G)$ is the treewidth of $G$. Our main result is that this bound is tight for…

This thesis is a study of large sets of unit vectors in $\cx^n$ such that the absolute value of their standard inner products takes on only a small number of values. We begin with bounds: what is the maximal size of a set of lines with only…

We present a method to obtain upper bounds on covering numbers. As applications of this method, we reprove and generalize results of Rogers on economically covering Euclidean $n$-space with translates of a convex body, or more generally,…

A $d$-{\em interval} is a union of at most $d$ disjoint closed intervals on a fixed line. Tardos [Combinatorica 15 (1995), 123-134] and the second author [Disc. Comput. Geom. 18 (1997), 195-203] used topological tools to bound the…

Let G/H be a pseudo-Riemannian semisimple symmetric space. The tangent bundle T(G/H) contains a maximal G-invariant neighbourhood of the zero section where the adapted complex structure exists. Such neighbourhood is endowed with a canonical…

Covering numbers are a powerful tool used in the development of approximation algorithms, randomized dimension reduction methods, smoothed complexity analysis, and others. In this paper we prove upper bounds on the covering number of…

Farber and Rudyak introduced topological complexity $\mathbf{TC}(X)$ of motion planning and its higher analogs $\mathbf{TC}_n(X)$ to measure the complexity of assigning paths to point tuples. Motivated by motion planning where a robotic…

We prove an upper bound for the number of cyclic transitive subgroups in a finite permutation group and clarify the structure of the groups for which this bound becomes sharp. We also give an application in the theory of number fields.