اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدReturn words of linear involutions and fundamental groups
59
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We investigate the natural codings of linear involutions. We deduce from the geometric representation of linear involutions as Poincare maps of measured foliations a suitable definition of return words which yields that the set of first return words to a given word is a symmetric basis of the free group on the underlying alphabet $A$. The set of first return words with respect to a subgroup of finite index $G$ of the free group on $A$ is also proved to be a symmetric basis of $G$.
قيم البحث
اقرأ أيضاً
In this paper, we give a necessary condition for an infinite word defined by a non-degenerate interval exchange on three intervals (3iet word) to be invariant by a substitution: a natural parameter associated to this word must be a Sturm number. We d
educe some algebraic consequences from this condition concerning the incidence matrix of the associated substitution. As a by-product of our proof, we give a combinatorial characterization of 3iet words.
The group of almost Riordan arrays contains the group of Riordan arrays as a subgroup. In this note, we exhibit examples of pseudo-involutions, involutions and quasi-involutions in the group of almost Riordan arrays.
If H is a connected, graded Hopf algebra, then Takeuchis formula can be used to compute its antipode. However, there is usually massive cancellation in the result. We show how sign-reversing involutions can sometimes be used to obtain cancellation-fr
ee formulas. We apply this idea to nine different examples. We rederive known formulas for the antipodes in the Hopf algebra of polynomials, the shuffle Hopf algebra, the Hopf algebra of quasisymmertic functions in both the monomial and fundamental bases, the Hopf algebra of multi-quasisymmetric functions in the fundamental basis, and the incidence Hopf algebra of graphs. We also find cancellation-free expressions for particular values of the antipode in the immaculate basis for the noncommutative symmetric functions as well as the Malvenuto-Reutenauer and Porier-Reutenauer Hopf algebras, some of which are the first of their kind. We include various conjectures and suggestions for future research.
Let $mathsf G$ be a connected reductive linear algebraic group defined over $mathbb R$, and let $C: mathsf Grightarrow mathsf G$ be a fundamental Chevalley involution. We show that for every $gin mathsf G(mathbb R)$, $C(g)$ is conjugate to $g^{-1}$ i
n the group $mathsf G(mathbb R)$. Similar result on the Lie algebras is also obtained.
A sequential dynamical system (SDS) consists of a graph, a set of local functions and an update schedule. A linear sequential dynamical system is an SDS whose local functions are linear. In this paper, we derive an explicit closed formula for any lin
ear SDS as a synchronous dynamical system. We also show constructively, that any synchronous linear system can be expressed as a linear SDS, i.e. it can be written as a product of linear local functions. Furthermore, we study the connection between linear SDS and the incidence algebras of partially ordered sets (posets). Specifically, we show that the M{o}bius function of any poset can be computed via an SDS, whose graph is induced by the Hasse diagram of the poset. Finally, we prove a cut theorem for the M{o}bius functions of posets with respect to certain chain decompositions.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
