5 citations · 7 across the 5 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2020★ 5 cited
Lower bounds for contingency tables via Lorentzian polynomials
Petter Brändén, Jonathan Leake, Igor Pak
We present a new lower bound on the number of contingency tables, improving upon and extending previous lower bounds by Barvinok and Gurvits. As an application, we obtain new lower…
math.CO2011
Mesh patterns and the expansion of permutation statistics as sums of permutation patterns
Petter Brändén, Anders Claesson
Any permutation statistic $f:\sym\to\CC$ may be represented uniquely as a, possibly infinite, linear combination of (classical) permutation patterns: . To provide ex…
math.CO2003
Finite automata and pattern avoidance in words
Petter Brändén, Toufik Mansour
We say that a word on a totally ordered alphabet avoids the word if there are no subsequences in order-equivalent to . In this paper we suggest a new approach to the…