Results 51 to 60 of about 219,402 (291)
A general lattice theoretic construction of Reading constructs Hopf subalgebras of the Malvenuto-Reutenauer Hopf algebra (MR) of permutations. The products and coproducts of these Hopf subalgebras are defined extrinsically in terms of the embedding in MR.
Shirley Law
doaj +1 more source
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
The purpose of this article is to construct an internal function underlying the “Sponge” scheme for constructing cryptographic hash functions. An internal function in the “Sponge” scheme is a fixed-length transformation or permutation that
R. M. Ospanov +3 more
doaj +1 more source
Permutation Reconstruction [PDF]
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
$m$-submultisets and $m$-permutations of multisets elements
The article is devoted to two classical combinatorial problems on multisets, which in the existing literature are given unjustifiably little space. Namely, the calculation of the number of all submultisets of power $m$ for an arbitrary multiset and the ...
O.V. Makhnei +2 more
doaj +1 more source
The field of disordered systems provides many simple models in which the competing influences of thermal and non-thermal disorder lead to new phases and non-trivial thermal behavior of order parameters. In this paper, we add a model to the subject by considering a system where the state space consists of various orderings of a list. As in spin glasses,
openaire +3 more sources
To permute or not to permute [PDF]
Abstract Permutation test is a popular technique for testing a hypothesis of no effect, when the distribution of the test statistic is unknown. To test the equality of two means, a permutation test might use a test statistic which is the difference of the two sample means in the univariate case.
Yifan, Huang +3 more
openaire +2 more sources
Estimating significances of differences between slopes: A new methodology and software [PDF]
Determining the significance of slope differences is a common requirement in studies of self-thinning, ontogeny and sexual dimorphism, among others. This has long been carried out testing for the overlap of the bootstrapped 95% confidence intervals of ...
Vasco M. N. C. S. Vieira, Joel Creed
doaj
Let $C(n)$ denote the number of permutations $σ$ of $[n]=\{1,2,\dots,n\}$ such that $\gcd(j,σ(j))=1$ for each $j\in[n]$. We prove that for $n$ sufficiently large, $n!/3.73^n < C(n) < n!/2.5^n$.
openaire +3 more sources
Image encryption is one of the essential tasks in image security. In this paper, we propose a novel approach that integrates a hyperchaotic system, pixel-level Dynamic Filtering, DNA computing, and operations on 3D Latin Cubes, namely DFDLC, for image ...
Taiyong Li +4 more
doaj +1 more source

