On the Number Counting of Polynomial Functions

Polynomial functions （in particular, permutation polynomials） play an important role in the design of modern cryptosystem. In this note the problem of counting the number of polynomial functions over finite commutative rings is discussed. Let A be a general finite commutative local ring. Under a certain condition, the counting formula of the number of polynomial functions over A is obtained. Before this paper, some results over special finite commutative rings were obtained by many authors.

On Polynomial Functions over Finite Commutative Rings

Let R be an arbitrary finite commutative local ring. In this paper, we obtain a necessary and sufficient condition for a function over R to be a polynomial function. Before this paper, necessary and sufficient conditions for a function to be a polynomial function over some special finite commutative local rings were obtained.

Extended Kantorovich method for local stresses in composite laminates upon polynomial stress functions

The extended Kantorovich method is employed to study the local stress concentrations at the vicinity of free edges in symmetrically layered composite laminates subjected to uniaxial tensile load upon polynomial stress functions. The stress fields are initially assumed by means of the Lekhnitskii stress functions under the plane strain state. Applying the principle of complementary virtual work,the coupled ordinary differential equations are obtained in which the solutions can be obtained by solving a generalized eigenvalue problem. Then an iterative procedure is established to achieve convergent stress distributions. It should be noted that the stress function based extended Kantorovich method can satisfy both the traction-free and free edge stress boundary conditions during the iterative processes. The stress components near the free edges and in the interior regions are calculated and compared with those obtained results by finite element method（FEM）. The convergent stresses have good agreements with those results obtained by three dimensional（3D） FEM. For generality, various layup configurations are considered for the numerical analysis. The results show that the proposed polynomial stress function based extended Kantorovich method is accurate and efficient in predicting the local stresses in composite laminates and computationally much more efficient than the 3D FEM.

Equality-constrained minimization of polynomial functions

This paper investigates the equality-constrained minimization of polynomial functions. Let R be the field of real numbers, and R[x1,..., xn] the ring of polynomials over R in variables x1,..., xn. For an f ∈ R[x1,..., xn] and a finite subset H of R[x1,..., xn], denote by V(f : H) the set {f( ˉα) | ˉα∈ Rn, and h( ˉα) =0, ? h ∈ H}. We provide an effective algorithm for computing a finite set U of non-zero univariate polynomials such that the infimum inf V(f : H) of V(f : H) is a root of some polynomial in U whenever inf V(f : H) = ±∞.The strategies of this paper are decomposing a finite set of polynomials into triangular chains of polynomials and computing the so-called revised resultants. With the aid of the computer algebraic system Maple, our algorithm has been made into a general program to treat the equality-constrained minimization of polynomials with rational coefficients.

Lacunary Generating Functions of Hybrid Type Polynomials in Viewpoint of Symbolic Approach

In this paper,we introduce mon-symbolic method to obtain the generating functions of the hybrid class of Hermite-associated Laguerre and its associated polynomials.We obtain the series definitions of these hybrid special polynomials.Also,we derive the double lacunary generating functions of the Hermite-Laguerre polynomials and the Hermite-Laguerre-Wright polynomials.Further,we find multiplicative and derivative operators for the Hermite-Laguerre-Wright polynomials which helps to find the symbolic differential equation of the Hermite-Laguerre-Wright polynomials.Some concluding remarks are also given.

ON HERMITE MATRIX POLYNOMIALS AND HERMITE MATRIX FUNCTIONS

In this paper properties of Hermite matrix polynomials and Hermite matrix functions are studied. The concept ot total set with respect to a matrix functional is introduced and the total property of the Hermite matrix polynomials is proved. Asymptotic behaviour of Hermite matrix polynomials is studied and the relationship of Hermite matrix functions with certain matrix differential equations is developed. A new expression of the matrix exponential for a wide class of matrices in terms of Hermite matrix polynomials is proposed.

Convergence Phenomenon with Fourier Series of tg(x2)and Alike

The Fourier series of the 2π-periodic functions tg(x2)and 1sin(x)and some of their relatives (first of their integrals) are investigated and illustrated with respect to their convergence. These functions are Generalized functions and the convergence is weak convergence in the sense of the convergence of continuous linear functionals defining them. The figures show that the approximations of the Fourier series possess oscillations around the function which they represent in a broad band embedding them. This is some analogue to the Gibbs phenomenon. A modification of Fourier series by expansion in powers cosn(x)for the symmetric part of functions and sin(x)cosn−1(x)for the antisymmetric part (analogous to Taylor series) is discussed and illustrated by examples. The Fourier series and their convergence behavior are illustrated also for some 2π-periodic delta-function-like sequences connected with the Poisson theorem showing non-vanishing oscillations around the singularities similar to the Gibbs phenomenon in the neighborhood of discontinuities of functions. .

Fuzzy smooth support vector machine with different smooth functions

Smooth support vector machine （SSVM） changs the normal support vector machine （SVM） into the unconstrained op- timization by using the smooth sigmoid function. The method can be solved under the Broyden-Fletcher-Goldfarb-Shanno （BFGS） algorithm and the Newdon-Armijio （NA） algorithm easily, however the accuracy of sigmoid function is not as good as that of polyno- mial smooth function. Furthermore, the method cannot reduce the influence of outliers or noise in dataset. A fuzzy smooth support vector machine （FSSVM） with fuzzy membership and polynomial smooth functions is introduced into the SVM. The fuzzy member- ship considers the contribution rate of each sample to the optimal separating hyperplane and makes the optimization problem more accurate at the inflection point. Those changes play a positive role on trials. The results of the experiments show that those FSSVMs can obtain a better accuracy and consume the shorter time than SSVM and lagrange support vector machine （LSVM）.

Multi-criteria classification approach with polynomial aggregation function and incomplete certain information

The relationship between the importance of criterion and the criterion aggregation function is discussed, criterion＇s weight and combinational weights between some criteria are defined, and a multi-criteria classification method with incomplete certain information and polynomial aggregation function is proposed. First, linear programming is constructed by classification to reference alternative set （assignment examples） and incomplete certain information on criterion＇s weights. Then the coefficient of the polynomial aggregation function and thresholds of categories are gained by solving the linear programming. And the consistency index of alternatives is obtained, the classification of the alternatives is achieved. The certain criteria＇s values of categories and uncertain criteria＇s values of categories are discussed in the method. Finally, an example shows the feasibility and availability of this method.

A Secure Anonymous Internet Electronic Voting Scheme Based on the Polynomial

In this paper, we use the polynomial function and Chaum＇s RSA （Rivest, Shamir, Adleman） blind signature scheme to construct a secure anonymous internet electronic voting scheme. In our scheme, each vote does not need to be revealed in the tallying phase. The ballot number of each candidate gets is counted by computing the degrees of two polynomials＇ greatest common divisor. Our scheme does not require a special voting channel and communication can occur entirely over the current internet.

ORTHOGONAL MATRIX POLYNOMIALS WITH RESPECT TO LINEAR MATRIX MOMENT FUNCTION ALS:THEORY AND APPLICATIONS

In this paper orthogonal matrix polynomials with respect to a right matrix moment functional an introduced. Basic results, important examples and applications to the approximation of matrix integrals are studied. Error bounds for the proposed matrix quadrature rules are given.

SIMULTANEOUSE APPROXIMATION TO A DIFFERENTIABLE FUNCTION AND ITS DERIVATIVES BY LAGRANGE INTERPOLATING POLYNOMIALS

This paper establishes the following pointwise result for simultancous Lagrange imterpolating approxima- tion:,then |f^(k)(x)-P_n^(k)(f,x)|=O(1)△_n^(q-k)(x)ω where P_n(f,x)is the Lagrange interpolating potynomial of deereeon the nodes X_nUY_n(see the definition of the next).

ORTHOGONAL MATRIX POLYNOMIALS WITH RESPECT TO A CONJUGATE BILINEAR MATRIX MOMENT FUNCTIONAL: BASIC THEORY

In this paper basic results for a theory of orthogonal matrix polynomials with respect to a conjugate bilinear matrix moment functional are proposed. Properties of orthogonal matrix polynomial sequences including a three term matrix relationship are given. Positive definite conjugate bilinear matrix moment functionals are introduced and a characterization of positive definiteness in terms of a block Haenkel moment matrix is established. For each positive definite conjugate bilinear matrix moment functional an associated matrix inner product is defined.

Prediction of Flexural Deformation of Reinforcement Concrete Beams with Polynomial Tension Stiffening Model

Based on an assumption of parabolic bond stress distribution,a simplified model with quartic polynomial function of the relative slip of steel bar and surrounding concrete for reinforced concrete (RC)tensile member was proposed. The post-cracking behavior as well as tension stiffening effect was considered in the new model. The relative slip of bending member could also be determined through the extension of the new model,which could be applied to obtaining the concentrated rotations at certain sections in order to predict the flexural deformation of RC beam. Several examples of four-point bending RC beams were approached to verify the new model,and the predictions of the flexural deflections of RC beams agreed well with experimental results. The new model can be extended to the application of partially corroded RC beam.

A polynomial smooth epsilon-support vector regression based on cubic spline interpolation

Regression analysis is often formulated as an optimization problem with squared loss functions. Facing the challenge of the selection of the proper function class with polynomial smooth techniques applied to support vector regression models, this study takes cubic spline interpolation to generate a new polynomial smooth function ｜×｜ε^ 2, in g-insensitive support vector regression. Theoretical analysis shows that Sε^2 -function is better than pε^2 -function in properties, and the approximation accuracy of the proposed smoothing function is two order higher than that of classical pε^2 -function. The experimental data shows the efficiency of the new approach.

The Polynomial Function Model in Born-Infeld Theory

Based on the Lagrangian action density under Born-Infeld type dynamics and motivated by the one-dimensional prescribed mean curvature equation,we investigate the polynomial function model in Born-Infeld theory in this paper with the form of-([10α(φ′)^(2)]φ′)′=λf(φ(x)),whereλ>0 is a real parameter,f∈C 2(0,+∞)is a nonlinear function.We are interested in the exact number of positive solutions of the above nonlinear equation.We specifically develop for the problem combined with a careful analysis of a time-map method.

Analytic Expression of Arbitrary Matrix Elements for Boson Exponential Quadratic Polynomial Operators

Making use of the transformation relation among usual, normal, and antinormal ordering for the multimode boson exponential quadratic polynomial operators （BEQPO＇s）I we present the analytic expression of arbitrary matrix elements for BEQPO＇s. As a preliminary application, we obtain the exact expressions of partition function about the boson quadratic polynomial system, matrix elements in particle-number, coordinate, and momentum representation, and P representation for the BEQPO＇s.

DIFFERENTIAL POLYNOMIALS SHARING ONE VALUE

In this paper, we investigate uniqueness problems of differential polynomials of meromorphic functions. Let a, b be non-zero constants and let n, k be positive integers satisfying n ≥ 3k ＋ 12. If f^n＋ af^（k）and g^n＋ ag^（k）share b CM and the b-points of f^n＋ af^（k）are not the zeros of f and g, then f and g are either equal or closely related.

ON APPROXIMATION OF A FUNCTION AND ITS DERIVATIVES BY A POLYNOMIAL AND ITS DERIVATIVES

Let g∈C^q[-1, 1] be such that g^((k))(±1)=0 for k=0,…,q. Let P_n be an algebraic polynomial of degree at most n, such that P_n^((k))(±1)=0 for k=0,…,[_2~ (q+1)]. Then P_n and its derivatives P_n^((k)) for k≤q well approximate g and its respective derivatives, provided only that P_n well approxi- mates g itself in the weighted norm ‖g(x)-P_n(x) (1-x^2)^(1/2)~q‖ This result is easily extended to an arbitrary f∈C^q[-1, 1], by subtracting from f the polynomial of minnimal degree which interpolates f^((0))…,f^((q)) at±1. As well as providing easy criteria for judging the simultaneous approximation properties of a given Polynomial to a given function, our results further explain the similarities and differences between algebraic polynomial approximation in C^q[-1, 1] and trigonometric polynomial approximation in the space of q times differentiable 2π-periodic functions. Our proofs are elementary and basic in character, permitting the construction of actual error estimates for simultaneous approximation proedures for small values of q.

ON SIMULTANEOUS APPROXIMATION TO A DIFFERENTIABLE FUNCTION AND ITS DERIVATIVE BY INVERSE PAL-TYPE INTERPOLATION POLYNOMIALS

Let ξn-1<ξn-2 <ξn-2 <… < ξ1 be the zeros of the the (n -1)-th Legendre polynomial Pn-1(x) and - 1 = xn < xn-1 <… < x1 = 1 the zeros of the polynomial W n(x) =- n(n - 1) Pn-1(t)dt = (1 -x2)P'n-1(x). By the theory of the inverse Pal-Type interpolation, for a function f(x) ∈ C[-1 1], there exists a unique polynomial Rn(x) of degree 2n - 2 (if n is even) satisfying conditions Rn(f,ξk) = f(∈ek)(1≤ k≤ n - 1) ;R'n(f,xk) = f'(xk)(1≤ k≤ n). This paper discusses the simultaneous approximation to a differentiable function f by inverse Pal-Type interpolation polynomial {Rn(f,x)} (n is even) and the main result of this paper is that if f ∈ C'[1,1], r≥2, n≥ + 2> and n is even thenholds uniformly for all x ∈ [- 1,1], where h(x) = 1 +