International audience We present statistic-preserving bijections between four classes of combinatorial objects. Two of them, the class of unlabeled $(\textrm{2+2})$-free posets and a certain class of chord diagrams (or involutions), already appeared in the literature, but were apparently not known to be equinumerous. The third one is a new class of pattern avoiding permutations, and the fourth one consists of certain integer sequences called $\textit{ascent sequences}$. We also determine the generating function of these classes of objects, thus recovering a non-D-finite series obtained by Zagier for chord diagrams. Finally, we characterize the ascent sequences that correspond to permutations avoiding the barred pattern $3\bar{1}52\bar{4}$, and enumerate those permutations, thus settling a conjecture of Pudwell. Nous présentons des bijections, transportant de nombreuses statistiques, entre quatre classes d'objets. Deux d'entre elles, la classe des EPO (ensembles partiellement ordonnés) sans motif $(\textrm{2+2})$ et une certaine classe d'involutions, sont déjà apparues dans la littérature. La troisième est une classe de permutations à motifs exclus, et la quatrième une classe de suites que nous appelons $\textit{suites à montées}$. Nous déterminons ensuite la série génératrice de ces classes, retrouvant ainsi un résultat prouvé par Zagier pour les involutions sus-mentionnées. La série obtenue n'est pas D-finie. Apparemment, le fait qu'elle compte aussi les EPO sans motif $(\textrm{2+2})$ est nouveau. Finalement, nous caractérisons les suites à montées qui correspondent aux permutations évitant le motif barré $3\bar{1}52\bar{4}$ et énumérons ces permutations, ce qui démontre une conjecture de Pudwell.
This paper presents a bijection between ascent sequences and upper triangular matrices whose non-negative entries are such that all rows and columns contain at least one non-zero entry. We show the equivalence of several natural statistics on these structures under this bijection and prove that some of these statistics are equidistributed. Several special classes of matrices are shown to have simple formulations in terms of ascent sequences. Binary matrices are shown to correspond to ascent sequences with no two adjacent entries the same. Bidiagonal matrices are shown to be related to order-consecutive set partitions and a simple condition on the ascent sequences generate this class.
We introduce a new combinatorial object called a web world that consists of a set of web diagrams. The diagrams of a web world are generalizations of graphs, and each is built on the same underlying graph. Instead of ordinary vertices the diagrams have pegs, and edges incident to a peg have different heights on the peg. The web world of a web diagram is the set of all web diagrams that result from permuting the order in which endpoints of edges appear on a peg. The motivation comes from particle physics, where web diagrams arise as particular types of Feynman diagrams describing scattering amplitudes in non-Abelian gauge (Yang-Mills) theories. To each web world we associate two matrices called the web-colouring matrix and web-mixing matrix. The entries of these matrices are indexed by ordered pairs of web diagrams (D1, D2), and are computed from those colourings of the edges of D1 that yield D2 under a transformation determined by each colouring.We show that colourings of a web diagram (whose constituent indecomposable diagrams are all unique) that lead to a reconstruction of the diagram are equivalent to order-preserving mappings of certain partially ordered sets (posets) that may be constructed from the web diagrams. For web worlds whose web graphs have all edge labels equal to 1, the diagonal entries of web-mixing and web-colouring matrices are obtained by summing certain polynomials determined by the descents in permutations in the Jordan-Hölder set of all linear extensions of the associated poset. We derive tri-variate generating generating functions for the number of web worlds according to three statistics and enumerate the number of different web diagrams in a web world. Three special web worlds are examined in great detail, and the traces of the web-mixing matrices calculated in each case.
We study the statistics area, bounce and dinv on the set of parallelogram polyominoes having a rectangular m times n bounding box. We show that the bi-statistics (area, bounce) and (area, dinv) give rise to the same q, t-analogue of Narayana numbers which was introduced by two of the authors in [4]. We prove the main conjectures of that paper: the q, t-Narayana polynomials are symmetric in both q and t, and m and n. This is accomplished by providing a symmetric functions interpretation of the q, t-Narayana polynomials which relates them to the famous diagonal harmonics.
The non-Abelian exponentiation theorem has recently been generalised to correlators of multiple Wilson line operators. The perturbative expansions of these correlators exponentiate in terms of sets of diagrams called webs, which together give rise to colour factors corresponding to connected graphs. The colour and kinematic degrees of freedom of individual diagrams in a web are entangled by mixing matrices of purely combinatorial origin. In this paper we relate the combinatorial study of these matrices to properties of partially ordered sets (posets), and hence obtain explicit solutions for certain families of web-mixing matrix, at arbitrary order in perturbation theory. We also provide a general expression for the rank of a general class of mixing matrices, which governs the number of independent colour factors arising from such webs. Finally, we use the poset language to examine a previously conjectured sum rule for the columns of web-mixing matrices which governs the cancellation of the leading subdivergences between diagrams in the web. Our results, when combined with parallel developments in the evaluation of kinematic integrals, offer new insights into the all-order structure of infrared singularities in non-Abelian gauge theories.
Abstract. We introduce two operators on stable configurations of the sandpile model that provide an algorithmic bijection between recurrent and parking configurations. This bijection preserves their equivalence classes with respect to the sandpile group. The study of these operators in the special case of the complete bipartite graph Km,n naturally leads to a generalization of the well known Cyclic Lemma of Dvoretsky and Motzkin, via pairs of periodic bi-infinite paths in the plane having slightly different slopes. We achieve our results by interpreting the action of these operators as an action on a point in the grid Z 2 which is pointed to by one of these pairs of paths. Our Cyclic lemma allows us to enumerate several classes of polyominoes, and therefore builds on the work of Irving and Rattan (2009), Chapman et al. (2009), and Bonin et al. (2003.
A poset is said to be (2 + 2)-free if it does not contain an induced subposet that is isomorphic to 2 + 2, the union of two disjoint 2-element chains. Two elements in a poset are indistinguishable if they have the same strict up-set and the same strict down-set. Being indistinguishable defines an equivalence relation on the elements of the poset. We introduce the statistic maxindist, the maximum size of a set of indistinguishable elements. We show that, under a bijection of Bousquet-Mélou et al. [1], indistinguishable elements correspond to letters that belong to the same run in the so-called ascent sequence corresponding to the poset. We derive the generating function for the number of (2 + 2)-free posets with respect to both maxindist and the number of different strict down-sets of elements in the poset. Moreover, we show that (2 + 2)-free posets P with maxindist(P ) at most k are in bijection with upper triangular matrices of nonnegative integers not exceeding k, where each row and each column contains a nonzero entry. (Here we consider isomorphic posets to be equal.) In particular, (2 + 2)-free posets P on n elements with maxindist(P ) = 1 correspond to upper triangular binary matrices where each row and column contains a nonzero entry, and whose entries sum to n. We derive a generating function counting such matrices, which confirms a conjecture of Jovovic [8], and we refine the generating function to count upper triangular matrices consisting of nonnegative integers not exceeding k and having a nonzero entry in each row and column. That refined generating function also enumerates (2 + 2)-free posets according to maxindist. Finally, we link our enumerative results to certain restricted permutations and matrices.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.