اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدIndependence of hyperlogarithms over function fields via algebraic combinatorics
300
0
0.0
(
0
)
نشر من قبل
Gerard Henry Edmond Duchamp
تاريخ النشر
2011
مجال البحث
الهندسة المعلوماتية
والبحث باللغة
English
تأليف
Matthieu Deneufch^atel
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We obtain a necessary and sufficient condition for the linear independence of solutions of differential equations for hyperlogarithms. The key fact is that the multiplier (i.e. the factor $M$ in the differential equation $dS=MS$) has only singularities of first order (Fuchsian-type equations) and this implies that they freely span a space which contains no primitive. We give direct applications where we extend the property of linear independence to the largest known ring of coefficients.
قيم البحث
اقرأ أيضاً
On complex algebraic varieties, height functions arising in combinatorial applications fail to be proper. This complicates the description and computation via Morse theory of key topological invariants. Here we establish checkable conditions under wh
ich the behavior at infinity may be ignored, and the usual theorems of classical and stratified Morse theory may be applied. This allows for simplified arguments in the field of analytic combinatorics in several variables, and forms the basis for new methods applying to problems beyond the reach of previous techniques.
We first formulate a function field version of Vojtas generalized abc conjecture for algebraic tori. We then show a function field analogue of the Lang-Vojta Conjecture for varieties of log general type that are ramified covers of $mathbb G_m^n$. In
particular, it includes the case $ mathbb P^nsetminus D$, where $D$ is a hypersurface over a function field in $mathbb P^n$ with $n+1$ irreducible components and $deg Dge n+2$. The main tools include generalizations of the techniques developed by Corvaja and Zannier in 2008 and 2013 and a gcd estimate of two multivariable polynomials over function fields evaluated at $S$-unit arguments. The gcd theorem obtained here is an adaptation of Levins methods for number fields in 2019 via a weaker version of Schmidts subspace theorem over function fields, which we derive with the use of Vojtas machine in a setting over the constant fields.
We consider the algebraic combinatorics of the set of injections from a $k$-element set to an $n$-element set. In particular, we give a new combinatorial formula for the spherical functions of the Gelfand pair $(S_k times S_n, text{diag}(S_k) times S
_{n-k})$. We use this combinatorial formula to give new Delsarte linear programming bounds on the size of codes over injections.
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.
This note is purely expository and is in Russian. We show how to prove interesting combinatorial results using the local Lovasz lemma. The note is accessible for students having basic knowledge of combinatorics; the notion of independence is defined
and the Lovasz lemma is stated and proved. Our exposition follows `Probabilistic methods of N. Alon and J. Spencer. The main difference is that we show how the proof could have been invented. The material is presented as a sequence of problems, which is peculiar not only to Zen monasteries but also to advanced mathematical education; most problems are presented with hints or solutions.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
