Miriam Farber

activity

20112016

most citedWeak Separation, Pure Domains and Cluster Distance

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

collaborators

Showing 2014Show all

2 papers · 1 filter

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 $μ_{1}^{2} \leq 2 m - n + 1$ . It is conjectured that for connected graphs $n - 1 \leq s^{+} \leq 2 m - n + 1$ …

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…