Skip to content
Log in
Sponsored AI Networking Cookbook: Practical recipes for AI-assisted network automation and development AI Networking Cookbook: Practical recipes for AI-assisted network automation and development

Author

Paramhans Kushwaha

View on Semantic Scholar

3 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Sep 2026

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 $\...

Ajay Kumar, Rajiv Kumar, Paramhans Kushwaha · 0 citations
#edge computing Preprint Sep 2026

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 unchange...

Paramhans Kushwaha · 0 citations
#edge computing Open access Sep 2026

Application of betti splittings to the regularity of binomial edge ideals

Let [Formula: see text] be a simple graph on [Formula: see text] vertices and [Formula: see text] denote the corresponding binomial edge ideal in [Formula: see text], where [Formula: see text] is a field. In this paper, we provide an upper bound for the regularity of binomial edge ideals of trees. Our approach leverage...

Rajiv Kumar, Paramhans Kushwaha · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.