activity
20032020
most citedLower bounds for contingency tables via Lorentzian polynomials

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

collaborators

5 papers

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.CV2012★ 1 cited

A characterization of multiplier sequences for generalized Laguerre bases

Petter Brändén, Elin Ottergren

We give a complete characterization of multiplier sequences for generalized Laguerre bases. We also apply our methods to give a short proof of the characterization of Hermite multi…

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.CV2008★ 1 cited

Lee-Yang Problems and The Geometry of Multivariate Polynomials

Julius Borcea, Petter Brändén

We describe all linear operators on spaces of multivariate polynomials preserving the property of being non-vanishing in open circular domains. This completes the multivariate gene…

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…