اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدA Hopf algebra of subword complexes
139
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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 induces a natural non-trivial sub-Hopf algebra on $c$-clusters in the theory of cluster algebras.
قيم البحث
اقرأ أيضاً
Let $p$ be an odd prime number and $K$ a number field having a primitive $p$-th root of unity $zeta.$ We prove that Nikshychs non-group theoretical Hopf algebra $H_p$, which is defined over $mathbb{Q}(zeta)$, admits a Hopf order over the ring of inte
gers $mathcal{O}_K$ if and only if there is an ideal $I$ of $mathcal{O}_K$ such that $I^{2(p-1)} = (p)$. This condition does not hold in a cyclotomic field. Hence this gives an example of a semisimple Hopf algebra over a number field not admitting a Hopf order over any cyclotomic ring of integers. Moreover, we show that, when a Hopf order over $mathcal{O}_K$ exists, it is unique and we describe it explicitly.
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.
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).
Multitriangulations, and more generally subword complexes, yield a large family of simplicial complexes that are homeomorphic to spheres. Until now, all attempts to prove or disprove that they can be realized as convex polytopes faced major obstacles
. In this article, we lay out the foundations of a framework -- built upon notions from algebraic combinatorics and discrete geometry -- that allows a deeper understanding of geometric realizations of subword complexes of Coxeter groups. Namely, we describe explicitly a family of chirotopes that encapsulate the necessary information to obtain geometric realizations of subword complexes. Further, we show that the space of geometric realizations of this family covers that of subword complexes, making this combinatorially defined family into a natural object to study. The family of chirotopes is described through certain parameter matrices. That is, given a finite Coxeter group, we present matrices where certain minors have prescribed signs. Parameter matrices are universal: The existence of these matrices combined with conditions in terms of Schur functions is equivalent to the realizability of all subword complexes of this Coxeter group as chirotopes. Finally, parameter matrices provide extensions of combinatorial identities; for instance, the Vandermonde determinant and the dual Cauchy identity are recovered through suitable choices of parameters.
In this paper, we define a Hopf algebra structure on the vector space spanned by packed words using a selection-quotient coproduct. We show that this algebra is free on its irreducible packed words. Finally, we give some brief explanations on the Maple codes we have used.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
