Related papers: Depth stability of cover ideals

The distinguishing number $D(G)$ of a graph $G$ is the least integer $d$ such that $G$ has a vertex labeling with $d$ labels that is preserved only by a trivial automorphism. The distinguishing stability, of a graph $G$ is denoted by…

We compute the depth and (give bounds for) the regularity of generalized binomial edge ideals associated with generalized block graphs.

A graph $ G $ is said to be $ (H;k) $-vertex stable if $ G $ contains a~subgraph isomorphic to $ H $ even after removing any $ k $ of its vertices alongside with their incident edges. We will denote by $ \text{stab}(H;k) $ the minimum size…

Let $J_{n,m}:=(x_1x_2\cdots x_m,\; x_2x_3\cdots x_{m+1},\; \ldots,\; x_{n-m+1}\cdots x_n,\; x_{n-m+2}\cdots x_nx_1, \ldots, x_nx_1\cdots x_{m-1})$ be the $m$-path ideal of the cycle graph of length $n$, in the ring of polynomials…

Let $\hat{T} : X \times \mathbb{R} \to X \times \mathbb{R}$ given by $\hat{T}(x,t) = (Tx, g_x(t))$ be a skew-product dynamical system where $T : X \to X$ is a mixing conformal expanding map and, for each $x \in X$, $g_x : \mathbb{R} \to…

A graph H is strongly immersed in G if G is obtained from H by a sequence of vertex splittings (i.e., lifting some pairs of incident edges and removing the vertex) and edge removals. Equivalently, vertices of H are mapped to distinct…

If $J\subset I$ are two monomials ideals, we give a practical upper bound for the Stanley depth of $J/I$, which we call it the \emph{quasi-depth} of $J/I$. Also, we compute the quasi-depth of several classes of square free monomial ideals.…

Stable gonality is a multigraph parameter that measures the complexity of a graph. It is defined using maps to trees. Those maps, in some sense, divide the edges equally over the edges of the tree; stable gonality asks for the map with the…

Our previous paper shows that the (vertex) spanning tree degree enumerator polynomial of a connected graph $G$ is a real stable polynomial (id est is non-zero if all variables have positive imaginary parts) if and only if $G$ is…

The stability number of a graph G, denoted by alpha(G), is the cardinality of a maximum stable set, and mu(G) is the cardinality of a maximum matching in G. If alpha(G) + mu(G) equals its order, then G is a Koenig-Egervary graph. We call G…

Let J be a strongly stable monomial ideal in P=k[X0,...,Xn] and let BSt(J) be the family of all the homogeneous ideals in P such that the set N(J) of all the monomials that do not belong to J is a k-vector basis of the quotient P/I. We show…

Let $I\supsetneq J$ be two square free monomial ideals of a polynomial algebra over a field generated in degree $\geq 1$, resp. $\geq 2$ . Almost always when $I$ contains precisely one variable, the other generators having degrees $\geq 2$,…

In this paper we study depth and Stanley depth of the edge ideals and quotient rings of the edge ideals, associated to classes of graphs obtained by taking the strong product of two graphs. We consider the cases when either both graphs are…

The usual definition of the stability region of implicit multistep methods often implies that there are some isolated points of stability within the region of instability of the numerical method. These isolated stable points may appear when…

We consider a bipartite distance-regular graph $G$ with diameter at least 4 and valency at least 3. Fix a vertex of $G$ and let $T$ denote the corresponding subconstituent algebra. We give a detailed description of a certain type of…

Given a rational monomial map, we consider the question of finding a toric variety on which it is algebraically stable. We give conditions for when such variety does or does not exist. We also obtain several precise estimates of the degree…

Let $S=K[x_1,\ldots,x_n]$ be the ring of polynomials over a field $K$. Given two monomial ideals $0\subset I\subsetneq J \subset S$, we present a new method to compute the Hilbert depth of $J/I$. As an application, we show that if $u\in S$…

I relate bipartite graph matchings to stable matchings. I prove a necessary and sufficient condition for the existence of a saturating stable matching, where every agent on one side is matched, for all possible preferences. I extend my…

Let $G$ be a finite simple graph and let $I_G$ denote its associated toric ideal in the polynomial ring $R$. For each integer $n\geq 2$, we completely determine all the possible values for the tuple $({\rm reg}(R/I_G), {\rm…

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…