Results 21 to 30 of about 2,138 (236)
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
Finite groups in which normality, permutability or Sylow permutability is transitive
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2014 Y. Li gave a characterization of the class of finite soluble groups in which every subnormal subgroup is normal by means of NE-subgroups: a subgroup H of a group G is called an NE-subgroup of G if NG(H) ∩ HG = H. We obtain a new characterization of these
Malinowska Izabela Agata
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 Logic of Identity: Distinguishability and Indistinguishability in Classical and Quantum Physics [PDF]
, 2014 The suggestion that particles of the same kind may be indistinguishable in a fundamental sense, even so that challenges to traditional notions of individuality and identity may arise, has first come up in the context of classical statistical mechanics ...
Dieks, Dennis
core +2 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
Symmetries and Paraparticles as a Motivation for Structuralism [PDF]
, 2009 This paper develops an analogy proposed by Stachel between general relativity (GR) and quantum mechanics (QM) as regards permutation invariance. Our main idea is to overcome Pooley's criticism of the analogy by appeal to paraparticles.
Butterfield, Jeremy, Caulton, Adam
core +3 more sources
Journal of High Energy Physics, 2003 N-fold tensor products of a rational CFT carry an action of the permutation group S_N. These automorphisms can be used as gluing conditions in the study of boundary conditions for tensor product theories. We present an ansatz for such permutation boundary states and check that it satisfies the cluster condition and Cardy's constraints.
openaire +3 more sources
B\"{a}cklund transformations as integrable discretization. The geometric approach [PDF]
Open Communications in Nonlinear Mathematical PhysicsWe present interpretation of known results in the theory of discrete asymptotic and discrete conjugate nets from the "discretization by B\"{a}cklund transformations" point of view. We collect both classical formulas of XIXth century differential geometry
Adam Doliwa
doaj +1 more source
Permutation Reconstruction [PDF]
The Electronic Journal of Combinatorics, 2006 In this paper, we consider the problem of permutation reconstruction. This problem is an analogue of graph reconstruction, a famous question in graph theory. In the case of permutations, the problem can be stated as follows: In all possible ways, delete $k$ entries of the permutation $p=p_1p_2p_3...p_n$ and renumber accordingly, creating $n \choose k$
openaire +2 more sources