The umbral transfer-matrix method. IV: Counting self-avoiding polygons and walks.
Zeilberger, Doron (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “The umbral transfer-matrix method. V: The Goulden-Jackson cluster method for infinitely many mistakes.”
The umbral transfer-matrix method. IV: Counting self-avoiding polygons and walks.
The umbral transfer-matrix method. III: Counting animals.
Zeilberger, Doron (2001)
The New York Journal of Mathematics [electronic only]
Similarity:
Two very short proofs of combinatorial identity.
Anglani, Roberto, Barile, Margherita (2005)
Integers
Similarity:
Counting words by number of occurrences of some patterns.
Gao, Zhicheng, MacFie, Andrew, Panario, Daniel (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Further applications of a power series method for pattern avoidance.
Rampersad, Narad (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A combinatorial proof of a symmetric -Pfaff-Saalschütz identity.
Guo, Victor J.W., Zeng, Jiang (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Generating functions for the digital sum and other digit counting sequences.
Adams-Watters, Franklin T., Ruskey, Frank (2009)
Journal of Integer Sequences [electronic only]
Similarity:
Matrix compositions.
Munarini, Emanuele, Poneti, Maddalena, Rinaldi, Simone (2009)
Journal of Integer Sequences [electronic only]
Similarity:
The box parameter for words and permutations
Helmut Prodinger (2014)
Open Mathematics
Similarity:
The box parameter for words counts how often two letters w j and w k define a “box” such that all the letters w j+1; ..., w k−1 fall into that box. It is related to the visibility parameter and other parameters on words. Three models are considered: Words over a finite alphabet, permutations, and words with letters following a geometric distribution. A typical result is: The average box parameter for words over an M letter alphabet is asymptotically given by 2n − 2n H M/M, for fixed...
Strings with maximally many distinct subsequences and substrings.
Flaxman, Abraham, Harrow, Aram W., Sorkin, Gregory B. (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Consecutive patterns: from permutations to column-convex polyominoes and back.
Rawlings, Don, Tiefenbruck, Mark (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Meanders and Motzkin words.
Panayotopoulos, A., Tsikouras, P. (2004)
Journal of Integer Sequences [electronic only]
Similarity:
Transcendence of numbers with an expansion in a subclass of complexity 2 + 1
Tomi Kärki (2006)
RAIRO - Theoretical Informatics and Applications
Similarity:
We divide infinite sequences of subword complexity into four subclasses with respect to left and right special elements and examine the structure of the subclasses with the help of Rauzy graphs. Let ≥ 2 be an integer. If the expansion in base of a number is an Arnoux-Rauzy word, then it belongs to Subclass I and the number is known to be transcendental. We prove the transcendence of numbers with expansions in the subclasses II and III.