Results 21 to 30 of about 141,402 (295)
Geometric grid classes of permutations [PDF]
, 2012 A geometric grid class consists of those permutations that can be drawn on a specified set of line segments of slope ±1 arranged in a rectangular pattern governed by a matrix.
Atkinson, M.D. +8 more
core +1 more source
S-crucial and bicrucial permutations with respect to squares [PDF]
, 2014 A permutation is square-free if it does not contain two consecutive factors of length two or more that are order-isomorphic. A permutation is bicrucial with respect to squares if it is square-free but any extension of it to the right or to the left by ...
Gent, Ian +4 more
core +3 more sources
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 +2 more sources
A relation on 132-avoiding permutation patterns [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 A permutation $σ$ contains the permutation $τ$ if there is a subsequence of $σ$ order isomorphic to $τ$. A permutation $σ$ is $τ$-avoiding if it does not contain the permutation $τ$.
Natalie Aisbett
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 +4 more sources
Avoiding maximal parabolic subgroups of S_k [PDF]
Discrete Mathematics & Theoretical Computer Science, 2000 We find an explicit expression for the generating function of the number of permutations in S_n avoiding a subgroup of S_k generated by all but one simple transpositions.
Toufik Mansour, Alek Vainshtein
doaj +1 more source
Magic Square and Arrangement of Consecutive Integers That Avoids k-Term Arithmetic Progressions
Mathematics, 2021 In 1977, Davis et al. proposed a method to generate an arrangement of [n]={1,2,…,n} that avoids three-term monotone arithmetic progressions. Consequently, this arrangement avoids k-term monotone arithmetic progressions in [n] for k≥3.
Kai An Sim, Kok Bin Wong
doaj +1 more source
, 2011 A selection of points drawn from a convex polygon, no two with the same vertical or horizontal coordinate, yields a permutation in a canonical fashion.
Ruskuc, Nik +13 more
core +1 more source
New Hopf Structures on Binary Trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2009 The multiplihedra $\mathcal{M}_{\bullet} = (\mathcal{M}_n)_{n \geq 1}$ form a family of polytopes originating in the study of higher categories and homotopy theory. While the multiplihedra may be unfamiliar to the algebraic combinatorics community, it is
Stefan Forcey +2 more
doaj +1 more source
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