activity
20112016
most citedWeak Separation, Pure Domains and Cluster Distance

5 citations · 14 across the 9 of their papers we have counts for

collaborators

11 papers

math.CO2016★ 5 cited

Weak Separation, Pure Domains and Cluster Distance

Miriam Farber, Pavel Galashin

Following the proof of the purity conjecture for weakly separated collections, recent years have revealed a variety of wider examples of purity in different settings. In this paper…

math.CO2015

Noncrossing partitions, toggles, and homomesies

David Einstein, Miriam Farber, Emily Gunawan +4

We introduce natural involutions ("toggles") on the set of noncrossing partitions of size , along with certain composite operations obtained by composing thes…

math.CO2015

Arrangements Of Minors In The Positive Grassmannian And a Triangulation of The Hypersimplex

Miriam Farber, Yelena Mandelshtam

The structure of zero and nonzero minors in the Grassmannian leads to rich combinatorics of matroids. In this paper, we investigate an even richer structure of possible equalities…

math.CO2015★ 2 cited

Arrangements of equal minors in the positive Grassmannian

Miriam Farber, Alexander Postnikov

We discuss arrangements of equal minors of totally positive matrices. More precisely, we investigate the structure of equalities and inequalities between the minors. We show that a…

math.CO2014★ 1 cited

Conjectured bounds for the sum of squares of positive eigenvalues of a graph

Clive Elphick, Felix Goldberg, Miriam Farber +1

A well known upper bound for the spectral radius of a graph, due to Hong, is that . It is conjectured that for connected graphs …

math.CO2014★ 2 cited

Interlacing networks: birational RSK, the octahedron recurrence, and Schur function identities

Miriam Farber, Sam Hopkins, Wuttisak Trongsiriwat

Motivated by the problem of giving a bijective proof of the fact that the birational RSK correspondence satisfies the octahedron recurrence, we define interlacing networks, which a…