activity
20052024
most citedAlternating Reachability

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

collaborators

13 papers

math.CO2024

Eigenbasis for a weighted adjacency matrix associated with the projective geometry

Murali K. Srinivasan

In a recent article "Projective geometries, -polynomial structures, and quantum groups" Terwilliger (arXiv:2407.14964) defined a certain weighted adjacency matrix, depending on…

math.CO2024

Subspaces, subsets, and Motzkin paths

Jonathan D. Farley, Murali K. Srinivasan

We define a map from subspaces to Motzkin paths and show that the inverse image of every path is a disjoint union of symmetric Boolean subsets yielding an explicit symmetric Boolea…

math.CO2022★ 1 cited

A q-analog of the adjacency matrix of the n-cube

Subhajit Ghosh, Murali K. Srinivasan

We define a q-analog of the adjacency matrix of the n-cube, determine its eigenvalues and write down a canonical eigenbasis. We give a weighted count of the number of rooted spanni…

math.CO2018

The perfect matching association scheme

Murali K. Srinivasan

We revisit the Bose-Mesner algebra of the perfect matching association scheme. Our main results are: 1. An inductive algorithm, based on solving linear equations, to compute the ei…

math.CO2015

On the representation theory of

Ashish Mishra, Murali K. Srinivasan

In the Vershik-Okounkov approach to the complex irreducible representations of and we parametrize the irreducible representations and their bases by spectral obje…

math.RT2014

Wreath product action on generalized Boolean algebras

Ashish Mishra, Murali K. Srinivasan

Let G be a finite group acting on the finite set X such that the corresponding (complex) permutation representation is multiplicity free. There is a natural rank and order preservi…