Thin sets of constant width

We prove that every Banach space which admits an unconditional basis can be renormed to contain a constant width set with empty interior, thus guaranteeing, for the first time, existence of such sets in a reflexive space. In the isometric case we prove that normal structure is characterized by the property that the class of diametrically complete sets and the class of sets with constant radius from the boundary coincide.     

Structure of the Space of Diametrically Complete Sets in a Minkowski Space

We study the structure of the space of diametrically complete sets in a finite dimensional normed space. In contrast to the Euclidean case, this space is in general not convex. We show that its starshapedness is equivalent to the completeness of the parallel bodies of complete sets, a property studied in Moreno and Schneider (Isr. J. Math. 2012, doi:10.1007/s11856-012-0003-6), which is generically not satisfied. The space in question is, however, always contractible. Our main result states that in the case of a polyhedral norm, the space of translation classes of diametrically complete sets of given diameter is a finite polytopal complex. The proof makes use of a diagram technique, due to P. McMullen, for the representation of translation classes of polytopes with given normal vectors. The paper concludes with a study of the extreme diametrically complete sets.     

A Generic relation on Recursively Enumerable Sets

We introduce the concept of a generic relation for algorithmic problems, which preserves the property of being decidable for a problem for almost all inputs and possesses the transitive property. As distinct from the classical m-reducibility relation, the generic relation under consideration does not possess the reflexive property: we construct an example of a recursively enumerable set that is generically incomparable with itself. We also give an example of a set that is complete with respect to the generic relation in the class of recursively enumerable sets.     

On the class of disjoint limited completely continuous operators

We introduce and study new class of sets (almost L-limited sets). Also, we introduce new concept of property in Banach lattice (almost Gelfand–Phillips property) and we characterize this property using almost L-limited sets. On the other hand, we introduce the class of disjoint limited completely continuous operators which is a largest class than that of limited completely continuous operators, we characterize this class of operators and we study some of its properties.     

Ultrafilters of measurable spaces as generalized solutions in abstract attainability problems

We consider problems of asymptotic analysis that arise, in particular, in the formalization of effects related to an approximate observation of constraints. We study nonsequential (generally speaking) variants of asymptotic behavior that can be formalized in the class of ultrafilters of an appropriate measurable space. We construct attraction sets in a topological space that are realized in the class of ultrafilters of the corresponding measurable space and specify conditions under which ultrafilters of a measurable space are sufficient for constructing the “complete” attraction set corresponding to applying ultrafilters of the family of all subsets of the space of ordinary solutions. We study a compactification of this space that is constructed in the class of Stone ultrafilters (ultrafilters of a measurable space with an algebra of sets) such that the attraction set is realized as a continuous image of the compact set of generalized solutions; we also study the structure of this compact set in terms of free ultrafilters and ordinary solutions that observe the constraints of the problem exactly. We show that, in the case when there are no exact ordinary solutions, this compact set consists of free ultrafilters only; i.e., it is contained in the remainder of the compactifier (an example is given showing that the similar property may be absent for other variants of the extension of the original problem).     

Uniqueness of completions and related topics

A bounded subset of a normed linear space is said to be (diametrically) complete if it cannot be enlarged without increasing the diameter. A complete super set of a bounded set K having the same diameter as K is called a completion of K. In general, a bounded set may have different completions. We study normed linear spaces having the property that there exists a nontrivial segment with a unique completion. It turns out that this property is strictly weaker than the property that each complete set is a ball, and it is strictly stronger than the property that each set of constant width is a ball. Extensions of this property are also discussed.     

An arithmetic of complete permutations with constraints, I: an exposition of the general theory

We develop an arithmetic of complete permutations of symmetric, integral bases; this arithmetic is comparable to that of perfect systems of difference sets with which there are several interrelations. Super-position of permutations provides the addition of this arithmetic. Addition if facilitated by complete permutations with a certain “splitting” property, allowing them to be pulled apart and reassembled. The split permutations also provide a singular direct product for complete permutations in conjunction with the multiplication (direct product) of the arithmetic which itself derives from that for perfect systems of difference sets.

We pay special attention to complete permutations satisfying constraints both fixed and variable; this is equivalent to embedding partial complete permutations in complete permutations. In the sequel, using this arithmetic, we investigate the spectra of certain constraints with respect to central integral bases which are of interest for the purpose of giving further constructions either of complete permutations with constraints or of irregular, extremel perfect systems of difference sets.     

The Myerson value for complete coalition structures

In order to describe partial cooperation structures, this paper introduces complete coalition structures as sets of feasible coalitions. A complete coalition structure has a property that, for any coalition, if each pair of players in the coalition belongs to some feasible coalition contained in the coalition then the coalition itself is also feasible. The union stable structures, which constitute the domain of the Myerson value, are a special class of the complete coalition structures. As an allocation rule on complete coalition structures, this paper proposes an extension of the Myerson value for complete coalition structures and provides an axiomatization.     

On the strong CE-property of convex sets

We consider a class of convex bounded subsets of a separable Banach space. This class includes all convex compact sets as well as some noncompact sets important in applications. For sets in this class, we obtain a simple criterion for the strong CE-property, i.e., the property that the convex closure of any continuous bounded function is a continuous bounded function. Some results are obtained concerning the extension of functions defined at the extreme points of a set in this class to convex or concave functions defined on the entire set with preservation of closedness and continuity. Some applications of the results in quantum information theory are considered.     

Best approximation properties in spaces of measurable functions

We research proximinality of μ‐sequentially compact sets and μ‐compact sets in measurable function spaces. Next we show a correspondence between the Kadec–Klee property for convergence in measure and μ‐compactness of the sets in Banach function spaces. Also the property S is investigated in Fréchet spaces and employed to provide the Kadec–Klee property for local convergence in measure. We discuss complete criteria for continuity of metric projection in Fréchet spaces with respect to the Hausdorff distance. Finally, we present the necessary and sufficient condition for continuous metric selection onto a one‐dimensional subspace in sequence Lorentz spaces .     

A concept of variety for regular biordered sets

We define a bivariety of regular biordered sets to be a nonempty class of regular biordered sets which is closed under taking direct products, regular bimorphic images and relatively regular biordered subsets. It is then shown that there is a complete lattice morphism mapping the complete lattice of all e-varieties of regular semigroups onto the complete lattice of all bivarieties of regular biordered sets; as a corollary we prove that there is a complete lattice morphism mapping the complete lattice of all e-varieties of E-solid regular semigroups onto the complete lattice of all varieties of solid binary algebras. Examples of bivarieties include the class of all solid regular biordered sets and the class of all local semilattices. For each setX with at least two elements, we show that a bivariety contains a free object onX if and only if it consists entirely of solid regular biordered sets or it consists entirely of local semilattices. The author gratefully acknowledges the financial support of an Australian Postgraduate Research Award.     

Inverse shadowing and related measures In Memory of Professor Shantao Liao

We study various weaker forms of the inverse shadowing property for discrete dynamical systems on a smooth compact manifold. First, we introduce the so-called ergodic inverse shadowing property(Birkhoff averages of continuous functions along an exact trajectory and the approximating one are close). We demonstrate that this property implies the continuity of the set of invariant measures in the Hausdorff metric. We show that the class of systems with ergodic inverse shadowing is quite broad; it includes all diffeomorphisms with hyperbolic nonwandering sets. Second, we study the so-called individual inverse shadowing(any exact trajectory can be traced by approximate ones, but this shadowing is not uniform with respect to the initial point of the trajectory).We demonstrate that this property is closely related to structural stability and ?-stability of diffeomorphisms.     

Player splitting in extensive form games

By a player splitting we mean a mechanism that distributes the information sets of a player among so-called agents. A player splitting is called independent if each path in the game tree contains at most one agent of every player. Following Mertens (1989), a solution is said to have the player splitting property if, roughly speaking, the solution of an extensive form game does not change by applying independent player splittings. We show that Nash equilibria, perfect equilibria, Kohlberg-Mertens stable sets and Mertens stable sets have the player splitting property. An example is given to show that the proper equilibrium concept does not satisfy the player splitting property. Next, we give a definition of invariance under (general) player splittings which is an extension of the player splitting property to the situation where we also allow for dependent player splittings. We come to the conclusion that, for any given dependent player splitting, each of the above solutions is not invariant under this player splitting. The results are used to give several characterizations of the class of independent player splittings and the class of single appearance structures by means of invariance of solution concepts under player splittings. Received: December 1996/Revised Version: January 2000     

Equiorthogonal Frequency Hypercubes: Preliminary Theory

Using a strong definition of frequency hypercube, we define a strengthened form of orthogonality, called equiorthogonality, for sets of such hypercubes. We prove that the maximum possible number of mutually equiorthogonal frequency hypercubes (MEFH) of order n and dimension d based on m distinct symbols is (n-1)^d/(m-1). A set of (n-1)^d/(m-1) such MEFH is called a complete set. Because of the stronger conditions on the hypercubes, we can find complete sets of MEFH of all lower dimensions within any complete set of MEFH; this useful property is not shared by sets of mutually orthogonal hypercubes using the usual, weaker definition.     

Tensor products and relation quantales

A classical tensor product \({A \otimes B}\) of complete lattices A and B, consisting of all down-sets in \({A \times B}\) that are join-closed in either coordinate, is isomorphic to the complete lattice Gal(A,B) of Galois maps from A to B, turning arbitrary joins into meets. We introduce more general kinds of tensor products for closure spaces and for posets. They have the expected universal property for bimorphisms (separately continuous maps or maps preserving restricted joins in the two components) into complete lattices. The appropriate ingredient for quantale constructions is here distributivity at the bottom, a generalization of pseudocomplementedness. We show that the truncated tensor product of a complete lattice B with itself becomes a quantale with the closure of the relation product as multiplication iff B is pseudocomplemented, and that the tensor product has a unit element iff B is atomistic. The pseudocomplemented complete lattices form a semicategory in which the hom-set between two objects is their tensor product. The largest subcategory of that semicategory has as objects the atomic boolean complete lattices, which is equivalent to the category of sets and relations. More general results are obtained for closure spaces and posets.     

Strengthened fixed point property and products in ordered sets

Strengthened fixed point property for ordered sets is formulated. It is weaker than the strong fixed point property due to Duffus and Sauer and stronger than the product property meaning that A × Y has the fixed point property whenever A has the former and Y has the latter. In particular, doubly chain complete ordered sets with no infinite antichain have the strengthened fixed point property whenever they have the fixed point property, which yields a transparent proof of the well-known theorem saying that doubly chain complete ordered sets with no infinite antichain have the product property whenever they have the fixed point property. The new proof does not require the axiom of choice. Presented at the Summer School on General Algebra and Ordered Sets, Malá Morávka, 4–10 September 2005.     

Linearly degenerate Hamiltonian PDEs and a new class of solutions to the WDVV associativity equations

We define a new class of solutions to the WDVV associativity equations. This class is determined by the property that one of the commuting PDEs associated with such a WDVV solution is linearly degenerate. We reduce the problem of classifying such solutions of the WDVV equations to the particular case of the so-called algebraic Riccati equation and, in this way, arrive at a complete classification of irreducible solutions.