Enumeration formula for (2,n)-cubes in discrete planes

DOI10.1016/J.DAM.2012.05.029MaRDI QIDQ713312zbMATH OpenOpenAlexFDO

Authors Eric Domenjoud, Damien Jamet, Damien Vergnaud, L. Vuillon

Publication date 26 October 2012

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2012.05.029

zbMATH Keywords

discrete planesBerstel-Pocchiola diagramslocal configurationsRote sequences

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of finite geometries (05B25) Combinatorics on words (68R15)

Cites work

• scientific article; zbMATH DE number 1342259 (Why is no real title available?)
• scientific article; zbMATH DE number 1104451 (Why is no real title available?)
• scientific article; zbMATH DE number 1438574 (Why is no real title available?)
• A GEOMETRIC PROOF OF THE ENUMERATION FORMULA FOR STURMIAN WORDS
• Local configurations in a discrete plane
• On the number of digital straight line segments
• On the number of factors of Sturmian words
• Sequences with subword complexity \(2n\)

Cited in

(3)

• A further study for the upper bound of the cardinality of Farey vertices and application in discrete geometry
• A complete characterization of the \((m, n)\)-cubes and combinatorial applications in imaging, vision and discrete geometry
• Erratum to: ``A further study for the upper bound of the cardinality of Farey vertices and applications in discrete geometry

This page was built for publication: Enumeration formula for \((2,n)\)-cubes in discrete planes

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