本文整理匯總了Python中sage.combinat.permutation.Permutation.monomial_coefficients方法的典型用法代碼示例。如果您正苦於以下問題：Python Permutation.monomial_coefficients方法的具體用法？Python Permutation.monomial_coefficients怎麽用？Python Permutation.monomial_coefficients使用的例子？那麽, 這裏精選的方法代碼示例或許可以為您提供幫助。您也可以進一步了解該方法所在類sage.combinat.permutation.Permutation的用法示例。
在下文中一共展示了Permutation.monomial_coefficients方法的1個代碼示例，這些例子默認根據受歡迎程度排序。您可以為喜歡或者感覺有用的代碼點讚，您的評價將有助於係統推薦出更棒的Python代碼示例。
示例1: _element_constructor_
# 需要導入模塊: from sage.combinat.permutation import Permutation [as 別名]
# 或者: from sage.combinat.permutation.Permutation import monomial_coefficients [as 別名]
def _element_constructor_(self, x):
r"""
Convert ``x`` into ``self``.
EXAMPLES::
sage: R = algebras.FQSym(QQ).G()
sage: x, y, z = R([1]), R([2,1]), R([3,2,1])
sage: R(x)
G[1]
sage: R(x+4*y)
G[1] + 4*G[2, 1]
sage: R(1)
G[]
sage: D = algebras.FQSym(ZZ).G()
sage: X, Y, Z = D([1]), D([2,1]), D([3,2,1])
sage: R(X-Y).parent()
Free Quasi-symmetric functions over Rational Field in the G basis
sage: R([1, 3, 2])
G[1, 3, 2]
sage: R(Permutation([1, 3, 2]))
G[1, 3, 2]
sage: R(SymmetricGroup(4)(Permutation([1,3,4,2])))
G[1, 3, 4, 2]
sage: RF = algebras.FQSym(QQ).F()
sage: R(RF([2, 3, 4, 1]))
G[4, 1, 2, 3]
sage: R(RF([3, 2, 4, 1]))
G[4, 2, 1, 3]
sage: DF = algebras.FQSym(ZZ).F()
sage: D(DF([2, 3, 4, 1]))
G[4, 1, 2, 3]
sage: R(DF([2, 3, 4, 1]))
G[4, 1, 2, 3]
sage: RF(R[2, 3, 4, 1])
F[4, 1, 2, 3]
"""
if isinstance(x, (list, tuple, PermutationGroupElement)):
x = Permutation(x)
try:
P = x.parent()
if isinstance(P, FreeQuasisymmetricFunctions.G):
if P is self:
return x
return self.element_class(self, x.monomial_coefficients())
except AttributeError:
pass
return CombinatorialFreeModule._element_constructor_(self, x)