Semi-perimeter and inner site-perimeter of k-ary words and bargraphs

DOI10.26493/2590-9770.1376.a29zbMath1454.05013OpenAlexW3138231396MaRDI QIDQ5151495

Toufik Mansour

Publication date: 19 February 2021

Published in: The Art of Discrete and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.26493/2590-9770.1376.a29

zbMATH Keywords

Chebyshev polynomialsbargraphs\(k\)-ary wordssemi-perimeterinner semi-perimeter

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial probability (60C05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The height and width of bargraphs
• Exact solution of the discrete \((1+1)\)-dimensional SOS model with field and surface interactions
• Forbidden subsequences and Chebyshev polynomials
• The site-perimeter of bargraphs
• A bijection between bargraphs and Dyck paths
• Restricted permutations and Chebyshev polynomials
• Critical exponents from nonlinear functional equations for partially directed cluster models
• Levels in bargraphs
• Exact solution of the discrete (1+1)-dimensional RSOS model with field and surface interactions
• Counting corners in compositions and set partitions presented as bargraphs
• Exact solution of the discrete (1+1)-dimensional RSOS model in a slit with field and wall interactions
• The site-perimeter of words
• Combinatorial parameters in bargraphs
• Restricted 132-avoiding permutations
• Permutations with restricted patterns and Dyck paths