Results 41 to 50 of about 219,402 (291)
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
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
THE METHOD OF TRANSFORMATION IN DESCRIPTIVE LINGUISTICS [PDF]
Вісник університету ім. А. Нобеля. Серія Філологічні науки, 2020 As we know the method of transformation was proposed by Z. Harris who was the outstanding delegate of descriptive linguistics, later was used by his student N. Chomsky. By creating the transformation model of generative grammar N.
Konul H. Mamedova
doaj +1 more source
Definitions, 2020 A permutation representation of a group can be defined as a homomorphism of the given group G into a symmetric group, the group of all permutations of a given set t.
R. K. Caldwell +3 more
semanticscholar +1 more source
A Probabilistic Chaotic Image Encryption Scheme
Mathematics, 2022 This paper proposes a probabilistic image encryption scheme that improves on existing deterministic schemes by using a chaining mode of chaotic maps in a permutation-masking process.
Ali Kanso +2 more
doaj +1 more source
Conditional permutation importance revisited
BMC Bioinformatics, 2020 Random forest based variable importance measures have become popular tools for assessing the contributions of the predictor variables in a fitted random forest.
Dries Debeer, C. Strobl
semanticscholar +1 more source
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