On the Growth of Components of Meromorphic Solutions of Systems of Complex Differential Equations

This paper investigates the problem of the growth of the components of meromorphic solutions of a class of a system of complex algebraic differential equations, and generalized some of N. Toda＇s results concerning the growth of differential equations to the case of systems of differential equations. The paper considers the existence of admissible solutions of the system of differential equations.     

THE GROWTH OF SOLUTIONS OF SYSTEMS OF COMPLEX NONLINEAR ALGEBRAIC DIFFERENTIAL EQUATIONS

We investigate the problem of growth order of solutions of a type of systems of non-linear algebraic differential equations, and extend some results of the growth order of solutions of algebraic differential equations to systems of algebraic differential equations.     

On solving equations of algebraic sum of equal powers

It is well known that a system of equations of sum of equal powers can be converted to an algebraic equation of higher degree via Newton's identities. This is the Viete-Newton theorem. This work reports the generalizations of the Viete-Newton theorem to a system of equations of algebraic sum of equal powers. By exploiting some facts from algebra and combinatorics, it is shown that a system of equations of algebraic sum of equal powers can be converted in a closed form to two algebraic equations, whose degree sum equals the number of unknowns of the system of equations of algebraic sum of equal powers.     

Topological Structure of Non-wandering Set of a Graph Map

Let G be a graph （i.e., a finite one-dimensional polyhedron） and f ： G → G be a continuous map. In this paper, we show that every isolated recurrent point of f is an isolated non-wandering point; every accumulation point of the set of non-wandering points of f with infinite orbit is a two-order accumulation point of the set of recurrent points of f; the derived set of an ω-limit set of f is equal to the derived set of an the set of recurrent points of f; and the two-order derived set of non-wandering set of f is equal to the two-order derived set of the set of recurrent points of f.     

拟线性可化约的双曲型方程组的奇性分析

In this paper we investigate the formation of singularities of hyperbolic systems. Employing the method of parametric coordinates and the existence of the solution of the blow-up system, we prove that the blow-up of classic solutions is due to the envelope of characteristics of the same family, analyze the geometric properties of the envelope of characteristics and estimate the blowup rates of the solution precisely.     

EXTREMES OF RATIOS OF DETERMINANTS AND CANONICAL CORRELATION VARIABLES

This article develops some extremes of the ratios of determinants. The results are themultivariate extensions of the extremes of quadratic forms, and can be applied to finding thecanonicai correlation variables of two random vectors. Hence a group of canonical correlationvariables is a solution of the extreme of the ratio of determinants.     

Bifurcation of Equilibria in a Class of Planar Piecewise Smooth Systems with 3 Parameters

The goal of this paper is to investigate the bifurcation properties of stationary points of a class of planar piecewise smooth systems with 3 parameters using the theory of differential inclusions. We especially study the existence of the stationary points on the line of discontinuity of this kind of planar piecewise smooth system.     

An algorithm for decomposing a polynomial system into normal ascending sets

We present an algorithm to decompose a polynomial system into a finite set of normal ascending sets such that the set of the zeros of the polynomial system is the union of the sets of the regular zeros of the normal ascending sets.If the polynomial system is zero dimensional,the set of the zeros of the polynomials is the union of the sets of the zeros of the normal ascending sets.     

ESTIMATES OF N-FUNCTION AND m-FUNCTION OF MEROMORPHIC SOLUTIONS OF SYSTEMS OF COMPLEX DIFFERENCE EQUATIONS

We apply Nevanlinna theory of the value distribution of meromorphic functions to study the properties of Nevanlinna counting function and proximity function of meromorphic solutions of a type of systems of complex difference equations. Our results can give estimates on the proximity function and the counting function of solutions of systems of difference equations. This implies that solutions have a relatively large number of poles. It extend some result concerning difference equations to the systems of difference equations.     

The Order of Hypersubstitutions of Type （2, 2）

Hypersubstitutions are mappings which map operation symbols to terms of the corresponding arities. They were introduced as a way of making precise the concept of a hyperidentity and generalizations to M-hyperidentities. A variety in which every identity is satisfied as a hyperidentity is called solid. If every identity is an M-hyperidentity for a subset M of the set of all hypersubstitutions, the variety is called M-solid. There is a Galois connection between monoids of hypersubstitutions and sublattices of the lattice of all varieties of algebras of a given type. Therefore, it is interesting and useful to know how semigroup or monoid properties of monoids of hypersubstitutions transfer under this Galois connection to properties of the corresponding lattices of M-solid varieties. In this paper, we study the order of each hypersubstitution of type （2, 2）, i.e., the order of the cyclic subsemigroup generated by that hypersubstitution of the monoid of all hypersubstitutions of type （2, 2）. The main result is that the order is 1, 2, 3, 4 or infinite.     

Solutions of minimal period for a semilinear wave equation

In questo lavoro si considera il problema

Eigenvalues of the Dirac operator in the continuous spectrum

Functionsp(x) andq(x) for which the Dirac operator $$Dy = \left( {\begin{array}{*{20}c} {\begin{array}{*{20}c} 0 \\ { - 1} \\ \end{array} } & {\begin{array}{*{20}c} 1 \\ 0 \\ \end{array} } \\ \end{array} } \right)\frac{{dy}}{{dx}} + \left( {\begin{array}{*{20}c} {p(x) q(x)} \\ {q(x) - p(x)} \\ \end{array} } \right)y = \lambda y, y = \left( {\begin{array}{*{20}c} {y_1 } \\ {y_2 } \\ \end{array} } \right), y_1 (0) = 0,$$ has a countable number of eigenvalues in the continuous spectrum are constructed.     

The formula for the number of order-preserving selfmappings of a fence

LetY be a fence of sizem andr=?m?1/2?. The numberb(m) of order-preserving selfmappings ofY is equal toA _r-B_r-C_r-D_r, where, ifm is odd, $$\begin{gathered} A_r = 2(r + 1)\sum\limits_{s = 0}^r {\left( {\begin{array}{*{20}c} {r + s} \\ {2s} \\ \end{array} } \right)} 4^s , B_r = 2r\sum\limits_{s = 1}^r {\left( {\begin{array}{*{20}c} {r + s} \\ s \\ \end{array} } \right)\left( {\begin{array}{*{20}c} {r - 1} \\ {s - 1} \\ \end{array} } \right),} \hfill \\ C_r = 4r\sum\limits_{s = 0}^{r - 1} {\left( {\begin{array}{*{20}c} {r + s} \\ s \\ \end{array} } \right)\left( {\begin{array}{*{20}c} {r - 1} \\ s \\ \end{array} } \right), D_r = \sum\limits_{s = 0}^{r - 1} {(2s + 1)} \left( {\begin{array}{*{20}c} {r + s - 1} \\ s \\ \end{array} } \right)\left( {\begin{array}{*{20}c} {r - 1} \\ s \\ \end{array} } \right)} \hfill \\ \end{gathered} $$ . Ifm is even, a similar formula forb(m) is true. The key trick in the proof is a one-to-one correspondence between order-preserving selfmappings ofY and pairs consisted of a partition ofY and a strictly increasing mapping of a subfence ofY toY.     

Inclusion-exclusion inequalities

Ifμ is a positive measure, andA ₂, ...,A _n are measurable sets, the sequencesS ₀, ...,S _n andP _[0], ...,P _[n] are related by the inclusion-exclusion equalities. Inequalities among theS _i are based on the obviousP _[k]≧0. Letting =the average average measure of the intersection ofk of the setsA _i , it is shown that (−1) ^k Δ ^k M _i ≧0 fori+k≦n. The casek=1 yields Fréchet’s inequalities, andk=2 yields Gumbel’s and K. L. Chung’s inequalities. Generalizations are given involvingk-th order divided differences. Using convexity arguments, it is shown that forS ₀=1, whenS ₁≧N−1, and for 1≦k<N≦n andv=0, 1, .... Asymptotic results asn → ∞ are obtained. In particular it is shown that for fixedN, for all sequencesM ₀, ...,M _n of sufficiently large length if and only if for 0<t<1.     

Branching inset entropies on open domains

The forms of all semisymmetric, branching, multidimensional measures of inset information on open domains are determined. This is done for both the complete and the possibly incomplete partition cases. The key to these results is to find the general solution of the functional equation

Multiple periodic solutions of a superlinear forced wave equation

We study the existence of forced vibrations of nonlinear wave equation: (*) $$\begin{array}{*{20}c} {u_{tt} - u_{xx} + g(u) = f(x,t),} & {(x,t) \in (0,\pi ) \times R,} \\ {\begin{array}{*{20}c} {u(0,t) = u(\pi ,t) = 0,} \\ {u(x,t + 2\pi ) = u(x,t),} \\ \end{array} } & {\begin{array}{*{20}c} {t \in R,} \\ {(x,t) \in (0,\pi ) \times R,} \\ \end{array} } \\ \end{array}$$ whereg(ξ)∈C(R,R)is a function with superlinear growth and f(x, t) is a function which is 2π-periodic in t. Under the suitable growth condition on g(ξ), we prove the existence of infinitely many solution of (*) for any given f(x, t).     

Counting the number of isotone selfmappings of crowns

Letn>1. The number of all strictly increasing selfmappings of a 2n-element crown is . The number of all order-preserving selfmappings of a 2n-element crown is

On Existence and Multiplicity of Solutions for Elliptic Equations Involving the p-Laplacian

In the present paper, the following Dirichlet problem and Neumann problem involving the p-Laplacian

Matrix semigroups—generators and relations

Some presentations for the semigroups of all 2×2 matrices and all 2×2 matrices of determinant 0 or 1 over the field GF(p) (p prime) are given. In particular, if <a, b, c‖ R> is any (semigroup) presentation for the general linear group in terms of generators $$A = \left( {\begin{array}{*{20}c} 1 & 0 \\ 1 & 1 \\ \end{array} } \right),B = \left( {\begin{array}{*{20}c} 1 & 1 \\ 0 & 1 \\ \end{array} } \right),C = \left( {\begin{array}{*{20}c} 1 & 0 \\ 0 & \xi \\ \end{array} } \right),$$ where ζ is a primitive root of 1 modulop, then the presentation $$\langle a,b,c,t|R,t^2 = ct = tc = t,tba^{p - 1} t = 0,b^{\xi - 1} atb = a^{\xi - 1} tb^\xi a^{1 - \xi - 1} \rangle $$ defines the semigroup of all 2×2 matrices over GF (2,p) in terms of generatorsA, B, C and $$T = \left( {\begin{array}{*{20}c} 1 & 0 \\ 0 & 0 \\ \end{array} } \right).$$ Generating sets and ranks of various matrix semigroups are also found.     

On theq-log-concavity of Gaussian binomial coefficients

We give a combinatorial proof that is a polynomial inq with nonnegative coefficients for nonnegative integersa, b, k, l withab andlk. In particular, fora=b=n andl=k, this implies theq-log-concavity of the Gaussian binomial coefficients , which was conjectured byButler (Proc. Amer. Math. Soc. 101 (1987), 771–775).