Related papers: On guarded extensions of MMSNP

In this article, we give a sufficient and necessary condition for determining whether a matchgate signature retains its property under a certain variable permutation, which can be checked in polynomial time. We also define the concept of…

We study classes of countable graphs where every member does not contain a given finite graph as an induced subgraph -- denoted by $\mathsf{Free}(\mathcal{G})$ for a given finite graph $\mathcal{G}$. Our main results establish a structural…

Monadic stability generalizes many tameness notions from structural graph theory such as planarity, bounded degree, bounded tree-width, and nowhere density. The sparsification conjecture predicts that the (possibly dense) monadically stable…

Motivated by the theory of proof complexity generators we consider the following $\Sigma^p_2$ search problem $\mbox{DD}_P$ determined by a propositional proof system $P$: given a $P$-proof $\pi$ of a disjunction $\bigvee_i {\alpha}_i$, no…

We prove that P = NP implies #P = FP by exploiting the topological structure of 3SAT solution spaces. The argument proceeds via a dichotomy: any polynomial-time algorithm for 3SAT either operates without global knowledge of the…

Let $\V$ be a symmetric monoidal model category and let $X$ be an object in $\V$. From this we can construct a new symmetric monoidal model category $Sp^{\Sigma}(\V,X)$ of symmetric spectra objects in $\V$ with respect to $X$, together with…

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 consider the {\em Deligne-Simpson problem (DSP) (resp. the weak DSP): Give necessary and sufficient conditions upon the choice of the $p+1$ conjugacy classes $c_j\subset gl(n,{\bf C})$ or $C_j\subset GL(n,{\bf C})$ so that there exist…

We consider $(M,g)$ a smooth compact Riemannian manifold of dimension $n \geq 2$ without boundary, $1 < p$ a real parameter and $r = \frac{p(n + p)}{n}$. This paper concerns the validity of the optimal Moser inequality \[ \left(\int_M…

We determine the computational complexity of approximately counting the total weight of variable assignments for every complex-weighted Boolean constraint satisfaction problem (or CSP) with any number of additional unary (i.e., arity 1)…

In 1995 T. Matsui considered a special family 0/1-polytopes for which the problem of recognizing the non-adjacency of two arbitrary vertices is NP-complete. In 2012 the author of this paper established that all the polytopes of this family…

Symmetric Grothendieck polynomials are inhomogeneous versions of Schur polynomials that arise in combinatorial $K$-theory. A polynomial has saturated Newton polytope (SNP) if every lattice point in the polytope is an exponent vector. We…

Forbidden Patterns Problems (FPPs) are a proper generalisation of Constraint Satisfaction Problems (CSPs). However, we show that when the input is connected and belongs to a class which has low tree-depth decomposition (e.g. structure of…

We prove an entropy versus degree dichotomy for low-degree tests and the Sum-of-Squares (SoS) hierarchy on a calibrated window after a gadget layer. For a target distribution \(\mu\) and a product-like proxy \(u\), we study the low-degree…

We introduce the {\sc classified stable matching} problem, a problem motivated by academic hiring. Suppose that a number of institutes are hiring faculty members from a pool of applicants. Both institutes and applicants have preferences…

In this paper, we focus on the separability of classes with the cross-entropy loss function for classification problems by theoretically analyzing the intra-class distance and inter-class distance (i.e. the distance between any two points…

The advent of graph convolutional network (GCN)-based multi-view learning provides a powerful framework for integrating structural information from heterogeneous views, enabling effective modeling of complex multi-view data. However,…

We study interactions between Skolem Arithmetic and certain classes of Constraint Satisfaction Problems (CSPs). We revisit results of Glass er et al. in the context of CSPs and settle the major open question from that paper, finding a…

For a graph $G=(V,E)$, a set $D\subseteq V$ is called a \emph{disjunctive dominating set} of $G$ if for every vertex $v\in V\setminus D$, $v$ is either adjacent to a vertex of $D$ or has at least two vertices in $D$ at distance $2$ from it.…

We introduce a new variant of the art gallery problem that comes from safety issues. In this variant we are not interested in guard sets of smallest cardinality, but in guard sets with largest possible distances between these guards. To the…