q-Enumeration of words by their total variation

Combinatorics

Bibliographic Details
Published in:	Discrete Mathematics & Theoretical Computer Science
Main Authors:	Ligia Loreta Cristea, Helmut Prodinger
Format:	Article
Language:	English
Published:	Discrete Mathematics & Theoretical Computer Science 2011-01-01
Subjects:	[info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
Online Access:	https://dmtcs.episciences.org/477/pdf

Similar Items

Enumeration of words by the sum of differences between adjacent letters
by: Toufik Mansour
Published: (2009-01-01)

The location of the first maximum in the first sojourn of a Dyck path
by: Helmut Prodinger
Published: (2008-01-01)

Digital search trees with m trees: Level polynomials and insertion costs
by: Helmut Prodinger
Published: (2011-08-01)

The asymmetric leader election algorithm with Swedish stopping: a probabilistic analysis
by: Guy Louchard, et al.
Published: (2012-09-01)

A combinatorial and probabilistic study of initial and end heights of descents in samples of geometrically distributed random variables and in permutations
by: Guy Louchard, et al.
Published: (2007-01-01)

Asymptotic results for silent elimination
by: Guy Louchard, et al.
Published: (2010-01-01)

A perimeter enumeration of column-convex polyominoes
by: Svjetlan Feretić
Published: (2007-01-01)

Hereditary biclique-Helly graphs: recognition and maximal biclique enumeration
by: Martiniano Eguia, et al.
Published: (2013-02-01)

Asymptotic enumeration on self-similar graphs with two boundary vertices
by: Elmar Teufl, et al.
Published: (2009-01-01)

Words and bisimulations of dynamical systems
by: Thomas Brihaye
Published: (2007-01-01)

Gray code order for Lyndon words
by: Vincent Vajnovszki
Published: (2007-01-01)

On the length of shortest 2-collapsing words
by: Alessandra Cherubini, et al.
Published: (2009-01-01)

Automaticity of primitive words and irreducible polynomials
by: Anne Lacroix, et al.
Published: (2013-01-01)

Properties of the extremal infinite smooth words
by: Srečko Brlek, et al.
Published: (2007-01-01)

On the critical exponent of generalized Thue-Morse words
by: Alexandre B. Massé, et al.
Published: (2007-01-01)

Counting descents, rises, and levels, with prescribed first element, in words
by: Sergey Kitaev, et al.
Published: (2008-01-01)

A geometrical approach of palindromic factors of standard billiard words
by: Jean-Pierre Borel
Published: (2007-01-01)

The Join of the Varieties of R-trivial and L-trivial Monoids via Combinatorics on Words
by: Manfred Kufleitner, et al.
Published: (2012-06-01)

On the Number of Balanced Words of Given Length and Height over a Two-Letter Alphabet
by: Nicolas Bédaride, et al.
Published: (2010-01-01)

All totally symmetric colored graphs
by: Mariusz Grech, et al.
Published: (2013-03-01)

Nordhaus-Gaddum Type Results for Total Domination
by: Michael Henning, et al.
Published: (2011-12-01)

Total domination in K₅- and K₆-covered graphs
by: Odile Favaron, et al.
Published: (2008-01-01)

Probabilistic Analysis of Carlitz Compositions
by: Guy Louchard, et al.
Published: (2002-01-01)

Sequence variations of the 1-2-3 conjecture and irregularity strength
by: Ben Seamone, et al.
Published: (2013-01-01)

List edge and list total colorings of planar graphs without non-induced 7-cycles
by: Aijun Dong, et al.
Published: (2013-03-01)

A chip-firing variation and a new proof of Cayley's formula
by: Peter Mark Kayll, et al.
Published: (2013-03-01)

Binary Labelings for Plane Quadrangulations and their Relatives
by: Stefan Felsner, et al.
Published: (2011-01-01)

Structure of spanning trees on the two-dimensional Sierpinski gasket
by: Shu-Chiuan Chang, et al.
Published: (2011-01-01)

The Eulerian distribution on centrosymmetric involutions
by: Marilena Barnabei, et al.
Published: (2009-01-01)

Number of connected spanning subgraphs on the Sierpinski gasket
by: Shu-Chiuan Chang, et al.
Published: (2009-01-01)

Coding partitions
by: Fabio Burderi, et al.
Published: (2007-01-01)

Interaction properties of relational periods
by: Vesa Halava, et al.
Published: (2008-01-01)

Waiting Time Distribution for Pattern Occurrence in a Constrained Sequence: an Embedding Markov Chain Approach
by: Gregory Nuel
Published: (2008-01-01)

On economical set representations of graphs
by: Jing Kong, et al.
Published: (2009-01-01)

Recurrence among trees with most numerous efficient dominating sets
by: Dorota Bród, et al.
Published: (2008-01-01)

Bounded-degree graphs have arbitrarily large queue-number
by: David R. Wood
Published: (2008-01-01)

Ambiguity in the m-bonacci numeration system
by: Petra Kocábová, et al.
Published: (2007-01-01)

Simultaneous generation for zeta values by the Markov-WZ method
by: Khodabakhsh Hessami Pilehrood, et al.
Published: (2008-01-01)

The distribution of ascents of size d or more in compositions
by: Charlotte Brennan, et al.
Published: (2009-01-01)

On hereditary Helly classes of graphs
by: Marina Groshaus, et al.
Published: (2008-01-01)