Polynomials of Least Deviation from Zero in Sobolev p-Norm

The first part of this paper complements previous results on characterization of polynomials of least deviation from zero in Sobolev p-norm ($$1<p<\infty $$ 1 < p < ∞ ) for the case $$p=1$$ p = 1 . Some relevant examples are indicated. The second part deals with the location of zeros of polynomials of least deviation in discrete Sobolev p-norm. The asymptotic distribution of zeros is established on general conditions. Under some order restriction in the discrete part, we prove that the n-th polynomial of least deviation has at least $$n-\mathbf {d}^*$$ n - d ∗ zeros on the convex hull of the support of the measure, where $$\mathbf {d}^*$$ d ∗ denotes the number of terms in the discrete part.

Investigation of a Control Function Determining the Location of the Zeros as a Possible Proof of the Riemann Hypothesis.

The article examines the control function in relation to the distribution of Zeros on thecritical line x = 0,5. To confirm this hypothesis, it will be necessary to perform a large number ofstatistical analyzes of the distribution of non-trivial zero points of the Riemann Zeta function.

On distribution densities of algebraic points under different height functions

In the article we consider the spatial distribution of points, whose coordinates are conjugate algebraic numbers of fixed degree. The distribution is introduced using a height function. We have obtained universal upper and lower bounds of the distribution density of such points using an arbitrary height function. We have shown how from a given joint density function of coefficients of a random polynomial of degree n, one can construct such a height function H that the polynomials q of degree n uniformly chosen under H[q] ≤1 have the same distribution of zeros as the former random polynomial.

A Riemann–von Mangoldt-Type Formula for the Distribution of Beurling Primes

In this paper we work out a Riemann–von Mangoldt type formula for the summatory function := , where is an arithmetical semigroup (a Beurling generalized system of integers) and is the corresponding von Mangoldt function attaining with a prime element and zero otherwise. On the way towards this formula, we prove explicit estimates on the Beurling zeta function , belonging to , to the number of zeroes of in various regions, in particular within the critical strip where the analytic continuation exists, and to the magnitude of the logarithmic derivative of , under the sole additional assumption that Knopfmacher’s Axiom A is satisfied. We also construct a technically useful broken line contour to which the technic of integral transformation can be well applied. The whole work serves as a first step towards a further study of the distribution of zeros of the Beurling zeta function, providing appropriate zero density and zero clustering estimates, to be presented in the continuation of this paper.

The distribution of zeros of solutions for a class of third order differential equation

For third order linear differential equations of the form r(t)x'(t)''+ p(t)x'(t) + q(t)x(t) = 0; we will establish lower bounds for the distance between zeros of a solution and/or its derivatives. The main results will be proved by making use of Hardyís inequality, some generalizations of Opialís inequality and Boydís inequality.

OSCILLATION PROPERTIES FOR NON-CLASSICAL STURM-LIOUVILLE PROBLEMS WITH ADDITIONAL TRANSMISSION CONDITIONS

This work is aimed at studying some comparison and oscillation properties of boundary value problems (BVP’s) of a new type, which differ from classical problems in that they are defined on two disjoint intervals and include additional transfer conditions that describe the interaction between the left and right intervals. This type of problems we call boundary value-transmission problems (BVTP’s). The main difficulty arises when studying the distribution of zeros of eigenfunctions, since it is unclear how to apply the classical methods of Sturm’s theory to problems of this type. We established new criteria for comparison and oscillation properties and new approaches used to obtain these criteria. The obtained results extend and generalizes the Sturm’s classical theorems on comparison and oscillation.

On the vertical distribution of values of L-functions in the Selberg class

We prove explicit formulae for [Formula: see text]-points of [Formula: see text]-functions from the Selberg class. Next we extend a theorem of Littlewood on the vertical distribution of zeros of the Riemann zeta-function [Formula: see text] to the case of [Formula: see text]-points of the aforementioned [Formula: see text]-functions. This result implies the uniform distribution of subsequences of [Formula: see text]-points and from this a discrete universality theorem in the spirit of Voronin is derived.

Laplace Contour Integrals and Linear Differential Equations

The purpose of this paper is to determine the main properties of Laplace contour integrals $$\begin{aligned} \Lambda (z)=\frac{1}{2\pi i}\int _\mathfrak {C}\phi (t)e^{-zt}\,dt \end{aligned}$$ Λ ( z ) = 1 2 π i ∫ C ϕ ( t ) e - z t d t that solve linear differential equations $$\begin{aligned} L[w](z):=w^{(n)}+\sum _{j=0}^{n-1}(a_j+b_jz)w^{(j)}=0. \end{aligned}$$ L [ w ] ( z ) : = w ( n ) + ∑ j = 0 n - 1 ( a j + b j z ) w ( j ) = 0 . This concerns, in particular, the order of growth, asymptotic expansions, the Phragmén–Lindelöf indicator, the distribution of zeros, the existence of sub-normal and polynomial solutions, and the corresponding Nevanlinna functions.

COMPUTER TOOLS FOR SOLVING MATHEMATICAL PROBLEMS: A REVIEW

The rapid development of digital computer hardware and software has had a dramatic influence on mathematics, and contrary. The advanced hardware and modern sophistical software such as computer visualization, symbolic computation, computerassisted proofs, multi-precision arithmetic and powerful libraries, have provided resolving many open problems, a huge very difficult mathematical problems, and discovering new patterns and relationships, far beyond a human capability. In the first part of the paper we give a short review of some typical mathematical problems solved by computer tools. In the second part we present some new original contributions, such as intriguing consequence of the presence of roundoff errors, distribution of zeros of random polynomials, dynamic study of zero-finding methods, a new three-point family of methods for solving nonlinear equations and two algorithms for the inclusion of a simple complex zero of a polynomial.