5 citations · 9 across the 15 of their papers we have counts for
16 papers
Weighted lattice point enumeration in lecture hall order polytopes
Katharina Jochemko, Krishna Menon
We consider weighted lattice point enumeration in lecture hall order polytopes. We observe that these half-open polytopes are closed under weight-lifting for a large class of polyn…
Gamma-positivity for octopuses: a bijective proof
Krishna Menon
Chapoton introduced an interesting family of polytopes called arbor polytopes, where a polytope is associated to any arbor . Chapoton conjectured that the polyno…
Ehrhart positivity for marked order polytopes
Katharina Jochemko, Krishna Menon
Given a pair of finite posets , the function counting integer-valued order preserving extensions of an order preserving map from to…
How to bounce your canon permutation
Danai Deligeorgaki, Krishna Menon
We study a new class of palindromic descent polynomials. Given a Dyck path of semilength and a permutation of size , one can label the up-steps and down-steps of …
Descent-restricted subsequences via RSK and evacuation
Krishna Menon, Anurag Singh
The length of a longest increasing subsequence in a permutation has been extensively studied. An increasing subsequence is one that has no descents. We study g…
Exploring the Influence of Graph Operations on Zero Forcing Sets
Krishna Menon, Anurag Singh
Zero forcing in graphs is a coloring process where a colored vertex can force its unique uncolored neighbor to be colored. A zero forcing set is a set of initially colored vertices…
Sum of squares of hook lengths and contents
Krishna Menon
It is known that for the Young diagram of any partition of an integer , the sum of squares of the hook lengths of its cells is exactly more than that of the contents of it…
Sketches, moves and partitions: counting regions of deformations of reflection arrangements
Priyavrat Deshpande, Krishna Menon
The collection of reflecting hyperplanes of a finite Coxeter group is called a reflection arrangement and it appears in many subareas of combinatorics and representation theory. We…
Subsequence frequency in binary words
Krishna Menon, Anurag Singh
The numbers we study in this paper are of the form , which is the number of binary words of length that contain the word (as a subsequence) exactly times.…
Dyck paths, binary words, and Grassmannian permutations avoiding an increasing pattern
Krishna Menon, Anurag Singh
A permutation is called Grassmannian if it has at most one descent. The study of pattern avoidance in such permutations was initiated by Gil and Tomasko in 2021. We continue this w…
Refinements of the braid arrangement and two parameter Fuss-Catalan numbers
Priyavrat Deshpande, Krishna Menon, Writika Sarkar
A hyperplane arrangement in is a finite collection of affine hyperplanes. Counting regions of hyperplane arrangements is an active research direction in enumerative…
A branch statistic for trees: Interpreting coefficients of the characteristic polynomial of braid deformations
Priyavrat Deshpande, Krishna Menon
A hyperplane arrangement in is a finite collection of affine hyperplanes. The regions are the connected components of the complement of these hyperplanes. By a theor…
Pattern avoidance of -pairs in circular permutations
Krishna Menon, Anurag Singh
The study of pattern avoidance in linear permutations has been an active area of research for almost half a century now, starting with the work of Knuth in 1973. More recently, the…
Pattern avoidance and dominating compositions
Krishna Menon, Anurag Singh
Jelínek, Mansour, and Shattuck studied Wilf-equivalence among pairs of patterns of the form where is a set partition of size with at least two blocks. They obtain…
A combinatorial statistic for labeled threshold graphs
Priyavrat Deshpande, Krishna Menon, Anurag Singh
Consider the collection of hyperplanes in whose defining equations are given by . This arrangement is called the threshold arr…
Counting regions of the boxed threshold arrangement
Priyavrat Deshpande, Krishna Menon, Anurag Singh
In this paper we consider the hyperplane arrangement in whose hyperplanes are . We call it…