Bounds for the zeros of symmetric kravchuk polynomials

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

Normal Forms for Polynomial Differential Systems in R-3 Having an Invariant Quadric and a Darboux Invariant

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

Learning kernels for support vector machines with polynomial powers of sigmoid

In the pattern recognition research field, Support Vector Machines (SVM) have been an effectiveness tool for classification purposes, being successively employed in many applications. The SVM input data is transformed into a high dimensional space using some kernel functions where linear separation is more likely. However, there are some computational drawbacks associated to SVM. One of them is the computational burden required to find out the more adequate parameters for the kernel mapping considering each non-linearly separable input data space, which reflects the performance of SVM. This paper introduces the Polynomial Powers of Sigmoid for SVM kernel mapping, and it shows their advantages over well-known kernel functions using real and synthetic datasets.

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.

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.

Estimates of covariance functions for growth from birth to 630 days of age in Nelore cattle

Weight records of Brazilian Nelore cattle, from birth to 630 d of age, recorded every 3 mo, were analyzed using random regression models. Independent variables were Legendre polynomials of age at recording. The model of analysis included contemporary groups as fixed effects and age of dam as a linear and quadratic covariable. Mean trends were modeled through a cubic regression on orthogonal polynomials of age. Up to four sets of random regression coefficients were fitted for animals' direct and maternal, additive genetic, and permanent environmental effects. Changes in measurement error variances with age were modeled through a variance function. Orders of polynomial fit from three to six were considered, resulting in up to 77 parameters to be estimated. Models fitting random regressions modeled the pattern of variances in the data adequately, with estimates similar to those from corresponding univariate analysis. Direct heritability estimates decreased after birth and tended to be lowest at ages at which maternal effect estimates tended to be highest. Maternal heritability estimates increased after birth to a peak around 110 to 120 d of age and decreased thereafter. Additive genetic direct correlation estimates between weights at standard ages (birth, weaning, yearling, and final weight) were moderate to high and maternal genetic and environmental correlations were consistently high.

On the Milnor fibre and L numbers of semi-weighted homogeneous arrangements

Inthispaperwestudygermsofpolynomialsformedbytheproductofsemi-weighted homogeneous polynomials of the same type, which we call semi-weighted homogeneous arrangements. It is shown how the L numbers of such polynomials are computed using only their weights and degree of homogeneity. A key point of the main theorem is to find the number called polar ratio of this polynomial class. An important consequence is the description of the Euler characteristic of the Milnor fibre of such arrangements only depending on their weights and degree of homogeneity. The constancy of the L numbers in families formed by such arrangements is shown, with the deformed terms having weighted degree greater than the weighted degree of the initial germ. Moreover, using the results of Massey applied to families of function germs, we obtain the constancy of the homology of the Milnor fibre in this family of semi-weighted homogeneous arrangements.

STABLE PIECEWISE POLYNOMIAL VECTOR FIELDS

Let N = {y > 0} and S = {y < 0} be the semi-planes of R-2 having as common boundary the line D = {y = 0}. Let X and Y be polynomial vector fields defined in N and S, respectively, leading to a discontinuous piecewise polynomial vector field Z = (X, Y). This work pursues the stability and the transition analysis of solutions of Z between N and S, started by Filippov (1988) and Kozlova (1984) and reformulated by Sotomayor-Teixeira (1995) in terms of the regularization method. This method consists in analyzing a one parameter family of continuous vector fields Z(epsilon), defined by averaging X and Y. This family approaches Z when the parameter goes to zero. The results of Sotomayor-Teixeira and Sotomayor-Machado (2002) providing conditions on (X, Y) for the regularized vector fields to be structurally stable on planar compact connected regions are extended to discontinuous piecewise polynomial vector fields on R-2. Pertinent genericity results for vector fields satisfying the above stability conditions are also extended to the present case. A procedure for the study of discontinuous piecewise vector fields at infinity through a compactification is proposed here.

Bayesian analysis of random regression models using B-splines to model test-day milk yield of Holstein cattle in Brazil

The objective of this paper is to model variations in test-day milk yields of first lactations of Holstein cows by RR using B-spline functions and Bayesian inference in order to fit adequate and parsimonious models for the estimation of genetic parameters. They used 152,145 test day milk yield records from 7317 first lactations of Holstein cows. The model established in this study was additive, permanent environmental and residual random effects. In addition, contemporary group and linear and quadratic effects of the age of cow at calving were included as fixed effects. Authors modeled the average lactation curve of the population with a fourth-order orthogonal Legendre polynomial. They concluded that a cubic B-spline with seven random regression coefficients for both the additive genetic and permanent environment effects was to be the best according to residual mean square and residual variance estimates. Moreover they urged a lower order model (quadratic B-spline with seven random regression coefficients for both random effects) could be adopted because it yielded practically the same genetic parameter estimates with parsimony. (C) 2012 Elsevier B.V. All rights reserved.

Polynomial and Poisson dependence in free Poisson algebras and free Poisson fields

We prove that any two Poisson dependent elements in a free Poisson algebra and a free Poisson field of characteristic zero are algebraically dependent, thus answering positively a question from Makar-Limanov and Umirbaev (2007) [8]. We apply this result to give a new proof of the tameness of automorphisms for free Poisson algebras of rank two (see Makar-Limanov and Umirbaev (2011) [9], Makar-Limanov et al. (2009) [10]). (C) 2011 Elsevier Inc. All rights reserved.

Modeling random corrosion processes via polynomial chaos expansion

Polynomial Chaos Expansion (PCE) is widely recognized as a flexible tool to represent different types of random variables/processes. However, applications to real, experimental data are still limited. In this article, PCE is used to represent the random time-evolution of metal corrosion growth in marine environments. The PCE coefficients are determined in order to represent data of 45 corrosion coupons tested by Jeffrey and Melchers (2001) at Taylors Beach, Australia. Accuracy of the representation and possibilities for model extrapolation are considered in the study. Results show that reasonably accurate smooth representations of the corrosion process can be obtained. The representation is not better because a smooth model is used to represent non-smooth corrosion data. Random corrosion leads to time-variant reliability problems, due to resistance degradation over time. Time variant reliability problems are not trivial to solve, especially under random process loading. Two example problems are solved herein, showing how the developed PCE representations can be employed in reliability analysis of structures subject to marine corrosion. Monte Carlo Simulation is used to solve the resulting time-variant reliability problems. However, an accurate and more computationally efficient solution is also presented.

A graded subring of an inverse limit of polynomial rings

We study the power series ring R= K[[x1,x2,x3,...]]on countably infinitely many variables, over a field K, and two particular K-subalgebras of it: the ring S, which is isomorphic to an inverse limit of the polynomial rings in finitely many variables over K, and the ring R', which is the largest graded subalgebra of R. Of particular interest are the homogeneous, finitely generated ideals in R', among them the generic ideals. The definition of S as an inverse limit yields a set of truncation homomorphisms from S to K[x1,...,xn] which restrict to R'. We have that the truncation of a generic I in R' is a generic ideal in K[x1,...,xn]. It is shown in Initial ideals of Truncated Homogeneous Ideals that the initial ideal of such an ideal converge to the initial ideal of the corresponding ideal in R'. This initial ideal need no longer be finitely generated, but it is always locally finitely generated: this is proved in Gröbner Bases in R'. We show in Reverse lexicographic initial ideals of generic ideals are finitely generated that the initial ideal of a generic ideal in R' is finitely generated. This contrast to the lexicographic term order. If I in R' is a homogeneous, locally finitely generated ideal, and if we write the Hilbert series of the truncated algebras K[x1,...,xn] module the truncation of I as qn(t)/(1-t)n, then we show in Generalized Hilbert Numerators that the qn's converge to a power series in t which we call the generalized Hilbert numerator of the algebra R'/I. In Gröbner bases for non-homogeneous ideals in R' we show that the calculations of Gröbner bases and initial ideals in R' can be done also for some non-homogeneous ideals, namely those which have an associated homogeneous ideal which is locally finitely generated. The fact that S is an inverse limit of polynomial rings, which are naturally endowed with the discrete topology, provides S with a topology which makes it into a complete Hausdorff topological ring. The ring R', with the subspace topology, is dense in R, and the latter ring is the Cauchy completion of the former. In Topological properties of R' we show that with respect to this topology, locally finitely generated ideals in R'are closed.

Topics in geometry, analysis and inverse problems

The thesis consists of three independent parts. Part I: Polynomial amoebas We study the amoeba of a polynomial, as de ned by Gelfand, Kapranov and Zelevinsky. A central role in the treatment is played by a certain convex function which is linear in each complement component of the amoeba, which we call the Ronkin function. This function is used in two di erent ways. First, we use it to construct a polyhedral complex, which we call a spine, approximating the amoeba. Second, the Monge-Ampere measure of the Ronkin function has interesting properties which we explore. This measure can be used to derive an upper bound on the area of an amoeba in two dimensions. We also obtain results on the number of complement components of an amoeba, and consider possible extensions of the theory to varieties of codimension higher than 1. Part II: Differential equations in the complex plane We consider polynomials in one complex variable arising as eigenfunctions of certain differential operators, and obtain results on the distribution of their zeros. We show that in the limit when the degree of the polynomial approaches innity, its zeros are distributed according to a certain probability measure. This measure has its support on the union of nitely many curve segments, and can be characterized by a simple condition on its Cauchy transform. Part III: Radon transforms and tomography This part is concerned with different weighted Radon transforms in two dimensions, in particular the problem of inverting such transforms. We obtain stability results of this inverse problem for rather general classes of weights, including weights of attenuation type with data acquisition limited to a 180 degrees range of angles. We also derive an inversion formula for the exponential Radon transform, with the same restriction on the angle.

Mathematical aspects of Feynman integrals

In the present dissertation we consider Feynman integrals in the framework of dimensional regularization. As all such integrals can be expressed in terms of scalar integrals, we focus on this latter kind of integrals in their Feynman parametric representation and study their mathematical properties, partially applying graph theory, algebraic geometry and number theory. The three main topics are the graph theoretic properties of the Symanzik polynomials, the termination of the sector decomposition algorithm of Binoth and Heinrich and the arithmetic nature of the Laurent coefficients of Feynman integrals.rnrnThe integrand of an arbitrary dimensionally regularised, scalar Feynman integral can be expressed in terms of the two well-known Symanzik polynomials. We give a detailed review on the graph theoretic properties of these polynomials. Due to the matrix-tree-theorem the first of these polynomials can be constructed from the determinant of a minor of the generic Laplacian matrix of a graph. By use of a generalization of this theorem, the all-minors-matrix-tree theorem, we derive a new relation which furthermore relates the second Symanzik polynomial to the Laplacian matrix of a graph.rnrnStarting from the Feynman parametric parameterization, the sector decomposition algorithm of Binoth and Heinrich serves for the numerical evaluation of the Laurent coefficients of an arbitrary Feynman integral in the Euclidean momentum region. This widely used algorithm contains an iterated step, consisting of an appropriate decomposition of the domain of integration and the deformation of the resulting pieces. This procedure leads to a disentanglement of the overlapping singularities of the integral. By giving a counter-example we exhibit the problem, that this iterative step of the algorithm does not terminate for every possible case. We solve this problem by presenting an appropriate extension of the algorithm, which is guaranteed to terminate. This is achieved by mapping the iterative step to an abstract combinatorial problem, known as Hironaka's polyhedra game. We present a publicly available implementation of the improved algorithm. Furthermore we explain the relationship of the sector decomposition method with the resolution of singularities of a variety, given by a sequence of blow-ups, in algebraic geometry.rnrnMotivated by the connection between Feynman integrals and topics of algebraic geometry we consider the set of periods as defined by Kontsevich and Zagier. This special set of numbers contains the set of multiple zeta values and certain values of polylogarithms, which in turn are known to be present in results for Laurent coefficients of certain dimensionally regularized Feynman integrals. By use of the extended sector decomposition algorithm we prove a theorem which implies, that the Laurent coefficients of an arbitrary Feynman integral are periods if the masses and kinematical invariants take values in the Euclidean momentum region. The statement is formulated for an even more general class of integrals, allowing for an arbitrary number of polynomials in the integrand.