ترغب بنشر مسار تعليمي؟ اضغط هنا

Alphabets, rewriting trails and periodic representations in algebraic bases

135   0   0.0 ( 0 )
 نشر من قبل Jean-Louis Verger-Gaugry
 تاريخ النشر 2020
  مجال البحث الهندسة المعلوماتية
والبحث باللغة English




اسأل ChatGPT حول البحث

For $beta > 1$ a real algebraic integer ({it the base}), the finite alphabets $mathcal{A} subset mathbb{Z}$ which realize the identity $mathbb{Q}(beta) = {rm Per}_{mathcal{A}}(beta)$, where ${rm Per}_{mathcal{A}}(beta)$ is the set of complex numbers which are $(beta, mathcal{A})$-eventually periodic representations, are investigated. Comparing with the greedy algorithm, minimal and natural alphabets are defined. The natural alphabets are shown to be correlated to the asymptotics of the Pierce numbers of the base $beta$ and Lehmers problem. The notion of rewriting trail is introduced to construct intermediate alphabets associated with small polynomial values of the base. Consequences on the representations of neighbourhoods of the origin in $mathbb{Q}(beta)$, generalizing Schmidts theorem related to Pisot numbers, are investigated. Applications to Galois conjugation are given for convergent sequences of bases $gamma_s := gamma_{n, m_1 , ldots , m_s}$ such that $gamma_{s}^{-1}$ is the unique root in $(0,1)$ of an almost Newman polynomial of the type $-1+x+x^n +x^{m_1}+ldots+ x^{m_s}$, $n geq 3$, $s geq 1$, $m_1 - n geq n-1$, $m_{q+1}-m_q geq n-1$ for all $q geq 1$. For $beta > 1$ a reciprocal algebraic integer close to one, the poles of modulus $< 1$ of the dynamical zeta function of the $beta$-shift $zeta_{beta}(z)$ are shown, under some assumptions, to be zeroes of the minimal polynomial of $beta$.



قيم البحث

اقرأ أيضاً

148 - Nicolas Behr 2021
Building upon the rule-algebraic stochastic mechanics framework, we present new results on the relationship of stochastic rewriting systems described in terms of continuous-time Markov chains, their embedded discrete-time Markov chains and certain ty pes of generating function expressions in combinatorics. We introduce a number of generating function techniques that permit a novel form of static analysis for rewriting systems based upon marginalizing distributions over the states of the rewriting systems via pattern-counting observables.
203 - Xing Gao , Li Guo , Huhu Zhang 2021
Many years ago, Rota proposed a program on determining algebraic identities that can be satisfied by linear operators. After an extended period of dormant, progress on this program picked up speed in recent years, thanks to perspectives from operated algebras and Grobner-Shirshov bases. These advances were achieved in a series of papers from special cases to more general situations. These perspectives also indicate that Rotas insight can be manifested very broadly, for other algebraic structures such as Lie algebras, and further in the context of operads. This paper gives a survey on the motivation, early developments and recent advances on Rotas program, for linear operators on associative algebras and Lie algebras. Emphasis will be given to the applications of rewriting systems and Grobner-Shirshov bases. Problems, old and new, are proposed throughout the paper to prompt further developments on Rotas program.
Convergent rewriting systems on algebraic structures give methods to solve decision problems, to prove coherence results, and to compute homological invariants. These methods are based on higher-dimensional extensions of the critical branching lemma that characterizes local confluence from confluence of the critical branchings. The analysis of local confluence of rewriting systems on algebraic structures, such as groups or linear algebras, is complicated because of the underlying algebraic axioms, and in some situations, local confluence properties require additional termination conditions. This article introduces the structure of algebraic polygraph modulo that formalizes the interaction between the rules of an algebraic rewriting system and the inherent algebraic axioms, and we show a critical branching lemma for algebraic polygraphs. We deduce from this result a critical branching lemma for rewriting systems on algebraic objects whose axioms are specified by convergent modulo rewriting systems. We illustrate our constructions for string, linear, and group rewriting systems.
It is widely expected that NMHV amplitudes in planar, maximally supersymmetric Yang-Mills theory require symbol letters that are not rationally expressible in terms of momentum-twistor (or cluster) variables starting at two loops for eight particles. Recent advances in loop integration technology have made this an `experimentally testable hypothesis: compute the amplitude at some kinematic point, and see if algebraic symbol letters arise. We demonstrate the feasibility of such a test by directly integrating the most difficult of the two-loop topologies required. This integral, together with its rotated image, suffices to determine the simplest NMHV component amplitude: the unique component finite at this order. Although each of these integrals involve algebraic symbol alphabets, the combination contributing to this amplitude is---surprisingly---rational. We describe the steps involved in this analysis, which requires several novel tricks of loop integration and also a considerable degree of algebraic number theory. We find dramatic and unusual simplifications, in which the two symbols initially expressed as almost ten million terms in over two thousand letters combine in a form that can be written in five thousand terms and twenty-five letters.
A word is square-free if it does not contain any square (a word of the form $XX$), and is extremal square-free if it cannot be extended to a new square-free word by inserting a single letter at any position. Grytczuk, Kordulewski, and Niewiadomski pr oved that there exist infinitely many ternary extremal square-free words. We establish that there are no extremal square-free words over any alphabet of size at least 17.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا