Combinatorial properties of the antichains of a Garland.
Combinatorial results for semigroups of order-decreasing partial transformations.
Combinatorial statistics on type-B analogues of noncrossing partitions and restricted permutations.
Combinatorics and cluster expansions.
Combinatorics of Dyadic Intervals: Consistent Colourings
We study the problem of consistent and homogeneous colourings for increasing families of dyadic intervals. We determine when this problem can be solved and when it cannot.
Combinatorics of geometrically distributed random variables: New -tangent and -secant numbers.
Combinatorics of identities involving Meixner polynomials. (Combinatoire des identités sur les polynômes de Meixner.)
Combinatorics of integer partitions in arithmetic progression.
Combinatorics of partial derivatives.
Combinatorics of the free Baxter algebra.
Combinatorics of the three-parameter PASEP partition function.
Combined algebraic properties of central* sets.
Common -transversal of finite families.
Comparison of Random S-Box Generation Methods
Complementary equations and Wythoff sequences.
Completely dissociative groupoids
In a groupoid, consider arbitrarily parenthesized expressions on the variables where each appears once and all variables appear in order of their indices. We call these expressions -ary formal products, and denote the set containing all of them by . If are distinct, the statement that and are equal for all values of is a generalized associative law. Among other results, we show that many small groupoids are completely dissociative, meaning that no generalized associative law holds...
Completion of the Wilf-classification of 3-5 pairs using generating trees.
Complexité de suites définies par des billards rationnels
Complexité et automates cellulaires linéaires
Complexité et automates cellulaires linéaires
The aim of this paper is to evaluate the growth order of the complexity function (in rectangles) for two-dimensional sequences generated by a linear cellular automaton with coefficients in , and polynomial initial condition. We prove that the complexity function is quadratic when l is a prime and that it increases with respect to the number of distinct prime factors of l.