Enumeration of words by the sum of differences between adjacent letters

Enumeration of words by the sum of differences between adjacent letters

Combinatorics

Bibliographic Details
Main Author:	Toufik Mansour
Format:	Article
Language:	English
Published:	Discrete Mathematics & Theoretical Computer Science 2009-01-01
Series:	Discrete Mathematics & Theoretical Computer Science
Subjects:	[info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
Online Access:	https://dmtcs.episciences.org/467/pdf

Similar Items

q-Enumeration of words by their total variation
by: Ligia Loreta Cristea, et al.
Published: (2011-01-01)

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

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

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

Hereditary biclique-Helly graphs: recognition and maximal biclique enumeration
by: Martiniano Eguia, et al.
Published: (2013-02-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)

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

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

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

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

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

On the critical exponent of generalized Thue-Morse words
by: Alexandre B. Massé, et al.
Published: (2007-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)

Congruence successions in compositions
by: Toufik Mansour, et al.
Published: (2014-05-01)

Self-complementing permutations of k-uniform hypergraphs
by: Artur Szymański, et al.
Published: (2009-01-01)

Edge condition for long cycles in bipartite graphs
by: Lech Adamus
Published: (2009-01-01)

Gray codes avoiding matchings
by: Darko Dimitrov, et al.
Published: (2009-01-01)

On the chromatic number of some flip graphs
by: Ruy Fabila-Monroy, et al.
Published: (2009-01-01)

String pattern avoidance in generalized non-crossing trees
by: Yidong Sun, et al.
Published: (2009-01-01)

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

Independent sets in (P₆, diamond)-free graphs
by: Raffaele Mosca
Published: (2009-01-01)

Determinants of rational knots
by: Louis H. Kauffman, et al.
Published: (2009-01-01)

Adjoint functors and tree duality
by: Jan Foniok, et al.
Published: (2009-01-01)

The distribution of ascents of size d or more in compositions
by: Charlotte Brennan, et al.
Published: (2009-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)

Directed figure codes are decidable
by: Michal Kolarz, et al.
Published: (2009-01-01)

Ore and Erdős type conditions for long cycles in balanced bipartite graphs
by: Janusz Adamus, et al.
Published: (2009-01-01)

A construction of small regular bipartite graphs of girth 8
by: Camino Balbuena
Published: (2009-01-01)

Clique-transversal sets and weak 2-colorings in graphs of small maximum degree
by: Gábor Bacsó, et al.
Published: (2009-01-01)

On-line extensible bin packing with unequal bin sizes
by: Deshi Ye, et al.
Published: (2009-01-01)

Centerpoint theorems for wedges
by: Jeff Erickson, et al.
Published: (2009-01-01)

Long cycles in hypercubes with distant faulty vertices
by: Petr Gregor, et al.
Published: (2009-01-01)

Clustered Spanning Tree - Conditions for Feasibility
by: Nili Guttmann-Beck, et al.
Published: (2019-08-01)

Detection number of bipartite graphs and cubic graphs
by: Frederic Havet, et al.
Published: (2014-12-01)

Strong parity vertex coloring of plane graphs
by: Tomas Kaiser, et al.
Published: (2014-03-01)

The Cerný conjecture for automata respecting intervals of a directed graph
by: Mariusz Grech, et al.
Published: (2013-11-01)

A variant of Niessen’s problem on degreesequences of graphs
by: Jiyun Guo, et al.
Published: (2014-05-01)

Clique cycle transversals in graphs with few P₄'s
by: Raquel Bravo, et al.
Published: (2013-09-01)