Enumeration in musical theory.
Enumeration of derangements with descents in prescribed positions.
Enumeration of factorizable multi-dimensional permutations.
Enumeration of permutations with restricted subsequences. (Enumération de permutations à motifs exclus.)
Enumeration of pin-permutations.
Enumeration schemes for permutations avoiding barred patterns.
Enumeration schemes for words avoiding patterns with repeated letters.
Equidistribution and sign-balance on 132-avoiding permutations.
Equidistribution and sign-balance on 321-avoiding permutations.
Equidistribution of descents, adjacent pairs, and place-value pairs on permutations.
Equitable matroids.
Euler-Mahonian parameters on colored permutation groups.
Excedance numbers for permutations in complex reflection groups.
Extended Ramsey theory for words representing rationals
Ramsey theory for words over a finite alphabet was unified in the work of Carlson, who also presented a method to extend the theory to words over an infinite alphabet, but subject to a fixed dominating principle. In the present work we establish an extension of Carlson's approach to countable ordinals and Schreier-type families developing an extended Ramsey theory for dominated words over a doubly infinite alphabet (in fact for ω-ℤ*-located words), and we apply this theory, exploiting the Budak-Işik-Pym...
Extending Hall's theorem into list colorings: a partial history.
Extensions de quelques théorèmes de densité
Extensions of -subsets to -subsets - existence versus constructability
Extrema in sequences.
Fibonacci Numbers in Permutations
Frankl’s conjecture for large semimodular and planar semimodular lattices
A lattice is said to satisfy (the lattice theoretic version of) Frankl’s conjecture if there is a join-irreducible element such that at most half of the elements of satisfy . Frankl’s conjecture, also called as union-closed sets conjecture, is well-known in combinatorics, and it is equivalent to the statement that every finite lattice satisfies Frankl’s conjecture. Let denote the number of nonzero join-irreducible elements of . It is well-known that consists of at most elements....