Related papers: Hardness Results for Weaver's Discrepancy Problem

We study the general $(\boldsymbol{\sigma},\mathbf{p})$-eigenvalue problem of nonnegative tensors introduced by A. Gautier, F. Tudisco, and M. Hein [SIAM J. Matrix Anal. Appl., 40 (2019), pp. 1206--1231], which unifies several well-studied…

We continue the study of the covering complexity of constraint satisfaction problems (CSPs) initiated by Guruswami, H{\aa}stad and Sudan [SIAM J. Comp. 2002] and Dinur and Kol [CCC'13]. The covering number of a CSP instance $\Phi$ is the…

We establish deterministic hardness of approximation results for the Shortest Vector Problem in $\ell_p$ norm ($\mathsf{SVP}_p$) and for Unique-SVP ($\mathsf{uSVP}_p$) for all $p > 2$. Previously, no deterministic hardness results were…

We study minimum cost constraint satisfaction problems (MinCostCSP) through the algebraic lens. We show that for any constraint language $\Gamma$ which has the dual discriminator operation as a polymorphism, there exists a…

We prove the inverse conjecture for the Gowers U^{s+1}[N]-norm for all s >= 3; this is new for s > 3, and the cases s<3 have also been previously established. More precisely, we establish that if f : [N] -> [-1,1] is a function with || f…

We prove the so-called inverse conjecture for the Gowers U^{s+1}-norm in the case s = 3 (the cases s < 3 being established in previous literature). That is, we establish that if f : [N] -> C is a function with |f(n)| <= 1 for all n and || f…

Many problems in high-dimensional statistics appear to have a statistical-computational gap: a range of values of the signal-to-noise ratio where inference is information-theoretically possible, but (conjecturally) computationally…

In this paper we propose statistical inference tools for the covariance operators of functional time series in the two sample and change point problem. In contrast to most of the literature the focus of our approach is not testing the null…

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…

In this work we consider the generalized Navier-Stoke equations with the presence of a damping term in the momentum equation. % The problem studied here derives from the set of equations which govern the isothermal flow of incompressible,…

In the present paper, we study the norms for symmetric and antisymmetric tensor products of weighted shift operators. By proving that for $n\geq 2$, $$\|S_{\alpha}^{l_1}\odot\cdots \odot S_{\alpha}^{l_k}\odot…

The multivariate resultant is a fundamental tool of computational algebraic geometry. It can in particular be used to decide whether a system of n homogeneous equations in n variables is satisfiable (the resultant is a polynomial in the…

Finding a d-regular spanning subgraph (or d-factor) of a graph is easy by Tutte's reduction to the matching problem. By the same reduction, it is easy to find a minimal or maximal d-factor of a graph. However, if we require that the…

Many important stable matching problems are known to be NP-hard, even when strong restrictions are placed on the input. In this paper we seek to identify structural properties of instances of stable matching problems which will allow us to…

Let $(M^n,g_0)$ be a smooth compact Riemannian manifold of dimension $n\geq 3$ with smooth non-empty boundary $\partial M$. Let $\Gamma\subset\mathbb{R}^n$ be a symmetric convex cone and $f$ a symmetric defining function for $\Gamma$…

Symbolic regression (SR) is the task of discovering a symbolic expression that fits a given data set from the space of mathematical expressions. Despite the abundance of research surrounding the SR problem, there's a scarcity of works that…

The Duffin-Schaeffer conjecture is a fundamental unsolved problem in metric number theory. It asserts that for every non-negative function $\psi:~\mathbb{N} \rightarrow \mathbb{R}$ for almost all reals $x$ there are infinitely many coprime…

Establishing the complexity of {\em Bounded Distance Decoding} for Reed-Solomon codes is a fundamental open problem in coding theory, explicitly asked by Guruswami and Vardy (IEEE Trans. Inf. Theory, 2005). The problem is motivated by the…

In the fundamental Stable Marriage and Stable Roommates problems, there are inherent trade-offs between the size and stability of solutions. While in the former problem, a stable matching always exists and can be found efficiently using the…

Every finite non-nilpotent group can be extended by a term operation such that solving equations in the resulting algebra is NP-complete and checking identities is co-NP-complete. This result was firstly proven by Horv\'ath and Szab\'o; the…