相关论文: Neural ring homomorphism preserves mandatory sets …

This paper illustrates the richness of the concept of regular sets of time bounds and demonstrates its application to problems of computational complexity. There is a universe of bounds whose regular subsets allow to represent several time…

This thesis investigates the central role of homomorphism problems (structure-preserving maps) in two complementary domains: database querying over finite, graph-shaped data, and constraint solving over (potentially infinite) structures.…

We study the complexity of fundamental distributed graph problems in the recently popular setting where information about the input graph is available to the nodes before the start of the computation. We focus on the most common such…

This article resides in the realm of the noncommutative (free) analog of real algebraic geometry - the study of polynomial inequalities and equations over the real numbers - with a focus on matrix convex sets $C$ and their projections $\hat…

We analyze constrained and unconstrained minimization problems on patches of tetrahedra sharing a common vertex with discontinuous piecewise polynomial data of degree p. We show that the discrete minimizers in the spaces of piecewise…

There is increasing realization in neuroscience that information is represented in the brain, e.g., neocortex, hippocampus, in the form sparse distributed codes (SDCs), a kind of cell assembly. Two essential questions are: a) how are such…

Neural codes, represented as collections of binary strings, encode neural activity and show relationships among stimuli. Certain neurons, called place cells, have been shown experimentally to fire in convex regions in space. A natural…

A trigraph is a graph where each pair of vertices is labelled either 0 (a non-arc), 1 (an arc) or $\star$ (both an arc and a non-arc). In a series of papers, Hell and co-authors proposed to study the complexity of homomorphisms from graphs…

Convex neural codes are subsets of the Boolean lattice that record the intersection patterns of convex sets in Euclidean space. Much work in recent years has focused on finding combinatorial criteria on codes that can be used to classify…

Concurrent Constraint Programming (CCP) is a simple and powerful model for concurrency where agents interact by telling and asking constraints. Since their inception, CCP-languages have been designed for having a strong connection to logic.…

Let $N$ be a compact, connected, nonorientable surface of genus $g$ with $n$ boundary components. Let $\lambda$ be a simplicial map of the complex of curves, $\mathcal{C}(N)$, on $N$ which satisfies the following: $[a]$ and $[b]$ are…

For finitely generated modules $M$ and $N $ over a commutative Noetherian local ring $R$, we give various sufficient criteria for detecting freeness of $M$ or $N$ via vanishing of some finitely many Ext modules $\textrm{Ext}^i_R(M,N)$ and…

A neural code on $ n $ neurons is a collection of subsets of the set $ [n]=\{1,2,\dots,n\} $. In this paper, we study some properties of graphs of neural codes. In particular, we study codeword containment graph (CCG) given by Chan et al.…

In line with the recent development in topological graph theory, we are considering undirected graphs that are allowed to contain {\em multiple edges}, {\em loops}, and {\em semi-edges}. A graph is called {\em simple} if it contains no…

In this paper, we study a class $\mathcal{C}$ of squarefree monomial ideals $I\subseteq R=\mathbb{K}[x_1,\dots,x_n]$ over a field $\mathbb{K}$, defined by the condition that $\dim R/I$ equals the maximum degree of the minimal generators of…

The paper is concerned with the boundary behaviour of polynomially and rationally convex hulls in pseudoconvex domains in $\mathbb{C}^n$. As an application, it is shown that every connected polynomially or rationally convex compact set with…

When doing representation learning on data that lives on a known non-trivial manifold embedded in high dimensional space, it is natural to desire the encoder to be homeomorphic when restricted to the manifold, so that it is bijective and…

In this note, as a particular case of a more general result, we obtain the following theorem: Let $\Omega\subseteq {\bf R}^n$ be a non-empty bounded open set and let $f:\overline {\Omega}\to {\bf R}^n$ be a continuous function which is…

The permanent versus determinant conjecture is a major problem in complexity theory that is equivalent to the separation of the complexity classes VP_{ws} and VNP. Mulmuley and Sohoni (SIAM J. Comput., 2001) suggested to study a…

Let $I$ denote an ideal of a local ring $(R,\mathfrak{m})$ of dimension $n$. Let $M$ denote a finitely generated $R$-module. We study the endomorphism ring of the local cohomology module $H^c_I(M), c = \grade (I,M)$. In particular there is…