Related papers: Neural Ideal Preserving Homomorphisms

In this paper, we study formal mappings between smooth generic submanifolds in multidimensional complex space and establish results on finite determination, convergence and local biholomorphic and algebraic equivalence. Our finite…

Let $R$ be a standard graded polynomial ring that is finitely generated over a field of characteristic $0$, let $\mathfrak{m}$ be the homogeneous maximal ideal of $R$, and let $I$ be a homogeneous prime ideal of $R$. Dao and Monta\~{n}o…

In this paper, we consider the N-pure notion. An ideal $I$ of a ring $R$ is said to be N-pure, if for every $a\in I$ there exists $b\in I$ such that $a(1-b)\in N(R)$, where N(R) is nil radical of $R$. We provide new characterizations for…

In this paper, we study the graph classification problem from the graph homomorphism perspective. We consider the homomorphisms from $F$ to $G$, where $G$ is a graph of interest (e.g. molecules or social networks) and $F$ belongs to some…

Let $R$ be a polynomial ring in $N$ variables over an arbitrary field $K$ and let $I$ be an ideal of $R$ generated by $n$ polynomials of degree at most 2. We show that there is a bound on the projective dimension of $R/I$ that depends only…

The study of different types of ideals in non self-adjoint operator algebras has been a topic of recent research. This study focuses on principal ideals in subalgebras of groupoid C*-algebras. An ideal is said to be principal if it is…

Let $F$ be a field and $M_n(F)$ the ring of $n \times n$ matrices over $F$. Given a subset $S$ of $M_n(F)$, the null ideal of $S$ is the set of all polynomials $f$ with coefficients from $M_n(F)$ such that $f(A) = 0$ for all $A \in S$. We…

Two graphs $G$ and $H$ are homomorphism indistinguishable over a graph class $\mathcal{F}$ if they admit the same number of homomorphisms from every graph $F \in \mathcal{F}$. Many graph isomorphism relaxations such as (quantum) isomorphism…

Let $I$ be a monomial ideal in a polynomial ring $A=K[x_1,...,x_n]$. We call a monomial ideal $J$ to be a minimal monomial reduction ideal of $I$ if there exists no proper monomial ideal $L \subset J$ such that $L$ is a reduction ideal of…

We study various binomial and monomial ideals arising in the theory of divisors, orientations, and matroids on graphs. We use ideas from potential theory on graphs and from the theory of Delaunay decompositions for lattices to describe…

Given a polynomial ring $C$ over a field and proper ideals $I$ and $J$ whose generating sets involve disjoint variables, we determine how to embed the associated primes of each power of $I+J$ into a collection of primes described in terms…

Let f: A\to B be a ring homomorphism between Noetherian normal integral domains. We establish a general criterion for f to induce a homomorphism Cl(f): Cl(A)\to Cl(B) on divisor class groups. For instance, this criterion applies whenever f…

The generalized test ideals introduced in [HY] are related to multiplier ideals via reduction to characteristic p. In addition, they satisfy many of the subtle properties of the multiplier ideals, which in characteristic zero follow via…

Primary decomposition of commutative monoid congruences is insensitive to certain features of primary decomposition in commutative rings. These features are captured by the more refined theory of mesoprimary decomposition of congruences,…

In recent years many algorithms have been developed for finding patterns in graphs and networks. A disadvantage of these algorithms is that they use subgraph isomorphism to determine the support of a graph pattern; subgraph isomorphism is a…

The core of an ideal is defined as the intersection of all of its reductions. In this paper we provide an explicit description for the core of a monomial ideal $I$ satisfying certain residual conditions, showing that ${\rm core}(I)$…

The main focus of this paper is on the problem of relating an ideal $I$ in the polynomial ring $\mathbb Q[x_1, \dots, x_n]$ to a corresponding ideal in $\mathbb F_p[x_1,\dots, x_n]$ where $p$ is a prime number; in other words, the…

Determining how the brain stores information is one of the most pressing problems in neuroscience. In many instances, the collection of stimuli for a given neuron can be modeled by a convex set in $\mathbb{R}^d$. Combinatorial objects known…

We introduce a construction, called linearization, that associates to any monomial ideal $I$ an ideal $\mathrm{Lin}(I)$ in a larger polynomial ring. The main feature of this construction is that the new ideal $\mathrm{Lin}(I)$ has linear…

Edge ideals of finite simple graphs $G$ on $n$ vertices are the ideals $I(G)$ of the polynomial ring $S$ in $n$ variables generated by the quadratic monomials associated with the edges of $G$. In this paper, we consider the possible pairs…