Restricted words by adjacencies
نویسنده
چکیده
A recurrence, a determinant formula, and generating functions are presented for enumerating words with restricted letters by adjacencies. The main theorem leads to re nements (with up to two additional parameters) of known results on compositions, polyominoes, and permutations. Among the examples considered are (1) the introduction of the ascent variation on compositions, (2) the enumeration of directed vertically convex polyominoes by upper descents, area, perimeter, relative height, and column number, (3) a tri-variate extension of MacMahon’s determinant formula for permutations with prescribed descent set, and (4) a combinatorial setting for an entire sequence of bibasic Bessel functions. .
منابع مشابه
Sorting Separable Permutations by Restricted Multi-break Rearrangements
A multi-break rearrangement generalizes most of genome rearrangements, such as block-interchanges, transpositions and reversals. A k-break cuts k adjacencies over a permutation, and forms k new adjacencies by joining the extremities according to an arbitrary matching. Block-interchange distance is a polynomial problem, but the transposition and the reversal distances are both NP-hard problems. ...
متن کاملNon-orthogonal ray guarding
In an earlier paper the notion of a ray guard, a guard that can only see along a single ray, was introduced. Ray guarding means siting the fewest possible guards that guard all adjacencies (shared edges or parts of edges) in an orthogonal arrangement of adjacent nonoverlapping rectangles. In the earlier paper the problem was restricted by requiring that the direction of sight be parallel to one...
متن کاملAdjacencies in Words
Based Based on on two two inversion inversion formulas formulas for for enumerating enumerating words words in in the the free free monoid monoid by by adjacencies, adjacencies, we we present present a a new new approach approach to to a a class class of of permutation permutation problems problems having having Eulerian-type Eulerian-type generating generating functions. functions. We We also ...
متن کاملAdjacencies in Permutations
A permutation on an alphabet $ \Sigma $, is a sequence where every element in $ \Sigma $ occurs precisely once. Given a permutation $ \pi $= ($\pi_{1} $, $ \pi_{2} $, $ \pi_{3} $,....., $ \pi_{n} $) over the alphabet $ \Sigma $ =$\{ $0, 1, . . . , n$-$1 $\}$ the elements in two consecutive positions in $ \pi $ e.g. $ \pi_{i} $ and $ \pi_{i+1} $ are said to form an \emph{adjacency} if $ \pi_{i+1...
متن کاملMore Statistics on Permutation Pairs
Two inversion formulas for enumerating words in the free monoid by θ-adjacencies are applied in counting pairs of permutations by various statistics. The generating functions obtained involve refinements of bibasic Bessel functions. We further extend the results to finite sequences of permutations. ∗This work is partially supported by EC grant CHRX-CT93-0400 and PRC Maths-Info †Financial suppor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 220 شماره
صفحات -
تاریخ انتشار 2000