相关论文: NP-hardness of computing PL geometric category in …

It has recently been shown that the problem of testing global convexity of polynomials of degree four is {strongly} NP-hard, answering an open question of N.Z. Shor. This result is minimal in the degree of the polynomial when global…

A polyhedron $\textbf{P} \subset \mathbb{R}^3$ has Rupert's property if a hole can be cut into it, such that a copy of $\textbf{P}$ can pass through this hole. There are several works investigating this property for some specific polyhedra:…

Using elementary graded automorphisms of polytopal algebras (essentially the coordinate rings of projective toric varieties) polyhedral versions of the group of elementary matrices and the Steinberg and Milnor groups are defined. They…

In the packing-constrained point covering problem, PC^2, one seeks configurations of points in the plane that cannot all be covered by a packing arrangement of unit disks. We consider in particular the problem of finding the minimum number…

Let $\Delta$ be a $d$-dimensional normal pseudomanifold, $d \ge 3.$ A relative lower bound for the number of edges in $\Delta$ is that $g_2$ of $\Delta$ is at least $g_2$ of the link of any vertex. When this inequality is sharp $\Delta$ has…

Shellings of simplicial complexes have long been a useful tool in topological and algebraic combinatorics. Shellings of a complex expose a large amount of information in a helpful way, but are not easy to construct, often requiring deep…

Given a piecewise linear (PL) function $p$ defined on an open subset of $\R^n$, one may construct by elementary means a unique polyhedron with multiplicities $\D(p)$ in the cotangent bundle $\R^n\times \R^{n*}$ representing the graph of the…

We determine the Lusternik-Schnirelmann category of the projective product spaces introduced by D. Davis. We also obtained an upper bound for the topological complexity of these spaces, which improves the estimate given by J. Gonz\'alez, M.…

In this paper, we use new results together with established facts about Thurston's compactification of Teichm\"uller space to address the geometric P=W conjecture for $\mathrm{SL}(2,\mathbb{C})$, which concerns projective compactifications…

Let $f\colon M^{2n}\to\mathbb{R}^{2n+p}$ denote an isometric immersion of a Kaehler manifold of complex dimension $n\geq 2$ into Euclidean space with codimension $p$. If $2p\leq 2n-1$, we show that generic rank conditions on the second…

The work is devoted to the variety of $2$-dimensional algebras over an algebraically closed field. Firstly, we classify such algebras modulo isomorphism. Then we describe the degenerations and the closures of principal algebra series in the…

Golodness of 2-dimensional simplicial complexes is studied through polyhedral products, and combinatorial and topoogical characterization of Golodness of surface triangulations is given. An answer to the question of Berglund is also given…

As an example of the categorical apparatus of pseudo algebras over 2-theories, we show that pseudo algebras over the 2-theory of categories can be viewed as pseudo double categories with folding or as appropriate 2-functors into…

We prove a complete classification of degree-$2$ foliations on $\mathbb{P}^n$ in any dimension, assuming they are not algebraically integrable. If $\mathcal{F}$ is such a foliation, then either $\mathcal{F}$ is the linear pull-back of a…

We study the minimum number of constraints needed to formulate random instances of the maximum stable set problem via linear programs (LPs), in two distinct models. In the uniform model, the constraints of the LP are not allowed to depend…

Let $S\subset\Ps^r$ ($r\geq 5$) be a nondegenerate, irreducible, smooth, complex, projective surface of degree $d$. Let $\delta_S$ be the number of double points of a general projection of $S$ to $\Ps^4$. In the present paper we prove that…

We study the problem of computing the minimum vertex cover on k-uniform k-partite hypergraphs when the k-partition is given. On bipartite graphs (k = 2), the minimum vertex cover can be computed in polynomial time. For general k, the…

Our main result is that every n-dimensional polytope can be described by at most (2n-1) polynomial inequalities and, moreover, these polynomials can explicitly be constructed. For an n-dimensional pointed polyhedral cone we prove the bound…

Milnor manifolds are a class of certain codimension-$1$ submanifolds of the product of projective spaces. In this paper, we study the LS-category and topological complexity of these manifolds. We determine the exact value of the LS-category…

We discuss the computational complexity of special cases of the 3-dimensional (axial) assignment problem where the elements are points in a Cartesian space and where the cost coefficients are the perimeters of the corresponding triangles…