Minimax Theorems Involving Two Functions and Strictly Monotone Transformations of Their Values

Two two-function minimax theorems are proved.The concavity-convexity conditions of the twofunctions involve strictly monotone transformations and mixing of the values of the two functions,and aredescribed by the inequalities as upward and weakly downward conditions.     

Inverse Piston Problem for the System of One-Dimensional Isentropic Flow

In this paper, the authors consider the inverse piston problem for the system of one-dimensional isentropic flow and obtain that, under suitable conditions, the piston velocity can be uniquely determined by the initial state of the gas on the right side of the piston and the position of the forward shock.     

Automatic continuity and representation of group homomorphisms defined between groups of continuous functions

Let C(X,G) be the group of continuous functions from a topological space X into a topological group G with pointwise multiplication as the composition law, endowed with the uniform convergence topology. To what extent does the group structure of C(X,G) determine the topology of X? More generally, when does the existence of a group homomorphism H between the groups C(X,G) and C(Y,G) implies that there is a continuous map h of Y into X such that H is canonically represented by h? We prove that, for any topological group G and compact spaces X and Y, every non-vanishing C-isomorphism (defined below) H of C(X,G) into C(Y,G) is automatically continuous and can be canonically represented by a continuous map h of Y into X. Some applications to specific groups and examples are given in the paper.     

On inequalities of Lieb-Thirring type

Applying the method proposed by Kashin for proving inequalities of Lieb-Thirring type for orthonormal systems, we prove a similar inequality in the multidimensional case.     

On a generalization of Pólya’s theorem

We consider generalizations of Pólya’s theorem to the case of entire functions taking algebraic values at natural or integer points.     

ISLAND, revisited

This paper is in answer to the comment on the GRG paper: Lockerbie N.A. Gen. Rel. Grav. 36, 593 (2004), made by A.V. Sanders, G.T. Gillies (ibid.). N. A. Lockerbie is a member of the STEP (Satellite Test of the Equivalence Principle) Science Study Team, and an Associate of the Institute for Gravitational Research at the University of Glasgow, Scotland, UK.     

Characterization of spherical particles using high-order neural networks and scanning flow cytometry

We retrieve the radius R, real n and imaginary k parts of the refractive index of homogeneous spherical particles using angular distribution of the light-scattering intensity. To solve the inverse light-scattering problem we use a high-order neural-network technique. The effect of network parameters on optimization is examined. The technique is evaluated for noise-corrupted input data at 0.6 μm<R<10.6 μm, 1.02<n<1.38, and 0<k<0.03. The errors of retrieval for nonabsorbing particles do not exceed 0.05 μm for radius and 0.015 for refractive index. The experimental verification is fulfilled by experimental data retrieved by means of a scanning flow cytometer. The light-scattering profiles of polystyrene beads and spherized red blood cells are processed with the high-order neural networks and a non-linear regression at Mie theory. The parameters retrieved by the high-order neural networks correlate well with the parameters retrieved by the least-square method.     

Nash Equilibria,Variational Inequalities,and Dynamical Systems

In this paper, we introduce some relationships between Nash equilibria, variational equilibria, and dynamical equilibria for noncooperative games.     

A simple solution of the van der Waerden permanent problem

The van der Waerden permanent problem was solved using mainly algebraic methods. A much simpler analytic proof is given using a new concept in optimization theory which may be of importance in the general theory of mathematical programming.     

Approximating Clarke’s subgradients of semismooth functions by divided differences

We show that the algorithm presented in an earlier paper by Studniarski (Numer. Math., 55:685–693, 1989) can be applied, after only a small modification, to approximate numerically Clarke’s subgradients of semismooth functions of two variables. Results of computational testing of this modified algorithm are also reported.