Subspaces and quotients of Banach spaces with shrinking unconditional bases

The main result is that a separable Banach space with the weak* unconditional tree property is isomorphic to a subspace as well as a quotient of a Banach space with a shrinking unconditional basis. A consequence of this is that a Banach space is isomorphic to a subspace of a space with a shrinking unconditional basis if and only if it is isomorphic to a quotient of a space with a shrinking unconditional basis, which solves a problem dating to the 1970s. The proof of the main result also yields that a uniformly convex space with the unconditional tree property is isomorphic to a subspace as well as a quotient of a uniformly convex space with an unconditional finite dimensional decomposition.     

Scalarization of Henig Proper Efficient Points in a Normed Space

In a general normed space equipped with the order induced by a closed convex cone with a base, using a family of continuous monotone Minkowski functionals and a family of continuous norms, we obtain scalar characterizations of Henig proper efficient points of a general set and a bounded set, respectively. Moreover, we give a scalar characterization of a superefficient point of a set in a normed space equipped with the order induced by a closed convex cone with a bounded base.     

A generalized duality and applications

The aim of this paper is to present a nonconvex duality with a zero gap and its connection with convex duality. Since a convex program can be regarded as a particular case of convex maximization over a convex set, a nonconvex duality can be regarded as a generalization of convex duality. The generalized duality can be obtained on the basis of convex duality and minimax theorems. The duality with a zero gap can be extended to a more general nonconvex problems such as a quasiconvex maximization over a general nonconvex set or a general minimization over the complement of a convex set. Several applications are given.On leave from the Institute of Mathematics, Hanoi, Vietnam.     

Topological representation of posets

There is a canonical imbedding of a poset into a complete Boolean lattice and hence into a Boolean lattice. This gives it a representation as a collection of clopen sets of a Boolean space. There are reflective functions from a category of distributive posets to the subcategories of distributive and Boolean lattices and consequently a topological dual equivalence that extends the Stone duality of Boolean lattices.Presented by B. Jonsson.     

A pair of orthogonal frames

We start with a characterization of a pair of frames to be orthogonal in a shift-invariant space and then give a simple construction of a pair of orthogonal shift-invariant frames. This is applied to obtain a construction of a pair of Gabor orthogonal frames as an example. This is also developed further to obtain constructions of a pair of orthogonal wavelet frames.     

Harmonic and pulse excitations of multiply connected cylindrical bodies

The three-dimensional problem of the theory of elasticity of the harmonic oscillations of cylindrical bodies (a layer with several tunnel cavities on a cylinder of finite length) is considered for uniform mixed boundary conditions on its bases. Using the Φ-solutions constructed, the boundary-value problems are reduced to a system of well-known one-dimensional singular integral equations. The solution of the problem of the pulse excitation of a layer on the surface of a cavity is “assembled” from a packet of corresponding harmonic oscillations using an integral Fourier transformation with respect to time. The results of calculations of the dynamic stress concentration in a layer (a plate) weakened by one and two openings of different configuration are given, as well as the amplitude-frequency characteristics for a cylinder of finite length with a transverse cross section in the form of a square with rounded corners, and data of calculations for a trapeziform pulse, acting on the surface of a circular cavity, are presented.     

A recognition algorithm for the intersection graphs of directed paths in directed trees

Consider a finite family of non-empty sets. The intersection graph of this family is obtained by representing each set by a vertex, two vertices being connected by an edge if and only if the corresponding sets intersect. The intersection graph of a family of directed paths in a directed tree is called a directed path graph. In this paper we present an efficient algorithm which constructs to a given graph a representation by a family of directed paths on a directed tree, if one exists. Also, we prove that a graph is a proper directed path graph if and only if it is a directed path graph.     

A Priori and A Posteriori: A Bootstrapping Relationship

The distinction between a priori and a posteriori knowledge has been the subject of an enormous amount of discussion, but the literature is biased against recognizing the intimate relationship between these forms of knowledge. For instance, it seems to be almost impossible to find a sample of pure a priori or a posteriori knowledge. In this paper, it will be suggested that distinguishing between a priori and a posteriori is more problematic than is often suggested, and that a priori and a posteriori resources are in fact used in parallel. We will define this relationship between a priori and a posteriori knowledge as the bootstrapping relationship. As we will see, this relationship gives us reasons to seek for an altogether novel definition of a priori and a posteriori knowledge. Specifically, we will have to analyse the relationship between a priori knowledge and a priori reasoning, and it will be suggested that the latter serves as a more promising starting point for the analysis of aprioricity. We will also analyse a number of examples from the natural sciences and consider the role of a priori reasoning in these examples. The focus of this paper is the analysis of the concepts of a priori and a posteriori knowledge rather than the epistemic domain of a posteriori and a priori justification.     

Preservation of the existence of fixed and coincidence points under homotopy of mappings of ordered sets

In problems of topology and analysis, well-known theorem on the preservation by any continuous homotopy of the property of a mapping to have a fixed point and the property of a pair of mappings to have a coincidence point are extensively applied. Thus, for contraction mappings and some of their generalizations, Frigon’s results on the preservation of the property to have a fixed point by a homotopy of a special type are known. This paper presents theorems on the preservation by order homotopy of the property of a pair of mappings to have a coincidence point. As a corollary, conditions under which such a homotopy preserves the property of a mapping to have a fixed point are obtained.     

Two questions on semi-clean group rings

It was proved in [4] that every group ring of a torsion abelian group over a commutative local ring is a semi-clean ring. It was asked in [4] whether every group ring of a torsion abelian group over a commutative clean ring is a semi-clean ring and whether every group ring of a torsion abelian group over a commutative semi-clean ring is a semi-clean ring. In this paper, we give a positive answer to question 1 and a negative answer to question 2.     

New parameters of subsets in polynomial association schemes

We define new parameters, a zero interval and a dual zero interval, of subsets in P- or Q-polynomial association schemes. A zero interval of a subset in a P-polynomial association scheme is a successive interval index for which the inner distribution vanishes, and a dual zero interval of a subset in a Q-polynomial association scheme is a successive interval index for which the dual inner distribution vanishes. We derive bounds of the lengths of a zero interval and a dual zero interval using the degree and dual degree respectively, and show that a subset in a P-polynomial association scheme (resp. a Q-polynomial association scheme) having a large length of a zero interval (resp. a dual zero interval) induces a completely regular code (resp. a Q-polynomial association scheme). Moreover, we consider the spherical analogue of a dual zero interval.     

The stress state of an elastic composite cone with centre of rotation at the apex

The torsion of a composite cone that has a centre of rotation at its apex is investigated in a spherical system of coordinates. A composite cone is a cone with one shear modulus, inserted into a conical funnel having another shear modulus and with ideal mechanical contact between its surface and the inner surface of the conical funnel. The auxiliary problem of a composite cone with its apex truncated by a spherical surface is considered first. The outer surface of such a conical body is not loaded, but a load that reduces to a torque is applied to its spherical surface. The auxiliary problem is reduced to a one-dimensional discontinuous boundary-value problem using a specially constructed integral transformation. The exact solution of this boundary-value problem is constructed. The limit is then taken in the solution obtained as the radius of the spherical surface tends to zero for the purpose of obtaining an exact solution of the problem of the torsion of a composite cone that has a centre of rotation at the apex.     

Remarks on pseudo-valuation rings

A prime ideal P of a ring A is said to be a strongly prime ideal if aP and bA are comparable for all a,b ε A. We shall say that a ring A is a pseudo-valuation ring (PVR) if each prime ideal of A is a strongly prime ideal. We show that if A is a PVR with maximal ideal M, then every overring of A is a PVR if and only if M is a maximal ideal of every overring of M that does not contain the reciprocal’of any element of M.We show that if R is an atomic domain and a PVD, then dim(R) ≤ 1. We show that if R is a PVD and a prime ideal of R is finitely generated, then every overring of R is a PVD. We give a characterization of an atomic PVD in terms of the concept of half-factorial domain.     

A relaxed extragradient-like method for a generalized mixed equilibrium problem,a general system of generalized equilibria and a fixed point problem

Very recently, Takahashi and Takahashi [S. Takahashi, W. Takahashi, Strong convergence theorem for a generalized equilibrium problem and a nonexpansive mapping in a Hilbert space, Nonlinear Anal. 69 (2008) 1025–1033] suggested and analyzed an iterative method for finding a common solution of a generalized equilibrium problem and a fixed point problem of a nonexpansive mapping in a Hilbert space. In this paper, based on Takahashi–Takahashi’s iterative method and well-known extragradient method we introduce a relaxed extragradient-like method for finding a common solution of a generalized mixed equilibrium problem, a general system of generalized equilibria and a fixed point problem of a strictly pseudocontractive mapping in a Hilbert space and then obtain a strong convergence theorem. Utilizing this theorem, we establish some new strong convergence results in fixed point problems, variational inequalities, mixed equilibrium problems and systems of generalized equilibria.     

Nonlinear Chebyshev approximation to set-valued functions

In this paper, we give a characterization of best Chebyshev approximation to set-valued functions from a family of continuous functions with the weak betweeness property. As a consequence, we obtain a characterization of Kolmogorov type for best simultaneous approximation to an infinity set of functions. We introduce the concept of a set-sun and give a characterization of it. In addition, we prove a property of Amir–Ziegler type for a family of real functions and we get a characterization of best simultaneous approximation to two functions     

Knuth’s Coherent Presentations of Plactic Monoids of Type A

We construct finite coherent presentations of plactic monoids of type A. Such coherent presentations express a system of generators and relations for the monoid extended in a coherent way to give a family of generators of the relations amongst the relations. Such extended presentations are used for representations of monoids, in particular, it is a way to describe actions of monoids on categories. Moreover, a coherent presentation provides the first step in the computation of a categorical cofibrant replacement of a monoid. Our construction is based on a rewriting method introduced by Squier that computes a coherent presentation from a convergent one. We compute a finite coherent presentation of a plactic monoid from its column presentation and we reduce it to a Tietze equivalent one having Knuth’s generators.     

Staircase Parameterization in Dynamical Selection

This paper deals with a variant of a dynamical selection scheme introduced by Attouch and Cominetti for ill-posed convex minimization which combines approximation with the steepest descent method by mean of a suitable parameterization of the approximation parameter as a function of the time. This variant applies to a general inclusion with a maximal monotone operator by mean of a staircase parameterization. A discrete analogue is also considered. Applications to selecting a particular zero of a maximal monotone operator or a particular fixed point of a nonexpansive mapping via regularization techniques are presented. Finally, the alternative use of well-posedness by perturbations is discussed.     

Counting matrices over finite fields having a given number of rows of unit weight

We present a formula enumerating matrices over a finite field of a given rank and a given number of rows of unit weight, i.e., each having a single nonzero entry. We also determine the number of subspaces of a given dimension containing a given number of vectors of unit weight.