Complexity and heights of tori

G Chinta, J Jorgenson, A Karlsson - Dynamical systems and group … - books.google.com
We prove detailed asymptotics for the number of spanning trees, called complexity, for a
general class of discrete tori as the parameters tend to infinity. The proof uses in particular …

Complexity and heights of tori

G Chinta, J Jorgenson, A Karlsson - arXiv e-prints, 2011 - ui.adsabs.harvard.edu
We prove detailed asymptotics for the number of spanning trees, called complexity, for a
general class of discrete tori as the parameters tend to infinity. The proof uses in particular …

[PDF][PDF] Complexity and heights of tori

G Chinta, J Jorgenson, A Karlsson - arXiv preprint arXiv …, 2011 - researchgate.net
We prove detailed asymptotics for the number of spanning trees, called complexity, for a
general class of discrete tori as the parameters tend to infinity. The proof uses in particular …

[PDF][PDF] Complexity and heights of tori

G Chinta, J Jorgenson… - arXiv preprint arXiv …, 2011 - chinta.ccny.cuny.edu
We prove detailed asymptotics for the number of spanning trees, called complexity, for a
general class of discrete tori as the parameters tend to infinity. The proof uses in particular …

[PDF][PDF] Complexity and heights of tori

G Chinta, J Jorgenson, A Karlsson - arXiv preprint arXiv:1110.6841, 2011 - Citeseer
We prove detailed asymptotics for the number of spanning trees, called complexity, for a
general class of discrete tori as the parameters tend to infinity. The proof uses in particular …

[PDF][PDF] Complexity and heights of tori

G Chinta, J Jorgenson, A Karlsson - unige.ch
We prove detailed asymptotics for the number of spanning trees, called complexity, for a
general class of discrete tori as the parameters tend to infinity. The proof uses in particular …

Complexity and heights of tori

G Chinta, J Jorgenson, A Karlsson - arXiv preprint arXiv:1110.6841, 2011 - arxiv.org
We prove detailed asymptotics for the number of spanning trees, called complexity, for a
general class of discrete tori as the parameters tend to infinity. The proof uses in particular …

[PDF][PDF] Complexity and heights of tori

G Chinta, J Jorgenson, A Karlsson - 2011 - access.archive-ouverte.unige.ch
We prove detailed asymptotics for the number of spanning trees, called complexity, for a
general class of discrete tori as the parameters tend to infinity. The proof uses in particular …

[引用][C] Complexity and heights of tori

G Chinta, J Jorgenson, A Karlsson - Dynamical Systems and Group …, 2012 - cir.nii.ac.jp
Complexity and heights of tori | CiNii Research CiNii 国立情報学研究所 学術情報ナビゲータ[サイニィ
] 詳細へ移動 検索フォームへ移動 論文・データをさがす 大学図書館の本をさがす 日本の博士論文を …

[PDF][PDF] Complexity and heights of tori

G Chinta, J Jorgenson, A Karlsson - unige.ch
We prove detailed asymptotics for the number of spanning trees, called complexity, for a
general class of discrete tori as the parameters tend to infinity. The proof uses in particular …