Anush Tserunyan PhD Candidate UCLA Mathematics Department   Office: MS 6139 E-mail: anush at math .ucla .edu   MS in Theoretical Computer Science, Yerevan State University, 2007 BS in Computer Science, Yerevan State University, 2005   My CV

Research

I'm interested in mathematical logic. My primary area of research is descriptive set theory; in particular the study of definable equivalence relations and applications in dynamical systems. I'm also interested in complexity theory and my Master's thesis was in graph theory.

My advisor is Alexander Kechris and my co-advisor at UCLA is Itay Neeman.

Papers and preprints

Finite generators for countable group actions in the Borel and Baire category settings, submitted (2012) [pdf]

Characterization of a class of graphs related to pairs of disjoint matchings, Discrete Mathematics 309 (2009), no. 4, 693-713 [pdf]

(with V.V. Mkrtchyan, V.L. Musoyan) On edge disjoint pairs of matchings, Discrete Mathematics 308 (2008), no. 23, 5823-5828 [pdf]

Slides

Finite generators for countable group actions [pdf]

Weakly wandering sets and their generalizations [pdf]

Generic finite generators [pdf]

Notes

Greg Hjorth's proof of "E_0 is a universal hyperfinite equivalence relation" [pdf]

Miri Segal's effective witness of measure-theoretic hyperfiniteness [pdf]

Countable compact Hausdorff spaces are Polish [pdf]

Teaching

I will be teaching a course on Descriptive Set Theory at the UCLA Logic Summer School, July 7-27, 2013. Here is some relevant material:

Prep-work

Problem set

Notes

A quick introduction to basic set theory [pdf]

Lecture notes and problem set from "First order logic and Godel incompleteness", a course at the UCLA Logic Summer School 2012.

Previous Teaching

Music links

LA Philharmonic

My former band: Variation of the Harmonic