Related papers: Recurrence relations in counting the pattern 13-2 …
We study the generating function for the number of permutations on n letters containing exactly $r\gs0$ occurences of 132. It is shown that finding this function for a given r amounts to a routine check of all permutations in $S_{2r}$.
The connection between matrix integrals and links is used to define matrix models which count alternating tangles in which each closed loop is weighted with a factor n, i.e. may be regarded as decorated with n possible colors. For n=2, the…
Recently, Babson and Steingrimsson (see [BS]) introduced generalized permutations patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. We study generating functions for the number…
We regard explanations as a blending of the input sample and the model's output and offer a few definitions that capture various desired properties of the function that generates these explanations. We study the links between these…
We investigate the spectral properties of rooted trees with the intention of improving the currently existing results that deal with this matter. The concept of an assigned rational function is recursively defined for each vertex of a…
Herein, the theory of Bergman kernel is developed to the weighted case. A general form of weighted Bergman reproducing kernel is obtained, by which we can calculate concrete Bergman kernel functions for specific weights and domains.
We derive the algebraic generating function for inversion sequences avoiding the patterns $201$ and $210$ by describing a set of succession rules, converting them to a system of generating function equations with one catalytic variable, and…
We study mapping properties of operators with kernels defined via a combination of continuous and discrete orthogonal polynomials, which provide an abstract formulation of quantum (q-) Fourier type systems. We prove Ismail conjecture…
In this paper, we introduce a new method for computing generating functions with respect to the number of descents and left-to-right minima over the set of permutations which have no consecutive occurrences of a pattern that starts with 1.
A recurrence relation is said to have the Laurent property if all of its iterates are Laurent polynomials in the initial values with integer coefficients. We consider a family of nonlinear recurrences with the Laurent property, which were…
We develop the technique of reduced word manipulation to give a range of results concerning reduced words and permutations more generally. We prove a broad connection between pattern containment and reduced words, which specializes to our…
We present a common sufficient condition for the total positivity of combinatorial triangles and their reversals, as well as the real-rootedness of generating functions of the rows. The proof technique is to construct a unified planar…
Babson and Steingr\'{\i}msson introduced generalized permutation patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. Claesson presented a complete solution for the number of…
In rule-based systems, goal-oriented computations correspond naturally to the possible ways that an observation may be explained. In some applications, we need to compute explanations for a series of observations with the same domain. The…
We describe a combinatorial approach for investigating properties of rational numbers. The overall approach rests on structural bijections between rational numbers and familiar combinatorial objects, namely rooted trees. We emphasize that…
We study the generating function for the number of even (or odd) permutations on n letters containing exactly $r\gs0$ occurrences of 132. It is shown that finding this function for a given r amounts to a routine check of all permutations in…
We derive the P-finite recurrences for classes of sequences with ordinary generating function containing roots of polynomials. The focus is on establishing the D-finite differential equations such that the familiar steps of reducing their…
This paper is continuation of the study of the 1-box pattern in permutations introduced by the authors in \cite{kitrem4}. We derive a two-variable generating function for the distribution of this pattern on 132-avoiding permutations, and…
In their study of cyclic pattern containment, Domagalski et al. conjecture differential equations for the generating functions of circular permutations avoiding consecutive patterns of length 3. In this note, we prove and significantly…
In his Ph.D. thesis, Ira Gessel proved a reciprocity formula for noncommutative symmetric functions which enables one to count words and permutations with restrictions on the lengths of their increasing runs. We generalize Gessel's theorem…