Group-theoretical generalization of necklace polynomials
نویسنده
چکیده
Let G be a group, U a subgroup of G of finite index, X a finite alphabet and q an indeterminate. In this paper, we study symmetric polynomials MG(X,U) and M q G(X,U) which were introduced as a group-theoretical generalization of necklace polynomials. Main results are to generalize identities satisfied by necklace polynomials due to Metropolis and Rota in a bijective way, and to express M G(X,U) in terms of MG(X,V )’s, where [V ] ranges over a set of conjugacy classes of subgroups to which U is subconjugate. As a byproduct, we provide the explicit form of the GLm(C)-module whose character is M q Z (X,nZ), where m is the cardinality of X.
منابع مشابه
FORMAL GROUP-THEORETIC GENERALIZATIONS OF THE NECKLACE ALGEBRA, INCLUDING A q-DEFORMATION
N. Metropolis and G.-C. Rota Adv. Math, 50, 1983, 95{125] studied the necklace polynomials, and were lead to deene the necklace algebra as a combinatorial model for the classical ring of Witt vectors (which corresponds to the multiplicative formal group law X + Y ? XY). In this paper, we deene and study a generalized necklace algebra, which is associated with an arbitrary formal group law F ove...
متن کاملMoyal quantization and stable homology of necklace Lie algebras
We compute the stable homology of necklace Lie algebras associated with quivers and give a construction of stable homology classes from certain A∞-categories. Our construction is a generalization of the construction of homology classes of moduli spaces of curves due to M. Kontsevich. In the second part of the paper we produce a Moyal-type quantization of the symmetric algebra of a necklace Lie ...
متن کاملSome compact generalization of inequalities for polynomials with prescribed zeros
Let $p(z)=z^s h(z)$ where $h(z)$ is a polynomial of degree at most $n-s$ having all its zeros in $|z|geq k$ or in $|z|leq k$. In this paper we obtain some new results about the dependence of $|p(Rz)|$ on $|p(rz)| $ for $r^2leq rRleq k^2$, $k^2 leq rRleq R^2$ and for $Rleq r leq k$. Our results refine and generalize certain well-known polynomial inequalities.
متن کاملFast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials over GF(2)
Many applications call for exhaustive lists of strings subject to various constraints, such as inequivalence under group actions. A k-ary necklace is an Ž . equivalence class of k-ary strings under rotation the cyclic group . A k-ary unlabeled necklace is an equivalence class of k-ary strings under rotation and permutation of alphabet symbols. We present new, fast, simple, recursive algoŽ . rit...
متن کاملSplitting Necklaces and a Generalization of the Borsuk-ulam Antipodal Theorem
We prove a very natural generalization of the Borsuk-Ulam antipodal Theorem and deduce from it, in a very straightforward way, the celebrated result of Alon [1] on splitting necklaces. Alon’s result says that t(k− 1) is an upper bound on the number of cutpoints of an opened t-coloured necklace so that the segments we get can be used to partition the set of vertices of the necklace into k subset...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012