Access the full text.
Sign up today, get DeepDyve free for 14 days.
A. Coja-Oghlan, Cristopher Moore, Vishal Sanwalani (2006)
MAX k-CUT and approximating the chromatic number of random graphsRandom Structures and Algorithms, 28
G. Carlsson (2009)
Topology and dataBulletin of the American Mathematical Society, 46
D. Salamon, E. Zehnder (1992)
Morse theory for periodic solutions of hamiltonian systems and the maslov indexCommunications on Pure and Applied Mathematics, 45
V. Arnold (2009)
Topological Classification of Morse Functions and Generalisations of Hilbert's 16-th ProblemTopologica, 2
Matthew Kahle (2009)
Random Geometric ComplexesDiscrete & Computational Geometry, 45
N Pippenger, K Schleich (2006)
Topological characteristics of random triangulated surfacesRandom Struct. Algorithms, 28
Ryan Vinroot (2013)
Generating functions for real character degree sums of finite general linear and unitary groupsJournal of Algebraic Combinatorics, 40
Amos Kovacs (1987)
Some enumeration problems for matrices over a finite fieldLinear Algebra and its Applications, 94
V. Ginzburg, Başak Gürel (2015)
Non-contractible periodic orbits in Hamiltonian dynamics on closed symplectic manifoldsCompositio Mathematica, 152
V. Arnold (2007)
Smooth functions statisticsFunctional Analysis and Other Mathematics, 1
Michael Usher, Jun Zhang (2015)
Persistent homology and Floer-Novikov theoryarXiv: Symplectic Geometry
Lior Aronshtam, N. Linial, T. Luczak, R. Meshulam (2010)
Collapsibility and Vanishing of Top Homology in Random Simplicial ComplexesDiscrete & Computational Geometry, 49
L. Polterovich, E. Shelukhin (2014)
Autonomous Hamiltonian flows, Hofer’s geometry and persistence modulesSelecta Mathematica, 22
V. Ginzburg, Başak Gürel (2014)
The Conley Conjecture and BeyondArnold Mathematical Journal, 1
R. Meshulam, N. Wallach (2006)
Homological connectivity of random k‐dimensional complexesRandom Structures & Algorithms, 34
L. Nicolaescu (2012)
Random Morse functions and spectral geometryarXiv: Differential Geometry
O. Bobrowski, Matthew Kahle (2014)
Topology of random geometric complexes: a surveyJournal of Applied and Computational Topology, 1
R. Ghrist (2007)
Barcodes: The persistent topology of dataBulletin of the American Mathematical Society, 45
R Meshulam, N Wallach (2009)
Homological connectivity of random $$k$$ k -dimensional complexesRandom Struct. Algorithms, 34
A. Costa, M. Farber (2013)
Geometry and topology of random 2-complexesIsrael Journal of Mathematics, 209
R. Meshulam (2013)
Bounded quotients of the fundamental group of a random 2-complexarXiv: Combinatorics
Basak Gurel (2012)
On non‐contractible periodic orbits of Hamiltonian diffeomorphismsBulletin of The London Mathematical Society, 45
We study random, finite-dimensional, ungraded chain complexes over a finite field and show that for a uniformly distributed differential a complex has the smallest possible homology with the highest probability: either zero or one-dimensional homology depending on the parity of the dimension of the complex. We prove that as the order of the field goes to infinity the probability distribution concentrates in the smallest possible dimension of the homology. On the other hand, the limit probability distribution, as the dimension of the complex goes to infinity, is a super-exponentially decreasing, but strictly positive, function of the dimension of the homology.
Arnold Mathematical Journal – Springer Journals
Published: Jan 25, 2017
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.