Enumeration formula for \((2,n)\)-cubes in discrete planes
From MaRDI portal
Publication:713312
DOI10.1016/j.dam.2012.05.029zbMath1250.68218OpenAlexW1977353646MaRDI QIDQ713312
Damien Vergnaud, Eric Domenjoud, Laurent Vuillon, Damien Jamet
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
Exact enumeration problems, generating functions (05A15) Combinatorics on words (68R15) Combinatorial aspects of finite geometries (05B25)
Related Items (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 ⋮ Unnamed Item
Cites Work
This page was built for publication: Enumeration formula for \((2,n)\)-cubes in discrete planes