Searcharxiv⌕ Search

arXiv subjects

Chanchal Kumar

Publications and source records attributed to Chanchal Kumar.

6 recordsLinked to original sources
arXiv2026

Enumeration of certain subsets of uprooted trees and spherical parking functions

Spherical $G$-parking functions are a distinguished subset of standard monomials, arising from the skeleton ideals of the $G$-parking function ideal. Explicit enumeration formulas for spherical $G$-parking functions are known only for a few classes of graphs. In this paper, we consider a family of graphs $G_{\ell}$ ($1\leq \ell \leq n-2$), obtained from the complete graph $K_{n+1}$ by deleting the $\ell$ edges joining vertex $1$ to the vertices in $F_{\ell}= \{n-\ell+1, \ldots, n\}$. The uprooted spanning trees of $G_{\ell}-\{0\}$ correspond to the set $\mathcal{U}_n^{1\not\sim F_{\ell}}$ of uprooted trees with vertex set $[n]$ in which vertex $1$ is not adjacent to any vertex in $F_{\ell}$, and we establish that $|\mathcal{U}_n^{1\not\sim F_{\ell}}| = (n-1)^{n-\ell-2}(n-2)^{\ell}(n-\ell-1)$. We derive this formula combinatorially and independently recover it as an application of the matrix tree theorem, obtaining some combinatorial identities as consequences. Finally, we determine the number of spherical $G_{\ell}$-parking functions as $|\mathrm{sPF}(G_{\ell})| = (n-1)^{n-3}(n-\ell-1)^2$.

math.CO↗
arXiv2025

Combinatorial Identities Using the Matrix Tree Theorem

In this paper, we explore some interesting applications of the matrix tree theorem. In particular, we present a combinatorial interpretation of a distribution of $(n-1)^{n-1}$, in the context of uprooted spanning trees of the complete graph $K_{n}$, which was previously obtained by Chauve--Dulucq--Guibert. Additionally, we establish a combinatorial explanation for the distribution of $m^{n-1}n^{m-1}$, related to spanning trees of the complete bipartite graph $K_{m,n}$, which seems new. Furthermore, we extend this study to the graph $K_{n}\setminus \{e_{1,n}\}$, obtained by deleting an edge from $K_n$, and derive a new identity for the number of its uprooted spanning trees.

math.CO↗
arXiv2020

Standard Monomials of 1-Skeleton Ideals of Graphs and Their Signless Laplace Matrices

Let $G$ be a (multi) graph on the vertex set $V=\{0,1,\ldots ,n\}$ with root $0$. The $G$-parking function ideal $\mathcal{M}_G$ is a monomial ideal in the polynomial ring $R=\mathbb{K}[x_1,\ldots ,x_n]$ over a field $\mathbb{K}$ such that $\dim_{\mathbb K}\left(\frac{R}{\mathcal{M}_G}\right)=\det\left(\widetilde{L}_G\right)$, where $\widetilde{L}_G$ is the truncated Laplace matrix of $G$ and $\det\left(\widetilde L_G\right)$ is the determinant of $\widetilde L_G$. In other words, standard monomials of the Artinian quotient $\frac{R}{\mathcal{M}_G}$ correspond bijectively with the spanning trees of $G$. For $0\leq k\leq n-1$, the $k$-skeleton ideal $\mathcal{M}_G^{(k)}$ of $G$ is the monomial subideal $\mathcal{M}_G^{(k)}=\left\langle m_A:\emptyset\neq A\subseteq[n]\text{ and }|A|\leq k+1\right\rangle$ of the $G$-parking function ideal $\mathcal{M}_G=\left\langle m_A : \emptyset \neq A\subseteq[n]\right\rangle\subseteq R$. For a simple graph $G$, Dochtermann conjectured that $\dim_{\mathbb K}\left(\frac{R}{\mathcal{M}_G^{(1)}}\right)\geq\det\left(\widetilde{Q}_G\right)$, where $\widetilde Q_G$ is the truncated signless Laplace matrix of $G$. We show that Dochtermann conjecture holds for any (simple or multi) graph $G$ on $V$.

math.CO↗
arXiv2020

Skeleton Ideals of Certain Graphs, Standard Monomials and Spherical Parking Functions

Let $G$ be an (oriented) graph on the vertex set $V = \{ 0, 1,\ldots,n\}$ with root $0$. Postnikov and Shapiro associated a monomial ideal $\mathcal{M}_G$ in the polynomial ring $ R = {\mathbb{K}}[x_1,\ldots,x_n]$ over a field $\mathbb{K}$. A subideal $\mathcal{M}_G^{(k)}$ of $\mathcal{M}_G$ generated by subsets of $\widetilde{V}=V\setminus \{0\}$ of size at most $k+1$ is called a $k$-skeleton ideal of the graph $G$. Many interesting homological and combinatorial properties of $1$-skeleton ideal $\mathcal{M}_G^{(1)}$ are obtained by Dochtermann for certain classes of simple graph $G$. A finite sequence $\mathcal{P}=(p_1,\ldots,p_n) \in \mathbb{N}^n$ is called a spherical $G$-parking function if the monomial $\mathbf{x}^{\mathcal{P}} = \prod_{i=1}^{n} x_i^{p_i} \in \mathcal{M}_G \setminus \mathcal{M}_G^{(n-2)}$. Let ${\rm sPF}(G)$ be the set of all spherical $G$-parking functions. In this paper, a combinatorial description for all multigraded Betti numbers of the $k$-skeleton ideal $\mathcal{M}_{K_{n+1}}^{(k)}$ of the complete graph $K_{n+1}$ on $V$ are given. Also, using DFS burning algorithms of Perkinson-Yang-Yu (for simple graph) and Gaydarov-Hopkins (for multigraph), we give a combinatorial interpretation of spherical $G$-parking functions for the graph $G = K_{n+1}- \{e\}$ obtained from the complete graph $K_{n+1}$ on deleting an edge $e$. In particular, we showed that $|{\rm sPF}(K_{n+1}- \{e_0\} )|= (n-1)^{n-1}$ for an edge $e_0$ through the root $0$, but $|{\rm sPF}(K_{n+1} - \{e_1\})| = (n-1)^{n-3}(n-2)^2$ for an edge $e_1$ not through the root.

math.CO↗
arXiv2020

Integer Sequences and Monomial Ideals

Let $\mathfrak{S}_n$ be the set of all permutations of $[n]=\{1,\ldots,n\}$ and let $W$ be the subset consisting of permutations $\sigma \in \mathfrak{S}_n$ avoiding 132 and 312-patterns. The monomial ideal $I_W = \left\langle \mathbf{x}^{\sigma} = \prod_{i=1}^n x_i^{\sigma(i)} : \sigma \in W \right\rangle $ in the polynomial ring $R = k[x_1,\ldots,x_n]$ over a field $k$ is called a hypercubic ideal in the article (Certain variants of multipermutohedron ideals, Proc. Indian Acad. Sci.(Math Sci. Vol. 126, No.4, (2016), 479-500). The Alexander dual $I_W^{[\mathbf{n}]}$ of $I_W$ with respect to $\mathbf{n}=(n,\ldots,n)$ has the minimal cellular resolution supported on the first barycentric subdivision $\mathbf{Bd}(\Delta_{n-1})$ of an $n-1$-simplex $\Delta_{n-1}$. We show that the number of standard monomials of the Artinian quotient $\frac{R}{I_W^{[\mathbf{n}]}}$ equals the number of rooted-labelled unimodal forests on the vertex set $[n]$. In other words, \[ \dim_k\left(\frac{R}{I_W^{[\mathbf{n}]}}\right) = \sum_{r=1}^n r!~s(n,r) = {\rm Per}\left([m_{ij}]_{n \times n} \right),\] where $s(n,r)$ is the (signless) Stirling number of the first kind and ${\rm Per}([m_{ij}]_{n \times n})$ is the permanent of the matrix $[m_{ij}]$ with $m_{ii}=i$ and $m_{ij}=1$ for $i \ne j$. For various subsets $S$ of $\mathfrak{S}_n$ consisting of permutations avoiding patterns, the corresponding integer sequences $\left\lbrace \dim_k\left(\frac{R}{I_S^{[\mathbf{n}]}}\right) \right\rbrace_{n=1}^{\infty}$ are identified.

math.CO↗