Character polynomials, their -analogs and the Kronecker product.
Garsia, A.M., Goupil, A. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Garsia, A.M., Goupil, A. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Guo, Victor J.W., Zeng, Jiang (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Woods, Kevin (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
O'Bryant, Kevin (2003)
Integers
Similarity:
Petkovšek, Marko, Wilf, Herbert S. (1996)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Knopfmacher, Arnold, Knopfmacher, John (1989)
International Journal of Mathematics and Mathematical Sciences
Similarity:
A. Opponheim (1971)
Acta Arithmetica
Similarity:
Schneider, Carsten (2006)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
Bailey, David H., Borwein, Jonathan M., Bradley, David M. (2006)
Experimental Mathematics
Similarity:
Dominique Duval (1989)
Compositio Mathematica
Similarity:
Bruce Litow, Dmitry Konovalov (2008)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
We investigate the computational structure of the biological kinship assignment problem by abstracting away all biological details that are irrelevant to computation. The computational structure depends on phenotype space, which we formally define. We illustrate this approach by exhibiting an approximation algorithm for kinship assignment in the case of the Simpson index with a priori error bound and running time that is polynomial in the bit size of the population, but exponential in...