output
20022009
most citedHierarchical structure and the prediction of missing links in networks

2.2k citations

Showing math.COShow all

23 papers · 1 filter

math.CO20093 cited

Matching polytopes and Specht modules

Ricky Ini Liu

We prove that the dimension of the Specht module of a forest is the same as the normalized volume of the matching polytope of . We also associate to a symmetric function…

math.CO20084 cited

The shifted plactic monoid

Luis Serrano

We introduce a shifted analog of the plactic monoid of Lascoux and Schützenberger, the \emph{shifted plactic monoid}. It can be defined in two different ways: via the \emph{shifted…

math.CO2008

Quantized dual graded graphs

Thomas Lam

We study quantized dual graded graphs, which are graphs equipped with linear operators satisfying the relation DU - qUD = rI. We construct examples based upon: the Fibonacci poset,…

math.CO2008

Ehrhart Theory for Lawrence Polytopes and Orbifold Cohomology of Hypertoric Varieties

Alan Stapledon

We establish a connection between the orbifold cohomology of hypertoric varieties and the Ehrhart theory of Lawrence polytopes. More specifically, we show that the dimensions of th…

math.CO20081 cited

A non-crossing standard monomial theory

T. Kyle Petersen, Pavlo Pylyavskyy, David E Speyer

The second author has introduced non-crossing tableaux, objects whose non-nesting analogues are semi-standard Young tableaux. We relate non-crossing tableaux to Gelfand-Tsetlin pat…

math.CO20081 cited

Promotion and cyclic sieving via webs

T. Kyle Petersen, Pavlo Pylyavskyy, Brendon Rhoades

We show that Schützenberger's promotion on two and three row rectangular Young tableaux can be realized as cyclic rotation of certain planar graphs introduced by Kuperberg. Moreove…