Results 11 to 20 of about 11,399 (183)

A Remark on Representations of Infinite Symmetric Groups [PDF]

open access: bronzeJournal of Mathematical Sciences, 2013
We simplify construction of Thoma representations of an infinite symmetric ...
Yu A Neretin, Neretin Yu A
exaly   +5 more sources

On representations of the infinite symmetric group [PDF]

open access: bronzeJournal of Mathematical Sciences, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Andreĭ Okounkov
exaly   +5 more sources

Uniformization Problems and the Cofinality of the Infinite Symmetric Group [PDF]

open access: bronzeNotre Dame Journal of Formal Logic, 1994
For a group \(G\) which is not finitely generated, the cofinality of \(G\), written \(c(G)\), is defined to be the least cardinal \(\lambda\) such that \(G\) is the union of a chain of \(\lambda\) proper subgroups. For an infinite cardinal \(\kappa\), denote \(c(\text{Sym}(\kappa))\) by \(c_ \kappa\). \textit{H. D. Macpherson} and \textit{P. M. Neumann}
James D. Sharp, Simon Thomas
openalex   +4 more sources

Centralizers of the infinite symmetric group [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2014
We review and introduce several approaches to the study of centralizer algebras of the infinite symmetric group $S_{\infty}$. Our work is led by the double commutant relationship between finite symmetric groups and partition algebras; in the case of $S_{\
Zajj Daugherty, Peter Herbrich
doaj   +5 more sources

GENERATING INFINITE SYMMETRIC GROUPS [PDF]

open access: greenBulletin of the London Mathematical Society, 2006
Let S=Sym(Ω) be the group of all permutations of an infinite set Ω. Extending an argument of Macpherson and Neumann, it is shown that if U is a generating set for S as a group, respectively as a monoid, then there exists a positive integer n such that every element of S may be written as a group word, respectively a monoid word, of length \leq n in the
GEORGE M. BERGMAN
openalex   +5 more sources

The cofinality spectrum of the infinite symmetric group [PDF]

open access: greenJournal of Symbolic Logic, 1994
AbstractLetSbe the group of all permutations of the set of natural numbers. The cofinality spectrumCF(S)ofSis the set of all regular cardinalsλsuch thatScan be expressed as the union of a chain ofλproper subgroups. This paper investigates which setsCof regular uncountable cardinals can be the cofinality spectrum ofS.
Saharon Shelah, Simon Thomas
openalex   +5 more sources

Maximal subgroups of infinite symmetric groups. [PDF]

open access: bronzeNotre Dame Journal of Formal Logic, 1992
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
James E. Baumgartner   +2 more
  +6 more sources

Certain unitary representations of the infinite symmetric group, II [PDF]

open access: bronzeNagoya Mathematical Journal, 1987
The infinite symmetric group is the discrete group of all finite permutations of the set X of all natural numbers. Among discrete groups, it has distinctive features from the viewpoint of representation theory and harmonic analysis. First, it is one of the most typical ICC-groups as well as free groups and known to be a group of non-type I.
Nobuaki Obata
openalex   +7 more sources

Maximal Subgroups of Infinite Symmetric Groups [PDF]

open access: bronzeCanadian Mathematical Bulletin, 1967
The purpose of this paper is to extend results of Ball [1] concerning maximal subgroups of the group S(X) of all permutations of the infinite set X. The basic idea is to consider S(X) as a group of operators on objects more complicated than X. The objects we consider here are subspaces of the Stone-Čech compactification of the discrete space X and the ...
Fred Richman
openalex   +3 more sources

The K -functor (Grothendieck group) of the infinite symmetric group [PDF]

open access: bronzeJournal of Soviet Mathematics, 1985
Translation from Zap. Nauchn. Semin. Leningr. Otd. Mat. Inst. Steklova 123, 126-151 (Russian) (1983; Zbl 0521.20006).
A. M. Vershik, S. V. Kerov
openalex   +4 more sources

Home - About - Disclaimer - Privacy