اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدCombinatorial Route to Algebra: The Art of Composition & Decomposition
365
0
0.0
(
0
)
تأليف
P. Blasiak
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We consider a general concept of composition and decomposition of objects, and discuss a few natural properties one may expect from a reasonable choice thereof. It will be demonstrated how this leads to multiplication and co- multiplication laws, thereby providing a generic scheme furnishing combinatorial classes with an algebraic structure. The paper is meant as a gentle introduction to the concepts of composition and decomposition with the emphasis on combinatorial origin of the ensuing algebraic constructions.
قيم البحث
اقرأ أيضاً
Quantum physics has revealed many interesting formal properties associated with the algebra of two operators, A and B, satisfying the partial commutation relation AB-BA=1. This study surveys the relationships between classical combinatorial structure
s and the reduction to normal form of operator polynomials in such an algebra. The connection is achieved through suitable labelled graphs, or diagrams, that are composed of elementary gates. In this way, many normal form evaluations can be systematically obtained, thanks to models that involve set partitions, permutations, increasing trees, as well as weighted lattice paths. Extensions to q-analogues, multivariate frameworks, and urn models are also briefly discussed.
We give a purely combinatorial proof of the Glaisher-Crofton identity which derives from the analysis of discrete structures generated by iterated second derivative. The argument illustrates utility of symbolic and generating function methodology of
modern enumerative combinatorics and their applications to computational problems.
We count the numbers of primitive periodic orbits on families of 4-regular directed circulant graphs with $n$ vertices. The relevant counting techniques are then extended to count the numbers of primitive pseudo orbits (sets of distinct primitive per
iodic orbits) up to length $n$ that lack self-intersections, or that never intersect at more than a single vertex at a time repeated exactly twice for each self-intersection (2-encounters of length zero), for two particular families of graphs. We then regard these two families of graphs as families of quantum graphs and use the counting results to compute the variance of the coefficients of the quantum graphs characteristic polynomial.
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 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.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
