-color partition theoretic interpretations of some mock theta functions.
-color partitions with weighted differences equal to minus two.
-words over any alphabet with forbidden any 3-subwords.
-words over any alphabet without subword for fixed , and .
Necklace bisection with one cut less than needed.
Několik kapitol z nauky o číslech
Některé relace mezi kombinačními čísly
Netted matrices.
New adventures in the land of -analogues (Yang-Baxter equations). (Nouvelles aventures au pays des -analogues (équation de Yang-Baxter).)
New bounds for union-free families of sets.
New bounds on the number of representation of as a binomial coefficient.
New directions in enumerative chess problems.
New Euler-Mahonian permutation statistics.
New infinite families of Ramanujan-type congruences modulo 9 for overpartition pairs
Let denote the number of overpartition pairs of n. Bringmann and Lovejoy (2008) proved that for n ≥ 0, . They also proved that there are infinitely many Ramanujan-type congruences modulo every power of odd primes for . Recently, Chen and Lin (2012) established some Ramanujan-type identities and explicit congruences for . Furthermore, they also constructed infinite families of congruences for modulo 3 and 5, and two congruence relations modulo 9. In this paper, we prove several new infinite...
New lower bound on the number of ternary square-free words.
Nim restrictions.
Nim with a modular Muller twist.
Nombre de factorisations d'un grand cycle (Number of factorizations of a large cycle).
Nombres de Bell et analyse -adique
Nonadaptive search problem with sets of equal sum
Consider the set A={1,2,3,…,2n}, n≥3 and let x∈ A be unknown element. For given natural number S we are allowed to ask whether x belongs to a subset B of A such that the sum of the elements of B equals S. We investigate for which S it is possible to find x using a nonadaptive search.