#### Filter Results:

#### Publication Year

2002

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

We study a group action on permutations due to Foata and Strehl and use it to prove that the descent generating polynomial of certain sets of permutations has a nonnegative expansion in the basis {t i (1 + t) n−1−2i } m i=0 , m = ⌊(n − 1)/2⌋. This property implies symmetry and unimodality. We prove that the action is invariant under stack-sorting which… (More)

We call a Stieltjes continued fraction with monic monomial numerators a Catalan continued fraction. Let e k (π) be the number of increasing subsequences of length k + 1 in the permutation π. We prove that any Cata-lan continued fraction is the multivariate generating function of a family of statistics on the 132-avoiding permutations, each consisting of a… (More)

We generalize the notion of graded posets to what we call sign-graded (labeled) posets. We prove that the W-polynomial of a sign-graded poset is symmetric and unimodal. This extends a recent result of Reiner and Welker who proved it for graded posets by associating a simplicial polytopal sphere to each graded poset. By proving that the W-polynomials of… (More)

We say that a word w on a totally ordered alphabet avoids the word v if there are no subsequences in w order-equivalent to v. In this paper we suggest a new approach to the enumeration of words on at most k letters avoiding a given pattern. By studying an automaton which for fixed k generates the words avoiding a given pattern we derive several previously… (More)

The Narayana numbers are N (n, k) = 1 n n k n k+1. There are several natural statistics on Dyck paths with a distribution given by N (n, k). We show the equidistribution of Narayana statistics by computing the flag h-vector of J(2 × n) in different ways. In the process we discover new Narayana statistics and provide co-statistics for which the Narayana… (More)

- Petter Brändén, Luca Moci
- 2012

We introduce an arithmetic version of the multivariate Tutte polynomial recently studied by Sokal, and a quasi-polynomial that interpolates between the two. We provide a generalized Fortuin-Kasteleyn representation for representable arithmetic matroids, with applications to arithmetic colorings and flows. We give a new proof of the positivity of the… (More)

Any permutation statistic f : S → C may be represented uniquely as a, possibly infinite, linear combination of (classical) permutation patterns: f = Σ τ λ f (τ)τ. To provide explicit expansions for certain statistics, we introduce a new type of permutation patterns that we call mesh patterns. Intuitively, an occurrence of the mesh pattern p = (π, R) is an… (More)

- Petter Brändén
- 2010

A hyperbolic program is an optimization problem of the form minimize c T x such that Ax = b and x ∈ Λ + , where c ∈ R n , Ax = b is a system of linear equations and Λ + is the closure of a so called hyperbolicity cone. Hyperbolic programming generalizes semidefinite programming, but it is not known to what extent since it is not known how general the… (More)

A matroid has the weak half-plane property (WHPP) if there exists a stable polynomial with support equal to the set of bases of the matroid. If the polynomial can be chosen with all nonzero coefficients equal to one then the matroid has the half-plane property (HPP). We describe a systematic method that allows us to reduce the WHPP to the HPP for large… (More)