On the Greatest Order of an Element of the Symmetric Group

1972 ◽  
Vol 79 (5) ◽  
pp. 500-501
Author(s):  
M. B. Nathanson
1989 ◽  
Vol 53 (188) ◽  
pp. 665-665 ◽  
Author(s):  
Jean-Pierre Massias ◽  
Jean-Louis Nicolas ◽  
Guy Robin

10.37236/1823 ◽  
2004 ◽  
Vol 11 (1) ◽  
Author(s):  
John D. Dixon ◽  
Daniel Panario

The asymptotics of the order of a random permutation have been widely studied. P. Erdös and P. Turán proved that asymptotically the distribution of the logarithm of the order of an element in the symmetric group $S_{n}$ is normal with mean ${1\over2}(\log n)^{2}$ and variance ${1\over3}(\log n)^{3}$. More recently R. Stong has shown that the mean of the order is asymptotically $\exp(C\sqrt{n/\log n}+O(\sqrt{n}\log\log n/\log n))$ where $C=2.99047\ldots$. We prove similar results for the asymptotics of the degree of the splitting field of a random polynomial of degree $n$ over a finite field.


Author(s):  
Heather M Russell ◽  
Julianna Tymoczko

Abstract Webs are planar graphs with boundary that describe morphisms in a diagrammatic representation category for $\mathfrak{sl}_k$. They are studied extensively by knot theorists because braiding maps provide a categorical way to express link diagrams in terms of webs, producing quantum invariants like the well-known Jones polynomial. One important question in representation theory is to identify the relationships between different bases; coefficients in the change-of-basis matrix often describe combinatorial, algebraic, or geometric quantities (e.g., Kazhdan–Lusztig polynomials). By ”flattening” the braiding maps, webs can also be viewed as the basis elements of a symmetric group representation. In this paper, we define two new combinatorial structures for webs: band diagrams and their one-dimensional projections, shadows, which measure depths of regions inside the web. As an application, we resolve an open conjecture that the change of basis between the so-called Specht basis and web basis of this symmetric group representation is unitriangular for $\mathfrak{sl}_3$-webs ([ 33] and [ 29].) We do this using band diagrams and shadows to construct a new partial order on webs that is a refinement of the usual partial order. In fact, we prove that for $\mathfrak{sl}_2$-webs, our new partial order coincides with the tableau partial order on webs studied by the authors and others [ 12, 17, 29, 33]. We also prove that though the new partial order for $\mathfrak{sl}_3$-webs is a refinement of the previously studied tableau order, the two partial orders do not agree for $\mathfrak{sl}_3$.


1995 ◽  
Vol 46 (2) ◽  
pp. 201-234 ◽  
Author(s):  
JOANNA SCOPES
Keyword(s):  

1989 ◽  
Vol 1 (19) ◽  
pp. 3073-3082 ◽  
Author(s):  
K Slevin ◽  
E Castano ◽  
J B Pendry

2006 ◽  
Vol 38 (1) ◽  
pp. 147-155 ◽  
Author(s):  
A. Caranti ◽  
F. Dalla. Volta
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document