UNIGE document Preprint
previous document  unige:17266  next document
add to browser collection

Complexity and heights of tori

Chinta, Gautam
Jorgenson, Jay
Year 2011
Description 14
Abstract We prove detailed asymptotics for the number of spanning trees, called complexity, for a general class of discrete tori as the parame- ters tend to infinity. The proof uses in particular certain ideas and techniques from an earlier paper [CJK10]. Our asymptotic formula provides a link between the complexity of these graphs and the height of associated real tori, and allows us to deduce some corollaries on the complexity thanks to certain results from analytic number theory. In this way we obtain a conjectural relationship between complexity and regular sphere packings.
Full text
Article (Preprint) (239 Kb) - public document Free access
(ISO format)
CHINTA, Gautam, JORGENSON, Jay, KARLSSON, Anders. Complexity and heights of tori. 2011. https://archive-ouverte.unige.ch/unige:17266

273 hits



Deposited on : 2011-10-31

Export document
Format :
Citation style :