Searcharxiv⌕ Search

arXiv subjects

Paramhans Kushwaha

Publications and source records attributed to Paramhans Kushwaha.

4 recordsLinked to original sources

On the Hilbert Series and Multiplicity of Generalized Binomial Edge Ideals

In this article, we compute the Hilbert series of the generalized binomial edge ideal associated with the join of two graphs. Consequently, we compute the Hilbert series of complete $r$-partite graphs. Further, we show that if a vertex satisfies a certain degree condition, then some Hilbert coefficients remain unchanged upon its removal. This provides a reduction technique for computing them. As an application, we compute the dimension and multiplicity of several classes of graphs.

math.AC↗

The Waldschmidt constant of square-free principal Borel ideals

Fix a square-free monomial $m = x_{i_1} \cdots x_{i_s}$ in $S = \K[x_1, \dots, x_n]$, where $\K$ is a field. The ideal generated by all square-free monomials that are Borel moves of $m$ is referred to as the \emph{square-free principal Borel ideal}, denoted by $\mathrm{sfBorel}(m)$. While the Waldschmidt constant of $\mathrm{sfBorel}(m)$ has been partially studied in the literature, we consider the remaining cases and provide bounds for the Waldschmidt constant of $\mathrm{sfBorel}(m)$. In some cases, we explicitly compute its exact value. Furthermore, we study this invariant for square-free Borel and square-free lex-segment ideals, establishing both bounds and exact values for special cases.

math.AC↗

Application of Betti Splittings to the Regularity of Binomial Edge Ideals

Let $G$ be a simple graph on $[n]$ vertices and $J_G$ denote the corresponding binomial edge ideal in $S=k[x_1,\ldots,x_n,y_1,\ldots,y_n]$, where $k$ is a field. In this paper, we provide an upper bound for the regularity of binomial edge ideals of trees. Our approach leverages the recently developed framework of Betti splittings of binomial edge ideals, a powerful technique for studying homological invariants via decompositions into simpler ideals. We also give a lower bound for the same. As a consequence, we explicitly compute the regularity of binomial edge ideals of trees under certain conditions.

math.AC↗

Hilbert Coefficients and Regularity of Binomial Edge Ideals

Let $G$ be a simple graph on $n$ vertices, and let $J_G$ denotes the corresponding binomial edge ideal in $S=\mathbb{K}[x_1,\ldots,x_n,y_1,\ldots,y_n]$, where $\mathbb{K}$ is a field. We show that if a vertex satisfies a certain degree condition, then some Hilbert coefficients remain unchanged upon its removal, thereby providing a reduction technique for computing Hilbert coefficients. As an application, for any $i\geq 0$ and a pair $(r,s)$ with $r\geq 2, s\in \mathbb{Z}$, we show that there always exists a graph $G$ such that $\mathrm{reg}(S/J_G)=r$ and $e_i(S/J_G)=s$, where $\mathrm{reg}(S/J_G)$ and $e_i(R/J_G)$ denote the Castelnuovo-Mumford regularity and the $i$-th Hilbert coefficient of $S/J_G$, respectively. In particular, this demonstrates that there is no inherent relationship between the regularity and the Hilbert coefficients for the class of binomial edge ideals.

math.AC↗