scholarly journals Partial matchings and pattern avoidance

2013 ◽  
Vol 7 (1) ◽  
pp. 25-50 ◽  
Author(s):  
Toufik Mansour ◽  
Mark Shattuck
Keyword(s):  
Generating Function ◽  
Generating Functions ◽  
Infinite Family ◽  
Pattern Avoidance ◽  
Explicit Formulas ◽  
Partial Matching ◽  
Natural Notion ◽  
Single Pattern ◽  
Finite Set

A partition of a finite set all of whose blocks have size one or two is called a partial matching. Here, we enumerate classes of partial matchings characterized by the avoidance of a single pattern, specializing a natural notion of partition containment that has been introduced by Sagan. Let vn(?) denote the number of partial matchings of size n which avoid the pattern ?. Among our results, we show that the generating function for the numbers vn(?) is always rational for a certain infinite family of patterns ?. We also provide some general explicit formulas for vn(?) in terms of vn(p), where p is a pattern contained in ?. Finally, we find, with two exceptions, explicit formulas and/or generating functions for the number of partial matchings avoiding any pattern of length at most five.

scholarly journals Pattern avoidance in inversion sequences

2015 ◽  
Vol 25 (2) ◽  
pp. 157-176 ◽  
Author(s):  
Toufik Mansour ◽  
Mark Shattuck
Keyword(s):  
Functional Equation ◽  
Generating Function ◽  
Generating Functions ◽  
Kernel Method ◽  
Fibonacci Numbers ◽  
Pattern Avoidance ◽  
Explicit Formulas ◽  
Schröder Numbers ◽  
Single Pattern ◽  
Combinatorial Methods

Abstract A permutation of length n may be represented, equivalently, by a sequence a1a2 • • • an satisfying 0 < ai < i for all z, which is called an inversion sequence. In analogy to the usual case for permutations, the pattern avoidance question is addressed for inversion sequences. In particular, explicit formulas and/or generating functions are derived which count the inversion sequences of a given length that avoid a single pattern of length three. Among the sequences encountered are the Fibonacci numbers, the Schröder numbers, and entry A200753 in OEIS. We make use of both algebraic and combinatorial methods to establish our results. An explicit Injection is given between two of the avoidance classes, and in three cases, the kernel method is used to solve a functional equation satisfied by the generating function enumerating the class in question.

scholarly journals Counting water cells in bargraphs of compositions and set partitions

2018 ◽  
Vol 12 (2) ◽  
pp. 413-438 ◽  
Author(s):  
Toufik Mansour ◽  
Mark Shattuck
Keyword(s):  
Generating Function ◽  
Generating Functions ◽  
Horizontal Line ◽  
Explicit Formulas ◽  
Set Partitions ◽  
Unit Square ◽  
Joint Distributions ◽  
Water Cell ◽  
First Moment

In this paper, we consider statistics on compositions and set partitions represented geometrically as bargraphs. By a water cell, we mean a unit square exterior to a bargraph that lies along a horizontal line between any two squares contained within the area subtended by the bargraph. That is, if a large amount of a liquid were poured onto the bargraph from above and allowed to drain freely, then the water cells are precisely those cells where the liquid would collect. In this paper, we count both compositions and set partitions according to the number of descents and water cells in their bargraph representations and determine generating function formulas for the joint distributions on the respective structures. Comparable generating functions that count non-crossing and non-nesting partitions are also found. Finally, we determine explicit formulas for the sign balance and for the first moment of the water cell statistic on set partitions, providing both algebraic and combinatorial proofs.

Zeta Mahler measures, multiple zeta values and L-values

2015 ◽  
Vol 11 (07) ◽  
pp. 2239-2246
Author(s):  
Yoshitaka Sasaki
Keyword(s):  
Generating Function ◽  
Generating Functions ◽  
Mahler Measure ◽  
Multiple Zeta Values ◽  
Explicit Formulas ◽  
Multiple Zeta ◽  
Zeta Values

The zeta Mahler measure is the generating function of higher Mahler measures. In this article, explicit formulas of higher Mahler measures, and relations between higher Mahler measures and multiple zeta (star) values are showed by observing connections between zeta Mahler measures and the generating functions of multiple zeta (star) values. Additionally, connections between higher Mahler measures and Dirichlet L-values associated with primitive quadratic characters are discussed.

Some properties of the Hermite polynomials

2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Feng Qi ◽  
Bai-Ni Guo
Keyword(s):  
Explicit Formula ◽  
Generating Function ◽  
Generating Functions ◽  
Recurrence Relations ◽  
Hermite Polynomials ◽  
Higher Order ◽  
Bell Polynomials ◽  
Explicit Formulas ◽  
Faà Di Bruno Formula ◽  
Derivatives Of

Abstract In this paper, by the Faà di Bruno formula and properties of Bell polynomials of the second kind, the authors reconsider the generating functions of Hermite polynomials and their squares, find an explicit formula for higher-order derivatives of the generating function of Hermite polynomials, and derive explicit formulas and recurrence relations for Hermite polynomials and their squares.

scholarly journals String pattern avoidance in generalized non-crossing trees

2009 ◽  
Vol Vol. 11 no. 1 (Combinatorics) ◽  
Author(s):  
Yidong Sun ◽  
Zhiping Wang
Keyword(s):  
Generating Functions ◽  
Inversion Formula ◽  
Pattern Avoidance ◽  
Lagrange Inversion ◽  
Explicit Formulas ◽  
Lagrange Inversion Formula ◽  
Special Cases ◽  
International Audience ◽  
String Pattern

Combinatorics International audience The problem of string pattern avoidance in generalized non-crossing trees is studied. The generating functions for generalized non-crossing trees avoiding string patterns of length one and two are obtained. The Lagrange inversion formula is used to obtain the explicit formulas for some special cases. A bijection is also established between generalized non-crossing trees with special string pattern avoidance and little Schr ̈oder paths.

scholarly journals Using Homological Duality in Consecutive Pattern Avoidance

10.37236/2005 ◽  
2011 ◽  
Vol 18 (2) ◽  
Author(s):  
Anton Khoroshkin ◽  
Boris Shapiro
Keyword(s):  
Differential Equation ◽  
Ordinary Differential Equation ◽  
Large Class ◽  
Generating Function ◽  
Generating Functions ◽  
Pattern Avoidance ◽  
Linear Ordinary Differential Equation ◽  
Sufficient Condition ◽  
Direct Algorithm ◽  
Polynomial Coefficients

Using an approach suggested by Dotsenko and Khoroshkin we present a sufficient condition guaranteeing that two collections of patterns of permutations have the same exponential generating functions for the number of permutations avoiding elements of these collections as consecutive patterns. In short, the coincidence of the latter generating functions is guaranteed by a length-preserving bijection of patterns in these collections which is identical on the overlappings of pairs of patterns where the overlappings are considered as unordered sets. Our proof is based on a direct algorithm for the computation of the inverse generating functions. As an application we present a large class of patterns where this algorithm is fast and, in particular, allows us to obtain a linear ordinary differential equation with polynomial coefficients satisfied by the inverse generating function.

scholarly journals Volumes in the Uniform Infinite Planar Triangulation: From Skeletons to Generating Functions

2018 ◽  
Vol 27 (6) ◽  
pp. 946-973
Author(s):  
LAURENT MÉNARD
Keyword(s):  
Generating Function ◽  
Generating Functions ◽  
Scaling Limit ◽  
Main Tool ◽  
Explicit Formulas ◽  
Planar Triangulation ◽  
Peeling Process ◽  
Metric Balls ◽  
Infinite Planar

We develop a method to compute the generating function of the number of vertices inside certain regions of the Uniform Infinite Planar Triangulation (UIPT). The computations are mostly combinatorial in flavour and the main tool is the decomposition of the UIPT into layers, called the skeleton decomposition, introduced by Krikun [20]. In particular, we get explicit formulas for the generating functions of the number of vertices inside hulls (or completed metric balls) centred around the root, and the number of vertices inside geodesic slices of these hulls. We also recover known results about the scaling limit of the volume of hulls previously obtained by Curien and Le Gall by studying the peeling process of the UIPT in [17].

scholarly journals Multiple Pattern Avoidance with respect to Fixed Points and Excedances

10.37236/1804 ◽  
2004 ◽  
Vol 11 (1) ◽  
Author(s):  
Sergi Elizalde
Keyword(s):  
Fixed Points ◽  
Generating Functions ◽  
Pattern Avoidance ◽  
Arbitrary Length ◽  
Dyck Paths ◽  
Main Technique ◽  
Single Pattern ◽  
Pattern Avoiding Permutations

We study the distribution of the statistics 'number of fixed points' and 'number of excedances' in permutations avoiding subsets of patterns of length 3. We solve all the cases of simultaneous avoidance of more than one pattern, giving generating functions enumerating these two statistics. Some cases are generalized to patterns of arbitrary length. For avoidance of one single pattern we give partial results. We also describe the distribution of these statistics in involutions avoiding any subset of patterns of length 3. The main technique is to use bijections between pattern-avoiding permutations and certain kinds of Dyck paths, in such a way that the statistics in permutations that we study correspond to statistics on Dyck paths that are easy to enumerate.

New family of Whitney numbers

Filomat ◽  
2017 ◽  
Vol 31 (2) ◽  
pp. 309-320 ◽  
Author(s):  
B.S. El-Desouky ◽  
Nenad Cakic ◽  
F.A. Shiha
Keyword(s):  
Generating Functions ◽  
Recurrence Relations ◽  
Stirling Numbers ◽  
Explicit Formulas ◽  
Basic Properties ◽  
New Family ◽  
Whitney Numbers ◽  
Special Cases

In this paper we give a new family of numbers, called ??-Whitney numbers, which gives generalization of many types of Whitney numbers and Stirling numbers. Some basic properties of these numbers such as recurrence relations, explicit formulas and generating functions are given. Finally many interesting special cases are derived.

scholarly journals A General Family of q-Hypergeometric Polynomials and Associated Generating Functions

Mathematics ◽  
2021 ◽  
Vol 9 (11) ◽  
pp. 1161
Author(s):  
Hari Mohan Srivastava ◽  
Sama Arjika
Keyword(s):  
Generating Function ◽  
Generating Functions ◽  
Hypergeometric Functions ◽  
Additional Parameter ◽  
Physical Sciences ◽  
General Family ◽  
Hypergeometric Polynomials

Basic (or q-) series and basic (or q-) polynomials, especially the basic (or q-) hypergeometric functions and the basic (or q-) hypergeometric polynomials are studied extensively and widely due mainly to their potential for applications in many areas of mathematical and physical sciences. Here, in this paper, we introduce a general family of q-hypergeometric polynomials and investigate several q-series identities such as an extended generating function and a Srivastava-Agarwal type bilinear generating function for this family of q-hypergeometric polynomials. We give a transformational identity involving generating functions for the generalized q-hypergeometric polynomials which we have introduced here. We also point out relevant connections of the various q-results, which we investigate here, with those in several related earlier works on this subject. We conclude this paper by remarking that it will be a rather trivial and inconsequential exercise to give the so-called (p,q)-variations of the q-results, which we have investigated here, because the additional parameter p is obviously redundant.

Sign in / Sign up

Export Citation Format

Share Document