SearcharxivSearch

arXiv subjects

Carolina Benedetti

Publications and source records attributed to Carolina Benedetti.

At least 19 recordsLinked to original sources

Order and Gorenstein properties for lattice path matroid polytopes

We characterize matroids whose polytopes are order polytopes as a special class of lattice path matroids, called snakes. This shows that snakes are exactly the objects lying in the intersection of the Neggers-Stanley conjecture and a conjecture of de Loera, Haws, and Köppe. We then characterize Gorenstein lattice path matroid polytopes, yielding a new class of matroids satisfying the latter conjecture. Finally, we also show that lattice path matroids are exactly the class of positroids in which the coarsest subdivision of the matroid base polytope into translates of order polytopes is a (finest) matroidal subdivision.

math.CO

On subdivisions of the permutahedron and flags of lattice path matroids

In this manuscript we study the subdivisions of the permutahedron $Π_n$ into two subpolytopes corresponding to flags of positroids, which are in particular flags of lattice path matroids (LPFMs). A subpolytope $P_{[u,v]}$ of $Π_n$ is a Bruhat Interval Polytope (BIP) if $P_{[u,v]}$ is the convex hull of all the permutations (viewed as points in $\RR^n$) in the interval $[u,v]$ in the Bruhat order of $§_n$. We show that the coarsest subdivisions we obtain into LPFMs are the only subdivisions of $Π_n$ via hyperplane splits, into subpolytopes corresponding to BIPs. More specifically, we describe the hyperplanes whose intersection with $Π_n$ give rise to BIPs. Hence, these subdivisions are polytopes coming from points in the complete nonnegative flag variety.

math.CO

Shellability of the quotient order on lattice path matroids

The concept of a matroid quotient has connections to fundamental questions in the geometry of flag varieties. In previous work, Benedetti and Knauer characterized quotients in the class of lattice path matroids (LPMs) in terms of a simple combinatorial condition. As a consequence, they showed that the quotient order on LPMs yields a graded poset whose rank polynomial relates to a refinement of the Catalan numbers. In this work we show that this poset admits an EL-labeling, implying that the order complex is shellable and hence enjoys several combinatorial and topological properties. We use this to establish bounds on the Möbius function of the poset, interpreting falling chains in the EL-labeling in terms of properties of underlying permutations. Furthermore, we show that this EL-labeling is in fact a Whitney labeling, in the sense of the recent notion introduced by González D'León and Hallam.

math.CO

A quantum Murnaghan--Nakayama rule for the flag manifold

In this paper, we give a rule for the multiplication of a Schubert class by a tautological class in the (small) quantum cohomology ring of the flag manifold. As an intermediate step, we establish a formula for the multiplication of a Schubert class by a quantum Schur polynomial indexed by a hook partition. This entails a detailed analysis of chains and intervals in the quantum Bruhat order. This analysis allows us to use results of Leung--Li and of Postnikov to reduce quantum products by hook Schur polynomials to the (known) classical product.

math.CO

Lattice path matroids and quotients

We characterize the quotients among lattice path matroids (LPMs) in terms of their diagrams. This characterization allows us to show that ordering LPMs by quotients yields a graded poset, whose rank polynomial has the Narayana numbers as coefficients. Furthermore, we study full lattice path flag matroids and show that -- contrary to arbitrary positroid flag matroids -- they correspond to points in the nonnegative flag variety. At the basis of this result lies an identification of certain intervals of the strong Bruhat order with lattice path flag matroids. A recent conjecture of Mcalmon, Oh, and Xiang states a characterization of quotients of positroids. We use our results to prove this conjecture in the case of LPMs.

math.CO

Kostant's partition function and magic multiplex juggling sequences

Kostant's partition function is a vector partition function that counts the number of ways one can express a weight of a Lie algebra $\mathfrak{g}$ as a nonnegative integral linear combination of the positive roots of $\mathfrak{g}$. Multiplex juggling sequences are generalizations of juggling sequences that specify an initial and terminal configuration of balls and allow for multiple balls at any particular discrete height. Magic multiplex juggling sequences generalize further to include magic balls, which cancel with standard balls when they meet at the same height. In this paper, we establish a combinatorial equivalence between positive roots of a Lie algebra and throws during a juggling sequence. This provides a juggling framework to calculate Kostant's partition functions, and a partition function framework to compute the number of juggling sequences. From this equivalence we provide a broad range of consequences and applications connecting this work to polytopes, posets, positroids, and weight multiplicities.

math.CO

Stable set polytopes and their 1-skeleta

We characterize the edges of two classes of $0/1$-polytopes. The first class corresponds to the stable set polytope of a graph $G$ and includes chain polytopes of posets, some instances of matroid independence polytopes, as well as newly-defined polytopes whose vertices correspond to noncrossing set partitions. In analogy with matroid basis polytopes, the second class is obtained by considering the stable sets of maximal cardinality. We investigate how the class of $0/1$-polytopes whose edges satisfy our characterization is situated within the hierarchy of $0/1$-polytopes. This includes the class of matroid polytopes. We also study the diameter of these classes of polytopes and improve slightly on the Hirsch bound.

math.CO

Todxs cuentan in ECCO: community and belonging in mathematics

The Encuentro Colombiano de Combinatoria (ECCO) is an international summer school that welcomes students and researchers with a wide variety of mathematical and personal experiences. ECCO has taught us a lot about what it might mean to truly find community and belonging in a mathematical space. The goal of this article is to share a few of the lessons that we have learned from helping to build it.

math.HO

Generalized Lattice Point Visibility

It is a well-known result that the proportion of lattice points visible from the origin is given by $\frac{1}{ζ(2)}$, where $ζ(s)=\sum_{n=1}^\infty\frac{1}{n^s}$ denotes the Riemann zeta function. Goins, Harris, Kubik and Mbirika, generalized the notion of lattice point visibility by saying that for a fixed $b\in\mathbb{N}$, a lattice point $(r,s)\in\mathbb{N}^2$ is $b$-visible from the origin if no other lattice point lies on the graph of a function $f(x)=mx^b$, for some $m\in\mathbb{Q}$, between the origin and $(r,s)$. In their analysis they establish that for a fixed $b\in\mathbb{N}$, the proportion of $b$-visible lattice points is $\frac{1}{ζ(b+1)}$, which generalizes the result in the classical lattice point visibility setting. In this short note we give an $n$-dimensional notion of $\bf{b}$-visibility that recovers the one presented by Goins et. al. in $2$-dimensions, and the classical notion in $n$-dimensions. We prove that for a fixed ${\bf{b}}=(b_1,b_2,\ldots,b_n)\in\mathbb{N}^n$ the proportion of ${\bf{b}}$-visible lattice points is given by $\frac{1}{ζ(\sum_{i=1}^nb_i)}$. Moreover, we propose a $\bf{b}$-visibility notion for vectors $\bf{b}\in \mathbb{Q}_{>0}^n$, and we show that by imposing weak conditions on those vectors one obtains that the density of ${\bf{b}}=(\frac{b_1}{a_1},\frac{b_2}{a_2},\ldots,\frac{b_n}{a_n})\in\mathbb{Q}_{>0}^n$-visible points is $\frac{1}{ζ(\sum_{i=1}^nb_i)}$. Finally, we give a notion of visibility for vectors $\bf{b}\in (\mathbb{Q}^{*})^n$, compatible with the previous notion, that recovers the results of Harris and Omar for $b\in \mathbb{Q}^{*}$ in $2$-dimensions; and show that the proportion of $\bf{b}$-visible points in this case only depends on the negative entries of $\bf{b}$.

math.NT

Quotients of uniform positroids

Flag matroids are a rich family of Coxeter matroids that can be characterized using pairs of matroids that form a quotient. We consider a class of matroids called positroids, introduced by Postnikov, and utilize their combinatorial representations to explore characterizations of flag positroids. Given a uniform positroid, we give a purely combinatorial characterization of a family of positroids that form quotients with it. We state this in terms of their associated decorated permutations. In proving our characterization we also fully describe the circuits of this family.

math.CO

Hypergraphic polytopes: combinatorial properties and antipode

In an earlier paper, the first two authors defined orientations on hypergraphs. Using this definition we provide an explicit bijection between acyclic orientations in hypergraphs and faces of hypergraphic polytopes. This allows us to obtain a geometric interpretation of the coefficients of the antipode map in a Hopf algebra of hypergraphs. This interpretation differs from similar ones for a different Hopf structure on hypergraphs provided recently by Aguiar and Ardila. Furthermore, making use of the tools and definitions developed here regarding orientations of hypergraphs we provide a characterization of hypergraphs giving rise to simple hypergraphic polytopes in terms of acyclic orientations of the hypergraph. In particular, we recover this fact for the nestohedra and the hyper-permutahedra, and prove it for generalized Pitman-Stanley polytopes as defined here.

math.CO

A combinatorial model for computing volumes of flow polytopes

We introduce new families of combinatorial objects whose enumeration computes volumes of flow polytopes. These objects provide an interpretation, based on parking functions, of Baldoni and Vergne's generalization of a volume formula originally due to Lidskii. We recover known flow polytope volume formulas and prove new volume formulas for flow polytopes that were seemingly unapproachable. A highlight of our model is an elegant formula for the flow polytope of a graph we call the caracol graph. As by-products of our work, we uncover a new triangle of numbers that interpolates between Catalan numbers and the number of parking functions, we prove the log-concavity of rows of this triangle along with other sequences derived from volume computations, and we introduce a new Ehrhart-like polynomial for flow polytope volume and conjecture product formulas for the polytopes we consider.

math.CO

Cancelation free formula for the antipode of linearized Hopf monoid

Many combinatorial Hopf algebras $H$ in the literature are the functorial image of a linearized Hopf monoid $\bf H$. That is, $H={\mathcal K} ({\bf H})$ or $H=\overline{\mathcal K} ({\bf H})$. Unlike the functor $\overline{\mathcal K}$, the functor ${\mathcal K}$ applied to ${\bf H}$ may not preserve the antipode of ${\bf H}$. In this case, one needs to consider the larger Hopf monoid ${\bf L}\times{\bf H}$ to get $H={\mathcal K} ({\bf H})=\overline{\mathcal K}({\bf L}\times{\bf H})$ and study the antipode in ${\bf L}\times{\bf H}$. One of the main results in this paper provides a cancelation free and multiplicity free formula for the antipode of ${\bf L}\times{\bf H}$. From this formula we obtain a new antipode formula for $H$. We also explore the case when ${\bf H}$ is commutative and cocommutative. In this situation we get new antipode formulas that despite of not being cancelation free, can be used to obtain one for $\overline{\mathcal K}({\bf H})$ in some cases. We recover as well many of the well-known cancelation free formulas in the literature. One of our formulas for computing the antipode in ${\bf H}$ involves acyclic orientations of hypergraphs as the central tool. In this vein, we obtain polynomials analogous to the chromatic polynomial of a graph, and also identities parallel to Stanley's (-1)-color theorem. One of our examples introduces a {\it chromatic} polynomial for permutations which counts increasing sequences of the permutation satisfying a pattern. We also study the statistic obtained after evaluating such polynomial at $-1$. Finally, we sketch $q$ deformations and geometric interpretations of our results. This last part will appear in a sequel paper in joint work with J. Machacek.

math.CO

Antipodes and involutions

If H is a connected, graded Hopf algebra, then Takeuchi's formula can be used to compute its antipode. However, there is usually massive cancellation in the result. We show how sign-reversing involutions can sometimes be used to obtain cancellation-free formulas. We apply this idea to nine different examples. We rederive known formulas for the antipodes in the Hopf algebra of polynomials, the shuffle Hopf algebra, the Hopf algebra of quasisymmertic functions in both the monomial and fundamental bases, the Hopf algebra of multi-quasisymmetric functions in the fundamental basis, and the incidence Hopf algebra of graphs. We also find cancellation-free expressions for particular values of the antipode in the immaculate basis for the noncommutative symmetric functions as well as the Malvenuto-Reutenauer and Porier-Reutenauer Hopf algebras, some of which are the first of their kind. We include various conjectures and suggestions for future research.

math.CO

Combinatorial Hopf Algebras of Simplicial Complexes

We consider a Hopf algebra of simplicial complexes and provide a cancellation-free formula for its antipode. We then obtain a family of combinatorial Hopf algebras by defining a family of characters on this Hopf algebra. The characters of these combinatorial Hopf algebras give rise to symmetric functions that encode information about colorings of simplicial complexes and their $f$-vectors. We also use characters to give a generalization of Stanley's $(-1)$-color theorem. A $q$-analog version of this family of characters is also studied.

math.CO

Combinatorial Hopf algebra of superclass functions of type $D$

We provide a Hopf algebra structure on the space of superclass functions on the unipotent upper triangular group of type D over a finite field based on a supercharacter theory constructed by André and Neto. Also, we make further comments with respect to types B and C. Type A was explores by M. Aguiar et. al (2010), thus this paper is a contribution to understand combinatorially the supercharacter theory of the other classical Lie types.

math.CO

Fomin-Greene monoids and Pieri operations

We explore monoids generated by operators on certain infinite partial orders. Our starting point is the work of Fomin and Greene on monoids satisfying the relations $(ur+\u{r+1})\u{r+1}ur=\u{r+1}ur(ur+\u{r+1})$ and $urut=usur$ if $|r-t|>1.$ Given such a monoid, the non-commutative functions in the variables $\u{}$ are shown to commute. Symmetric functions in these operators often encode interesting structure constants. Our aim is to introduce similar results for more general monoids not satisfying the relations of Fomin and Greene. This paper is an extension of a talk by the second author at the workshop on algebraic monoids, group embeddings and algebraic combinatorics at The Fields Institute in 2012.

math.CO

Schubert Polynomials and $k$-Schur functions

The main purpose of this paper is to show that the multiplication of a Schubert polynomial of finite type $A$ by a Schur function, which we refer to as Schubert vs. Schur problem, can be understood from the multiplication in the space of dual $k$-Schur functions. Using earlier work by the second author, we encode both problems by means of quasisymmetric functions. On the Schubert vs. Schur side, we study the poset given by the Bergeron-Sottile's $r$-Bruhat order, along with certain operators associated to this order. On the other side, we connect this poset with a graph on dual $k$-Schur functions given by studying the affine grassmannian order of Lam-Lapointe-Morse-Shimozono. Also, we define operators associated to the graph on dual $k$-Schur functions which are analogous to the ones given for the Schubert vs. Schur problem.

math.CO