On small fractional parts of polynomials

Text

We prove that for any real polynomial f(x)∈R[x] the set

     

Zeros of the sum of polynomials

It is given an upper bound for the number of simple and distinct zeros of the polynomial f+g, where f and g are relatively prime polynomials with complex coefficients.     

Sums of certain fractional parts

Periodica Mathematica Hungarica - In this note, an upper bound for the sum of fractional parts of certain smooth functions is given. Such sums arise naturally in numerous problems of analytic...     

The operational matrix of fractional integration for shifted Chebyshev polynomials

A new shifted Chebyshev operational matrix (SCOM) of fractional integration of arbitrary order is introduced and applied together with spectral tau method for solving linear fractional differential equations (FDEs). The fractional integration is described in the Riemann–Liouville sense. The numerical approach is based on the shifted Chebyshev tau method. The main characteristic behind the approach using this technique is that only a small number of shifted Chebyshev polynomials is needed to obtain a satisfactory result. Illustrative examples reveal that the present method is very effective and convenient for linear multi-term FDEs.     

Estimate of a sum of Legendre symbols of polynomials of even degree

Let n≥4 be even, p > (n²?2n)/2 be simple odd, andf(x)=a ₀+a ₁+...+a _nxⁿ be a polynomial with integral coefficients that are not quadratic over the residue field modulo p, (a _n, p)=1. The following inequality is proved: $$\left| {\sum\nolimits_{x = 1}^p {\left( {\frac{{f(x)}}{p}} \right)} } \right| \leqslant (n - 2)\sqrt {p + 1 - \frac{{n(n - 4)}}{4}} + 1.$$      

Sequences of polynomials of fractional binomial type

Sequences of polynomials which satisfy a binomial theorem involving fractional binomial coefficients can be characterized as umbral left inverses of singular sequences of binomial type.     

A fractional q-derivative operator and fractional extensions of some q-orthogonal polynomials

The Ramanujan Journal - A fractional q-derivative operator is introduced and some of its properties have been proved. Next, a fractional q-differential equation of Gauss type is introduced and...     

The eigenvalues of the sum of matrices with prescribed invariant polynomials *

Let A and B be n×n matrices over a field F, and c ₁,…,c_n ∈F. We give a sufficient condition for the existence of matrices A' and B' similar to A and B, respectively, such that A' + B' has eigenvalues c ₁,…,c_n .     

The expected value of the number of real zeros of a random sum of Legendre polynomials

It is known that the expected number of zeros in the interval of the sum , in which is the normalized Legendre polynomial of degree and the coefficients are independent normally distributed random variables with mean 0 and variance 1, is asymptotic to for large . We improve this result and show that this expected number is for any positive .

     

Small fractional parts of additive forms

Letf(x)=θ₁ x ₁ ^k +...+θ _s x _s ^k be an additive form with real coefficients, and ∥α∥ = min {|α-u|:uεℤ} denote the distance fromα to the nearest integer. We show that ifθ ₁,…,θ _s , are algebraic ands = 4k then there are integersx ₁,…,x _s , satisfying l ≤x ₁,≤ N and ∥f(x)∥ ≤ N ^E , withE = − 1 + 2/e. Whens = λk, 1 ≤λ ≤ 2k, the exponentE may be replaced byλE/4, and if we drop the condition thatθ ₁,…,θ _s , be algebraic then the result holds for almost all values of θεℝ ^s . Whenk ≥ 6 is small a better exponent is obtained using Heath-Brown’s version of Weyl’s estimate.     

Global optimization for sum of generalized fractional functions

This paper considers the solution of generalized fractional programming (GFP) problem which contains various variants such as a sum or product of a finite number of ratios of linear functions, polynomial fractional programming, generalized geometric programming, etc. over a polytope. For such problems, we present an efficient unified method. In this method, by utilizing a transformation and a two-part linearization method, a sequence of linear programming relaxations of the initial nonconvex programming problem are derived which are embedded in a branch-and-bound algorithm. Numerical results are given to show the feasibility and effectiveness of the proposed algorithm.     

Multidimensional modified fractional calculus operators involving a general class of polynomials

In the present work, we introduce and study essentially a class of multi-dimensional modified fractional calculus operators involving a general class of polynomials in the kernel. These operators are considered in the space of functionsM _γ (R ₊ ⁿ ). Some mapping properties and fractional differential formulas are obtained. Also images of some elementary and special functions are established.