Related papers: Neural ring homomorphism preserves mandatory sets …

The CSP dichotomy conjecture has been recently established, but a number of other dichotomy questions remain open, including the dichotomy classification of list homomorphism problems for signed graphs. Signed graphs arise naturally in many…

Let $(R,\m)$ and $(S,\n)$ be commutative Noetherian local rings, and let $\phi:R\to S$ be a flat local homomorphism such that $\m S = \n$ and the induced map on residue fields $R/\m \to S/\n$ is an isomorphism. Given a finitely generated…

In this paper, we investigate a constrained formulation of neural networks where the output is a convex function of the input. We show that the convexity constraints can be enforced on both fully connected and convolutional layers, making…

We consider the notion of a connection on a module over a commutative ring, and recall the obstruction calculus for such connections. The obstruction calculus is defined using Hochschild cohomology. However, in order to compute with Grobner…

We prove a local-global principle for $\infty$-categories over any base $\infty$-category $\mathcal{C}$: we show that any $\infty$-category $\mathcal{B} \to \mathcal{C}$ over $\mathcal{C}$ is determined by the following data: the collection…

The positive semidefinite rank of a convex body $C$ is the size of its smallest positive semidefinite formulation. We show that the positive semidefinite rank of any convex body $C$ is at least $\sqrt{\log d}$ where $d$ is the smallest…

For graphs $G$ and $H$, an $H$-coloring of $G$ is an edge-preserving mapping from $V(G)$ to $V(H)$. Note that if $H$ is the triangle, then $H$-colorings are equivalent to $3$-colorings. In this paper we are interested in the case that $H$…

For a fixed set ${\cal H}$ of graphs, a graph $G$ is ${\cal H}$-subgraph-free if $G$ does not contain any $H \in {\cal H}$ as a (not necessarily induced) subgraph. A recently proposed framework gives a complete classification on ${\cal…

In this paper, we study two classic optimization problems: minimum geometric dominating set and set cover. In the dominating-set problem, for a given set of objects in {the} plane as input, the objective is to choose a minimum number of…

Let $\Omega$ be a complex manifold, and let $X\subset \Omega$ be an open submanifold whose closure $\bar X$ is a (not necessarily compact) submanifold with smooth boundary. Let $G$ be a complex Lie group, $\Pi$ be a differentiable principal…

We study definable sets $D$ of SU-rank 1 in $M^{eq}$, where $M$ is a countable homogeneous and simple structure in a language with finite relational vocabulary. Each such $D$ can be seen as a `canonically embedded structure', which inherits…

We show a new way to round vector solutions of semidefinite programming (SDP) hierarchies into integral solutions, based on a connection between these hierarchies and the spectrum of the input graph. We demonstrate the utility of our method…

An identifying open code of a graph $G$ is a set $S$ of vertices that is both a separating open code (that is, $N_G(u) \cap S \ne N_G(v) \cap S$ for all distinct vertices $u$ and $v$ in $G$) and a total dominating set (that is, $N(v) \cap S…

Let $(R,\mathfrak{m},k)$ denote a local ring. For $I$ and $J$ ideals of $R$, for all integer $i$, let $H^i_{I,J}(-)$ denote the $i$-th local cohomology functor with respect to $(I,J)$. Here we give a generalized version of Local Duality…

A multiobjective optimization problem is $C^r$ simplicial if the Pareto set and the Pareto front are $C^r$ diffeomorphic to a simplex and, under the $C^r$ diffeomorphisms, each face of the simplex corresponds to the Pareto set and the…

The notion of graph covers (also referred to as locally bijective homomorphisms) plays an important role in topological graph theory and has found its computer science applications in models of local computation. For a fixed target graph…

We study the set of deRham classes of Lee $1$-forms of the locally conformally symplectic (LCS) structures taming the complex structure of a compact complex surface in the Kodaira class VII, and show that the existence of non-trivial…

The Minimum Consistent Subset (MCS) problem arises naturally in the context of supervised clustering and instance selection. In supervised clustering, one aims to infer a meaningful partitioning of data using a small labeled subset.…

Let $M$ be an orientable connected closed surface and $f$ be an $R$-closed homeomorphism on $M$ which is isotopic to identity. Then the suspension of $f$ satisfies one of the following condition: 1) the closure of each element of it is…

Self-Supervised Learning (SSL) for Combinatorial Optimization (CO) is an emerging paradigm for solving combinatorial problems using neural networks. In this paper, we address a central challenge of SSL for CO: solving problems with discrete…