Newman polynomials are those with all coefficients in {0, 1}. We consider here the problem of finding Newman polynomials P such that all the coefficients of P 2 are so small as possible for deg P and P (1) given. A set A ⊂ [1, N ] is called a B2[g] sequence if every integer n has at most g distinct representations as n = a1 + a2 with a1, a2 ∈ A and a1 ≤ a2. Gang Yu [4] introduced a new idea to ...

A method for finding the suboptimal control of linear delay systems with a quadratic cost functional using Legendre series is discussed. The state variable, state delay, state rate, and the control vector are expanded in the shifted Legendre series with unknown coefficients. The relation between the coefficients of the state rate with state variable is provided and the necessary condition of op...

Brightness temperature difference (BTD) values are calculated for selected Geostationary Operational Environmental Satellite (GOES-6) channels (3.9, 12.7 pm) and Advanced Very High Resolution Radiometer channels (3.7, 12.0 pm). Daytime and nighttime discrimination of particle size information is possible given the infrared cloud extinction optical depth and the BTD value. BTD values are present...

In this paper, we consider the second-kind Chebyshev polynomials (SKCPs) for the numerical solution of the fractional optimal control problems (FOCPs). Firstly, an introduction of the fractional calculus and properties of the shifted SKCPs are given and then operational matrix of fractional integration is introduced. Next, these properties are used together with the Legendre-Gauss quadrature fo...

Many interesting properties of polynomials are closely related to the geometry of their Newton polytopes. We analyze the coercivity on R of multivariate polynomials f ∈ R[x] in terms of their Newton polytopes. In fact, we introduce the broad class of so-called gem regular polynomials and characterize their coercivity via conditions imposed on the vertex set of their Newton polytopes. These cond...

For a graph G we denote by dG(u, v) the distance between vertices u and v in G, by dG(u) the degree of vertex u. The Hosoya polynomial of G is H(G) = ∑ {u,v}⊆V (G) x dG (u,v). For any positive numbers m and n, the partial Hosoya polynomials of G are Hm(G) = ∑ {u, v} ⊆ V (G) dG (u) = dG (v) = m xdG (u,v), Hmn(G) = ∑ {u, v} ⊆ V (G) dG (u) = m, dG (v) = n xdG (u,v). It has been shown that H(G1) − ...

In this article, we discuss a parallel implementation of efficient algorithms for computation of Legendre polynomial transforms and other orthogonal polynomial transforms. We develop an approach to the Driscoll–Healy algorithm using polynomial arithmetic and present experimental results on the accuracy, efficiency, and scalability of our implementation. The algorithms were implemented in ANSI C...

X iv :1 00 8. 50 35 v1 [ m at h. N T ] 3 0 A ug 2 01 0 RECOVERING FOURIER COEFFICIENTS OF MODULAR FORMS AND FACTORING OF INTEGERS Sergei N. Preobrazhenskĭi It is shown that if a function defined on the segment [−1, 1] has sufficiently good approximation by partial sums of the Legendre polynomial expansion, then, given the function’s Fourier coefficients cn for some subset of n ∈ [n1, n2], one c...

Variance components of the covariance function coefficients in a random regression test-day model were estimated by Legendre polynomials up to a fifth order for first-parity records of Dutch dairy cows using Gibbs sampling. Two Legendre polynomials of equal order were used to model the random part of the lactation curve, one for the genetic component and one for permanent environment. Test-day ...

in this paper, we consider the second-kind chebyshev polynomials (skcps) for the numerical solution of the fractional optimal control problems (focps). firstly, an introduction of the fractional calculus and properties of the shifted skcps are given and then operational matrix of fractional integration is introduced. next, these properties are used together with the legendre-gauss quadrature fo...