On averages of randomized class functions on the symmetric groups and their asymptotics

Paul-Olivier Dehaye; Dirk Zeindler

Displaying similar documents to “On averages of randomized class functions on the symmetric groups and their asymptotics”

A class of permutation trinomials over finite fields

Xiang-dong Hou (2014)

Acta Arithmetica

Similarity:

Let q > 2 be a prime power and $f = - x + t x^{q} + x^{2 q - 1}$ , where $t \in *_{q}$ . We prove that f is a permutation polynomial of $_{q ²}$ if and only if one of the following occurs: (i) q is even and $T r_{q / 2} (1 / t) = 0$ ; (ii) q ≡ 1 (mod 8) and t² = -2.

Doubly stochastic matrices and the Bruhat order

Richard A. Brualdi, Geir Dahl, Eliseu Fritscher (2016)

Czechoslovak Mathematical Journal

Similarity:

The Bruhat order is defined in terms of an interchange operation on the set of permutation matrices of order $n$ which corresponds to the transposition of a pair of elements in a permutation. We introduce an extension of this partial order, which we call the stochastic Bruhat order, for the larger class $Ω_{n}$ of doubly stochastic matrices (convex hull of $n \times n$ permutation matrices). An alternative description of this partial order is given. We define a class of special faces of $Ω_{n}$ induced by permutation...

Brauer relations in finite groups

Alex Bartel, Tim Dokchitser (2015)

Journal of the European Mathematical Society

Similarity:

If $G$ is a non-cyclic finite group, non-isomorphic $G$ -sets $X, Y$ may give rise to isomorphic permutation representations $ℂ [X] ≅ ℂ [Y]$ . Equivalently, the map from the Burnside ring to the rational representation ring of $G$ has a kernel. Its elements are called Brauer relations, and the purpose of this paper is to classify them in all finite groups, extending the Tornehave–Bouc classification in the case of $p$ -groups.

Determination of a type of permutation trinomials over finite fields

Xiang-dong Hou (2014)

Acta Arithmetica

Similarity:

Let $f = a x + b x^{q} + x^{2 q - 1} \in_{q} [x]$ . We find explicit conditions on a and b that are necessary and sufficient for f to be a permutation polynomial of $_{q ²}$ . This result allows us to solve a related problem: Let $g_{n, q} \in_{p} [x]$ (n ≥ 0, $p = c h a r_{q}$ ) be the polynomial defined by the functional equation $\sum_{c \in_{q}} {(x + c)}^{n} = g_{n, q} (x^{q} - x)$ . We determine all n of the form $n = q^{α} - q^{β} - 1$ , α > β ≥ 0, for which $g_{n, q}$ is a permutation polynomial of $_{q ²}$ .

Representations of $S_{n}$ and $G L_{n}$ and the q-Schur algebra

Gordon James (1990)

Banach Center Publications

Similarity:

G-matrices, $J$ -orthogonal matrices, and their sign patterns

Frank J. Hall, Miroslav Rozložník (2016)

Czechoslovak Mathematical Journal

Similarity:

A real matrix $A$ is a G-matrix if $A$ is nonsingular and there exist nonsingular diagonal matrices $D_{1}$ and $D_{2}$ such that $A^{- T} = D_{1} A D_{2}$ , where $A^{- T}$ denotes the transpose of the inverse of $A$ . Denote by $J = diag (\pm 1)$ a diagonal (signature) matrix, each of whose diagonal entries is $+ 1$ or $- 1$ . A nonsingular real matrix $Q$ is called $J$ -orthogonal if $Q^{T} J Q = J$ . Many connections are established between these matrices. In particular, a matrix $A$ is a G-matrix if and only if $A$ is diagonally (with positive diagonals) equivalent to a column permutation...

Nested matrices and inverse $M$ -matrices

Jeffrey L. Stuart (2015)

Czechoslovak Mathematical Journal

Similarity:

Given a sequence of real or complex numbers, we construct a sequence of nested, symmetric matrices. We determine the $L U$ - and $Q R$ -factorizations, the determinant and the principal minors for such a matrix. When the sequence is real, positive and strictly increasing, the matrices are strictly positive, inverse $M$ -matrices with symmetric, irreducible, tridiagonal inverses.

Minimal and minimum size latin bitrades of each genus

James Lefevre, Diane Donovan, Nicholas J. Cavenagh, Aleš Drápal (2007)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

Suppose that $T^{\circ}$ and $T^{☆}$ are partial latin squares of order $n$ , with the property that each row and each column of $T^{\circ}$ contains the same set of entries as the corresponding row or column of $T^{☆}$ . In addition, suppose that each cell in $T^{\circ}$ contains an entry if and only if the corresponding cell in $T^{☆}$ contains an entry, and these entries (if they exist) are different. Then the pair $T = (T^{\circ}, T^{☆})$ forms a . The of $T$ is the total number of filled cells in $T^{\circ}$ (equivalently $T^{☆}$ ). The latin bitrade is if there is no...

Scalar differential concomitants of first order of a symmetric connexion $Γ_{j k}^{i}$ in the two-dimensional space and their applications

Michał Lorens (1980)

Annales Polonici Mathematici

Similarity:

Symmetry classes of tensors associated with the semi-dihedral groups $S D_{8 n}$

Mahdi Hormozi, Kijti Rodtes (2013)

Colloquium Mathematicae

Similarity:

We discuss the existence of an orthogonal basis consisting of decomposable vectors for all symmetry classes of tensors associated with semi-dihedral groups $S D_{8 n}$ . In particular, a necessary and sufficient condition for the existence of such a basis associated with $S D_{8 n}$ and degree two characters is given.

A computation of positive one-peak posets that are Tits-sincere

Marcin Gąsiorek, Daniel Simson (2012)

Colloquium Mathematicae

Similarity:

A complete list of positive Tits-sincere one-peak posets is provided by applying combinatorial algorithms and computer calculations using Maple and Python. The problem whether any square integer matrix $A \in ₙ (ℤ)$ is ℤ-congruent to its transpose $A^{t r}$ is also discussed. An affirmative answer is given for the incidence matrices $C_{I}$ and the Tits matrices $C ̂_{I}$ of positive one-peak posets I.

Vandermonde nets

Roswitha Hofer, Harald Niederreiter (2014)

Acta Arithmetica

Similarity:

The second-named author recently suggested identifying the generating matrices of a digital (t,m,s)-net over the finite field $_{q}$ with an s × m matrix C over $_{q^{m}}$ . More exactly, the entries of C are determined by interpreting the rows of the generating matrices as elements of $_{q^{m}}$ . This paper introduces so-called Vandermonde nets, which correspond to Vandermonde-type matrices C, and discusses the quality parameter and the discrepancy of such nets. The methods that have been successfully used...