Hostname: page-component-74656f9884-8r8nv Total loading time: 0 Render date: 2026-11-11T01:38:28.364Z Has data issue: false hasContentIssue false

Mixing with staircase multiplicity functions

Published online by Cambridge University Press:  10 July 2008

OLEG AGEEV*
Affiliation:
Department of Mathematics, Moscow State Technical University, 2nd Baumanscaya St. 5, 105005 Moscow, Russia School of Mathematics and Statistics, University of New South Wales, Sydney 2052, Australia (email: ageev@mx.bmstu.ru, ageev@maths.unsw.edu.au)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Every subgroup of the symmetric group defines a natural factor of the Cartesian power of a transformation. We calculate the set of values of the spectral multiplicity function of such factors (under certain conditions on the transformation) in terms of the number of orbits of diagonal actions of these subgroups. An analogous statement also holds on the unitary level for operators that preserve 1. In particular, we prove that for every positive integer n, there exists a transformation which is mixing of all orders and has a staircase multiplicity function of length n; that is, the essential values of the spectral multiplicity function are {1,2,…,n}.

Information

Type
Research Article
Copyright
Copyright © 2008 Cambridge University Press