Triangular partitions: enumeration, structure, and generation

DOI10.1016/J.AAM.2024.102807MaRDI QIDQ6655717

A. Galvan, Sergi Elizalde

Publication date: 27 December 2024

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

triangular partitionYoung's latticebalanced wordcorner cut

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Combinatorial aspects of partitions of integers (05A17) Combinatorics on words (68R15) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Asymptotic enumeration (05A16)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the number of factors of Sturmian words
• Nonhomogeneous spectra of numbers
• Complexity and growth for polygonal billiards
• The number of plane corner cuts
• On the number of corner cuts
• Random generation of finite Sturmian words
• Asymptotic formula for balanced words
• Generalized \(q,t\)-Catalan numbers
• Studies on finite Sturmian words
• Some characterizations of finite Sturmian words.
• An efficient algorithm for determining the convex hull of a finite planar set
• A linear algorithm for nonhomogeneous spectra of numbers
• On the number of digital straight line segments
• A GEOMETRIC PROOF OF THE ENUMERATION FORMULA FOR STURMIAN WORDS
• A Shuffle Theorem for Paths Under Any Line
• Cutting corners
• Combinatorics of triangular partitions

This page was built for publication: Triangular partitions: enumeration, structure, and generation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6655717)