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