Counting Anosov graphs.

MaRDI QIDQ4558642zbMATH OpenFDO

Authors Meera G. Mainkar, Matthew Plante, Ben Salisbury

Publication date 29 November 2018

Full work available at URL https://arxiv.org/abs/1509.03571

zbMATH Keywords

Anosov graphgraph enumerationquotient graph

Mathematics Subject Classification ID

Signed and weighted graphs (05C22) Enumeration in graph theory (05C30) Nilpotent and solvable Lie groups (22E25)

Abstract: In recent work by Dani and Mainkar, a family of finite simple graphs was used to construct nilmanifolds admitting Anosov diffeomorphisms. Our main object of study is this particular set of graphs, which we call Anosov graphs. Moreover, Dani and Mainkar give a lower bound on the number of Anosov graphs in terms of the number of vertices and number of edges. In this work, we improve this lower bound in terms of vertices and edges, and we give lower and upper bounds solely in terms of the number of vertices.

Recommendations

• Anosov automorphisms on compact nilmanifolds associated with graphs
• Anosov diffeomorphisms on nilmanifolds modelled on a free nilpotent Lie group
• ANOSOV AUTOMORPHISMS ON CERTAIN CLASSES OF NILMANIFOLDS
• Anosov diffeomorphisms of nilmanifolds of dimension at most six
• A new method for constructing Anosov Lie algebras

Cited in

(3)

• Anosov automorphisms on compact nilmanifolds associated with graphs
• Classification of K -forms in nilpotent Lie algebras associated to graphs
• Anosov diffeomorphisms on infra‐nilmanifolds associated to graphs

Describes a project that uses

Uses Software

• SageMath

This page was built for publication: Counting Anosov graphs.

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