Results 21 to 30 of about 108,510 (269)
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
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
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
Enumeration of the distinct shuffles of permutations [PDF]
Discrete Mathematics & Theoretical Computer Science, 2009 A shuffle of two words is a word obtained by concatenating the two original words in either order and then sliding any letters from the second word back past letters of the first word, in such a way that the letters of each original word remain spelled ...
Camillia Smith Barnes
doaj +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
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
Partitioned Cacti: a Bijective Approach to the Cycle Factorization Problem [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 In this paper we construct a bijection for partitioned 3-cacti that gives raise to a new formula for enumeration of factorizations of the long cycle into three permutations with given number of cycles.
Gilles Schaeffer, Ekaterina Vassilieva
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
Determinant of binary circulant matrices
Special Matrices, 2019 This article gives a closed-form expression for the determinant of binary circulant matrices.
Hariprasad M.
doaj +1 more source