EuDML | Browse

Loading [MathJax]/extensions/MathZoom.js

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Subjects
05-XX Combinatorics
05Axx Enumerative combinatorics

Items

All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Page 1 Next

Displaying 1 – 20 of 50

$n$ -color partition theoretic interpretations of some mock theta functions.

Agarwal, A.K. (2004)

The Electronic Journal of Combinatorics [electronic only]

$n$ -color partitions with weighted differences equal to minus two.

Agarwal, A.K., Balasubrananian, R. (1997)

International Journal of Mathematics and Mathematical Sciences

$n$ -words over any alphabet with forbidden any 3-subwords.

Doroslovački, Rade, Marković, Olivera (2000)

Novi Sad Journal of Mathematics

$n$ -words over any alphabet without subword $a \underset{k - 1}{\underset{︸}{b \dots b}} a$ for fixed $a$ , $b$ and $k$ .

Doroslovački, Rade, Marković, Olivera (2000)

Novi Sad Journal of Mathematics

Necklace bisection with one cut less than needed.

Simonyi, Gábor (2008)

The Electronic Journal of Combinatorics [electronic only]

Několik kapitol z nauky o číslech

Emil Schönbaum (1905)

Časopis pro pěstování mathematiky a fysiky

Některé relace mezi kombinačními čísly $p (n)$

Robert Karpe (1969)

Časopis pro pěstování matematiky

Netted matrices.

Stănică, Pantelimon (2003)

International Journal of Mathematics and Mathematical Sciences

New adventures in the land of $q$ -analogues (Yang-Baxter equations). (Nouvelles aventures au pays des $q$ -analogues (équation de Yang-Baxter).)

Cartier, Pierre (1990)

Séminaire Lotharingien de Combinatoire [electronic only]

New bounds for union-free families of sets.

Coppersmith, Don, Shearer, James B. (1998)

The Electronic Journal of Combinatorics [electronic only]

New bounds on the number of representation of $t$ as a binomial coefficient.

Kane, Daniel (2004)

Integers

New directions in enumerative chess problems.

Elkies, Noam D. (2005)

The Electronic Journal of Combinatorics [electronic only]

New Euler-Mahonian permutation statistics.

Clarke, Robert J., Steingrimsson, Einar, Zeng, Jiang (1995)

Séminaire Lotharingien de Combinatoire [electronic only]

New infinite families of Ramanujan-type congruences modulo 9 for overpartition pairs

Ernest X. W. Xia (2015)

Colloquium Mathematicae

Let $\bar{p p} (n)$ denote the number of overpartition pairs of n. Bringmann and Lovejoy (2008) proved that for n ≥ 0, $\bar{p p} (3 n + 2) \equiv 0 (m o d 3)$ . They also proved that there are infinitely many Ramanujan-type congruences modulo every power of odd primes for $\bar{p p} (n)$ . Recently, Chen and Lin (2012) established some Ramanujan-type identities and explicit congruences for $\bar{p p} (n)$ . Furthermore, they also constructed infinite families of congruences for $\bar{p p} (n)$ 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.

Sun, Xinyu (2003)

Journal of Integer Sequences [electronic only]

Nim restrictions.

Albert, M.H., Nowakowski, R.J. (2004)

Integers

Nim with a modular Muller twist.

Gavel, Hillevi, Strimling, Pontus (2004)

Integers

Nombre de factorisations d'un grand cycle (Number of factorizations of a large cycle).

Biane, Philippe (2004)

Séminaire Lotharingien de Combinatoire [electronic only]

Nombres de Bell et analyse $p$ -adique

Daniel Barsky (1975/1976)

Groupe de travail d'analyse ultramétrique

Nonadaptive search problem with sets of equal sum

Emil Kolev (2003)

Open Mathematics

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.

Currently displaying 1 – 20 of 50

Page 1 Next