Results 21 to 30 of about 662 (278)
Permutation and complete permutation polynomials
Finite Fields and Their Applications, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Leonid A. Bassalygo, Victor A. Zinoviev
openaire +1 more source
Ballot permutations and odd order permutations [PDF]
Discrete Mathematics, 2020 There was an error with an alternative formula for b(n,3) that was on page ...
openaire +2 more sources
J. Integer Seq., 2015 Define a sequence of positive integers by the rule that a(n) = n for 1 <= n <= 3, and for n >= 4, a(n) is the smallest number not already in the sequence which has a common factor with a(n-2) and is relatively prime to a(n-1). We show that this is a permutation of the positive integers. The remarkable graph of this sequence consists of runs of
David L. Applegate +5 more
openaire +4 more sources
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
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
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.
Adam Doliwa
doaj +1 more source
Generalised Bianchi permutability for isothermic surfaces
, 2022 Isothermic surfaces are surfaces which allow a conformal curvature line parametrisation. They form an integrable system, and Darboux transforms of isothermic surfaces obey Bianchi permutability: for two distinct spectral parameters, the corresponding ...
Joseph Cho (12125631) +2 more
core +2 more sources
On the permutability of Sylow subgroups with derived subgroups of B-subgroups
Журнал Белорусского государственного университета: Математика, информатика, 2019 A finite non-nilpotent group G is called a B-group if every proper subgroup of the quotient group G/Φ(G) is nilpotent. We establish the r-solvability of the group in which some Sylow r-subgroup permutes with the derived subgroups of 2-nilpotent (or 2 ...
Ekaterina V. Zubei
doaj +1 more source
Profiles of Permutations [PDF]
The Electronic Journal of Combinatorics, 2009 This paper develops an analogy between the cycle structure of, on the one hand, random permutations with cycle lengths restricted to lie in an infinite set $S$ with asymptotic density $\sigma$ and, on the other hand, permutations selected according to the Ewens distribution with parameter $\sigma$.
openaire +3 more sources
Permutability Class of a Semigroup
, 2000 Given a permutation σ∈Sn, a semigroup S is called σ-permutable if x1x2···xn=xσ(1)xσ(2)···xσ(n) for all n-tuples x1, x2,…,xn∈S. Various permutability conditions were considered for special classes of permutations.
Kisielewicz, Andrzej
core +1 more source