Abstract
AbstractWe introduce the multi-width of a lattice polytope and use this to classify and count all lattice tetrahedra with multi-width $$(1,w_2,w_3)$$ ( 1 , w 2 , w 3 ) . The approach used in this classification can be extended into a computer algorithm to classify lattice tetrahedra of any given multi-width. We use this to classify tetrahedra with multi-width $$(2,w_2,w_3)$$ ( 2 , w 2 , w 3 ) for small $$w_2$$ w 2 and $$w_3$$ w 3 and make conjectures about the function counting lattice tetrahedra of any multi-width.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callSimilar Papers
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
