Results 31 to 40 of about 496,846 (263)
Permutation orientifolds [PDF]
Journal of High Energy Physics, 2007 32 pages, 1 Figure, v2: references added, minor correction, version published in ...
Brunner, Ilka, Mitev, Vladimir
openaire +2 more sources
Permutation Tests Using Arbitrary Permutation Distributions
Sankhya A, 2023 AbstractPermutation tests date back nearly a century to Fisher’s randomized experiments, and remain an immensely popular statistical tool, used for testing hypotheses of independence between variables and other common inferential questions. Much of the existing literature has emphasized that, for the permutation p-value to be valid, one must first pick
Aaditya Ramdas +3 more
openaire +3 more sources
Generating trees for partitions and permutations with no k-nestings [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 We describe a generating tree approach to the enumeration and exhaustive generation of k-nonnesting set partitions and permutations. Unlike previous work in the literature using the connections of these objects to Young tableaux and restricted lattice ...
Sophie Burrill +3 more
doaj +1 more source
Mixing Bandt-Pompe and Lempel-Ziv approaches: another way to analyze the complexity of continuous-states sequences [PDF]
, 2014 In this paper, we propose to mix the approach underlying Bandt-Pompe permutation entropy with Lempel-Ziv complexity, to design what we call Lempel-Ziv permutation complexity.
A. Lempel +44 more
core +4 more sources
Equivalence classes of matrices over a finite field
International Journal of Mathematics and Mathematical Sciences, 1979 Let Fq=GF(q) denote the finite field of order q and F(m,q) the ring of m×m matrices over Fq. Let Ω be a group of permutations of Fq. If A,BϵF(m,q) then A is equivalent to B relative to Ω if there exists ϕϵΩ such that ϕ(A)=B where ϕ(A) is computed by ...
Gary L. Mullen
doaj +1 more source
Interlocked Permutations [PDF]
SIAM Journal on Discrete Mathematics, 2019 The zero-error capacity of channels with a countably infinite input alphabet formally generalises Shannon's classical problem about the capacity of discrete memoryless channels. We solve the problem for three particular channels. Our results are purely combinatorial and in line with previous work of the third author about permutation capacity.
Cohen, Gérard +2 more
openaire +3 more sources
Permutations destroying arithmetic progressions in finite cyclic groups [PDF]
, 2015 A permutation \pi of an abelian group G is said to destroy arithmetic progressions (APs) if, whenever (a,b,c) is a non-trivial 3-term AP in G, that is c-b=b-a and a,b,c are not all equal, then (\pi(a),\pi(b),\pi(c)) is not an AP.
Hegarty, Peter, Martinsson, Anders
core +2 more sources
An AUC-based Permutation Variable Importance Measure for Random Forests [PDF]
, 2012 The random forest (RF) method is a commonly used tool for classification with high dimensional data as well as for ranking candidate predictors based on the so-called random forest variable importance measures (VIMs).
A Estabrooks +33 more
core +3 more sources
Homogeneous Permutations [PDF]
The Electronic Journal of Combinatorics, 2002 There are just five Fraïssé classes of permutations (apart from the trivial class of permutations of a singleton set); these are the identity permutations, reversing permutations, composites (in either order) of these two classes, and all permutations. The paper also discusses infinite generalisations of permutations, and the connection with Fraïssé's ...
openaire +2 more sources
A geometric interpretation of the permutation $p$-value and its application in eQTL studies [PDF]
, 2010 Permutation $p$-values have been widely used to assess the significance of linkage or association in genetic studies. However, the application in large-scale studies is hindered by a heavy computational burden.
Sun, Wei, Wright, Fred A.
core +3 more sources