Related papers: Collapsibility to a subcomplex of a given dimensio…

For all integers $k,d$ such that $k \geq 3$ and $k/2\leq d \leq k-1$, let $n$ be a sufficiently large integer {\rm(}which may not be divisible by $k${\rm)} and let $s\le \lfloor n/k\rfloor-1$. We show that if $H$ is a $k$-uniform hypergraph…

The Bodirsky-Pinsker conjecture asserts a P vs. NP-complete dichotomy for the computational complexity of Constraint Satisfaction Problems (CSPs) of first-order reducts of finitely bounded homogeneous structures. Prominently, two structures…

A given subset $A$ of natural numbers is said to be complete if every element of $\mathbb{N}$ is the sum of distinct terms taken from $A$. This topic is strongly connected to the knapsack problem which is known to be NP complete.…

We investigate the complexity of the reachability problem for (deep) neural networks: does it compute valid output given some valid input? It was recently claimed that the problem is NP-complete for general neural networks and…

Let A be an idempotent algebra on a finite domain. By mediating between results of Chen and Zhuk, we argue that if A satisfies the polynomially generated powers property (PGP) and B is a constraint language invariant under A (that is, in…

Deciding whether two simplicial complexes are homotopy equivalent is a fundamental problem in topology, which is famously undecidable. There exists a combinatorial refinement of this concept, called simple-homotopy equivalence: two…

We present some promising ideas to treat the problem of making completely rigorous the development of our expression for $\lambda_d(p)$ of the monomer-dimer problem on a $d$-dimensional hypercubic lattice \begin{equation}\label{abstract1}…

A given subset $A$ of natural numbers is said to be complete if every element of $\N$ is the sum of distinct terms taken from $A$. This topic is strongly connected to the knapsack problem which is known to be NP complete. The main goal of…

Let n and d be positive integers, let k be a field and let P(n,d;k) be the space of the polynomials in n variables of degree at most d with coefficients in k. Let B(n,d) be the set of the Bernstein-Sato polynomials of all polynomials in…

Let $K$ be a set of $k$ positive integers. A biclique cover of type $K$ of a graph $G$ is a collection of complete bipartite subgraphs of $G$ such that for every edge $e$ of $G$, the number of bicliques need to cover $e$ is a member of $K$.…

In 1984, Dancis proved that any $d$-dimensional simplicial manifold is determined by its $(\lfloor d/2 \rfloor + 1)$-skeleton. This paper adapts his proof to the setting of cubical complexes that can be embedded into a cube of arbitrary…

The computational complexity of the partition, 0-1 subset sum, unbounded subset sum, 0-1 knapsack and unbounded knapsack problems and their multiple variants were studied in numerous papers in the past where all the weights and profits were…

There has been a great of work on characterizing the complexity of the satisfiability and validity problem for modal logics. In particular, Ladner showed that the validity problem for all logics between K, T, and S4 is {\sl…

We relate the embeddability of the simplicial complex $[3]*K$ into $\mathbb{R}^{n+2}$ to that of $K$ into $\mathbb{R}^n$. In brief, the embeddability of $K$ into $\mathbb{R}^n$, in the metastable range $2n\geq 3(d+1)$, is equivalent to the…

Recently, Hajdu and S\'{a}rk\"{o}zy studied the multiplicative decompositions of polynomial sequences. In particular, they showed that when $k \geq 3$, each infinite subset of $\{x^k+1: x \in \mathbb{N}\}$ is multiplicatively irreducible.…

We generalize the KPZ equation to an O(3) $N=2j+1$ component model. In the limit $N \to \infty$ we show that the mode coupling equations become exact. Solving these approximately we find that the dynamic exponent $z$ increases from $3/2$…

Let $\Delta_k(n)$ denote the simplicial complex of $(k+1)$-crossing-free subsets of edges in $\binom{[n]}{2}$. Here $k,n\in \mathbb N$ and $n\ge 2k+1$. Jonsson (2003) proved that (neglecting the short edges that cannot be part of any…

We prove that path puzzles with complete row and column information--or equivalently, 2D orthogonal discrete tomography with Hamiltonicity constraint--are strongly NP-complete, ASP-complete, and #P-complete. Along the way, we newly…

We give a proof of the conjecture of Nelson and Nguyen [FOCS 2013] on the optimal dimension and sparsity of oblivious subspace embeddings, up to sub-polylogarithmic factors: For any $n\geq d$ and $\epsilon\geq d^{-O(1)}$, there is a random…

For positive integers $n$ and $d$, and the probability function $0\leq p(n)\leq 1$, we let $Y_{n,p,d}$ denote the probability space of all at most $d$-dimensional simplicial complexes on $n$ vertices, which contain the full…