Murali K. Srinivasan

activity

20052024

most citedAlternating Reachability

2 citations · 5 across the 11 of their papers we have counts for

collaborators

Showing 2010Show all

2 papers · 1 filter

math.CO2010

Note on Doron Zeilberger's paper: $(2 5)$ proofs that $(k n) \leq (k + 1 n)$ if $k < n /2$

Murali K. Srinivasan

We present yet another algebraic proof of the unimodality of the binomial coefficients.

math.CO2010★ 2 cited

Symmetric chains, Gelfand-Tsetlin chains, and the Terwilliger algebra of the binary Hamming scheme

Murali K. Srinivasan

The de Bruijn-Tengbergen-Kruyswijk (BTK) construction is a simple algorithm that produces an explicit symmetric chain decomposition of a product of chains. We linearize the BTK alg…

Note on Doron Zeilberger's paper: (25​) proofs that (kn​)≤(k+1n​) if k<n/2

Symmetric chains, Gelfand-Tsetlin chains, and the Terwilliger algebra of the binary Hamming scheme

Note on Doron Zeilberger's paper: $(2 5)$ proofs that $(k n) \leq (k + 1 n)$ if $k < n /2$