TRANSITIVE FACTORISATIONS INTO TRANSPOSITIONS AND HOLOMORPHIC MAPPINGS ON THE SPHERE
|
|
- Brett Lloyd
- 5 years ago
- Views:
Transcription
1 PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 25, Number, January 997, Pages 5 60 S )03880-X TRANSITIVE FACTORISATIONS INTO TRANSPOSITIONS AND HOLOMORPHIC MAPPINGS ON THE SPHERE I. P. GOULDEN AND D. M. JACKSON Communicated by Jeffry N. Kahn) Abstract. We determine the number of ordered factorisations of an arbitrary permutation on n symbols into transpositions such that the factorisations have minimal length and such that the factors generate the full symmetric group on n symbols. Such factorisations of the identity permutation have been considered by Crescimanno and Taylor in connection with a class of topologically distinct holomorphic maps on the sphere. As with Macdonald s construction for symmetric functions that multiply as the classes of the class algebra, essential use is made of Lagrange inversion.. Introduction Let C α be the conjugacy class of the symmetric group S n on n symbols, indexed by the partition α of n, for n, denoted by α n, and let h α bethesizeofthis conjugacy class. Let K α be the sum in CS n of all elements of C α,forα n. The number of parts of α is denoted by lα). The coefficient of K α in the product K β K γ,forα, β, γ n, is called the connection coefficient in the class algebra of S n. Up to a constant depending on h α,h β and h γ, it is the number of ordered factorisations σ,σ 2 )ofπ C α with factors σ,σ 2 in C β and C γ, respectively. If the condition n lα)) n lβ)) + n lγ)) fails, then the connection coefficient is zero. Such factorisations arise in a number of topological contexts, such as the determination of the Euler characteristic for the moduli space of curves [5, 8] and, more generally, the enumeration of two-cell embeddings [9]. In general, the connection coefficient can be expressed as a character sum, and this has been exploited see, e.g. [9, 0]) to address combinatorial questions that can be expressed in terms of certain connection coefficients. However, the determination of this character sum is difficult in most instances, so other approaches to connection coefficients are desirable. One such approach is given in [6], to evaluate the connection coefficient in the case that n lα)) = n lβ)) + n lγ)). These are called top coefficients, since partitions related by this equality are on the boundary of the region where the coefficient is zero. A construction in [6] Received by the editors July 20, Mathematics Subject Classification. Primary 05A5; Secondary 05E99, 58C0, 70H20. 5 c 997 American Mathematical Society
2 52 I. P. GOULDEN AND D. M. JACKSON uses the compositional inverse of the generating series for the complete symmetric functions to produce a basis for symmetric functions whose connection coefficients in the ring of symmetric functions are precisely the top connection coefficients, after reindexing. The results obtained thus require the use of Lagrange inversion in a fundamental way, to carry out this compositional inversion. The combinatorial setting for this is embeddings of vertex 2-coloured trees in the sphere, a setting that is suggestive of constructions for other connection coefficients that are close to top. Recently, an interesting new group theoretic restriction on factorisations, arising from another topological context, has been encountered by Crescimanno and Taylor []. Their work involves ordered factorisations of the identitity permutation into 2n 2 transpositions, with the additional condition that the factors generate S n. They obtain the surprising result that the number of such factorisations is 2n 2)!n n 3. Their interest in this problem arose from the fact that it equals n! times the number of topologically distinct holomorphic maps from S 2 to S 2 with 2n 2elementary branch point singularities whose images are fixed. It is readily seen that 2n 2 is the minimal number of transpositions whose product can equal the identity under the restriction that the transpositions generate S n. We can state the analogous question for an arbitrary permutation in the following way: Let c α be the number of j-tuples of permutations σ,...,σ j )such that, for an arbitrary but fixed π C α, a) π = σ σ j, b) σ,...,σ j C [2 n 2 ], c) σ,...,σ j generate S n, d) j is minimal, subject to a), b), c). We call σ,...,σ j )aminimal, transitive, ordered factorisation of π into transpositions. In this notation, Crescimanno and Taylor showed that c [ n ] =2n 2)!n n 3.) It is shown in Section 2 that the minimal choice of j in condition d) is j = µα), where ) µα) =n+lα) 2. Note that, in the case that π C [n], condition c) is forced by condition a), so this problem is simply the top problem solved in [6]; in particular Dénes [2] first showed that c [n] = n n 2. The main result of this paper is the following generalisation of Crescimanno and Taylor s and Dénes results, giving an explicit expression for c α when α is arbitrary. Theorem.. Let α =α,α 2,...,α k ) n,forn, k. Then k c α = n k 3 α αj j n + k 2)! α j )!. Our method is to determine a differential equation that a generating series for c α satisfies. This is given in Section 2. In Section 3 we prove that the corresponding series for the numbers given in Theorem. also satisfies the equation, and check initial conditions so this is unique. This latter series is manipulated in terms of two functional equations by Lagrange inversion, which seems essential to provide tractable expressions for the quantities required. However, we have not found the analogous construction to that for top coefficients, in which a compositional inverse j=
3 TRANSITIVE FACTORISATIONS INTO TRANSPOSITIONS 53 was an essential part of the construction from the outset. A character theoretic expression for c α is given in Section 4, although we have not been able to deduce Theorem. from this expression. 2. A combinatorial construction We begin with an analysis of multiplication by a transposition. For π S n let κπ) denote the number of cycles in the disjoint cycle representation of) π, andlet σbe the transposition a, b). We now consider separately two cases for the product πσ. Ifaand b are on different cycles of π, then the cycles of π containing elements a and b are joined together in πσ, soκπσ) =κπ), and in this case we call σ a join for π. If a and b are on the same cycle of π, then the cycle of π containing a and b is cut into two cycles in πσ, one containing a and the other containing b, so κπσ) = κπ) +, and in this second case we call σ a cut for π. Now suppose that σ,...,σ j ) is an ordered factorisation of π into transpositions i.e., it satisfies conditions a) and b) above, but not necessarily c) or d)), and that r of the transpositions are joins and s are cuts as they are multiplied together from left to right). Then by induction, starting with the identity permutation having n cycles, and using the relationships for κ in the two cases above, we have 2) κπ) =n r+s. Proposition 2.. If α =α,α 2,...) n,forn,thenµα)=n+lα) 2. Proof. Suppose σ,...,σ j ) is a transitive, ordered factorisation of π C α into transpositions i.e., it satisfies conditions a), b), c) above, but not necessarily d)). Let Gσ,...,σ j ) be the graph on vertices labelled {,...,n}, and edges labelled {,...,j} in which the edge labelled i joins the vertices interchanged by the transposition σ i,fori=,...,j. Condition c) means that G = Gσ,...,σ j ) is connected. Let T be the spanning tree of G formed by, for i =,...,j, selecting the edge labelled i for T if and only if it joins vertices in two different components of Gσ,...,σ i ) this is Kruskal s algorithm with the edges ordered by their labels). Now T contains n edges,all of whose corresponding transpositions must be joins, by construction. Of the edges of G that are not in T, suppose that g are joins and h are cuts. Then from 2) we obtain κπ) =n n +g)+h. But the number of edges of G is n +g+h, and κπ) =lα), so j = n +g+h=n+lα) 2+2g n+lα) 2, with equality when g = 0 and thus h = lα) ). This can be achievedfor any α by, for instance, choosing the first n edgesofgas the edges of any tree on vertices,...,n, in any order so these are all joins); thus we will have σ σ n C [n]. Then choose h = lα) edges to cut this cycle successively into cycles of lengths α,α 2,...,sowehaveσ σ n+lα) 2 C α.anyrequiredπ C α can be obtained in this way by suitably relabelling the vertices of G. The analysis above can be extended to determine the cycle distribution of permutations in the product πk [2 n 2 ] by means of a differential operator as follows. Let p =p,p 2,...) be indeterminates, and p λ = p λ p λ2,forλ=λ,λ 2,...), a partition. If τπ) n is the partition listing the lengths of the cycles of π, andwe
4 54 I. P. GOULDEN AND D. M. JACKSON define Φπ) =p τπ), extended linearly to the whole of CS n, then, as is considered in [4], ΦπK [2 n 2 ])= 2 J+C)Φπ), where J = 2 p i+j ij, C = p i p j i + j). p i p j p i+j i,j i,j The first operator J gives the contribution from the transpositions that are joins for π; the summand corresponding to i and j joins together an i-cycle and a j-cycle. The second operator C gives the contribution from the transpositions that are cuts for π; the summand corresponding to i and j cuts an i + j-cycle into an i-cycle and a j-cycle. In the case that p i is regarded as the i-th power sum symmetric function, then J and C are mutually adjoint operators on the ring of symmetric functions, equipped with the usual inner product.) We now use this combinatorial apparatus to determine an equation for the required numbers c α. Lemma 2.2. The generating series F = n satisfies the differential equation 3) where LF )= 2 i,j α n c α z n n! LF )=0, p i+j i F j F +i+j)p i p j p i p j h α µα)! p α F p i+j ) z F z F p i +2F. p i Proof. Let F be the generating series for minimal, transitive, ordered factorisations σ,...,σ j ) of permutations π in n S n, in which p i is an ordinary marker for cycles of length i in π, for i, and, in the terminology of the proof of Proposition 2., z is an exponential marker for the vertices in G, and u is an exponential marker for the edges in G. Thus F= z n u µα) c α n! µα)! hα p α = z n u µα) c α n! µα)! ΦK α). n α n n α n Consider a minimal, transitive, ordered factorisation σ,...,σ j )ofπ S n into transpositions. Suppose we remove the edge of largest label corresponding to transposition σ j )fromg, without changing π. This modifies the generating series to become F u. This may be determined in another way, by considering two cases for σ j. If σ j corresponds to a non-tree edge, then it is a cut, and thus σ,...,σ j )isa minimal, transitive, ordered factorisation in S n, so the contribution to the modified generating series from this case is C F. Otherwise, if σ j corresponds to a tree edge, then it is a join consisting of vertices from each of the exactly two components in Gσ,...,σ j ), and each of these
5 TRANSITIVE FACTORISATIONS INTO TRANSPOSITIONS 55 components corresponds to a minimal, transitive, ordered factorisation in the symmetric group on its vertex set. Thus the contribution to the modified generating series from this case is 2 p i+j i F ) ) j F, p i p j i,j using the multiplication rule for exponential generating series, with both vertices and edges labelled, since we are joining cycles in the two components. Thus F satisfies the differential equation 4) 2 i,j p i+j i F p i j F p j +i+j)p i p j F p i+j ) = F u. But F evaluated at u =isf,and F = z F u z + F p i 2F, p i u= so this differential equation can be rewritten in terms of F, giving the result. 3. Proof of the main result In this section we establish Theorem. by proving that G = n lα) 3 α αj j h α z n 5) p α α j )! n! n α n j is the unique choice for the series F considered in the previous section. Our proof consists of a verification that G satisfies the differential equation z zlg) =0, which F also satisfies, by Lemma 2.2. Uniqueness is then established via initial conditions. Two technical results are needed for this verification. Both use Lagrange s Implicit Function Theorem [7], Section.2) in an essential way. The first of these technical results concerns the functional equation s = z exp i i 6) p is i, and expresses each term that arises in z zlg) in terms of the unique solution s sz,p) to this equation. Proposition z G z = z ) 2 G = i i z p is i, i i p i s i i i 2 2 p is i,
6 56 I. P. GOULDEN AND D. M. JACKSON z 2 G = kk s k, for k, z p k k! G = kk 2 s k kk p k k! k! i i+ s k+i p i, for k. k + i Proof.. From 5), with [A]B denoting the coefficient of A in B, we have G = n 3 zn [λ n ]exp n i i p iλ i. n Then Lagrange s Theorem applied to 6) gives 7) G = n n 2 zn n [λn ] exp n i i λ p iλ i = s ) n 2 zn [z ]log n, z n and the result follows immediately. 2. Differentiating 6) partially with respect to z, and solving for s z,weobtain z s z = s i i+ 8) p i s i. But part of this proposition gives z G z z = i i 0 z p is i dz = z 0 i i p is i from 8). Now change the variable of integration to s, giving z G s z = i i 0 p is i i i+ p i s i ds, i i+ p i s i s z dz and the result follows. 3. Differentiating 6) partially with respect to p k and solving for s p k,wehave, for k, s = kk p k k! sk+ i i+ p i s i. Comparing this expression with 8), we obtain s p k = kk k! sk z s z.
7 TRANSITIVE FACTORISATIONS INTO TRANSPOSITIONS 57 Thus, from 7), z 2 G = z p k n zn [z n ] s n = n n zn [z n ] z and the result follows. 4. Part 3 of this proposition gives G z = kk p k k! 0 s k kk dz = z k! s = p k n zn [z n ] kk k! n ) k k s k, k! s s k 0 i i+ sk s z p i s i ds, from 8), changing the variable of integration to s. The result follows. The second of these technical results concerns the functional equation w = ze w, and the evaluation of two Abel-type summations that arise in our verification. The first of these results is straightforward, but the second seems more difficult and, as far as we can tell, is new. Proposition For m,lets m = i,j i+j=m i i j j j!. Then 2. For k, m, lett k,m = kk+ k! S m = mm m!,j 0 i+j=m T k,m + T m,k = Proof.. By Lagrange s Theorem, mm. m! i i j j j! k+j. Then k + m)k+m. k + m)! 9) w = i i z i and w w = z dw dz = i i zi. Thus, for m, ) S m =[z m w w ] w w=[zm ] w w, and the result follows from 9). 2. Let u = wx) andv=wy)forwgiven above, so u = xe u and v = ye v.then Tx, y) = T k,m x k y m = k k+ x k i i k! yi j j y j j! j + k k,m k j 0 = k k k+ x k k! v v y k y 0 y k v dy,
8 58 I. P. GOULDEN AND D. M. JACKSON from 9). But, from 9) and using the functional equation for v to change the variable of integration, we obtain y y k v kv 0 v dy = v k e kv dv = k k t k e t dt 0 0 ) ) = k! k k k+ e kv k k i k i)! vk i = k! k k k+ y k k k i k i)! v i. i= i= This gives T x, y) = v x ) ) k k x k k k i v y k i)! v i k i= = v x v y x ) x k [λ k ] e kλ λ = v x v λ v y x u ), v u u k by Lagrange s Theorem. Then T x, y)+ty, x) = xv y x v yu ) = l l xy l yx l u l! y x, l from 9). But T k,m + T m,k =[x k y m ]Tx, y)+ty, x)), and the result follows. We can now proceed with our verification that establishes the main result. Proof of Theorem.. Applying z z to LG), substituting for the terms that arise using Proposition 3., and collecting terms, we obtain z z LG)= ) S m mm + mm p m s m 2m) 2m ) + m! m! 2 T m,m p 2 m 2m)! s2m m + ) k + m) k+m T k,m T m,k p k p m s k+m = 0 k + m)! k,m k m from Proposition 3.2. But, for all monomials in F, the exponent of z equals the total degree in p, andf is the unique series in z and p of this type whose constant term is 0, and whose term of degree in z is zp.butgis of this type, with these initial conditions, so G must be the unique solution to z zlg) = 0 and hence LG) = 0, and the result follows. 4. Concluding remarks We conclude with some observations of a more general nature, and points that deserve further consideration. The product over parts of the partition given in the main result is reminiscent of an expression in [3] Theorem 2.3, p. 42), as has been pointed out to us by Richard Stanley, but it is unclear whether this is a coincidence, or whether it has greater significance. Differential equations similar to 4) can be derived for the analogous problem in which the factors are from any fixed conjugacy class, although we have not been
9 TRANSITIVE FACTORISATIONS INTO TRANSPOSITIONS 59 able to obtain explicit solutions in any case except the class of transpositions. Such equations are special cases of the general family S S t = H, S ) ),...,p,t p p 2 of first order partial differential equations, where H is an arbitrary function. This is called a Hamilton-Jacobi equation, and is developed by a variational argument. Thus the minimal transitive ordered factorisations of permutations into transpositions provides a combinatorial model for one equation in this family. We can also give a character expression for c α, using a series with an extra variable u, whose exponent marks the number of factors in a transitive, ordered factorisation that is not necessarily minimal. Let θ = θ, θ 2,...) denote the conjugate of the partition θ =θ,θ 2,...). Let χ θ be the character of the ordinary irreducible representation of S n indexed by θ n, andletχ θ α be the value of this character at any element of the conjugacy class C α. The degree of the irreducible representation indexed by θ is f θ. Then, using an exponential generating function argument for connected graphs, in the context of the proof of Proposition 2., it is readily shown that u c α = [p µα) z n ] α log z m f θ s θ e uηθ), µα)! n! m! m 0 θ m where s θ is the Schur symmetric function indexed by θ, and see [0] and [], p. 64) ) n ηθ) = 2 f θχθ [2 n 2 ] = ) θi ) θi. 2 2 Numerical computation with this expression led us to conjecture the main result in the first place, though we have been unable to use it as the basis of a proof. Finally, we note in passing that ηθ) arises in the approach of Crescimanno and Taylor [] in connection with a Casimir operator arising from a sum over representations. Acknowledgements This work was supported by grants from the Natural Sciences and Engineering Research Council of Canada. References [] M.Crescimanno and W.Taylor, Large N phases of chiral QCD 2, Nuclear Phys. B ), MR 96g:8223 [2] J.Dénes, The representation of a permutation as the product of a minimal number of transpositions and its connection with the theory of graphs, Publ. Math. Inst. Hungar. Acad. Sci ), MR 22:6733 [3] I.M.Gel fand, M.M.Kapranov and A.V.Zelevinsky, Discriminants, Resultants, and Multidimensional Determinants, Contemporary Math., Birkhäuser, Boston, 994. MR 95e:4045 [4] I.P.Goulden, A differential operator for symmetric functions and the combinatorics of multiplying transpositions, Trans. Amer. Math. Soc ), MR 95c:2009 [5] I.P.Goulden, J. L. Harer and D.M.Jackson, The virtual Euler characteristic of the moduli spaces of real and complex algebraic curves preprint). [6] I.P.Goulden and D.M.Jackson, Symmetric functions and Macdonald s result for top connexion coefficients in the symmetric group, J. Algebra ), MR 95j:0570
10 60 I. P. GOULDEN AND D. M. JACKSON [7] I.P.Goulden and D.M.Jackson, Combinatorial Enumeration, Wiley Interscience, New York, 983. MR 84m:05002 [8] J. Harer and D. Zagier, The Euler characteristic of the moduli space of curves, Invent. Math ), MR 87i:3203 [9] D.M.Jackson, Counting cycles in permutations by group characters, with an application to a topological problem, Trans. Amer. Math. Soc ), MR 88c:050 [0] D.M.Jackson, Some combinatorial problems associated with products of conjugacy clases of the symmetric group, J. Combin. Theory Ser. A ), MR 89k:05009 [] I.G.Macdonald, Symmetric functions and Hall polynomials, Clarendon Press, Oxford, 98. MR 84g:05003 Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario, Canada N2L 3G address: ipgoulden@math.uwaterloo.ca address: dmjackson@dragon.uwaterloo.ca
Transitive Factorizations in the Symmetric Group, and Combinatorial Aspects of Singularity Theory
Europ. J. Combinatorics 000, 00 06 Article No. 0.006/eujc.000.0409 Available online at http://www.idealibrary.com on Transitive Factorizations in the Symmetric Group, and Combinatorial Aspects of Singularity
More informationAdjoint Representations of the Symmetric Group
Adjoint Representations of the Symmetric Group Mahir Bilen Can 1 and Miles Jones 2 1 mahirbilencan@gmail.com 2 mej016@ucsd.edu Abstract We study the restriction to the symmetric group, S n of the adjoint
More informationA Blossoming Algorithm for Tree Volumes of Composite Digraphs
A Blossoming Algorithm for Tree Volumes of Composite Digraphs Victor J. W. Guo Center for Combinatorics, LPMC, Nankai University, Tianjin 30007, People s Republic of China Email: jwguo@eyou.com Abstract.
More informationA Conjectured Combinatorial Interpretation of the Normalized Irreducible Character Values of the Symmetric Group
A Conjectured Combinatorial Interpretation of the Normalized Irreducible Character Values of the Symmetric Group Richard P. Stanley Department of Mathematics, Massachusetts Institute of Technology Cambridge,
More informationRadon Transforms and the Finite General Linear Groups
Claremont Colleges Scholarship @ Claremont All HMC Faculty Publications and Research HMC Faculty Scholarship 1-1-2004 Radon Transforms and the Finite General Linear Groups Michael E. Orrison Harvey Mudd
More informationQuadratic Forms of Skew Schur Functions
Europ. J. Combinatorics (1988) 9, 161-168 Quadratic Forms of Skew Schur Functions. P. GOULDEN A quadratic identity for skew Schur functions is proved combinatorially by means of a nonintersecting path
More informationA Characterization of (3+1)-Free Posets
Journal of Combinatorial Theory, Series A 93, 231241 (2001) doi:10.1006jcta.2000.3075, available online at http:www.idealibrary.com on A Characterization of (3+1)-Free Posets Mark Skandera Department of
More informationREPRESENTATION THEORY OF S n
REPRESENTATION THEORY OF S n EVAN JENKINS Abstract. These are notes from three lectures given in MATH 26700, Introduction to Representation Theory of Finite Groups, at the University of Chicago in November
More informationREMARKS ON THE PAPER SKEW PIERI RULES FOR HALL LITTLEWOOD FUNCTIONS BY KONVALINKA AND LAUVE
REMARKS ON THE PAPER SKEW PIERI RULES FOR HALL LITTLEWOOD FUNCTIONS BY KONVALINKA AND LAUVE S OLE WARNAAR Abstract In a recent paper Konvalinka and Lauve proved several skew Pieri rules for Hall Littlewood
More informationThe chromatic symmetric function of almost complete graphs
The chromatic symmetric function of almost complete graphs Gus Wiseman Department of Mathematics, University of California, One Shields Ave., Davis, CA 95616 Email: gus@nafindix.com Faculty Sponsor: Anne
More information#A69 INTEGERS 13 (2013) OPTIMAL PRIMITIVE SETS WITH RESTRICTED PRIMES
#A69 INTEGERS 3 (203) OPTIMAL PRIMITIVE SETS WITH RESTRICTED PRIMES William D. Banks Department of Mathematics, University of Missouri, Columbia, Missouri bankswd@missouri.edu Greg Martin Department of
More informationThe cycle polynomial of a permutation group
The cycle polynomial of a permutation group Peter J. Cameron School of Mathematics and Statistics University of St Andrews North Haugh St Andrews, Fife, U.K. pjc0@st-andrews.ac.uk Jason Semeraro Department
More informationA quasisymmetric function generalization of the chromatic symmetric function
A quasisymmetric function generalization of the chromatic symmetric function Brandon Humpert University of Kansas Lawrence, KS bhumpert@math.ku.edu Submitted: May 5, 2010; Accepted: Feb 3, 2011; Published:
More informationarxiv: v1 [math.rt] 5 Aug 2016
AN ALGEBRAIC FORMULA FOR THE KOSTKA-FOULKES POLYNOMIALS arxiv:1608.01775v1 [math.rt] 5 Aug 2016 TIMOTHEE W. BRYAN, NAIHUAN JING Abstract. An algebraic formula for the Kostka-Foukles polynomials is given
More informationCOUNTING COVERS OF AN ELLIPTIC CURVE
COUNTING COVERS OF AN ELLIPTIC CURVE ABSTRACT. This note is an exposition of part of Dijkgraaf s article [Dij] on counting covers of elliptic curves and their connection with modular forms. CONTENTS 0.
More informationTutte Polynomials of Bracelets. Norman Biggs
Tutte Polynomials of Bracelets Norman Biggs Department of Mathematics London School of Economics Houghton Street London WC2A 2AE U.K. n.l.biggs@lse.ac.uk January 2009 CDAM Research Reports Series LSE-CDAM
More informationSOME DESIGNS AND CODES FROM L 2 (q) Communicated by Alireza Abdollahi
Transactions on Combinatorics ISSN (print): 2251-8657, ISSN (on-line): 2251-8665 Vol. 3 No. 1 (2014), pp. 15-28. c 2014 University of Isfahan www.combinatorics.ir www.ui.ac.ir SOME DESIGNS AND CODES FROM
More informationTransitive cycle factorizations and prime parking functions
Transitive cycle factorizations and prime parking functions Dongsu Kim Department of Mathematics KAIST, Daejeon 0-0, Korea dskim@math.kaist.ac.kr and Seunghyun Seo Department of Mathematics KAIST, Daejeon
More informationAppendix to: Generalized Stability of Kronecker Coefficients. John R. Stembridge. 14 August 2014
Appendix to: Generalized Stability of Kronecker Coefficients John R. Stembridge 14 August 2014 Contents A. Line reduction B. Complementation C. On rectangles D. Kronecker coefficients and Gaussian coefficients
More informationOn Systems of Diagonal Forms II
On Systems of Diagonal Forms II Michael P Knapp 1 Introduction In a recent paper [8], we considered the system F of homogeneous additive forms F 1 (x) = a 11 x k 1 1 + + a 1s x k 1 s F R (x) = a R1 x k
More informationMonotone Hurwitz Numbers in Genus Zero
Canad. J. Math. Vol. 65 5, 203 pp. 020 042 http://dx.doi.org/0.453/cjm-202-038-0 c Canadian Mathematical Society 202 Monotone Hurwitz Numbers in Genus Zero I. P. Goulden, Mathieu Guay-Paquet, and Jonathan
More informationTHE Q-SPECTRUM AND SPANNING TREES OF TENSOR PRODUCTS OF BIPARTITE GRAPHS
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 125, Number 11, November 1997, Pages 3155 3161 S 0002-9939(9704049-5 THE Q-SPECTRUM AND SPANNING TREES OF TENSOR PRODUCTS OF BIPARTITE GRAPHS TIMOTHY
More informationOn the adjacency matrix of a block graph
On the adjacency matrix of a block graph R. B. Bapat Stat-Math Unit Indian Statistical Institute, Delhi 7-SJSS Marg, New Delhi 110 016, India. email: rbb@isid.ac.in Souvik Roy Economics and Planning Unit
More informationMultiplicity Free Expansions of Schur P-Functions
Annals of Combinatorics 11 (2007) 69-77 0218-0006/07/010069-9 DOI 10.1007/s00026-007-0306-1 c Birkhäuser Verlag, Basel, 2007 Annals of Combinatorics Multiplicity Free Expansions of Schur P-Functions Kristin
More informationTHE NUMBER OF INDEPENDENT DOMINATING SETS OF LABELED TREES. Changwoo Lee. 1. Introduction
Commun. Korean Math. Soc. 18 (2003), No. 1, pp. 181 192 THE NUMBER OF INDEPENDENT DOMINATING SETS OF LABELED TREES Changwoo Lee Abstract. We count the numbers of independent dominating sets of rooted labeled
More informationUnitary Matrix Integrals, Primitive Factorizations, and Jucys-Murphy Elements
FPSAC 2010, San Francisco, USA DMTCS proc. AN, 2010, 271 280 Unitary Matrix Integrals, Primitive Factorizations, and Jucys-Murphy Elements Sho Matsumoto 1 and Jonathan Novak 2,3 1 Graduate School of Mathematics,
More informationThe map asymptotics constant t g
The map asymptotics constant t g Edward A. Bender Department of Mathematics University of California, San Diego La Jolla, CA 92093-02 ebender@ucsd.edu Zhicheng Gao School of Mathematics and Statistics
More informationBounds for pairs in partitions of graphs
Bounds for pairs in partitions of graphs Jie Ma Xingxing Yu School of Mathematics Georgia Institute of Technology Atlanta, GA 30332-0160, USA Abstract In this paper we study the following problem of Bollobás
More informationLogarithmic functional and reciprocity laws
Contemporary Mathematics Volume 00, 1997 Logarithmic functional and reciprocity laws Askold Khovanskii Abstract. In this paper, we give a short survey of results related to the reciprocity laws over the
More informationThe moduli space of binary quintics
The moduli space of binary quintics A.A.du Plessis and C.T.C.Wall November 10, 2005 1 Invariant theory From classical invariant theory (we refer to the version in [2]), we find that the ring of (SL 2 )invariants
More informationOn the number of matchings of a tree.
On the number of matchings of a tree. Stephan G. Wagner Department of Mathematics, Graz University of Technology, Steyrergasse 30, A-800 Graz, Austria Abstract In a paper of Klazar, several counting examples
More informationMinimal Paths and Cycles in Set Systems
Minimal Paths and Cycles in Set Systems Dhruv Mubayi Jacques Verstraëte July 9, 006 Abstract A minimal k-cycle is a family of sets A 0,..., A k 1 for which A i A j if and only if i = j or i and j are consecutive
More informationLatin squares: Equivalents and equivalence
Latin squares: Equivalents and equivalence 1 Introduction This essay describes some mathematical structures equivalent to Latin squares and some notions of equivalence of such structures. According to
More information,,>=o a,x"/nl, called the exponential generating function for {a, In->_0}, is said to be
SIAM J. ALG. DISC. METH. Vol. 7, No. 1, January 1986 1986 Society for Industrial and Applied Mathematics 0O7 LABELLED GRAPHS WITH SMALL VERTEX DEGREES AND P-RECURSIVENESS* I. P. GOULDENf AND D. M. JACKSONf
More information4 CONNECTED PROJECTIVE-PLANAR GRAPHS ARE HAMILTONIAN. Robin Thomas* Xingxing Yu**
4 CONNECTED PROJECTIVE-PLANAR GRAPHS ARE HAMILTONIAN Robin Thomas* Xingxing Yu** School of Mathematics Georgia Institute of Technology Atlanta, Georgia 30332, USA May 1991, revised 23 October 1993. Published
More informationMutually embeddable graphs and the Tree Alternative conjecture
Mutually embeddable graphs and the Tree Alternative conjecture Anthony Bonato a a Department of Mathematics Wilfrid Laurier University Waterloo, ON Canada, N2L 3C5 Claude Tardif b b Department of Mathematics
More informationList coloring hypergraphs
List coloring hypergraphs Penny Haxell Jacques Verstraete Department of Combinatorics and Optimization University of Waterloo Waterloo, Ontario, Canada pehaxell@uwaterloo.ca Department of Mathematics University
More informationON PERMUTATION POLYNOMIALS OF PRESCRIBED SHAPE
ON PERMUTATION POLYNOMIALS OF PRESCRIBED SHAPE AMIR AKBARY, DRAGOS GHIOCA, AND QIANG WANG Abstract. We count permutation polynomials of F q which are sums of m + 2 monomials of prescribed degrees. This
More informationA POLAR, THE CLASS AND PLANE JACOBIAN CONJECTURE
Bull. Korean Math. Soc. 47 (2010), No. 1, pp. 211 219 DOI 10.4134/BKMS.2010.47.1.211 A POLAR, THE CLASS AND PLANE JACOBIAN CONJECTURE Dosang Joe Abstract. Let P be a Jacobian polynomial such as deg P =
More informationINITIAL COMPLEX ASSOCIATED TO A JET SCHEME OF A DETERMINANTAL VARIETY. the affine space of dimension k over F. By a variety in A k F
INITIAL COMPLEX ASSOCIATED TO A JET SCHEME OF A DETERMINANTAL VARIETY BOYAN JONOV Abstract. We show in this paper that the principal component of the first order jet scheme over the classical determinantal
More informationA Relationship Between the Major Index For Tableaux and the Charge Statistic For Permutations
A Relationship Between the Major Index For Tableaux and the Charge Statistic For Permutations Kendra Killpatrick Pepperdine University Malibu, California Kendra.Killpatrick@pepperdine.edu Submitted: July
More informationTHE REPRESENTATION THEORY, GEOMETRY, AND COMBINATORICS OF BRANCHED COVERS
THE REPRESENTATION THEORY, GEOMETRY, AND COMBINATORICS OF BRANCHED COVERS BRIAN OSSERMAN Abstract. The study of branched covers of the Riemann sphere has connections to many fields. We recall the classical
More informationPreservation of log-concavity on summation
Preservation of log-concavity on summation Oliver Johnson Christina Goldschmidt October 12, 2005 Abstract We extend Hoggar s theorem that the sum of two independent discrete-valued log-concave random variables
More informationAntoni Marczyk A NOTE ON ARBITRARILY VERTEX DECOMPOSABLE GRAPHS
Opuscula Mathematica Vol. 6 No. 1 006 Antoni Marczyk A NOTE ON ARBITRARILY VERTEX DECOMPOSABLE GRAPHS Abstract. A graph G of order n is said to be arbitrarily vertex decomposable if for each sequence (n
More informationNew lower bounds for hypergraph Ramsey numbers
New lower bounds for hypergraph Ramsey numbers Dhruv Mubayi Andrew Suk Abstract The Ramsey number r k (s, n) is the minimum N such that for every red-blue coloring of the k-tuples of {1,..., N}, there
More informationENUMERATION OF CONNECTED CATALAN OBJECTS BY TYPE. 1. Introduction
ENUMERATION OF CONNECTED CATALAN OBJECTS BY TYPE BRENDON RHOADES Abstract. Noncrossing set partitions, nonnesting set partitions, Dyck paths, and rooted plane trees are four classes of Catalan objects
More informationYOUNG TABLEAUX AND THE REPRESENTATIONS OF THE SYMMETRIC GROUP
YOUNG TABLEAUX AND THE REPRESENTATIONS OF THE SYMMETRIC GROUP YUFEI ZHAO ABSTRACT We explore an intimate connection between Young tableaux and representations of the symmetric group We describe the construction
More informationENUMERATION OF TREES AND ONE AMAZING REPRESENTATION OF THE SYMMETRIC GROUP. Igor Pak Harvard University
ENUMERATION OF TREES AND ONE AMAZING REPRESENTATION OF THE SYMMETRIC GROUP Igor Pak Harvard University E-mail: pak@math.harvard.edu Alexander Postnikov Massachusetts Institute of Technology E-mail: apost@math.mit.edu
More informationOn an identity of Gessel and Stanton and the new little Göllnitz identities
On an identity of Gessel and Stanton and the new little Göllnitz identities Carla D. Savage Dept. of Computer Science N. C. State University, Box 8206 Raleigh, NC 27695, USA savage@csc.ncsu.edu Andrew
More informationWe denote the derivative at x by DF (x) = L. With respect to the standard bases of R n and R m, DF (x) is simply the matrix of partial derivatives,
The derivative Let O be an open subset of R n, and F : O R m a continuous function We say F is differentiable at a point x O, with derivative L, if L : R n R m is a linear transformation such that, for
More informationStirling Numbers of the 1st Kind
Daniel Reiss, Colebrook Jackson, Brad Dallas Western Washington University November 28, 2012 Introduction The set of all permutations of a set N is denoted S(N), while the set of all permutations of {1,
More informationCharacter Polynomials
Character Polynomials Problem From Stanley s Positivity Problems in Algebraic Combinatorics Problem : Give a combinatorial interpretation of the row sums of the character table for S n (combinatorial proof
More informationTC10 / 3. Finite fields S. Xambó
TC10 / 3. Finite fields S. Xambó The ring Construction of finite fields The Frobenius automorphism Splitting field of a polynomial Structure of the multiplicative group of a finite field Structure of the
More informationPermutation groups/1. 1 Automorphism groups, permutation groups, abstract
Permutation groups Whatever you have to do with a structure-endowed entity Σ try to determine its group of automorphisms... You can expect to gain a deep insight into the constitution of Σ in this way.
More informationarxiv:math/ v1 [math.qa] 5 Nov 2002
A new quantum analog of the Brauer algebra arxiv:math/0211082v1 [math.qa] 5 Nov 2002 A. I. Molev School of Mathematics and Statistics University of Sydney, NSW 2006, Australia alexm@ maths.usyd.edu.au
More informationTwo-boundary lattice paths and parking functions
Two-boundary lattice paths and parking functions Joseph PS Kung 1, Xinyu Sun 2, and Catherine Yan 3,4 1 Department of Mathematics, University of North Texas, Denton, TX 76203 2,3 Department of Mathematics
More informationReverse mathematics of some topics from algorithmic graph theory
F U N D A M E N T A MATHEMATICAE 157 (1998) Reverse mathematics of some topics from algorithmic graph theory by Peter G. C l o t e (Chestnut Hill, Mass.) and Jeffry L. H i r s t (Boone, N.C.) Abstract.
More informationCOMBINATORIAL CURVE NEIGHBORHOODS FOR THE AFFINE FLAG MANIFOLD OF TYPE A 1 1
COMBINATORIAL CURVE NEIGHBORHOODS FOR THE AFFINE FLAG MANIFOLD OF TYPE A 1 1 LEONARDO C. MIHALCEA AND TREVOR NORTON Abstract. Let X be the affine flag manifold of Lie type A 1 1. Its moment graph encodes
More informationOn the intersection of infinite matroids
On the intersection of infinite matroids Elad Aigner-Horev Johannes Carmesin Jan-Oliver Fröhlich University of Hamburg 9 July 2012 Abstract We show that the infinite matroid intersection conjecture of
More informationOn the mean connected induced subgraph order of cographs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 71(1) (018), Pages 161 183 On the mean connected induced subgraph order of cographs Matthew E Kroeker Lucas Mol Ortrud R Oellermann University of Winnipeg Winnipeg,
More informationDISCRETIZED CONFIGURATIONS AND PARTIAL PARTITIONS
DISCRETIZED CONFIGURATIONS AND PARTIAL PARTITIONS AARON ABRAMS, DAVID GAY, AND VALERIE HOWER Abstract. We show that the discretized configuration space of k points in the n-simplex is homotopy equivalent
More informationNotes on D 4 May 7, 2009
Notes on D 4 May 7, 2009 Consider the simple Lie algebra g of type D 4 over an algebraically closed field K of characteristic p > h = 6 (the Coxeter number). In particular, p is a good prime. We have dim
More informationCombining the cycle index and the Tutte polynomial?
Combining the cycle index and the Tutte polynomial? Peter J. Cameron University of St Andrews Combinatorics Seminar University of Vienna 23 March 2017 Selections Students often meet the following table
More informationThe Free Central Limit Theorem: A Combinatorial Approach
The Free Central Limit Theorem: A Combinatorial Approach by Dennis Stauffer A project submitted to the Department of Mathematical Sciences in conformity with the requirements for Math 4301 (Honour s Seminar)
More informationNAVARRO VERTICES AND NORMAL SUBGROUPS IN GROUPS OF ODD ORDER
NAVARRO VERTICES AND NORMAL SUBGROUPS IN GROUPS OF ODD ORDER JAMES P. COSSEY Abstract. Let p be a prime and suppose G is a finite solvable group and χ is an ordinary irreducible character of G. Navarro
More informationNotes on Complex Analysis
Michael Papadimitrakis Notes on Complex Analysis Department of Mathematics University of Crete Contents The complex plane.. The complex plane...................................2 Argument and polar representation.........................
More informationOptimal primitive sets with restricted primes
Optimal primitive sets with restricted primes arxiv:30.0948v [math.nt] 5 Jan 203 William D. Banks Department of Mathematics University of Missouri Columbia, MO 652 USA bankswd@missouri.edu Greg Martin
More informationSubhypergraph counts in extremal and random hypergraphs and the fractional q-independence
Subhypergraph counts in extremal and random hypergraphs and the fractional q-independence Andrzej Dudek adudek@emory.edu Andrzej Ruciński rucinski@amu.edu.pl June 21, 2008 Joanna Polcyn joaska@amu.edu.pl
More informationAlexander M. Blokh and Ethan M. Coven
SHARKOVSKIĬ TYPE OF CYCLES Alexander M. Blokh and Ethan M. Coven Abstract. The Sharkovskiĭ type of a map of an interval is the Sharkovskiĭ-greatest integer t such that it has a periodic point of period
More informationCOMPOSITION OF TRANSPOSITIONS AND EQUALITY OF RIBBON SCHUR Q-FUNCTIONS
COMPOSITION OF TRANSPOSITIONS AND EQUALITY OF RIBBON SCHUR Q-FUNCTIONS FARZIN BAREKAT AND STEPHANIE VAN WILLIGENBURG Abstract We introduce a new operation on skew diagrams called composition of transpositions,
More informationShifted symmetric functions II: expansions in multi-rectangular coordinates
Shifted symmetric functions II: expansions in multi-rectangular coordinates Valentin Féray Institut für Mathematik, Universität Zürich Séminaire Lotharingien de Combinatoire Bertinoro, Italy, Sept. 11th-12th-13th
More informationNON-SYMMETRIC HALL LITTLEWOOD POLYNOMIALS
Séminaire Lotharingien de Combinatoire 54 (2006, Article B54Ar NON-SYMMETRIC HALL LITTLEWOOD POLYNOMIALS FRANÇOIS DESCOUENS AND ALAIN LASCOUX À Adriano Garsia, en toute amitié Abstract. Using the action
More informationPartitions, rooks, and symmetric functions in noncommuting variables
Partitions, rooks, and symmetric functions in noncommuting variables Mahir Bilen Can Department of Mathematics, Tulane University New Orleans, LA 70118, USA, mcan@tulane.edu and Bruce E. Sagan Department
More informationSOME FACTORIZATIONS IN THE TWISTED GROUP ALGEBRA OF SYMMETRIC GROUPS. University of Rijeka, Croatia
GLASNIK MATEMATIČKI Vol. 5171)2016), 1 15 SOME FACTORIZATIONS IN THE TWISTED GROUP ALGEBRA OF SYMMETRIC GROUPS Milena Sošić University of Rijeka, Croatia Abstract. In this paper we will give a similar
More informationEnumerative Combinatorics 7: Group actions
Enumerative Combinatorics 7: Group actions Peter J. Cameron Autumn 2013 How many ways can you colour the faces of a cube with three colours? Clearly the answer is 3 6 = 729. But what if we regard two colourings
More informationThe Terwilliger Algebras of Group Association Schemes
The Terwilliger Algebras of Group Association Schemes Eiichi Bannai Akihiro Munemasa The Terwilliger algebra of an association scheme was introduced by Paul Terwilliger [7] in order to study P-and Q-polynomial
More informationCombinatorial Dimension in Fractional Cartesian Products
Combinatorial Dimension in Fractional Cartesian Products Ron Blei, 1 Fuchang Gao 1 Department of Mathematics, University of Connecticut, Storrs, Connecticut 0668; e-mail: blei@math.uconn.edu Department
More information(Permutations Arising from) Hook Coefficients of Chromatic Symmetric Functions
(Permutations Arising from) Hook Coefficients of Chromatic Symmetric Functions Ryan Kaliszewski Drexel University rlk72@drexel.edu July 17, 2014 Ryan Kaliszewski (Drexel University) Hook Coefficients July
More informationGeneralized Foulkes Conjecture and Tableaux Construction
Generalized Foulkes Conjecture and Tableaux Construction Thesis by Rebecca Vessenes In Partial Fulfillment of the Requirements for the egree of octor of Philosophy California Institute of Technology Pasadena,
More informationDISCRIMINANTS, SYMMETRIZED GRAPH MONOMIALS, AND SUMS OF SQUARES
DISCRIMINANTS, SYMMETRIZED GRAPH MONOMIALS, AND SUMS OF SQUARES PER ALEXANDERSSON AND BORIS SHAPIRO Abstract. Motivated by the necessities of the invariant theory of binary forms J. J. Sylvester constructed
More informationOn the Error Bound in the Normal Approximation for Jack Measures (Joint work with Le Van Thanh)
On the Error Bound in the Normal Approximation for Jack Measures (Joint work with Le Van Thanh) Louis H. Y. Chen National University of Singapore International Colloquium on Stein s Method, Concentration
More information4. Noether normalisation
4. Noether normalisation We shall say that a ring R is an affine ring (or affine k-algebra) if R is isomorphic to a polynomial ring over a field k with finitely many indeterminates modulo an ideal, i.e.,
More informationMathematical Research Letters 3, (1996) EQUIVARIANT AFFINE LINE BUNDLES AND LINEARIZATION. Hanspeter Kraft and Frank Kutzschebauch
Mathematical Research Letters 3, 619 627 (1996) EQUIVARIANT AFFINE LINE BUNDLES AND LINEARIZATION Hanspeter Kraft and Frank Kutzschebauch Abstract. We show that every algebraic action of a linearly reductive
More informationBP -HOMOLOGY AND AN IMPLICATION FOR SYMMETRIC POLYNOMIALS. 1. Introduction and results
BP -HOMOLOGY AND AN IMPLICATION FOR SYMMETRIC POLYNOMIALS DONALD M. DAVIS Abstract. We determine the BP -module structure, mod higher filtration, of the main part of the BP -homology of elementary 2- groups.
More informationSpectrally arbitrary star sign patterns
Linear Algebra and its Applications 400 (2005) 99 119 wwwelseviercom/locate/laa Spectrally arbitrary star sign patterns G MacGillivray, RM Tifenbach, P van den Driessche Department of Mathematics and Statistics,
More informationq-alg/ Mar 96
Integrality of Two Variable Kostka Functions Friedrich Knop* Department of Mathematics, Rutgers University, New Brunswick NJ 08903, USA knop@math.rutgers.edu 1. Introduction q-alg/9603027 29 Mar 96 Macdonald
More informationDirac s Map-Color Theorem for Choosability
Dirac s Map-Color Theorem for Choosability T. Böhme B. Mohar Technical University of Ilmenau, University of Ljubljana, D-98684 Ilmenau, Germany Jadranska 19, 1111 Ljubljana, Slovenia M. Stiebitz Technical
More informationCombinatorial Enumeration. Jason Z. Gao Carleton University, Ottawa, Canada
Combinatorial Enumeration Jason Z. Gao Carleton University, Ottawa, Canada Counting Combinatorial Structures We are interested in counting combinatorial (discrete) structures of a given size. For example,
More informationLongest element of a finite Coxeter group
Longest element of a finite Coxeter group September 10, 2015 Here we draw together some well-known properties of the (unique) longest element w in a finite Coxeter group W, with reference to theorems and
More informationZero-Sum Flows in Regular Graphs
Zero-Sum Flows in Regular Graphs S. Akbari,5, A. Daemi 2, O. Hatami, A. Javanmard 3, A. Mehrabian 4 Department of Mathematical Sciences Sharif University of Technology Tehran, Iran 2 Department of Mathematics
More informationON KRONECKER PRODUCTS OF CHARACTERS OF THE SYMMETRIC GROUPS WITH FEW COMPONENTS
ON KRONECKER PRODUCTS OF CHARACTERS OF THE SYMMETRIC GROUPS WITH FEW COMPONENTS C. BESSENRODT AND S. VAN WILLIGENBURG Abstract. Confirming a conjecture made by Bessenrodt and Kleshchev in 1999, we classify
More informationON SOME FACTORIZATION FORMULAS OF K-k-SCHUR FUNCTIONS
ON SOME FACTORIZATION FORMULAS OF K-k-SCHUR FUNCTIONS MOTOKI TAKIGIKU Abstract. We give some new formulas about factorizations of K-k-Schur functions, analogous to the k-rectangle factorization formula
More informationThe spectra of super line multigraphs
The spectra of super line multigraphs Jay Bagga Department of Computer Science Ball State University Muncie, IN jbagga@bsuedu Robert B Ellis Department of Applied Mathematics Illinois Institute of Technology
More informationOn cycle index and orbit stabilizer of Symmetric group
The International Journal Of Engineering And Science (IJES) Volume 3 Issue 1 Pages 18-26 2014 ISSN (e): 2319 1813 ISSN (p): 2319 1805 On cycle index and orbit stabilizer of Symmetric group 1 Mogbonju M.
More informationA proof of the Square Paths Conjecture
A proof of the Square Paths Conjecture Emily Sergel Leven October 7, 08 arxiv:60.069v [math.co] Jan 06 Abstract The modified Macdonald polynomials, introduced by Garsia and Haiman (996), have many astounding
More informationAuerbach bases and minimal volume sufficient enlargements
Auerbach bases and minimal volume sufficient enlargements M. I. Ostrovskii January, 2009 Abstract. Let B Y denote the unit ball of a normed linear space Y. A symmetric, bounded, closed, convex set A in
More information* 8 Groups, with Appendix containing Rings and Fields.
* 8 Groups, with Appendix containing Rings and Fields Binary Operations Definition We say that is a binary operation on a set S if, and only if, a, b, a b S Implicit in this definition is the idea that
More informationCounting Three-Line Latin Rectangles
Counting Three-Line Latin Rectangles Ira M Gessel* Department of Mathematics Brandeis University Waltham, MA 02254 A k n Latin rectangle is a k n array of numbers such that (i) each row is a permutation
More informationMATH 223A NOTES 2011 LIE ALGEBRAS 35
MATH 3A NOTES 011 LIE ALGEBRAS 35 9. Abstract root systems We now attempt to reconstruct the Lie algebra based only on the information given by the set of roots Φ which is embedded in Euclidean space E.
More informationCombinatorial Interpretations of a Generalization of the Genocchi Numbers
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 7 (2004), Article 04.3.6 Combinatorial Interpretations of a Generalization of the Genocchi Numbers Michael Domaratzki Jodrey School of Computer Science
More information