AT
Anush Tserunyan
math.DSmath.LOmath.COmath.PRmath.GRcs.DMmath.AG
On Valency
published · living versionsW_gbqgmxk5·v1 · currentpublished
The measure equivalence classification of Baumslag-Solitar groups
with Damien Gaboriau, Antoine Poulin, Robin Tucker-Drob, Konrad Wróbel
1 version
W_qvx7hurv·v1published
Preprints & journals
21 papers in the corpus · 2007–2026Finite index extensions of treeable equivalence relations are treeable2610.08986v2 · Ruiyuan Chen, Anush Tserunyan, Robin Tucker-Drob2026 · 0 citationsarXiv
Bounded chaining in measurable dynamics2609.18061v2 · Anush Tserunyan, Jenna Zomback2026 · 0 citationsarXiv
The Radon--Nikodym topography of acyclic measured graphs2512.24741v2 · Anush Tserunyan, Robin Tucker-Drob2025 · 0 citationsarXiv
Heavy repulsion of clusters in Bernoulli percolation2509.10631v1 · Sasha Bell, Tasmin Chu, Owen Rodgers et al.2025 · 0 citationsarXiv
Tree-like graphings, wallings, and median graphings of equivalence relations2308.13010v3 · Ruiyuan Chen, Antoine Poulin, Ran Tao et al.2023 · 1 citationForum of Mathematics, Sigma 13 (2025) e64
Nonamenable subforests of multi-ended quasi-pmp graphs2211.07908v7 · Ruiyuan Chen, Grigory Terlov, Anush Tserunyan2022 · 0 citationsProc. Lond. Math. Soc., (3) 2026;133:e70217
A ratio ergodic theorem via tiling and uniformly syndetic markers2208.06463v3 · Benjamin D. Miller, Anush Tserunyan2022 · 0 citationsErgodic Theory and Dynamical Systems: Proceedings of the Workshops University of North Carolina at Chapel Hill 2021, edited by Idris Assani, Berlin, Boston: De Gruyter (2024), pp. 99-116
A backward ergodic theorem along trees and its consequences for free group actions2012.10522v9 · Anush Tserunyan, Jenna Zomback2020 · 0 citationsJournal of European Math. Soc. (JEMS), 2025
Characterization of saturated graphs related to pairs of disjoint matchings2011.11187v6 · Zhengda Mo, Sam Qunell, Anush Tserunyan et al.2020 · 0 citationsarXiv
Pairs of disjoint matchings and related classes of graphs2005.00671v4 · Huizheng (Ali) Guo, Kieran Kaempen, Zhengda Mo et al.2020 · 1 citationInvolve 16 (2023) 249-264
Independent Sets in Algebraic Hypergraphs1809.05205v2 · Anton Bernshteyn, Michelle Delcourt, Anush Tserunyan2018 · 1 citationarXiv
A descriptive construction of trees and Stallings' theorem1805.09506v4 · Anush Tserunyan2018 · 2 citationsarXiv
A descriptive set theorist's proof of the pointwise ergodic theorem1805.07365v2 · Anush Tserunyan2018 · 1 citationarXiv
Pointwise ergodic theorem for locally countable quasi-pmp graphs1805.02607v9 · Anush Tserunyan2018 · 1 citationJournal of Modern Dynamics, 18 (2022), 609-655
A short nonalgorithmic proof of the containers theorem for hypergraphs1801.07186v3 · Anton Bernshteyn, Michelle Delcourt, Henry Towsner et al.2018 · 7 citationsarXiv
Edge sliding and ergodic hyperfinite decomposition1704.06019v2 · Benjamin D. Miller, Anush Tserunyan2017 · 0 citationsarXiv
A Ramsey theorem on semigroups and a general van der Corput lemma1411.3262v2 · Anush Tserunyan2014 · 5 citationsJournal of Symbolic Logic, vol. 81 (2016), no. 2, pp. 718--741
Mixing and double recurrence in probability groups1405.5629v4 · Anush Tserunyan2014 · 3 citationsFundamenta Mathematicae 260 (2023), 77-98
Finite generators for countable group actions in the Borel and Baire category settings1204.0829v2 · Anush Tserunyan2012 · 9 citationsarXiv
Characterization Of A Class Of Graphs Related To Pairs Of Disjoint Matchings0712.1014v1 · A. V. Tserunyan2007 · 6 citationsDiscrete Mathematics 309 (2009) 693--713
On Edge-Disjoint Pairs Of Matchings0708.1903v1 · V. V. Mkrtchyan, V. L. Musoyan, A. V. Tserunyan2007 · 8 citationsDiscrete Mathematics, 2008, Vol 308/23 pp 5823-5828
Career total: 30 works. 21 are in this corpus.
Profile built from the corpus for this byline.
Author records are still filling in while the Hub is in alpha. If this is your page, you'll be able to claim it soon. Spot a mistake? Tell us.