Combinatorics of Compositions and Words

DOI10.1201/9781420072686zbMath1184.68373OpenAlexW88717455MaRDI QIDQ5192641

Publication date: 6 August 2009

Full work available at URL: https://doi.org/10.1201/9781420072686

combinatorics pattern avoidance pattern enumeration

Combinatorics on words (68R15) Formal languages and automata (68Q45) Research exposition (monographs, survey articles) pertaining to computer science (68-02)

Related Items (92)

Counting rises and levels in \(r\)-color compositions ⋮ Unnamed Item ⋮ Shedding light on words ⋮ Pattern restricted Stirling \(k\)-ary words, the plateau statistic and the kernel method ⋮ Protected cells in compositions ⋮ Pattern-avoiding alternating words ⋮ The (ordinary) generating functions enumerating \(123\)-avoiding words with \(r\) occurrences of each of \(1, 2, \dots, n\) are always algebraic ⋮ Unnamed Item ⋮ Combinatorics of Multicompositions ⋮ Higher-Order Quasi-Monte Carlo for Bayesian Shape Inversion ⋮ Exact site-percolation probability on the square lattice ⋮ The solution of a recursive sequence arising from a combinatorial problem in botanical epidemiology ⋮ Constructions of balanced odd-variable rotation symmetric Boolean functions with optimal algebraic immunity and high nonlinearity ⋮ Balanced \(2p\)-variable rotation symmetric Boolean functions with optimal algebraic immunity ⋮ Unnamed Item ⋮ Schröder partitions, Schröder tableaux and weak poset patterns ⋮ Smooth column convex polyominoes ⋮ Spectral deformation for two-body dispersive systems with e.g. the Yukawa potential ⋮ Unnamed Item ⋮ Extremal functions of forbidden multidimensional matrices ⋮ Counting corners in compositions and set partitions presented as bargraphs ⋮ Unnamed Item ⋮ Longest monotone subsequences and rare regions of pattern-avoiding permutations ⋮ Generalized algorithm for restricted weak composition generation ⋮ Variable neighbourhood structures for cycle location problems ⋮ Backward type inference for XML queries ⋮ Constructing odd-variable RSBFs with optimal algebraic immunity, good nonlinearity and good behavior against fast algebraic attacks ⋮ Colored compositions, invert operator and elegant compositions with the ``black tie ⋮ Unnamed Item ⋮ Chimneys in compositions and bargraphs ⋮ Pattern avoidance in ordered set partitions ⋮ Counting words with Laguerre series ⋮ Grand Dyck paths with air pockets ⋮ Finite Automata, Probabilistic Method, and Occurrence Enumeration of a Pattern in Words and Permutations ⋮ Matching points in compositions and words ⋮ Unnamed Item ⋮ Wasserstein-\(p\) bounds in the central limit theorem under local dependence ⋮ A generalized binomial theorem for induced weak compositions ⋮ Compositions of positive integers with \(2s\) and \(3s\) ⋮ Fat tails and black swans: Exact results for multiplicative processes with resets ⋮ Compositions of \(n\) as alternating sequences of weakly increasing and strictly decreasing partitions ⋮ Counting subwords in flattened involutions and Kummer functions ⋮ Ascents of size less than \(d\) in compositions ⋮ Greatest descents after any maxima in compositions ⋮ PCB assembly scheduling with alternative nozzle types for one component type ⋮ Unnamed Item ⋮ Robust variable horizon MPC with move blocking ⋮ On graphs representable by pattern-avoiding words ⋮ Construction of rotation symmetric Boolean functions with optimal algebraic immunity and high nonlinearity ⋮ Abelian borders in binary words ⋮ Loop-free Gray code algorithms for the set of compositions ⋮ Comparison of fast boundary element methods on parametric surfaces ⋮ Some results on the avoidance of vincular patterns by multisets ⋮ Statistical structure of concave compositions ⋮ Durfee squares in compositions ⋮ Constructions of even-variable RSBFs with optimal algebraic immunity and high nonlinearity ⋮ Universal cycle packings and coverings for \(k\)-subsets of an \(n\)-set ⋮ Counting water cells in bargraphs of compositions and set partitions ⋮ Staircase patterns in words: subsequences, subwords, and separation number ⋮ Block reversal on finite words ⋮ Counting compositions over finite abelian groups ⋮ Balanced \(2^k\)-variable rotation symmetric Boolean functions with optimal algebraic immunity ⋮ Bargraphs in bargraphs ⋮ Recurrence relations for patterns of type (2,1) in flattened permutations ⋮ Unnamed Item ⋮ \(n\)-color palindromic compositions with restricted subscripts ⋮ Signed excedance enumeration via determinants ⋮ Combinatorics of \(n\)-color cyclic compositions ⋮ Shift-plethysm, hydra continued fractions, and \(m\)-distinct partitions ⋮ The site-perimeter of words ⋮ Maximally additively reducible subsets of the integers ⋮ Combinatorial parameters on bargraphs of permutations ⋮ Unnamed Item ⋮ Subset Selection in Sparse Matrices ⋮ Complexity, exactness, and rationality in polynomial optimization ⋮ The inner site-perimeter of compositions ⋮ Combinatory classes of compositions with higher order conjugation ⋮ Gray code orders for \(q\)-ary words avoiding a given factor ⋮ Switching environments, synchronous sex, and the evolution of mating types ⋮ Deciding the Confusability of Words under Tandem Repeats in Linear Time ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On enumeration of \(q\)-ary sequences with a fixed number of occurrences of the subblock 00 ⋮ Minimal varieties of associative algebras and transcendental series ⋮ Recurrence relations in counting the pattern 13-2 in flattened permutations ⋮ Unnamed Item ⋮ Avoidance of classical patterns by Catalan sequences ⋮ Counting subword patterns in permutations arising as flattened partitions of sets ⋮ ENUMERATING NECKLACES WITH TRANSITIONS ⋮ Counting subwords in flattened partitions of sets ⋮ Stack-sorting for Words

Uses Software

This page was built for publication: Combinatorics of Compositions and Words