APPROXIMATE CALCULATION OF SUMS I: BOUNDS FOR THE ZEROS OF GRAM POLYNOMIALS

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Random regression models using different functions to model milk flow in dairy cows

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Inequalities for zeros of Jacobi polynomials via Sturm's theorem: Gautschi's conjectures

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Goppa codes through polynomials of B[X;(1/2^2)Z_0] and its decoding principle

In this paper, we present a decoding principle for Goppa codes constructed by generalized polynomials, which is based on modified Berlekamp-Massey algorithm. This algorithm corrects all errors up to the Hamming weight $t\leq 2r$, i.e., whose minimum Hamming distance is $2^{2}r+1$.

Quaternion orders over quadratic integer rings from arithmetic fuchsian groups

In this paper we show that the quaternion orders OZ[ √ 2] ≃ ( √ 2, −1)Z[ √ 2] and OZ[ √ 3] ≃ (3 + 2√ 3, −1)Z[ √ 3], appearing in problems related to the coding theory [4], [3], are not maximal orders in the quaternion algebras AQ( √ 2) ≃ ( √ 2, −1)Q( √ 2) and AQ( √ 3) ≃ (3 + 2√ 3, −1)Q( √ 3), respectively. Furthermore, we identify the maximal orders containing these orders.

Piecewise Bounded Quadratic Systems in the Plane

In this paper we study the sliding mode of piecewise bounded quadratic systems in the plane given by a non-smooth vector field Z=(X,Y). Analyzing the singular, crossing and sliding sets, we get the conditions which ensure that any solution, including the sliding one, is bounded.

On the zeros of a class of generalized hypergeometric polynomials

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Para-orthogonal polynomials from constant Verblunsky coefficients

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Bounds for the zeros of symmetric kravchuk polynomials

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Random regression models for milk, fat and protein in Colombian Buffaloes

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Szegö polynomials: quadrature rules on the unit circle and on [-1, 1]

We consider some of the relations that exist between real Szegö polynomials and certain para-orthogonal polynomials defined on the unit circle, which are again related to certain orthogonal polynomials on [-1, 1] through the transformation x = (z1/2+z1/2)/2. Using these relations we study the interpolatory quadrature rule based on the zeros of polynomials which are linear combinations of the orthogonal polynomials on [-1, 1]. In the case of any symmetric quadrature rule on [-1, 1], its associated quadrature rule on the unit circle is also given.

Vibrational-rotational analysis of supersingular plus quadratic A/r(4)+r(2) potential

Most work on supersingular potentials has focused on the study of the ground state. In this paper, a global analysis of the ground and excited states for the successive values of the orbital angular momentum of the supersingular plus quadratic potential is carried out, making use of centrifugal plus quadratic potential eigenfunction bases. First, the radially nodeless states are variationally analyzed for each value of the orbital angular momentum using the corresponding functions of the bases; the output includes the centrifugal and frequency parameters of the auxiliary potentials and their eigenfunction bases. In the second stage, these bases are used to construct the matrix representation of the Hamiltonian of the system, and from its diagonalization the energy eigenvalues and eigenvectors of the successive states are obtained. The systematics of the accuracy and convergence of the overall results are discussed with emphasis on the dependence on the intensity of the supersingular part of the potential and on the orbital angular momentum.

Comparative study between powers of sigmoid functions, MLP-backpropagation and polynomials in function approximation problems

Function approximation is a very important task in environments where the computation has to be based on extracting information from data samples in real world processes. So, the development of new mathematical model is a very important activity to guarantee the evolution of the function approximation area. In this sense, we will present the Polynomials Powers of Sigmoid (PPS) as a linear neural network. In this paper, we will introduce one series of practical results for the Polynomials Powers of Sigmoid, where we will show some advantages of the use of the powers of sigmiod functions in relationship the traditional MLP-Backpropagation and Polynomials in functions approximation problems.