SBSara Billey

Sara Billey

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Sara Billey has a total of 25 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Brewing Fubini-Bruhat Orders

    by Sara C. Billey, Stark Ryan

    The Bruhat order on permutations arises out of the study of Schubert varieties in Grassmannians and flag varieties, which have been important for over 100 years. The purpose of this paper is to study variations on this theme related to subvarieties of the spanning line configurations $X_{n,k}$ as defined by Pawlowski and Rhoades. These subvarieties are indexed by Fubini words, or equivalently by ordered set partitions. Three natural partial orders arise in this context; we refer to them as the decaf, medium roast, and espresso orders. The decaf order is a generalization of the weak order on permutations defined by covering relations using simple transpositions. The medium roast order is a generalization of the (strong) Bruhat order defined by the closure relationship on the subvarieties. The espresso order is the transitive closure of a relation based on intersecting subvarieties. Many properties of Schubert varieties and Bruhat order extend to one or more of the three Fubini-Bruhat orders. We examine some of the many possibilities in this work.

  • Open Access

    Criteria for smoothness of positroid varieties via pattern avoidance, Johnson graphs, and spirographs

    by Sara Billey, Jordan Weaver

    Positroids are certain representable matroids originally studied by Postnikov in connection with the totally nonnegative Grassmannian and now used widely in algebraic combinatorics. The positroids give rise to determinantal equations defining positroid varieties as subvarieties of the Grassmannian variety. Rietsch, Knutson-Lam-Speyer, and Pawlowski studied geometric and cohomological properties of these varieties. In this paper, we continue the study of the geometric properties of positroid varieties by establishing several equivalent conditions characterizing smooth positroid varieties using a variation of pattern avoidance defined on decorated permutations, which are in bijection with positroids. This allows us to give two formulas for counting the number of smooth positroids along with two q q -analogs. We include enumerative results due to Christian Krattenthaler which follow from these formulas. Furthermore, we give a combinatorial method for determining the dimension of the tangent space of a positroid variety at key points using an induced subgraph of the Johnson graph. We also give a Bruhat interval characterization of positroids.


  • Open Access

    Criteria for smoothness of positroid varieties via pattern avoidance, Johnson graphs, and spirographs

    by Sara Billey, Jordan Weaver

    Positroids are certain representable matroids originally studied by Postnikov in connection with the totally nonnegative Grassmannian and now used widely in algebraic combinatorics. The positroids give rise to determinantal equations defining positroid varieties as subvarieties of the Grassmannian variety. Rietsch, Knutson-Lam-Speyer, and Pawlowski studied geometric and cohomological properties of these varieties. In this paper, we continue the study of the geometric properties of positroid varieties by establishing several equivalent conditions characterizing smooth positroid varieties using a variation of pattern avoidance defined on decorated permutations, which are in bijection with positroids. This allows us to give two formulas for counting the number of smooth positroids along with two $q$-analogs. We include enumerative results due to Christian Krattenthaler which follow from these formulas. Furthermore, we give a combinatorial method for determining the dimension of the tangent space of a positroid variety at key points using an induced subgraph of the Johnson graph. We also give a Bruhat interval characterization of positroids.

  • Open Access

    Tableau posets and the fake degrees of coinvariant algebras

    by Sara C. Billey, Matjaž Konvalinka, Joshua P. Swanson

    We introduce two new partial orders on the standard Young tableaux of a given partition shape, in analogy with the strong and weak Bruhat orders on permutations. Both posets are ranked by the major index statistic offset by a fixed shift. The existence of such ranked poset structures allows us to classify the realizable major index statistics on standard tableaux of arbitrary straight shape and certain skew shapes. By a theorem of Lusztig--Stanley, this classification can be interpreted as determining which irreducible representations of the symmetric group exist in which homogeneous components of the corresponding coinvariant algebra, strengthening a recent result of the third author for the modular major index. Our approach is to identify patterns in standard tableaux that allow one to mutate descent sets in a controlled manner. By work of Lusztig and Stembridge, the arguments extend to a classification of all nonzero fake degrees of coinvariant algebras for finite complex reflection groups in the infinite family of Shephard--Todd groups.

  • Open Access

    Parabolic Double Cosets in Coxeter Groups

    by Sara C. Billey, Matjaž Konvalinka, T. Kyle Petersen, William Slofstra, Bridget E. Tenner

    Parabolic subgroups $W_I$ of Coxeter systems $(W,S)$, as well as their ordinary and double quotients $W / W_I$ and $W_I \backslash W / W_J$, appear in many contexts in combinatorics and Lie theory, including the geometry and topology of generalized flag varieties and the symmetry groups of regular polytopes. The set of ordinary cosets $w W_I$, for $I \subseteq S$, forms the Coxeter complex of $W$, and is well-studied. In this article we look at a less studied object: the set of all double cosets $W_I w W_J$ for $I, J \subseteq S$. Double cosets are not uniquely presented by triples $(I,w,J)$. We describe what we call the lex-minimal presentation, and prove that there exists a unique such object for each double coset. Lex-minimal presentations are then used to enumerate double cosets via a finite automaton depending on the Coxeter graph for $(W,S)$. As an example, we present a formula for the number of parabolic double cosets with a fixed minimal element when $W$ is the symmetric group $S_n$ (in this case, parabolic subgroups are also known as Young subgroups). Our formula is almost always linear time computable in $n$, and we show how it can be generalized to any Coxeter group with little additional work. We spell out formulas for all finite and affine Weyl groups in the case that $w$ is the identity element.


  • Open Access

    Parabolic double cosets in Coxeter groups

    by Sara C. Billey, Matjaž Konvalinka, T. Kyle Petersen, William Slofstra, Bridget E. Tenner

    Parabolic subgroups $W_I$ of Coxeter systems $(W,S)$, as well as their ordinary and double quotients $W / W_I$ and $W_I \backslash W / W_J$, appear in many contexts in combinatorics and Lie theory, including the geometry and topology of generalized flag varieties and the symmetry groups of regular polytopes. The set of ordinary cosets $w W_I$, for $I \subseteq S$, forms the Coxeter complex of $W$, and is well-studied. In this article we look at a less studied object: the set of all double cosets $W_I w W_J$ for $I, J \subseteq S$. Double coset are not uniquely presented by triples $(I,w,J)$. We describe what we call the lex-minimal presentation, and prove that there exists a unique such object for each double coset. Lex-minimal presentations are then used to enumerate double cosets via a finite automaton depending on the Coxeter graph for $(W,S)$. As an example, we present a formula for the number of parabolic double cosets with a fixed minimal element when $W$ is the symmetric group $S_n$ (in this case, parabolic subgroups are also known as Young subgroups). Our formula is almost always linear time computable in $n$, and we show how it can be generalized to any Coxeter group with little additional work. We spell out formulas for all finite and affine Weyl groups in the case that $w$ is the identity element.

  • Open Access

    A bijective proof of Macdonald's reduced word formula

    by Sara C. Billey, Alexander E. Holroyd, Benjamin Young

    We give a bijective proof of Macdonald's reduced word identity using pipe dreams and Little's bumping algorithm. This proof extends to a principal specialization due to Fomin and Stanley. Such a proof has been sought for over 20 years. Our bijective tools also allow us to solve a problem posed by Fomin and Kirillov from 1997 using work of Wachs, Lenart, Serrano and Stump. These results extend earlier work by the third author on a Markov process for reduced words of the longest permutation.

  • Open Access

    Coefficients and roots of peak polynomials

    by Sara Billey, Matthew Fahrbach, Alan Talmage

    Given a permutation $\pi=\pi_1\pi_2\cdots \pi_n \in \mathfrak{S}_n$, we say an index $i$ is a peak if $\pi_{i-1} < \pi_i > \pi_{i+1}$. Let $P(\pi)$ denote the set of peaks of $\pi$. Given any set $S$ of positive integers, define ${\mathcal{P}_S(n)=\{\pi\in \mathfrak{S}_n:P(\pi)=S\}}$. Billey-Burdzy-Sagan showed that for all fixed subsets of positive integers $S$ and sufficiently large $n$, $|\mathcal{P}_S(n)|=p_S(n)2^{n-|S|-1}$ for some polynomial $p_S(x)$ depending on $S$. They conjectured that the coefficients of $p_S(x)$ expanded in a binomial coefficient basis centered at $\max(S)$ are all positive. We show that this is a consequence of a stronger conjecture that bounds the modulus of the roots of $p_S(x)$. Furthermore, we give an efficient explicit formula for peak polynomials in the binomial basis centered at $0$, which we use to identify many integer roots of peak polynomials along with certain inequalities and identities.

  • Coefficients and Roots of Peak Polynomials

    by Sara Billey, Matthew Fahrbach, Alan Talmage

    Given a permutation , we say an index i is a peak if πi − 1 < πi > πi + 1. Let P(π) denote the set of peaks of π. Given any set S of positive integers, define . Billey–Burdzy–Sagan showed that for all fixed subsets of positive integers S and sufficiently large n, for some polynomial pS(x) depending on S. They conjectured that the coefficients of pS(x) expanded in a binomial coefficient basis centered at max (S) are all positive. We show that this is a consequence of a stronger conjecture that bounds the modulus of the roots of pS(x). Furthermore, we give an efficient explicit formula for peak polynomials in the binomial basis centered at 0, which we use to identify many integer roots of peak polynomials along with certain inequalities and identities.


  • Open Access

    Coxeter-Knuth graphs and a signed Little map for type B reduced words

    by Sara Billey, Zachary Hamaker, Austin Roberts, Benjamin Young

    We define an analog of David Little's algorithm for reduced words in type B, and investigate its main properties. In particular, we show that our algorithm preserves the recording tableau of Kra\'{s}kiewicz insertion, and that it provides a bijective realization of the Type B transition equations in Schubert calculus. Many other aspects of type A theory carry over to this new setting. Our primary tool is a shifted version of the dual equivalence graphs defined by Assaf and further developed by Roberts. We provide an axiomatic characterization of shifted dual equivalence graphs, and use them to prove a structure theorem for the graph of Type B Coxeter-Knuth relations.