اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدCombinatorial Hopf algebra of superclass functions of type $D$
160
0
0.0
(
0
)
تأليف
Carolina Benedetti
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We provide a Hopf algebra structure on the space of superclass functions on the unipotent upper triangular group of type D over a finite field based on a supercharacter theory constructed by Andre and Neto. Also, we make further comments with respect to types B and C. Type A was explores by M. Aguiar et. al (2010), thus this paper is a contribution to understand combinatorially the supercharacter theory of the other classical Lie types.
قيم البحث
اقرأ أيضاً
A non-commutative, planar, Hopf algebra of rooted trees was proposed in L. Foissy, Bull. Sci. Math. 126 (2002) 193-239. In this paper we propose such a non-commutative Hopf algebra for graphs. In order to define a non-commutative product we use a qua
ntum field theoretical (QFT) idea, namely the one of introducing discrete scales on each edge of the graph (which, within the QFT framework, corresponds to energy scales of the associated propagators).
We consider a Hopf algebra of simplicial complexes and provide a cancellation-free formula for its antipode. We then obtain a family of combinatorial Hopf algebras by defining a family of characters on this Hopf algebra. The characters of these combi
natorial Hopf algebras give rise to symmetric functions that encode information about colorings of simplicial complexes and their $f$-vectors. We also use characters to give a generalization of Stanleys $(-1)$-color theorem. A $q$-analog version of this family of characters is also studied.
We revisit the geometric description of cluster categories in type E in terms of colored diagonals in a polygon and generalize it to the case of m-cluster categories. As an application, we relate colored diagonals in a polygon to semi-standard Young
tableaux, in type E_6,E_7,E_8. This provides a new compatibility description of semi--standard Young tableaux in Grassmannian cluster algebras in type E_6, E_8 and in a sub-cluster algebra of type E_7.
We introduce a Hopf algebra structure of subword complexes, including both finite and infinite types. We present an explicit cancellation free formula for the antipode using acyclic orientations of certain graphs, and show that this Hopf algebra indu
ces a natural non-trivial sub-Hopf algebra on $c$-clusters in the theory of cluster algebras.
We describe combinatorial approaches to the question of whether families of real matrices admit pairs of nonreal eigenvalues passing through the imaginary axis. When the matrices arise as Jacobian matrices in the study of dynamical systems, these con
ditions provide necessary conditions for Hopf bifurcations to occur in parameterised families of such systems. The techniques depend on the spectral properties of additive compound matrices: in particular, we associate with a product of matrices a signed, labelled digraph termed a DSR^[2] graph, which encodes information about the second additive compound of this product. A condition on the cycle structure of this digraph is shown to rule out the possibility of nonreal eigenvalues with positive real part. The techniques developed are applied to systems of interacting elements termed interaction networks, of which networks of chemical reactions are a special case.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
