相关论文: A general method for investigating the roots of al…
The papers shows an algorithm to search for approximations of reals to rationals of the form a/b^2 that runs on \sqrt(b) polynomial time steps.
We introduce an asymmetric operator of generalised translation, define the generalised modulus of smoothness by its means, and obtain the direct and inverse theorems in approximation theory for it.
Translated from the Latin original "Novae demonstrationes circa resolutionem numerorum in quadrata" (1774). E445 in the Enestrom index. See Chapter III, section XI of Weil's "Number theory: an approach through history". Also, a very clear…
Theorem 1 is a formula expressing the mean number of real roots of a random multihomogeneous system of polynomial equations as a multiple of the mean absolute value of the determinant of a random matrix. Theorem 2 derives closed form…
In this paper we use probabilistic methods to derive some results on the generalized Bernoulli and generalized Euler polynomials. Our approach is based on the properties of Appell polynomials associated with uniformly distributed and…
In recent years, a number of papers have been devoted to the study of roots of period polynomials of modular forms. Here, we study cohomological analogues of the Eichler-Shimura period polynomials corresponding to higher $L$-derivatives. We…
We shall consider some special generalizations of Euler's factorial series. First we construct Pad\'e approximations of the second kind for these series. Then these approximations are applied to study global relations of certain p-adic…
Je retracerai l'histoire des conjectures de Weil sur le nombre de solutions d'\'equations polynomiales dans un corps fini et quelques unes des approches qui ont \'et\'e propos\'ees pour les r\'esoudre. The Weil conjectures: origins,…
The article presents mathematical generalization of results which originated as solutions of practical problems, in particular, the modeling of transitional processes in electrical circuits and problems of resource allocation. However, the…
The problem of finding the sum of a polynomial's values is considered. In particular, for any $n\geq 3$, the explicit formula for the sum of the $n$th powers of natural numbers $S_n=\sum_{x=1}^{m}x^{n}$ is proved:…
In the space of all entire functions it is solved the problem of interpolation taking into account multiplicities by sums of the series of exponentials with the exponents from a given set. It is found a criterion of solubility of the…
Generalization of the Euler polynomials ${{A}_{n}}\left( x \right)={{\left( 1-x \right)}^{n+1}}\sum\nolimits_{m=0}^{\infty }{{{m}^{n}}{{x}^{m}}}$ are the polynomials ${{\alpha }_{n}}\left( x \right)={{\left( 1-x…
In this paper, we investigate new class of sequences related to fully degenerate Bernoulli numbers and polynomials. From those sequences, we derive some formulae for the degenerate Bernoulli and Euler polynomials.
Euler's solution in 1734 of the Basel problem, which asks for a closed form expression for the sum of the reciprocals of all perfect squares, is one of the most celebrated results of mathematical analysis. In the modern era, numerous proofs…
Generalizations of some known results on the best, best linear and best one-sided approxima- tions by trigonometric polynomials of the classes of 2\pi - periodic functions presented in the form of convolutions to the case of set-valued…
E-generalization computes common generalizations of given ground terms w.r.t. a given equational background theory E. In 2005 [arXiv:1403.8118], we had presented a computation approach based on standard regular tree grammar algorithms, and…
We propose an improved algorithm for finding roots of polynomials over finite fields. This makes possible significant speedup of the decoding process of Bose-Chaudhuri-Hocquenghem, Reed-Solomon, and some other error-correcting codes.
Motivated by the question of whether Chow polynomials of matroids have only real roots, this article revisits the known relationship between Eulerian polynomials and the Hilbert series of Chow rings of permutohedral varieties. This is done…
This paper derives numerical bounds for and implements the splitting circle method for finding roots of a univariate polynomial in the presence of fixed precision.
For $N \in \mathbb{N}$, let $T_{N}$ be the Chebyshev polynomial of the first kind. Expressions for the sequence of numbers $p_{\ell}^{(N)}$, defined as the coefficients in the expansion of $1/T_{N}(1/z)$, are provided. These coefficients…