scholarly journals A General Theory of Wilf-Equivalence for Catalan Structures

10.37236/5629 ◽  
2015 ◽  
Vol 22 (4) ◽  
Author(s):  
Michael Albert ◽  
Mathilde Bouvel

The existence of apparently coincidental equalities (also called Wilf-equivalences) between the enumeration sequences or generating functions of various hereditary classes of combinatorial structures has attracted significant interest. We investigate such coincidences among non-crossing matchings and a variety of other Catalan structures including Dyck paths, 231-avoiding permutations and plane forests. In particular we consider principal subclasses defined by not containing an occurrence of a single given structure. An easily computed equivalence relation among structures is described such that if two structures are equivalent then the associated principal subclasses have the same enumeration sequence. We give an asymptotic estimate of the number of equivalence classes of this relation among structures of size $n$ and show that it is exponentially smaller than the $n^{th}$ Catalan number. In other words these "coincidental" equalities are in fact very common among principal subclasses. Our results also allow us to prove in a unified and bijective manner several known Wilf-equivalences from the literature.


10.37236/2976 ◽  
2013 ◽  
Vol 20 (2) ◽  
Author(s):  
Jonathan Bloom ◽  
Sergi Elizalde

Extending the notion of pattern avoidance in permutations, we study matchings and set partitions whose arc diagram representation avoids a given configuration of three arcs. These configurations, which generalize $3$-crossings and $3$-nestings, have an interpretation, in the case of matchings, in terms of patterns in full rook placements on Ferrers boards.We enumerate $312$-avoiding matchings and partitions, obtaining algebraic generating functions, in contrast with the known D-finite generating functions for the $321$-avoiding (i.e., $3$-noncrossing) case. Our approach provides a more direct proof of a formula of Bóna for the number of $1342$-avoiding permutations. We also give a bijective proof of the shape-Wilf-equivalence of the patterns $321$ and $213$ which greatly simplifies existing proofs by Backelin-West-Xin and Jelínek, and provides an extension of work of Gouyou-Beauchamps for matchings with fixed points. Finally, we classify pairs of patterns of length 3 according to shape-Wilf-equivalence, and enumerate matchings and partitions avoiding a pair in most of the resulting equivalence classes.



2012 ◽  
Vol DMTCS Proceedings vol. AR,... (Proceedings) ◽  
Author(s):  
Mark Dukes ◽  
Yvan Le Borgne

International audience We give a polyomino characterisation of recurrent configurations of the sandpile model on the complete bipartite graph $K_{m,n}$ in which one designated vertex is the sink. We present a bijection from these recurrent configurations to decorated parallelogram polyominoes whose bounding box is a $m×n$ rectangle. Other combinatorial structures appear in special cases of this correspondence: for example bicomposition matrices (a matrix analogue of set partitions), and (2+2)-free posets. A canonical toppling process for recurrent configurations gives rise to a path within the associated parallelogram polyominoes. We define a collection of polynomials that we call $q,t$-Narayana polynomials, the generating functions of the bistatistic $(\mathsf{area ,parabounce} )$ on the set of parallelogram polyominoes, akin to Haglund's $(\mathsf{area ,hagbounce} )$ bistatistic on Dyck paths. In doing so, we have extended a bistatistic of Egge et al. to the set of parallelogram polyominoes. This is one answer to their question concerning extensions to other combinatorial objects. We conjecture the $q,t$-Narayana polynomials to be symmetric and discuss the proofs for numerous special cases. We also show a relationship between the $q,t$-Catalan polynomials and our bistatistic $(\mathsf{area ,parabounce}) $on a subset of parallelogram polyominoes. Pour le modèle du tas de sable sur un graphe $K_m,n$ biparti complet, on donne une description des configurations rècurrentes à l'aide d'une bijection avec des polyominos parallèlogrammes dècorès de rectangle englobant $m×n$. D'autres classes combinatoires apparaissent comme des cas particuliers de cette construction: par exemple les matrices de bicomposition et les ordres partiels évitant le motif (2+2). Un processus d'éboulement canonique des configurations récurrentes se traduit par un chemin bondissant dans le polyomino parallèlogramme associè. Nous définissons une famille de polynômes, baptisée de $q,t$-Narayana, à travers la distribution d'une paire de statistique $(\mathsf{aire, poidscheminbondissant})$ sur les polyominos parallélogrammes similaire à celle de Haglund définissant les polynômes de $q,t$-Catalan sur les chemins de Dyck. Ainsi nous étendons une paire de statistique de Egge et d'autres à l'ensemble des polynominos parallélogrammes. Cela répond à l'une de leur question sur des généralistations à d'autres objets combinatoires. Nous conjecturons que les polynômes de $q,t$-Narayana sont symétriques et discutons des preuves de plusieurs cas particuliers. Nous montrons ègalement une relation avec les polynômes de $q,t$-Catalan en restreignant notre paire de statistique à un sous-ensemble des polyominos parallélogrammes.



2018 ◽  
Vol 27 (1) ◽  
pp. 18-31
Author(s):  
Jean-Luc Baril ◽  
Sergey Kirgizov ◽  
Armen Petrossian

Abstract We investigate an equivalence relation on permutations based on the pure descent statistic. Generating functions are given for the number of equivalence classes for the set of all permutations, and the sets of permutations avoiding exactly one pattern of length three. As a byproduct, we exhibit a permutation set in one-to-one correspondence with forests of ordered binary trees, which provides a new combinatorial class enumerated by the single-source directed animals on the square lattice. Furthermore, bivariate generating functions for these sets are given according to various statistics.



2012 ◽  
Vol 26 (25) ◽  
pp. 1246006
Author(s):  
H. DIEZ-MACHÍO ◽  
J. CLOTET ◽  
M. I. GARCÍA-PLANAS ◽  
M. D. MAGRET ◽  
M. E. MONTORO

We present a geometric approach to the study of singular switched linear systems, defining a Lie group action on the differentiable manifold consisting of the matrices defining their subsystems with orbits coinciding with equivalence classes under an equivalence relation which preserves reachability and derive miniversal (orthogonal) deformations of the system. We relate this with some new results on reachability of such systems.



2003 ◽  
Vol DMTCS Proceedings vol. AC,... (Proceedings) ◽  
Author(s):  
Michel Nguyên Thê

International audience This paper gives a survey of the limit distributions of the areas of different types of random walks, namely Dyck paths, bilateral Dyck paths, meanders, and Bernoulli random walks, using the technology of generating functions only.



1989 ◽  
Vol 41 (5) ◽  
pp. 830-854 ◽  
Author(s):  
B. Banaschewski ◽  
A. Pultr

A natural approach to topology which emphasizes its geometric essence independent of the notion of points is given by the concept of frame (for instance [4], [8]). We consider this a good formalization of the intuitive perception of a space as given by the “places” of non-trivial extent with appropriate geometric relations between them. Viewed from this position, points are artefacts determined by collections of places which may in some sense by considered as collapsing or contracting; the precise meaning of the latter as well as possible notions of equivalence being largely arbitrary, one may indeed have different notions of point on the same “space”. Of course, the well-known notion of a point as a homomorphism into 2 evidently fits into this pattern by the familiar correspondence between these and the completely prime filters. For frames equipped with a diameter as considered in this paper, we introduce a natural alternative, the Cauchy points. These are the obvious counterparts, for metric locales, of equivalence classes of Cauchy sequences familiar from the classical description of completion of metric spaces: indeed they are decreasing sequences for which the diameters tend to zero, identified by a natural equivalence relation.



1958 ◽  
Vol 13 ◽  
pp. 135-156 ◽  
Author(s):  
Masahisa Adachi

In the papers [11] and [18] Rohlin and Thom have introduced an equivalence relation into the set of compact orientable (not necessarily connected) differentiable manifolds, which, roughly speaking, is described in the following manner: two differentiable manifolds are equivalent (cobordantes), when they together form the boundary of a bounded differentiable manifold. The equivalence classes can be added and multiplied in a natural way and form a graded algebra Ω relative to the addition, the multiplication and the dimension of manifolds. The precise structures of the groups of cobordism Ωk of dimension k are not known thoroughly. Thom [18] has determined the free part of Ω and also calculated explicitly Ωk for 0 ≦ k ≦ 7.



Mathematics ◽  
2019 ◽  
Vol 7 (11) ◽  
pp. 1044 ◽  
Author(s):  
Jeong-Gon Lee ◽  
Kul Hur

We introduce the concepts of a bipolar fuzzy reflexive, symmetric, and transitive relation. We study bipolar fuzzy analogues of many results concerning relationships between ordinary reflexive, symmetric, and transitive relations. Next, we define the concepts of a bipolar fuzzy equivalence class and a bipolar fuzzy partition, and we prove that the set of all bipolar fuzzy equivalence classes is a bipolar fuzzy partition and that the bipolar fuzzy equivalence relation is induced by a bipolar fuzzy partition. Finally, we define an ( a , b ) -level set of a bipolar fuzzy relation and investigate some relationships between bipolar fuzzy relations and their ( a , b ) -level sets.



2011 ◽  
Vol 76 (2) ◽  
pp. 461-476 ◽  
Author(s):  
Greg Hjorth ◽  
André Nies

AbstractWe show that there is a complete, consistent Borel theory which has no “Borel model” in the following strong sense: There is no structure satisfying the theory for which the elements of the structure are equivalence classes under some Borel equivalence relation and the interpretations of the relations and function symbols are uniformly Borel.We also investigate Borel isomorphisms between Borel structures.



1999 ◽  
Vol 31 (02) ◽  
pp. 448-491 ◽  
Author(s):  
Hsien-Kuei Hwang

A general analytic scheme for Poisson approximation to discrete distributions is studied in which the asymptotic behaviours of the generalized total variation, Fortet-Mourier (or Wasserstein), Kolmogorov and Matusita (or Hellinger) distances are explicitly characterized. Applications of this result include many number-theoretic functions and combinatorial structures. Our approach differs from most of the existing ones in the literature and is easily amended for other discrete approximations; arithmetic and combinatorial examples for Bessel approximation are also presented. A unified approach is developed for deriving uniform estimates for probability generating functions of the number of components in general decomposable combinatorial structures, with or without analytic continuation outside their circles of convergence.



Sign in / Sign up

Export Citation Format

Share Document