Related papers: Neural ring homomorphism preserves mandatory sets …

Assume $D$ is a finite set and $R$ is a finite set of functions from $D$ to the natural numbers. An instance of the minimum $R$-cost homomorphism problem ($MinHom_R$) is a set of variables $V$ subject to specified constraints together with…

Let $K\subseteq{\mathbb R}^n$ be a convex semialgebraic set. The semidefinite extension degree ${\mathrm{sxdeg}}(K)$ of $K$ is the smallest number $d$ such that $K$ is a linear image of an intersection of finitely many spectrahedra, each of…

Soft-thresholding has been widely used in neural networks. Its basic network structure is a two-layer convolution neural network with soft-thresholding. Due to the network's nature of nonlinearity and nonconvexity, the training process…

Computational intractability has for decades motivated the development of a plethora of methodologies that mainly aimed at a quality-time trade-off. The use of Machine Learning techniques has finally emerged as one of the possible tools to…

An important question in the study of constraint satisfaction problems (CSP) is understanding how the graph or hypergraph describing the incidence structure of the constraints influences the complexity of the problem. For binary CSP…

Given a finite-dimensional FTvN system $(\mathbb{V},\mathbb{W},\lambda)$, we study the convexification of the spectral set $\lambda^{-1}(\mathcal{C})$ induced by a set $\mathcal{C} \subseteq \mathbb{W}$. While the case of invariant…

Let $(A,\mathfrak{m})$ be a Cohen-Macaulay local ring with residue field $k$. If $M$ is a finitely generated $A$-module then set $\text{curv}(M) = \limsup_n\sqrt[n]{\beta_n^A(M)}$. We show that under mild hypotheses the existence of a…

We apply the generalized sphere-packing bound to two classes of subblock-constrained codes. A la Fazeli et al. (2015), we made use of automorphism to significantly reduce the number of variables in the associated linear programming problem.…

The Dichotomy Conjecture for constraint satisfaction problems (CSPs) states that every CSP is in P or is NP-complete (Feder-Vardi, 1993). It has been verified for conservative problems (also known as list homomorphism problems) by A.…

We present new degree-sequence lower bounds on the expected size of an independent set from the hard-core model. For arbitrary graphs, we establish a multivariate lower bound inspired by a conjecture of the first author and Kang and a…

For every hyperplane $H$ supporting a convex body $C$ in the hyperbolic space $\mathbb{H}^d$ we define the width of $C$ determined by $H$ as the distance between $H$ and a most distant ultraparallel hyperplane supporting $C$. We prove that…

Let $X$ be a connected, compact complex manifold and $S\subset X$ a separating real hypersurface, so that $X$ decomposes as a union of compact complex manifolds with boundary $\bar X^\pm$. Let $\mathcal{M}$ be the moduli space of $S$-framed…

In many applications it is important to establish if a given topological preordered space has a topology and a preorder which can be recovered from the set of continuous isotone functions. Under antisymmetry this property, also known as…

Neurosymbolic systems can satisfy logical constraints during learning without achieving the intended concept-label correspondence; this is a problem known as reasoning shortcuts. We formalize reasoning shortcuts as a constraint satisfaction…

We consider holomorphic mappings $H$ between a smooth real hypersurface $M\subset \bC^{n+1}$ and another $M'\subset \bC^{N+1}$ with $N\geq n$. We provide conditions guaranteeing that $H$ is transversal to $M'$ along all of $M$. In the…

One of the central open problems to classify the computational complexity of finite-domain constraint satisfaction problems within P is to prove better algorithmic results for CSPs with a Maltsev polymorphism; we do not even know whether…

Let R be a strongly Z-graded ring with degree-0 subring S, and let C be a chain complex of modules over the subring P of elements of non-negative degree. We show that there are non-commutative localisations of P which detect whether the…

We prove a \emph{query complexity} lower bound on rank-one principal component analysis (PCA). We consider an oracle model where, given a symmetric matrix $M \in \mathbb{R}^{d \times d}$, an algorithm is allowed to make $T$ \emph{exact}…

Holographic quantum-error correcting codes are models of bulk/boundary dualities such as the anti-de Sitter/conformal field theory (AdS/CFT) correspondence, where a higher-dimensional bulk geometry is associated with the code's logical…

A proof for the lower bound is provided for the smallest eigenvalue of finite element equations with arbitrary conforming simplicial meshes. The bound has a similar form as the one by Graham and McLean [SIAM J. Numer. Anal., 44 (2006), pp.…