Sets of parts such that the partition function is even
Ben Saïd, J.-N. Nicolas (2003)
Acta Arithmetica
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Ben Saïd, J.-N. Nicolas (2003)
Acta Arithmetica
Similarity:
W. Klonecki (1966)
Applicationes Mathematicae
Similarity:
Xiao Jun Wu, Chong-Yun Chao (2005)
Czechoslovak Mathematical Journal
Similarity:
Let be a non-empty subset of positive integers. A partition of a positive integer into is a finite nondecreasing sequence of positive integers in with repetitions allowed such that . Here we apply Pólya’s enumeration theorem to find the number of partitions of into , and the number of distinct partitions of into . We also present recursive formulas for computing and .
Ji, Kathy Qing (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
P Erdös, P. Turán (1971)
Acta Arithmetica
Similarity:
Robert Karpe (1973)
Archivum Mathematicum
Similarity:
Padmavathamma, Sudha, T.G. (1993)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Kağan Kurşungöz (2010)
Acta Arithmetica
Similarity:
Shmuel Friedland, Benjamin Weiss (2005)
Open Mathematics
Similarity:
We introduce the notion of a generalized interval exchange induced by a measurable k-partition of [0,1). can be viewed as the corresponding restriction of a nondecreasing function on ℝ with . A is called λ-dense if λ(A i∩(a, b))>0 for each i and any 0≤ a< b≤1. We show that the 2–3 Furstenberg conjecture is invalid if and only if there are 2 and 3 λ-dense partitions A and B of [0,1), such that . We give necessary and sufficient conditions for this equality to hold. We...