相关论文: G.N. Chebotarev's "On the Problem of Resolvents"

This is an English translation of Anders Wiman's classical paper "\"{U}ber die Anwendung der Tschirnhausen Transformation auf die Reduktion algebraischer Gleichungen" from 1927. The original work first appeared in the 1927 extraordinary…

This is an English translation of G.N. Chebotarev's paper "On The Klein-Hilbert Resolvent Problem" which was originally written in Russian and published in Izvestiya Kazan. Fiz. Mat. Obshch., 6 (1932-1933), 5-22. In this article, Chebotarev…

This is an English translation of "The Problem of Resolvents and Critical Manifolds" by Tschebotarow/Chebotarev. In this article, Chebotarev explains his work on resolvent problems using critical manifolds. The current ideas of resolvent…

This is an English translation of the paper in which N. I. Akhiezer discovered his famous orthogonal polynomials on two intervals in a connection with a generalization of the Korkin-Zolotarev (Korkine-Zolotaref) problem (see the small…

This is an English translation of "The Resolvent Problem" by Tschebotarow/Chebotarev. In this article, Chebotarev summarizes the history of the resolvent problem from compass and ruler constructions to Klein and Hilbert' formlutions of the…

In 1683 Tschirnhaus claimed to have developed an algebraic method to determine the roots of any degree $n$ polynomial. His argument was flawed, but it spurred a great deal of work by mathematicians including Bring, Jerrard, Hamilton,…

A general formula is presented for any order derivative of Chebyshev polynomials instead of the existing recursive relationship. Hence, the Chebyshev finite difference method is made applicable not only to second order problems but also to…

The effective version of Chebotarev's density theorem under the Generalized Riemann Hypothesis and the Artin conjecture (cf. Iwaniec and Kowalski's Analytic Number Theory, 5.13) involves a numerical invariant of a subset $D$ of a finite…

We introduce the sequence of generalized Gon\v{c}arov polynomials, which is a basis for the solutions to the Gon\v{c}arov interpolation problem with respect to a delta operator. Explicitly, a generalized Gon\v{c}arov basis is a sequence…

New modifications of the methods for simultaneous extraction of all roots of polynomials over an arbitrary Chebyshev system are elaborated. A cubic convergence of iterations is proved. The method presented is a generalisation of the…

We give a uniform interpretation of the classical continuous Chebyshev's and Hahn's orthogonal polynomials of discrete variable in terms of Feigin's Lie algebra gl(N), where N is any complex number. One can similarly interpret Chebyshev's…

We employ the generalized Remez algorithm, initially suggested by P. T. P. Tang, to perform an experimental study of Chebyshev polynomials in the complex plane. Our focus lies particularly on the examination of their norms and zeros. What…

In this paper we obtained the formula for the number of irreducible polynomials with degree $n$ over finite fields of characteristic two with given trace and subtrace. This formula is a generalization of the result of Cattell et al.(2003)…

The goal of this paper is to lay the foundations for a combinatorial study, via orthogonal functions and intertwining operators, of category O for the rational Cherednik algebra of type G(r,p,n). As a first application, we give a…

Artin solved Hilbert's 17th problem, proving that a real polynomial in $n$ variables that is positive semidefinite is a sum of squares of rational functions, and Pfister showed that only $2^n$ squares are needed. In this paper, we…

In this book we describe an approach through toric geometry to the following problem: "estimate the number (counted with appropriate multiplicity) of isolated solutions of n polynomial equations in n variables over an algebraically closed…

We establish necessary and sufficient conditions for an arbitrary polynomial of degree $n$, especially with only real roots, to be trivial, i.e. to have the form a(x-b)^n. To do this, we derive new properties of polynomials and their roots.…

We consider the integer Chebyshev problem, that of minimizing the supremum norm over polynomials with integer coefficients on the interval $[0,1]$. We implement algorithms from semi-infinite programming and a branch and bound algorithm to…

Starting from the results of Charles Fefferman and Janos Koll\`ar in Continuous Solutions of Linear Equations [1], we adopt a new approach based on Fefferman's techniques of Glaeser refinement to show a more general result than the one…

The purpose of this article is to study the relationship between numerical invariants of certain subspace arrangements coming from reflection groups and numerical invariants arising in the representation theory of Cherednik algebras. For…