The number of limit cycles of cubic Hamiltonian system with perturbation

In this paper, by using qualitative analysis, we investigate the number of limit cycles of perturbed cubic Hamiltonian system with perturbation in the form of (2n+2m) or (2n+2m+1)th degree polynomials . We show that the perturbed systems has at most (n+m) limit cycles, and has at most n limit cycles if m=1. If m=1, n=1 and m=1, n=2, the general conditions for the number of existing limit cycles and the stability of the limit cycles will be established, respectively. Such conditions depend on the coefficients of the perturbed terms. In order to illustrate our results, two numerical examples on the location and stability of the limit cycles are given.     

A path-following procedure to find a proper equilibrium of finite games

We propose a procedure to find a proper equilibrium of finiten-person games, which was introduced by Myerson as a refinement of perfect equilibrium. The procedure is a new variable dimension fixed point algorithm having Π _i ^=1/n m _i ! directions in which it may leave the starting point, wherem _i is the number of thei-th player's pure strategies.     

Functions with derivatives given by polynomials in the function itself or a related function

We construct the set of holomorphic functions S ₁ = {f: Ω_f ? ? → ?} whose members have n-th order derivatives which are given by a polynomial of degree n+1 in the function itself. We also construct the set of holomorphic functions S ₂ = {g: Ω_g ? ? → ?} whose members have n-th order derivatives which are given by the product of the function itself with a polynomial of degree n in an element of S ₁. The union S ₁ ∪ S ₂ contains all the hyperbolic and trigonometric functions. We study the properties of the polynomials involved and derive explicit expressions for them. As particular results, we obtain explicit and elegant formulas for the n-th order derivatives of the hyperbolic functions tanh, sech, coth and csch and the trigonometric functions tan, sec, cot and csc.     

On the enumeration of polynomials with prescribed factorization pattern

We use generating functions over group rings to count polynomials over finite fields with the first few coefficients and a factorization pattern prescribed. In particular, we obtain different exact formulas for the number of monic n-smooth polynomials of degree m over a finite field, as well as the number of monic n-smooth polynomials of degree m with the prescribed trace coefficient.     

On the root closedness of continuous function algebras

For a compact Hausdorff space X, C(X) denotes the algebra of all complex-valued continuous functions on X. For a positive integer n, we say that C(X) is n-th root closed if, for each f∈C(X), there exists g∈C(X) such that f=gn. It is shown that, for each integer m?2, there exists a compact Hausdorff space Xm such that C(Xm) is m-th root closed, but not n-th root closed for each integer n relatively prime to m. This answers a question posed by Countryman Jr. [R.S. Countryman Jr., On the characterization of compact Hausdorff X for which C(X) is algebraically closed, Pacific J. Math. 20 (1967) 433-438] et al.     

An analytical formula for pricing m-th to default swaps

The computational effort of pricing an m-th to default swap depends highly on the size n of the underlying basket. Usually, n different default times are modeled, but in fact the valuation only depends on the m-th smallest default time of this tuple. In this paper we attain an analytical formula for the distribution of this m-th default time. With the help of this distribution we simplify the valuation problem from an n-dimensional quadrature to a one-dimensional quadrature and break the curse of dimensionality. Applications of this modification are efficient pricing of m-th to default swaps, estimation of sensitivities and pricing of European max/min options.     

Chebyshev polynomials on a system of curves

This paper is devoted to the problem of how close can one get with the n-th Chebyshev numbers of a compact set ?? to the theoretical lower bound cap(??) ⁿ . It is shown that for a system of m ?? 2 analytic curves, there is always a subsequence for which the Chebyshev numbers are at least (1 + ??)cap(??) ⁿ , while for another subsequence they are at most (1 + O(n ^?1/(m?1)))cap(??) ⁿ . It is also shown that the last estimate is optimal. We also discuss how well a system of curves can be approximated by lemniscates in Hausdorff metric. The proofs are based on potential theoretical arguments. Simultaneous Diophantine approximation of harmonic measures lies in the background. To achieve the correct rate, a perturbation of the multi-valued complex Green??s function is introduced which makes the n-th power of its exponential single-valued and which allows the construction of Faber-like polynomials on multiply connected domains.     

On the existence of invariant tori in nearly-integrable Hamiltonian systems with finitely differentiable perturbations

We prove the existence of invariant tori in Hamiltonian systems, which are analytic and integrable except a 2n-times continuously differentiable perturbation (n denotes the number of the degrees of freedom), provided that the moduli of continuity of the 2n-th partial derivatives of the perturbation satisfy a condition of finiteness (condition on an integral), which is more general than a Hölder condition. So far the existence of invariant tori could be proven only under the condition that the 2n-th partial derivatives of the perturbation are Hölder continuous.     

Zero sets of polynomials in finite rings

In a field, of course, ann-th degree polynomial has at mostn zeros. Is there anything like this in rings? We find: ann-th degree polynomial in a finite ringA, ofr elements, that is not zero everywhere inA is non-zero at leastr/2 ⁿ times. This is sharp for alln, even in commutative rings; perhaps also in unitary rings, though examples are lacking beyond the cubic case. However, the best such result for commutative unitary rings (not determined pastn=3) is better; (2/2 ⁿ )r is proved, and the best coefficient is between that and its square root.     

Computation of bifurcation manifolds of linearly independent homoclinic orbits

Regarding the small perturbation as a parameter in an appropriate space of functions, we can discuss co-existence of homoclinic orbits for non-autonomous perturbations of an autonomous system in Rn and describe conditions of parameters for such degenerate homoclinic bifurcations with some bifurcation manifolds of infinite dimension. Since those manifolds determine the relation among parameters for such bifurcations, in this paper we give an algorithm to compute approximately those manifolds and concretely obtain their first order approximates.     

Linearly independent homoclinic bifurcations parameterized by a small function

In this paper we discuss a small nonautonomous perturbation of an autonomous system on Rn which has a homoclinic solution. Regarding the small perturbation as a parameter in an appropriate space of functions we discuss various situations of co-existence of homoclinic orbits. Those conditions of various co-existence actually define bifurcation manifolds in the space of functions for linearly independent homoclinic bifurcations.     

Smoothing noisy data with spline functions

It is shown how to choose the smoothing parameter when a smoothing periodic spline of degree 2m?1 is used to reconstruct a smooth periodic curve from noisy ordinate data. The noise is assumed “white”, and the true curve is assumed to be in the Sobolev spaceW ₂ ^(2m) of periodic functions with absolutely continuousv-th derivative,v=0, 1, ..., 2m?1 and square integrable 2m-th derivative. The criteria is minimum expected square error, averaged over the data points. The dependency of the optimum smoothing parameter on the sample size, the noise variance, and the smoothness of the true curve is found explicitly.     

Limit periodic motions in some systems with aftereffect under resonance condition

Volterra-type integrodifferential equations and their solutions are considered which, when the time increases without limit, exponentially tend to periodic modes. In the critical case of stability, when the characteristic equation has a pair of pure imaginary roots and the remaining roots have negative real parts, the problem of the existence of limit periodic solutions with resonance, caused by coincidence between the periodic part of the limit external periodic perturbation and the natural frequency of the linearized system, is solved. It is shown that, if the right-hand side of the equation is an analytic function and the existence of limit periodic solutions is determined by terms of the (2m + 1)-th order, these solutions are represented by power series in the arbitrary initial values of the non-critical variables and the parameter μ^1/(2m+1), where μ is a small parameter, characterizing the magnitude of the maximum external periodic perturbation. The amplitude equations are presented.     

A refinement of Cusick-Cheon bound for the second order binary Reed-Muller code

We prove a stronger form of the conjectured Cusick-Cheon lower bound for the number of quadratic balanced Boolean functions. We also prove various asymptotic results involving B(k,m), the number of balanced Boolean functions of degree ≤k in m variables, in the case k=2. Finally, we connect our results for k=2 with the (still unproved) conjectures of Cusick-Cheon for the functions B(k,m) with k>2.     

Pseudospectra, critical points and multiple eigenvalues of matrix polynomials

We develop a general framework for perturbation analysis of matrix polynomials. More specifically, we show that the normed linear space L_m(C^n×n) of n-by-n matrix polynomials of degree at most m provides a natural framework for perturbation analysis of matrix polynomials in L_m(C^n×n). We present a family of natural norms on the space L_m(C^n×n) and show that the norms on the spaces C^m+1 and C^n×n play a crucial role in the perturbation analysis of matrix polynomials. We define pseudospectra of matrix polynomials in the general framework of the normed space L_m(C^n×n) and show that the pseudospectra of matrix polynomials well known in the literature follow as special cases. We analyze various properties of pseudospectra in the unified framework of the normed space L_m(C^n×n). We analyze critical points of backward errors of approximate eigenvalues of matrix polynomials and show that each critical point is a multiple eigenvalue of an appropriately perturbed polynomial. We show that common boundary points of components of pseudospectra of matrix polynomials are critical points. As a consequence, we show that a solution of Wilkinson’s problem for matrix polynomials can be read off from the pseudospectra of matrix polynomials.     

Bifurcation set and distribution of limit cycles for a class of cubic Hamiltonian system with higher-order perturbed terms

A class of cubic Hamiltonion system with the higher-order perturbed term of degree n=5, 7, 9, 11, 13 is investigated. We find that there exist at least 13 limit cycles with the distribution C¹₉⊃2[C²₃⊃2C²₂] (let C_m^k denote a nest of limit cycles which encloses m singular points, and the symbol `⊂' is used to show the enclosing relations between limit cycles, while the sign `+' is used to divide limit cycles enclosing different critical points. Denote simply C_m^k+C_m^k=2C_m^k, etc.) in the Hamiltonian system under the perturbed term of degree 7, and give the complete bifurcation diagrams and classification of the phase portraits by using bifurcation theory and qualitative method and numerical simulations. These results in this paper are useful for the study of the weaken Hilbert 16th problem.     

Continuity of iteration and approximation of iterative roots

Motivated by computing iterative roots for general continuous functions, in this paper we prove the continuity of the iteration operators T_n, defined by T_nf=fⁿ. We apply the continuity and introduce the concept of continuity degree to answer positively the approximation question: If lim_m→∞F_m=F, can we find an iterative root f_m of F_m of order n for each m∈N such that the sequence (f_m) tends to the iterative root of F of order n associated with a given initial function? We not only give the construction of such an approximating sequence (f_m) but also illustrate the approximation of iterative roots with an example. Some remarks are presented in order to compare our approximation with the Hyers-Ulam stability.     

Several classes of even-variable 1-resilient rotation symmetric Boolean functions with high algebraic degree and nonlinearity

Recent research shows that the class of rotation symmetric Boolean functions is potentially rich in functions of cryptographic significance. In this paper, some classes of 2m-variable (m is an odd integer) 1-resilient rotation symmetric Boolean functions are got, whose nonlinearity and algebraic degree are studied. For the first time, we obtain 2m-variable 1-resilient rotation symmetric Boolean functions having high nonlinearity and optimal algebraic degree. In addition, we obtain a class of non-linear rotation symmetric 1-resilient function for every $n\ge 5$, and a class of quadratic rotation symmetric $(k?1)$-resilient function of $n=3k$ variables, where k is an integer.     

On generalized m-th root finsler metrics

In this paper, we characterize locally dually flat generalized m-th root Finsler metrics. Then we find a condition under which a generalized m-th root metric is projectively related to a m-th root metric. Finally, we prove that if a generalized m-th root metric is conformal to a m-th root metric, then both of them reduce to Riemannian metrics.