Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Katriel, Jacob
1993.
Products of class‐sums of the symmetric group: Generalizing the recurrence relations.
International Journal of Quantum Chemistry,
Vol. 47,
Issue. 4,
p.
243.
Goulden, I. P.
1994.
A differential operator for symmetric functions and the combinatorics of multiplying transpositions.
Transactions of the American Mathematical Society,
Vol. 344,
Issue. 1,
p.
421.
Goupil, Alain
1995.
Reflection decompositions in the classical Weyl groups.
Discrete Mathematics,
Vol. 137,
Issue. 1-3,
p.
195.
Labelle, Gilbert
and
Leroux, Pierre
1996.
Enumeration of (uni- or bicolored) plane trees according to their degree distribution.
Discrete Mathematics,
Vol. 157,
Issue. 1-3,
p.
227.
Engebretsen, Lars
Holmerin, Jonas
and
Russell, Alexander
2002.
Automata, Languages and Programming.
Vol. 2380,
Issue. ,
p.
73.
Engebretsen, Lars
Holmerin, Jonas
and
Russell, Alexander
2004.
Inapproximability results for equations over finite groups.
Theoretical Computer Science,
Vol. 312,
Issue. 1,
p.
17.
Adan-Bante, Edith
and
Verrill, Helena
2008.
Symmetric groups and conjugacy classes.
Journal of Group Theory,
Vol. 11,
Issue. 3,
Chen, WenBin
Yin, Dengpan
and
Chen, Zhengzhang
2010.
Inapproximability results for equations over infinite groups.
Theoretical Computer Science,
Vol. 411,
Issue. 26-28,
p.
2513.
Féray, Valentin
and
Goulden, I.P.
2013.
A multivariate hook formula for labelled trees.
Journal of Combinatorial Theory, Series A,
Vol. 120,
Issue. 4,
p.
944.
Diaconis, Persi
Evans, Steven N.
and
Graham, Ron
2014.
Unseparated pairs and fixed points in random permutations.
Advances in Applied Mathematics,
Vol. 61,
Issue. ,
p.
102.
Vassilieva, Ekaterina A.
2015.
Polynomial properties of Jack connection coefficients and generalization of a result by Dénes.
Journal of Algebraic Combinatorics,
Vol. 42,
Issue. 1,
p.
51.
Vassilieva, Ekaterina
2015.
Moments of normally distributed random matrices given by generating series for connection coefficients— Explicit algebraic computation.
Discrete Mathematics,
Vol. 338,
Issue. 9,
p.
1603.
Berkolaiko, G.
and
Irving, J.
2016.
Inequivalent factorizations of permutations.
Journal of Combinatorial Theory, Series A,
Vol. 140,
Issue. ,
p.
1.
Vassilieva, Ekaterina
2017.
Moments of Normally Distributed Random Matrices Given by Generating Series for Connection Coefficients — Explicit Bijective Computation.
Annals of Combinatorics,
Vol. 21,
Issue. 3,
p.
445.
Li, Songyuan
and
Troost, Jan
2020.
The topological symmetric orbifold.
Journal of High Energy Physics,
Vol. 2020,
Issue. 10,
Chen, Ricky X. F.
2023.
On products of permutations with the most uncontaminated cycles by designated labels.
Journal of Algebraic Combinatorics,
Vol. 57,
Issue. 4,
p.
1163.
Ben Dali, Houcine
2023.
Integrality in the Matching-Jack conjecture and the Farahat-Higman algebra.
Transactions of the American Mathematical Society,
Vol. 376,
Issue. 5,
p.
3641.