اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدL-functions of Carlitz modules, resultantal varieties and rooted binary trees
148
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We continue study of some algebraic varieties (called resultantal varieties) started in a paper of A. Grishkov, D. Logachev Resultantal varieties related to zeroes of L-functions of Carlitz modules. These varieties are related with the Sylvester matrix for the resultant of two polynomials, from one side, and with the L-functions of twisted Carlitz modules, from another side. Surprisingly, these varieties are described in terms of finite weighted rooted binary trees. We give a (conjecturally) complete description of them, we find parametrizations of their irreducible components and their invariants: degrees, multiplicities, Jordan forms, Galois actions. Proof of the fact that this description is really complete is a subject of future research. Maybe a generalization of these results will give us a solution of the problem of boundedness of the analytic rank of twists of Carlitz modules.
قيم البحث
اقرأ أيضاً
We show that there exists a connection between two types of objects: some kind of resultantal varieties over C, from one side, and varieties of twists of the tensor powers of the Carlitz module such that the order of 0 of its L-functions at infinity
is a constant, from another side. Obtained results are only a starting point of a general theory. We can expect that it will be possible to prove that the order of 0 of these L-functions at 1 (i.e. the analytic rank of a twist) is not bounded --- this is the function field case analog of the famous conjecture on non-boundedness of rank of twists of an elliptic curve over Q. The paper contains a calculation of a non-trivial polynomial determinant.
We prove two polynomial identities which are particular cases of a conjecture arising in the theory of L-functions of twisted Carlitz modules. This conjecture is stated in earlier papers of the second author.
We introduce some natural families of distributions on rooted binary ranked plane trees with a view toward unifying ideas from various fields, including macroevolution, epidemiology, computational group theory, search algorithms and other fields. In
the process we introduce the notions of split-exchangeability and plane-invariance of a general Markov splitting model in order to readily obtain probabilities over various equivalence classes of trees that arise in statistics, phylogenetics, epidemiology and group theory.
Recent work on perturbative quantum field theory has led to much study of the Connes-Kreimer Hopf algebra. Its (graded) dual, the Grossman-Larson Hopf algebra of rooted trees, had already been studied by algebraists. L. Foissy introduced a noncommuta
tive version of the Connes-Kreimer Hopf algebra, which turns out to be self-dual. Using some homomorphisms defined by the author and W. Zhao, we describe a commutative diagram that relates the aforementioned Hopf algebras to each other and to the Hopf algebras of symmetric functions, noncommutative symmetric functions, and quasi-symmetric functions.
Measures of tree balance play an important role in various research areas, for example in phylogenetics. There they are for instance used to test whether an observed phylogenetic tree differs significantly from a tree generated by the Yule model of s
peciation. One of the most popular indices in this regard is the Colless index, which measures the degree of balance for rooted binary trees. While many statistical properties of the Colless index (e.g. asymptotic results for its mean and variance under different models of speciation) have already been discussed in different contexts, we focus on its extremal properties. While it is relatively straightforward to characterize trees with maximal Colless index, the analysis of the minimal value of the Colless index and the characterization of trees that achieve it, are much more involved. In this note, we therefore focus on the minimal value of the Colless index for any given number of leaves. We derive both a recursive formula for this minimal value, as well as an explicit expression, which shows a surprising connection between the Colless index and the so-called Blancmange curve, a fractal curve that is also known as the Takagi curve. Moreover, we characterize two classes of trees that have minimal Colless index, consisting of the set of so-called emph{maximally balanced trees} and a class of trees that we call emph{greedy from the bottom trees}. Furthermore, we derive an upper bound for the number of trees with minimal Colless index by relating these trees with trees with minimal Sackin index (another well-studied index of tree balance).
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
