Related papers: Neural ring homomorphism preserves mandatory sets …
The constraint satisfaction problem (CSP) involves deciding, given a set of variables and a set of constraints on the variables, whether or not there is an assignment to the variables satisfying all of the constraints. One formulation of…
The problem Cover(H) asks whether an input graph G covers a fixed graph H (i.e., whether there exists a homomorphism G to H which locally preserves the structure of the graphs). Complexity of this problem has been intensively studied. In…
We develop an obstruction theory for homotopy of homomorphisms f,g : M -> N between minimal differential graded algebras. We assume that M = Lambda V has an obstruction decomposition given by V = V_0 oplus V_1 and that f and g are homotopic…
We define a notion of morphism between combinatorial codes, making the class of all combinatorial codes into a category $\mathbf{Code}$. We show that morphisms can be used to remove redundant information from a code, and that morphisms…
F. Wehrung has asked: Given a family $\mathcal{C}$ of subsets of a set $\Omega$, under what conditions will there exist a total ordering on $\Omega$ under which every member of $\mathcal{C}$ is convex? <p> Note that if $A$ and $B$ are…
This paper is a commutative algebra introduction to the homological theory of quasi-coherent sheaves and contraherent cosheaves over quasi-compact semi-separated schemes. Antilocality is an alternative way in which global properties are…
Due to the corresponding fact concerning Hilbert spaces, it is natural to ask if the linearity and the orthogonality structure of a Hilbert $C^*$-module determine its $C^*$-algebra-valued inner product. We verify this in the case when the…
In this paper the authors prove fundamental decomposition theorems pertaining to the internal structure of monoidal triangulated categories (M$\Delta$Cs). The tensor structure of an M$\Delta$C enables one to view these categories like…
We initiate a systematic study of the computational complexity of the Constraint Satisfaction Problem (CSP) over finite structures that may contain both relations and operations. We show the close connection between this problem and a…
In this short note we give an elementary description of the linear part of the minimal free resolution of a Stanley-Reisner ring of a simplicial complex $\Delta$. Indeed, the differentials in the linear part are simply a compilation of…
Two tantalizing invariants of a combinatorial code $\mathcal C\subseteq 2^{[n]}$ are cdim$(\mathcal C)$ and odim$(\mathcal C)$, the smallest dimension in which $\mathcal C$ can be realized by convex closed or open sets, respectively. Cruz,…
We investigate generalized notions of the nerve complex for the facets of a simplicial complex. We show that the homologies of these higher nerve complexes determine the depth of the Stanley-Reisner ring $k[\Delta]$ as well as the…
The face ring of a simplicial complex modulo m generic linear forms is shown to have finite local cohomology if and only if the link of every face of dimension m or more is `nonsingular', i.e., has the homology of a wedge of spheres of the…
The "neural code" is the way the brain characterizes, stores, and processes information. Unraveling the neural code is a key goal of mathematical neuroscience. Topology, coding theory, and, recently, commutative algebra are some the…
There exist two conjectures for constraint satisfaction problems (CSPs) of reducts of finitely bounded homogeneous structures: the first one states that tractability of the CSP of such a structure is, when the structure is a model-complete…
Following Johnsen and Verdure (2013), we can associate to any linear code $C$ an abstract simplicial complex and in turn, a Stanley-Reisner ring $R_C$. The ring $R_C$ is a standard graded algebra over a field and its projective dimension is…
A full-homomorphism between a pair of graphs is a vertex mapping that preserves adjacencies and non-adjacencies. For a fixed graph $H$, a full $H$-colouring is a full-homomorphism of $G$ to $H$. A minimal $H$-obstruction is a graph that…
We continue the study of the recently-introduced C123-framework, for (simple) graph problems restricted to inputs specified by the forbidding of some finite set of subgraphs, to more general graph problems possibly involving multiedges and…
Finding actions that satisfy the constraints imposed by both external inputs and internal representations is central to decision making. We demonstrate that some important classes of constraint satisfaction problems (CSPs) can be solved by…
We study the sewing constraints for rational two-dimensional conformal field theory on oriented surfaces with possibly non-empty boundary. The boundary condition is taken to be the same on all segments of the boundary. The following…