Dornstetter, J.L., Krob, D., Thibon, J.Y., Vassilieva, E.A. (2002)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Libicka, Inga, Łazarow, Ewa, Szkopińska, Bożena (2015-12-08T09:08:27Z)
Acta Universitatis Lodziensis. Folia Mathematica
Similarity:
N. K. Kundu (1974)
Annales Polonici Mathematici
Similarity:
P. Kostyrko (1972)
Colloquium Mathematicae
Similarity:
Boris Bukh (2008)
Acta Arithmetica
Similarity:
Fredricksen, Harold, Sweet, Melvin M. (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Jaskuła, Janusz, Szkopińska, Bożena (2015-12-15T14:49:03Z)
Acta Universitatis Lodziensis. Folia Mathematica
Similarity:
Mishna, Marni (2006)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
Jiří Matoušek (1989)
Colloquium Mathematicae
Similarity:
Ferenc Oravecz (2000)
Colloquium Mathematicae
Similarity:
The lattice of partitions and the sublattice of non-crossing partitions of a finite set are important objects in combinatorics. In this paper another sublattice of the partitions is investigated, which is formed by the symmetric partitions. The measure whose nth moment is given by the number of non-crossing symmetric partitions of n elements is determined explicitly to be the "symmetric" analogue of the free Poisson law.
Michael J. Evans (1974)
Colloquium Mathematicae
Similarity:
N. K. Kundu (1973)
Colloquium Mathematicae
Similarity:
Gang Yu (2005)
Colloquium Mathematicae
Similarity:
A positive integer n is called E-symmetric if there exists a positive integer m such that |m-n| = (ϕ(m),ϕ(n)), and n is called E-asymmetric if it is not E-symmetric. We show that there are infinitely many E-symmetric and E-asymmetric primes.
M. C. Chaki, K. K. Sharma (1976)
Colloquium Mathematicae
Similarity:
Popa, Sorin (1999)
Documenta Mathematica
Similarity:
Guo, Victor J.W. (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
N. C. Manna (1971)
Colloquium Mathematicae
Similarity: