A new transvectant algorithm for nilpotent normal forms

We offer an algorithm to determine the form of the normal form for a vector field with a nilpotent linear part, when the form of the normal form is known for each Jordan block of the linear part taken separately. The algorithm is based on the notion of transvectant, from classical invariant theory.     

A nonlinear functional for general scalar hyperbolic conservation laws

A generalized entropy functional was introduced in [T.-P. Liu, T. Yang, A new entropy functional for scalar conservation laws, Comm. Pure Appl. Math. 52 (1999) 1427-1442] for the scalar hyperbolic conservation laws with convex flux function. This functional was crucially used in the functional approach to the L¹ stability study on the system of hyperbolic conservation laws when each characteristic field is either genuinely nonlinear or linearly degenerate. However, how to construct the generalized entropy functional for scalar conservation laws with general flux, and then how to apply the functional approach to the L¹ study on general systems are still open. In this paper, we construct a new nonlinear functional which gives some partial answer to this question and we expect the analysis will shed some light on the future investigation in this direction.     

Boundary feedback stabilization of the undamped Timoshenko beam with both ends free

In this paper, we study a boundary feedback system of a class of nonuniform undamped Timoshenko beam with both ends free. We give some sufficient conditions and some necessary conditions for the system to have exponential stability. Our method is based on the operator semigroup technique, the multiplier technique, and the contradiction argument of the frequency domain method.     

Convergence of iterates with errors of asymptotically quasi-nonexpansive mappings and applications

In this paper, we consider a generalized iterative process with errors to approximate the common fixed points of two asymptotically quasi-nonexpansive mappings. A convergence theorem has been obtained which generalizes a known result. This theorem has then been used to prove another convergence theorem which, in turn, generalizes a number of results.     

Fixed point theorems for better admissible multimaps on almost convex sets

We obtain new fixed point theorems on multimaps in the class Bp defined on almost convex subsets of topological vector spaces. Our main results are applied to deduce various fixed point theorems, coincidence theorems, almost fixed point theorems, intersection theorems, and minimax theorems. Consequently, our new results generalize well-known works of Kakutani, Fan, Browder, Himmelberg, Lassonde, and others.     

On the normalized eigenvalue problems for nonlinear elliptic operators II

This paper continues our previous research on the following form of normalized eigenvalue problem

     

Strong characterizing sequences of countable groups

András Biró and Vera Sós prove that for any subgroup G of T generated freely by finitely many generators there is a sequence A⊆N such that for all β∈T we have (‖.‖ denotes the distance to the nearest integer)

     

Two new transformation formulas of basic hypergeometric series

By means of a modified version of Cauchy's method for obtaining bilateral series identities, two new transformation formulas for bilateral basic hypergeometric series are derived. These contain several important identities for basic hypergeometric series as special cases, including the nonterminating q-Saalschütz summation, Bailey's very well-poised summation and the nonterminating Watson transformation.     

Turán's theorem for pseudo-random graphs

The generalized Turán number ex(G,H) of two graphs G and H is the maximum number of edges in a subgraph of G not containing H. When G is the complete graph Km on m vertices, the value of ex(Km,H) is , where o(1)→0 as m→∞, by the Erd?s-Stone-Simonovits theorem.In this paper we give an analogous result for triangle-free graphs H and pseudo-random graphs G. Our concept of pseudo-randomness is inspired by the jumbled graphs introduced by Thomason [A. Thomason, Pseudorandom graphs, in: Random Graphs '85, Poznań, 1985, North-Holland, Amsterdam, 1987, pp. 307-331. MR 89d:05158]. A graph G is (q,β)-bi-jumbled if