نتایج جستجو برای: schinzel equation
تعداد نتایج: 229987 فیلتر نتایج به سال:
Definition 18.1 A (n, s)-Davenport-Schinzel sequence is a sequence over an alphabet A of size n in which no two consecutive characters are the same and there is no alternating subsequence of the form .
Abstract We establish a version “over the ring” of celebrated Hilbert Irreducibility Theorem. Given finitely many polynomials in k + n {k+n} variables, with coefficients ? {\mathbb{Z}} , positive degree last n we show that if they are irreducible over and satisf...
Davenport-Schinzel sequences are sequences that do not contain forbidden subsequences of alternating symbols. They arise in the computation of the envelope of a set of functions. We show that the maximal length of a Davenport-Schinzel sequence composed of n symbols is 6(noc(n»), where t1.(n)is the functional inverse of Ackermann's function, and is thus very slowly increasing to infinity. This i...
We give a Schinzel-Zassenhaus-type lower bound for the maximum modulus of roots monic integer polynomial with all symmetric respect to unit circle. Our results extend recent work Dimitrov, who proved general Schinzel-Zassenhaus conjecture by using Pólya rationality theorem power series coefficients, and some estimates logarithmic capacity (transfinite diameter) sets. use an enhancement Pólya's ...
On solutions of a common generalization of the Goła̧b–Schinzel equation and of the addition formulae
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید