activity
20122026
most citedIP-rigidity and eigenvalue groups

18 citations · 43 across the 7 of their papers we have counts for

collaborators

8 papers

math.DS2026

Embeddings of Relative Dimension Groups for Zero-Dimensional Dynamical Systems

Maryam Hosseini

Let be a factor map between zero-dimensional dynamical systems, and let and be quasi-sections with . We study the homomorphism $π^…

math.DS2023

Topological Factoring of Zero Dimensional Dynamical Systems

Nasser Golestani, Maryam Hosseini, Hamed Yahya Oghli

We show that every topological factoring between two zero dimensional dynamical systems can be represented by a sequence of morphisms between the levels of the associated ordered B…

math.DS2020★ 5 cited

On Topological Rank of Factors of Cantor Minimal Systems

Nasser Golestani, Maryam Hosseini

A Cantor minimal system is of finite topological rank if it has a Bratteli-Vershik representation whose number of vertices per level is uniformly bounded. We prove that if the topo…

cs.IT2018

Tail redundancy and its characterization of compression of memoryless sources

Maryam Hosseini, Narayana Santhanam

We formalize the tail redundancy of a collection of distributions over a countably infinite alphabet, and show that this fundamental quantity characterizes the asymptotic per-symbo…

cs.IT2018

Redundancy of unbounded memory Markov classes with continuity conditions

Changlong Wu, Maryam Hosseini, Narayana Santhanam

We study the redundancy of universally compressing strings generated by a binary Markov source without any bound on the memory. To better understand the connec…

math.DS2016★ 17 cited

Orbit equivalence of Cantor minimal systems and their continuous spectra

Thierry Giordano, David Handelman, Maryam Hosseini

To any continuous eigenvalue of a Cantor minimal system , we associate an element of the dimension group associated to . We introduce and study the c…

cs.IT2014★ 3 cited

On redundancy of memoryless sources over countable alphabets

Maryam Hosseini, Narayana Santhanam

The minimum average number of bits need to describe a random variable is its entropy, assuming knowledge of the underlying statistics On the other hand, universal compression suppo…

math.DS2012★ 18 cited

IP-rigidity and eigenvalue groups

Jon. Aaronson, Maryam Hosseini, Mariusz Lemanczyk

We examine the class of increasing sequences of natural numbers which are IP-rigidity sequences for some weakly mixing probability preserving transformation. This property is close…