In the situation where subjects independently rank order a fixed set of items, the idea of a consensus ordering of the items is defined and employed as a parameter in a class of probability models for rankings. In the context of such models, which generalize those of Mallows, posterior probabilities may be easily formed about the population consensus ordering. An example of rankings obtained by the Graduate Record Examination Board is presented to demonstrate the adequacy of these generalized Mallows' models for describing actual data sets of rankings and to illustrate convenient summaries of the posterior probabilities for the consensus ordering.

Person-centered methods are useful for studying individual differences in terms of (dis)similarities between response profiles on multivariate outcomes. Multivariate distance matrix regression (MDMR) tests the significance of associations of response profile (dis)similarities and a set of predictors using permutation tests. This paper extends MDMR by deriving and empirically validating the asymptotic null distribution of its test statistic, and by proposing an effect size for individual outcome variables, which is shown to recover true associations. These extensions alleviate the computational burden of permutation tests currently used in MDMR and render more informative results, thus making MDMR accessible to new research domains.

The two-sample problem for Cronbach’s coefficient ${\mathit{\alpha }}_C$\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$\alpha _C$$\end{document}, as an estimate of test or composite score reliability, has attracted little attention compared to the extensive treatment of the one-sample case. It is necessary to compare the reliability of a test for different subgroups, for different tests or the short and long forms of a test. In this paper, we study statistical procedures of comparing two coefficients ${\mathit{\alpha }}_{C,1}$\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$\alpha _{C,1}$$\end{document} and ${\mathit{\alpha }}_{C,2}$\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$\alpha _{C,2}$$\end{document}. The null hypothesis of interest is $H_0:{\mathit{\alpha }}_{C,1}={\mathit{\alpha }}_{C,2}$\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$H_0 : \alpha _{C,1} = \alpha _{C,2}$$\end{document}, which we test against one-or two-sided alternatives. For this purpose, resampling-based permutation and bootstrap tests are proposed for two-group multivariate non-normal models under the general asymptotically distribution-free (ADF) setting. These statistical tests ensure a better control of the type-I error, in finite or very small sample sizes, when the state-of-affairs ADF large-sample test may fail to properly attain the nominal significance level. By proper choice of a studentized test statistic, the resampling tests are modified in order to be valid asymptotically even in non-exchangeable data frameworks. Moreover, extensions of this approach to other designs and reliability measures are discussed as well. Finally, the usefulness of the proposed resampling-based testing strategies is demonstrated in an extensive simulation study and illustrated by real data applications.

In this paper, the statistical significance of the contribution of variables to the principal components in principal components analysis (PCA) is assessed nonparametrically by the use of permutation tests. We compare a new strategy to a strategy used in previous research consisting of permuting the columns (variables) of a data matrix independently and concurrently, thus destroying the entire correlational structure of the data. This strategy is considered appropriate for assessing the significance of the PCA solution as a whole, but is not suitable for assessing the significance of the contribution of single variables. Alternatively, we propose a strategy involving permutation of one variable at a time, while keeping the other variables fixed. We compare the two approaches in a simulation study, considering proportions of Type I and Type II error. We use two corrections for multiple testing: the Bonferroni correction and controlling the False Discovery Rate (FDR). To assess the significance of the variance accounted for by the variables, permuting one variable at a time, combined with FDR correction, yields the most favorable results. This optimal strategy is applied to an empirical data set, and results are compared with bootstrap confidence intervals.

In this paper, we propose a (n−1)2 parameter, multistage ranking model, which represents a generalization of Luce's model. We propose the n×n item-rank relative frequency matrix (p-matrix) as a device for summarizing a set of rankings. As an alternative to the traditional maximum likelihood estimation, for the proposed model we suggest a method which estimates the parameters from the p-matrix. An illustrative numerical example is given. The proposed model and its differences from Luce's model are briefly discussed. We also show some special p-matrix patterns possessed by the Thurstonian models and distance-based models.

We write $\mathcal {S}_n(A)$ for the set of permutations of a set A with n non-fixed points and $\mathrm {{seq}}^{1-1}_n(A)$ for the set of one-to-one sequences of elements of A with length n where n is a natural number greater than $1$. With the Axiom of Choice, $|\mathcal {S}_n(A)|$ and $|\mathrm {{seq}}^{1-1}_n(A)|$ are equal for all infinite sets A. Among our results, we show, in ZF, that $|\mathcal {S}_n(A)|\leq |\mathrm {{seq}}^{1-1}_n(A)|$ for any infinite set A if ${\mathrm {AC}}_{\leq n}$ is assumed and this assumption cannot be removed. In the other direction, we show that $|\mathrm {{seq}}^{1-1}_n(A)|\leq |\mathcal {S}_{n+1}(A)|$ for any infinite set A and the subscript $n+1$ cannot be reduced to n. Moreover, we also show that “$|\mathcal {S}_n(A)|\leq |\mathcal {S}_{n+1}(A)|$ for any infinite set A” is not provable in ZF.

Let p be a prime with $p\equiv 1\pmod {4}$ . Gauss first proved that $2$ is a quartic residue modulo p if and only if $p=x^2+64y^2$ for some $x,y\in \Bbb Z$ and various expressions for the quartic residue symbol $(\frac {2}{p})_4$ are known. We give a new characterisation via a permutation, the sign of which is determined by $(\frac {2}{p})_4$ . The permutation is induced by the rule $x \mapsto y-x$ on the $(p-1)/4$ solutions $(x,y)$ to $x^2+y^2\equiv 0 \pmod {p}$ satisfying $1\leq x < y \leq (p-1)/2$ .

For a set x, let ${\cal S}\left( x \right)$ be the set of all permutations of x. We prove in ZF (without the axiom of choice) several results concerning this notion, among which are the following:

(1) For all sets x such that ${\cal S}\left( x \right)$ is Dedekind infinite, $\left| {{{\cal S}_{{\rm{fin}}}}\left( x \right)} \right| < \left| {{\cal S}\left( x \right)} \right|$ and there are no finite-to-one functions from ${\cal S}\left( x \right)$ into ${{\cal S}_{{\rm{fin}}}}\left( x \right)$, where ${{\cal S}_{{\rm{fin}}}}\left( x \right)$ denotes the set of all permutations of x which move only finitely many elements.

(2) For all sets x such that ${\cal S}\left( x \right)$ is Dedekind infinite, $\left| {{\rm{seq}}\left( x \right)} \right| < \left| {{\cal S}\left( x \right)} \right|$ and there are no finite-to-one functions from ${\cal S}\left( x \right)$ into seq (x), where seq (x) denotes the set of all finite sequences of elements of x.

(3) For all infinite sets x such that there exists a permutation of x without fixed points, there are no finite-to-one functions from ${\cal S}\left( x \right)$ into x.

(4) For all sets x, $|{[x]^2}| < \left| {{\cal S}\left( x \right)} \right|$.

For a set x, let ${\cal S}\left( x \right)$ be the set of all permutations of x. We prove by the method of permutation models that the following statements are consistent with ZF:

(1) There is an infinite set x such that $|\wp \left( x \right)| < |{\cal S}\left( x \right)| < |se{q^{1 - 1}}\left( x \right)| < |seq\left( x \right)|$, where $\wp \left( x \right)$ is the power set of x, seq (x) is the set of all finite sequences of elements of x, and seq1-1 (x) is the set of all finite sequences of elements of x without repetition.

(2) There is a Dedekind infinite set x such that $|{\cal S}\left( x \right)| < |{[x]^3}|$ and such that there exists a surjection from x onto ${\cal S}\left( x \right)$.

(3) There is an infinite set x such that there is a finite-to-one function from ${\cal S}\left( x \right)$ into x.

The $W$-operator, $W([n])$, generalises the cut-and-join operator. We prove that $W([n])$ can be written as the sum of $n!$ terms, each term corresponding uniquely to a permutation in $S_{\!n}$. We also prove that there is a correspondence between the terms of $W([n])$ with maximal degree and noncrossing partitions.

We present conditions for a set of matrices satisfying a permutation identity to be simultaneously triangularizable. As applications of our results, we generalize Radjavi’s result on triangularization of matrices with permutable trace and results by Yan and Tang on linear triangularization of polynomial maps.

Let $n$ be a positive integer and $a$ an integer prime to $n$. Multiplication by $a$ induces a permutation over $\mathbb{Z}/n\mathbb{Z}=\{\overline{0},\overline{1},\ldots ,\overline{n-1}\}$. Lerch’s theorem gives the sign of this permutation. We explore some applications of Lerch’s result to permutation problems involving quadratic residues modulo $p$ and confirm some conjectures posed by Sun [‘Quadratic residues and related permutations and identities’, Preprint, 2018, arXiv:1809.07766]. We also study permutations involving arbitrary $k$th power residues modulo $p$ and primitive roots modulo a power of $p$.

In Qualitative Comparative Analysis (QCA), empirical researchers use the consistency value as one, if not sole, criterion to decide whether an association between a term and an outcome is consistent with a set-relational claim. Braumoeller (2015) points out that the consistency value is unsuitable for this purpose. We need to know the probability of obtaining it under the null hypothesis of no systematic relation. He introduces permutation testing for estimating the $p$ value of a consistency score as a safeguard against false positives. In this paper, I introduce permutation-based power estimation as a safeguard against false-negative conclusions. Low power might lead to the false exclusion of truth table rows from the minimization procedure and the generation and interpretation of invalid solutions. For a variety of constellations between an alternative and null hypothesis and numbers of cases, simulations demonstrate that power estimates can range from 1 to 0. Ex post power analysis for 63 truth table analyses shows that even under the most favorable constellation of parameters, about half of them can be considered low-powered. This points to the value of estimating power and calculating the required number of cases before the truth table analysis.

Forster [‘Finite-to-one maps’, J. Symbolic Logic68 (2003), 1251–1253] showed, in Zermelo–Fraenkel set theory, that if there is a finite-to-one map from ${\mathcal{P}}(A)$, the set of all subsets of a set $A$, onto $A$, then $A$ must be finite. If we assume the axiom of choice (AC), the cardinalities of ${\mathcal{P}}(A)$ and the set $S(A)$ of permutations on $A$ are equal for any infinite set $A$. In the absence of AC, we cannot make any conclusion about the relationship between the two cardinalities for an arbitrary infinite set. In this paper, we give a condition that makes Forster’s theorem, with ${\mathcal{P}}(A)$ replaced by $S(A)$, provable without AC.

We prove that the number of right ideals of codimension $n$ in the algebra of noncommutative Laurent polynomials in two variables over the finite field ${{\mathbb{F}}_{q}}$ is equal to

$${{\left( q-1 \right)}^{n+1}}_{{}}{{q}^{\frac{\left( n+1 \right)\left( n-2 \right)}{2}}}\sum\limits_{\theta }{{{q}^{inv\left( \theta \right)}}}$$

where the sum is over all indecomposable permutations in ${{S}_{n+1}}$ and where inv $\left( \theta \right)$ stands for the number of inversions of $\theta $ .

There has been ongoing interest in studying wine judges' performance in evaluating wines. Most of the studies have reached a similar conclusion: a significant lack of consensus exists in wine quality ratings. However, a few studies, to the author's knowledge, have provided direct quantification of how much consensus (as opposed to randomness) exists in wine ratings. In this paper, a permutation-based mixed model is proposed to quantify randomness versus consensus in wine ratings. Specifically, wine ratings under the condition of randomness are generated with a permutation method, and wine ratings under the condition of consensus can be produced by sorting the ratings for each judge. Then the observed wine ratings are modeled as a mixture of ratings under randomness and ratings under consensus. This study shows that the model can provide excellent model fit, which indicates that wine ratings, indeed, consist of a mixture of randomness and consensus. A direct measure is easily computed to quantify randomness versus consensus in wine ratings. The method is demonstrated with data analysis from a major wine competition and a simulation study. (JEL Classifications: C10, C13, C15)

An infinite permutation α is a linear ordering of N. We study properties of infinite permutations analogous to those of infinite words, and show some resemblances and some differences between permutations and words. In this paper, we try to extend to permutations the notion of automaticity. As we shall show, the standard definitions which are equivalent in the case of words are not equivalent in the context of permutations. We investigate the relationships between these definitions and prove that they constitute a chain of inclusions. We also construct and study an automaton generating the Thue-Morse permutation.

Customers arrive sequentially at times x1 < x2 < · · · < xn and stay for independent random times Z1, …, Zn > 0. The Z-variables all have the same distribution Q. We are interested in situations where the data are incomplete in the sense that only the order statistics associated with the departure times xi + Zi are known, or that the only available information is the order in which the customers arrive and depart. In the former case we explore possibilities for the reconstruction of the correct matching of arrival and departure times. In the latter case we propose a test for exponentiality.

We completely determine the localized automorphisms of the Cuntz algebras corresponding to permutation matrices in Mn ⊗ Mn for n = 3 and n = 4. This result is obtained through a combination of general combinatorial techniques and large scale computer calculations. Our analysis proceeds according to the general scheme proposed in a previous paper, where we analysed in detail the case of using labelled rooted trees. We also discuss those proper endomorphisms of these Cuntz algebras which restrict to automorphisms of their respective diagonals. In the case of we compute the number of automorphisms of the diagonal induced by permutation matrices in M3 ⊗ M3 ⊗ M3.