Anush Tserunyan

20082018
If you made any changes in Pure, your changes will be visible here soon.

Fingerprint Fingerprint is based on mining the text of the expert's scholarly documents to create an index of weighted terms, which defines the key subjects of each individual researcher.

  • 1 Similar Profiles
Disjoint Mathematics
Ramsey's Theorem Mathematics
Baire Category Mathematics
Group Action Mathematics
Groupoids Mathematics
Equivalence relation Mathematics
Countable Mathematics
Container Mathematics

Network Recent external collaboration on country level. Dive into details by clicking on the dots.

Research Output 2008 2018

A short nonalgorithmic proof of the containers theorem for hypergraphs

Bernshteyn, A., Delcourt, M., Towsner, H. & Tserunyan, A., Jan 1 2018, In : Proceedings of the American Mathematical Society. 147, 4, p. 1739-1749 11 p.

Research output: Contribution to journalArticle

Container
Hypergraph
Containers
Theorem
Number theory

Polish groupoids and functorial complexity

Lupini, M. & Tserunyan, A., Jan 1 2017, In : Transactions of the American Mathematical Society. 369, 9, p. 6683-6723 41 p.

Research output: Contribution to journalArticle

Groupoids
Equivalence relation
Orbit Equivalence
Orbits
G-space

A Ramsey Theorem on semigroups and a general van der Corput lemma

Tserunyan, A., Jun 1 2016, In : Journal of Symbolic Logic. 81, 2, p. 718-741 24 p.

Research output: Contribution to journalArticle

Ramsey's Theorem
Lemma
Semigroup
Filter
Recurrence

Finite generators for countable group actions in the Borel and Baire category settings

Tserunyan, A., Jan 1 2015, In : Advances in Mathematics. 269, p. 585-646 62 p.

Research output: Contribution to journalArticle

Baire Category
Group Action
Countable
Polish Space
Generator

Characterization of a class of graphs related to pairs of disjoint matchings

Tserunyan, A., Mar 6 2009, In : Discrete Mathematics. 309, 4, p. 693-713 21 p.

Research output: Contribution to journalArticle

Disjoint
Graph in graph theory
Maximum Matching
Spanning Subgraph
Connected Components