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

DOI10.1016/J.DAM.2012.05.029zbMATH Open1250.68218OpenAlexW1977353646MaRDI QIDQ713312FDOQ713312

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

• Title not available (Why is that?)
• On the number of digital straight line segments
• On the number of factors of Sturmian words
• Sequences with subword complexity \(2n\)
• A GEOMETRIC PROOF OF THE ENUMERATION FORMULA FOR STURMIAN WORDS
• Title not available (Why is that?)
• Local configurations in a discrete plane
• Title not available (Why is that?)

Cited In (3)

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