Related papers: A formula for the core of an ideal
We define the notion of ideal convergence for sequences $(x_n)$ with values in topological spaces $X$ with respect to a family $\{F_\eta: \eta \in X\}$ of subsets of $X$ with $\eta \in F_\eta$. Each set $F_\eta$ quantifies the degree of…
Given a unital associative ring S and a subring R, we say that S is an ideal (or Dorroh) extension of R if for some ideal I of S, S = R + I, where the sum is direct. In this note we investigate the ideal structure of an arbitrary ideal…
A subideal is an ideal of an ideal of B(H) and a principal subideal is a principal ideal of an ideal of B(H). We determine necessary and sufficient conditions for a principal subideal to be an ideal of B(H). This generalizes to arbitrary…
An invertible matrix is called a Perron similarity if it diagonalizes an irreducible, nonnegative matrix. Each Perron similarity gives a nontrivial polyhedral cone, called the spectracone, and polytope, called the spectratope, of realizable…
We say that an ideal I is homogeneous, if its restriction to any I-positive subset is isomorphic to I. The paper investigates basic properties of this notion -- we give examples of homogeneous ideals and present some applications to…
The absolute separation of a polynomial is the minimum nonzero difference between the absolute values of its roots. In the case of polynomials with integer coefficients, it can be bounded from below in terms of the degree and the height…
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…
The $k$-core of a graph is the maximal subgraph in which every node has degree at least~$k$, the shell index of a node is the largest $k$ such that the $k$-core contains the node, and the degeneracy of a graph is the largest shell index of…
The set of prime numbers has been analyzed, based on their algebraic and arithmetical structure. Here by obtaining a sort of linear formula for the set of prime numbers, they are redefined and identified; under a systematic procedure it has…
Ideals are one of the main topics of interest to the study of the order structure of an algebra. Due to their nice properties, ideals have an important role both in lattice theory and semigroup theory. Two natural concepts of ideal can be…
To an ideal in $\mathbb{C}[x,y]$ one can associate a topological zeta function. This is an extension of the topological zeta function associated to one polynomial. But in this case we use a principalization of the ideal instead of an…
In this paper we introduce the notion of I-convergence of sequences of k-dimensional subspaces of an inner product space, where I is an ideal of subsets of N, the set of all natural numbers and k in N. We also study some basic properties of…
Let R be a commutative ring with identity and M be an R-module. A proper ideal I of R is said to be a $z^\circ$-ideal if for each $a \in I$ the intersection of all minimal prime ideals containing a is contained in I. The purpose of this…
Let $X$ be an uncountable Polish space and let $\mathcal{I}$ be an ideal on $\omega$. A point $\eta \in X$ is an $\mathcal{I}$-limit point of a sequence $(x_n)$ taking values in $X$ if there exists a subsequence $(x_{k_n})$ convergent to…
We characterize the fixed divisor of a polynomial $f(X)$ in $\mathbb{Z}[X]$ by looking at the contraction of the powers of the maximal ideals of the overring ${\rm Int}(\mathbb{Z})$ containing $f(X)$. Given a prime $p$ and a positive…
The central component of a polygon triangulation is defined as the triangle or diameter that contain its geometric center. More generally, every polygon dissection contains a central component. Using this notion, we derive new recurrences…
In optimization or machine learning problems we are given a set of items, usually points in some metric space, and the goal is to minimize or maximize an objective function over some space of candidate solutions. For example, in clustering…
A graph is called weakly perfect if its vertex chromatic number equals its clique number. Let $R$ be a ring and $I(R)^*$ be the set of all left proper non-trivial ideals of $R$. The intersection graph of ideals of $R$, denoted by $G(R)$, is…
An ideal in a polynomial ring encodes a system of linear partial differential equations with constant coefficients. Primary decomposition organizes the solutions to the PDE. This paper develops a novel structure theory for primary ideals in…
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…