Fields of Algebraic Numbers Computable in Polynomial Time. I of complex algebraic numbers has an isomorphic presentation computable in
polynomial time. A similar fact
Inverse Sturm-Liouville problem with polynomials in the boundary condition and multiple eigenvaluesIn this paper, the inverse Sturm-Liouville problem with distribution potential and with
polynomials A Note on Explicit Formulas for Bernoulli PolynomialsKhaldi, Laala,
Bencherif, Farid,
Derbal, Abdallah,
Халди, Лаала,
Беншериф, Фарид,
Дербал, Абдалла For r 2
{
1; - 1; 1
2
}
, we prove several explicit formulas for the n-th Bernoulli
polynomial
Bn
On quantization of polynomial momentum observablesThe paper is devoted to quantization of
polynomial momentum observables in the cotangent bundle
Finding minimal polynomials of algebraic numbers of the form tan2(π/n) using Tschirnhausen’s transform transform. The first problem is connected with the construction of minimal
polynomials of the numbers
On Fluxbrane Polynomials for Generalized Melvin-like Solutions Associated with Rank 5 Lie Algebras coordinates z=ρ^2, which obey five differential master equations. The moduli functions are
polynomials On Two Categorifications of the Arrow Polynomial for Virtual KnotsTwo categorifications are given for the arrow
polynomial, an extension of the Kauffman bracket
Galois groups for one class of equationsWe find recurrent formulas for obtaining minimal
polynomials p n(x) ∈ Z[x] of numbers of the form
Algorithms of parametric estimation of polynomial trend models of time series on discrete transforms of estimation algorithms of
polynomial trend models' parameters of time series. Algorithms evaluate
polynomial