7 citations · 9 across the 25 of their papers we have counts for
20 papers · 1 filter
How to pick your team with no size restriction
Hiranya Kishore Dey
Settling a problem raised by Eccles in 2015, Narayanan in 2026 considers a two-player game in which two captains alternately select players while the opponent decides to which team…
-analogues of Fisher's inequality and oddtown theorem
Hiranya Kishore Dey
A classical result in design theory, known as Fisher's inequality, states that if every pair of clubs in a town shares the same number of members, then the number of clubs cannot e…
A descent-excedance correspondence in colored permutation groups
Hiranya Kishore Dey, Umesh Shankar, Sivaramakrishnan Sivasubramanian
It is well known that descents and excedances are equidistributed in the symmetric group. We show that the descent and excedance enumerators, summed over permutations with a fixed…
Sign-balance of excedances over mod-k-alternating permutations and gamma-positivity
Hiranya Kishore Dey, Iswar Mahato
A permutation is called mod-k-alternating if its entries are restricted to having the same remainder as the index, modulo some integer In this paper, we find the sign-b…
An exact enumeration of vertex connectivity of the enhanced power graphs of finite nilpotent groups
Sudip Bera, Hiranya Kishore Dey
The enhanced power graph of a group is a graph with vertex set where two distinct vertices and are adjacent if and only if there exists an element in such…
Sharp lower bound on the "number of nodal decomposition" of graphs
Hiranya Kishore Dey, Soumyajit Saha
Urschel introduced a notion of nodal partitioning to prove an upper bound on the number of nodal decomposition of discrete Laplacian eigenvectors. The result is an analogue to the…
Distance matrix of enhanced power graphs of finite groups
Anita Arora, Hiranya Kishore Dey, Shivani Goel
The enhanced power graph of a group is the graph with vertex set and edge set $ \{(u,v): u, v \in \langle w \rangle,~\mbox{for some}~ w \in G\}$. In this…
-enumeration of type B and D Eulerian polynomials based on parity of descents
Hiranya Kishore Dey, Umesh Shankar, Sivaramakrishnan Sivasubramanian
Carlitz and Scoville in 1973 considered a four variable polynomial that enumerates permutations in with respect to the parity of its descents and ascents. In recen…
On Difference of Enhanced Power Graph and Power Graph of a Finite Group
Sucharita Biswas, Peter J. Cameron, Angsuman Das +1
The difference graph of a finite group is the difference of enhanced power graph of and power graph of , with all isolated vertices are removed. In this paper we…
The Young matroid: A multiset extension of the Catalan matroid to arbitrary Young diagrams
Hiranya Kishore Dey, Brahadeesh Sankarnarayanan, S. Venkitesh
Introduced by Ardila (J. Combin. Theory Ser. A, 2003), the Catalan matroid is obtained by defining the bases of the matroid using Dyck paths from to . Further resear…
On connectivity, domination number and spectral radius of the proper enhanced power graphs of finite nilpotent groups
Sudip Bera, Hiranya Kishore Dey
For a group the enhanced power graph of is a graph with vertex set in which two distinct elements are adjacent if and only if there exists an element in …
Combinatorial proof of the log-convexity for the derangements in the Coxeter groups
Hiranya Kishore Dey, Subhajit Ghosh
We provide the combinatorial proofs of the log-convexity for the derangement numbers in the symmetric group , hyperoctahedral group , and the demihy…
Log-concavity of the Excedance Enumerators in positive elements of Type A and Type B Coxeter Groups
Hiranya Kishore Dey
The classical Eulerian Numbers are known to be log-concave. Let and be the number of even and odd permutations with excedances. In this paper, we…
Signed Alternating-runs enumeration in Classical Weyl Groups
Hiranya Kishore Dey, Sivaramakrishnan Sivasubramanian
The alternating-runs polynomial enumerates alternating runs in the symmetric group. There are three formulae for the number of permutations, in with …
Determining Number of Kneser Graphs: Exact Values and Improved Bounds
Angsuman Das, Hiranya Kishore Dey
The determining number of a graph is the minimum cardinality of a set such that pointwise stabilizer of under the action of is trivial. In t…
On the Alternating runs polynomial in type B and D Coxeter Groups
Hiranya Kishore Dey, Sivaramakrishnan Sivasubramanian
Wilf showed that the the alternating runs polynomial counting the number of permutations in the Symmetric group is divisible by where $m = \lfloor (n-2)/2 \rfloo…
On the connectivity of enhanced power graph of finite group
Sudip Bera, Hiranya Kishore Dey, Sajal Kumar Mukherjee
This paper deals with the vertex connectivity of enhanced power graph of finite group. We classify all abelian groups G such that vertex connectivity of enhanced power graph of G i…
Eulerian Central Limit Theorems and Carlitz identities in positive elements of Classical Weyl Groups
Hiranya Kishore Dey, Sivaramakrishnan Sivasubramanian
Central Limit Theorems are known for the Eulerian statistic "descent" (or "excedance") in the symmetric group $\SSS_n$. Recently, Fulman, Kim, Lee and Petersen gave a Central Limit…
Gamma positivity of the Excedance based Eulerian polynomial in positive elements of Classical Weyl Groups
Hiranya Kishore Dey, Sivaramakrishnan Sivasubramanian
The classical Eulerian polynomials are known to be gamma positive. Define the positive Eulerian polynomial as the polynomial obtained when we sum…
Gamma positivity of the Descent based Eulerian polynomial in positive elements of Classical Weyl Groups
Hiranya Kishore Dey, Sivaramakrishnan Sivasubramanian
The classical Eulerian polynomials are known to be gamma positive. Define the positive Eulerian polynomial as the polynomial obtained when we sum descents over…