Biography

Anush Tserunyan is a Professor of Mathematics at McGill University, Canada. After obtaining a bachelor's degree in computer science and applied mathematics in 2005 from Yerevan State University (Armenia) and a master's degree in 2007 in the same specialty, she obtained a doctorate in mathematics from the University of California at Los Angeles (UCLA), USA, which she defended in June 2013. Supervised by Alexander S. Kechris (Caltech) and Itay Neeman (UCLA), her thesis focused on finite generators for actions of countable groups, finite index pairs of equivalence relations, as well as complexity measures for recursive programs.

Collaboration with UMPA

Anush Tserunyan and Patrick Allen will be on sabbatical from McGill University for the 2024-2025 academic year. They plan to spend 6 months of that year in Lyon, specifically from September 1, 2024 to February 28, 2025. They are a pair of mathematicians from McGill whose visit is of interest to several teams on the site: “Geometry, Groups and Dynamics” and “Number Theory” from UMPA (as well as AGL from ICJ Lyon 1), including the following people: Benjamin Schraen, Sophie Morel, Olivier Taibi, Sandra Rozensztajn, Laurent Berger, Damien Gaboriau, Adrien Le Boudec (as well as marginally Todor Tsankov, Julien Melleray, Mikael de la Salle).

A number of collaborations are underway or being set up, some of which are already at an advanced stage, with members of the laboratory. Their visit will also benefit the laboratory's doctoral students.
Anush Tserunyan and Patrick Allen will both be giving a series of talks in seminars (GGD and number theory) and as part of the “Actions!” working group at UMPA.

Major publications

• H. Guo, K. Kaempen, Z. Mo, S. Qunell, J Rogge, C. Song, A. Tserunyan, J. Zomback. Pairs of disjoint matchings and related classes of graphs. Involve, 16-2 (2023), 249–264. [arXiv, doi:10.2140/involve.2023.16.249]
• Anush Tserunyan. Mixing and double recurrence in probability groups. Fundam. Math., 260 (2023), 77-98. [arXiv, doi:10.4064/fm225-7-2022]
• Anush Tserunyan. Pointwise ergodic theorem for locally countable quasi-pmp graphs. J. Mod. Dyn., 18, 2022, 609-655. [arXiv, doi:10.3934/jmd.2022019]
• Zhengda Mo, Sam Qunell, Anush Tserunyan, and Jenna Zomback. Characterization of saturated graphsrelated to pairs of disjoint matchings. Illinois J. Math., 66(1):59–77, 2022. [arXiv, doi:10.1215/00192082-9719963]
• Anton Bernshteyn, Michelle Delcourt, and Anush Tserunyan. Independent sets in algebraic hypergraphs. J.Eur. Math. Soc. (JEMS), 24(1):1–35, 2022, published online in 2021. [arXiv, doi:10.4171/jems/1082]
• Anush Tserunyan. A descriptive construction of trees and Stallings’ theorem. In Trends in set theory, volume 752 of Contemp. Math., pages 191–207. Amer. Math. Soc., [Providence], RI, [2020] ©2020. [arXiv, doi:10.1090/conm/752/15137]
• Anton Bernshteyn, Michelle Delcourt, Henry Towsner, and Anush Tserunyan. A short nonalgorithmic proof of the containers theorem for hypergraphs. Proc. Amer. Math. Soc., 147(4):1739–1749, 2019. [arXiv, doi:10.1090/proc/14368]
• Anush Tserunyan. A Ramsey theorem on semigroups and a general van der Corput lemma. J. Symb. Log., 81(2):718–741, 2016. [arXiv, doi:10.1017/jsl.2015.37]
• Anush Tserunyan. Finite generators for countable group actions in the Borel and Baire category settings. Adv. Math., 269:585–646, 2015. [arXiv, doi:10.1016/j.aim.2014.10.013]
• Anush Tserunyan. Characterization of a class of graphs related to pairs of disjoint matchings. Discrete Math., 309(4):693–713, 2009. [arXiv, doi:10.1016/j.disc.2008.01.004]
• V. V. Mkrtchyan, V. L. Musoyan, and A. V. Tserunyan. On edge-disjoint pairs of matchings. Discrete Math., 308(23):5823–5828, 2008. [arXiv, doi:10.1016/j.disc.2007.09.061]
• Benjamin D. Miller and Anush Tserunyan. Edge sliding and ergodic hyperfinite decomposition. 2017+.