Related papers: NP-hardness of computing PL geometric category in …

We define the LS-category cat_g by means of covers of a space by general subsets, and show that this definition coincides with the classical Lusternik-Schnirelmann category for compact metric ANR spaces. We apply this result to give short…

In this paper, we will prove that the 2-category (2-SGp) of symmetric 2-groups and 2-category ($\cR$-2-Mod) of $\cR$-2-modules(\cite{5}) have enough projective objects, respectively.

We prove that, for every fixed $\theta_0>0$, selecting a subset of prescribed cardinality that maximizes the Solow--Polasky diversity indicator is NP-hard for finite point sets in $\mathbb{R}^2$ with the Euclidean metric, and therefore also…

We study the representation theory of the symmetric group $S_n$ in positive characteristic $p$. Using features of the LLT-algorithm we give a conjectural description of the projective cover $P(\lambda)$ of the simple module $D(\lambda)$…

Polynomial solutions to the KP hierarchy are known to be parametrized by a cone over an infinite-dimensional Grassmann variety. Using the notion of Schubert derivation on a Grassmann algebra, we encode the classical Pl\"ucker equations of…

We give upper bounds on the minimal degree of a model in $\mathbb{P}^2$ and the minimal bidegree of a model in $\mathbb{P}^1 \times \mathbb{P}^1$ of the curve defined by a given Laurent polynomial, in terms of the combinatorics of the…

The problem of constructing a limit series of Penrose type partitions of a two-dimensional sphere is solved, which makes it possible to model quasicrystals possessing a point icosahedral group symmetry Ih. Images of polyhedron models are…

We present the upper bound of the essential norm of the composition operator over the Polylogarithmic Hardy space PL2(D;s).The results involve the Nevanlinna counting function for PL2(D;s). We first prove the Littlewood-Paley Identity for…

The minimum distance is one of the most important combinatorial characterizations of a code. The maximum likelihood decoding problem is one of the most important algorithmic problems of a code. While these problems are known to be hard for…

We continue the study of counting complexity begun in [Buergisser, Cucker 04] and [Buergisser, Cucker, Lotz 05] by proving upper and lower bounds on the complexity of computing the Hilbert polynomial of a homogeneous ideal. We show that the…

The hypercube 2-segmentation problem is a certain biclustering problem that was previously claimed to be NP-hard, but for which there does not appear to be a publicly available proof of NP-hardness. This manuscript provides such a proof.

We prove that the problem of deciding whether a 2- or 3-dimensional simplicial complex embeds into $\mathbb{R}^3$ is NP-hard. Our construction also shows that deciding whether a 3-manifold with boundary tori admits an $\mathbb{S}^{3}$…

We show that packing axis-aligned unit squares into a simple polygon $P$ is NP-hard, even when $P$ is an orthogonal and orthogonally convex polygon with half-integer coordinates. It has been known since the early 80s that packing unit…

We introduce a class of densely defined, unbounded, 2-Hochschild cocycles ([PT]) on finite von Neumann algebras $M$. Our cocycles admit a coboundary, determined by an unbounded operator on the standard Hilbert space associated to the von…

We study the parameterized complexity of the following fundamental geometric problems with respect to the dimension $d$: i) Given $n$ points in $\Rd$, compute their minimum enclosing cylinder. ii) Given two $n$-point sets in $\Rd$, decide…

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…

Let $K$ be a non-archimedean local field of residual characteristic $p\neq 2$. Let $G$ be a connected reductive group over $K$, let $\theta$ be an involution of $G$ over $K$, and let $H$ be the connected component of $\theta$-fixed subgroup…

In this paper, we prove the conjectures of Gharakhloo and Welker (2023) that the positive matching decomposition number (pmd) of a $3$-uniform hypergraph is bounded from above by a polynomial of degree $2$ in terms of the number of…

Deciding whether a graph can be embedded in a grid using only unit-length edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a number of graph classes for which the problem is polynomial, even…

We prove that a maximal totally complex submanifold $N^{2n}$ of the quaternionic projective space $\mathbb{H}\mathbb{P}^n$ ($n\geq 2$) is a parallel submanifold, provided one of the following conditions is satisfied: (1) $N$ is the orbit of…