We show that for the case of uniformly convex Banach spaces, the conditions of Brøndsted’s fixed point theorem can be relaxed.

As a weak version of embedding flow, the problem of iterative roots is studied extensively in one dimension, especially in monotone case. There are few results in high dimensions because the constructive method dealing with monotone mappings is unavailable. In this paper, by introducing a kind of partial order, we define the monotonicity for two-dimensional mappings and then present some results on the existence of iterative roots for linear mappings, triangle-type mappings, and co-triangle-type mappings, respectively. Our theorems show that even the property of monotonicity for iterative roots of monotone mappings, which is a trivial result in one dimension, does not hold anymore in high dimensions. At the end of this paper, the problem of iterative roots for two well-known planar mappings, that is, Hénon mappings and coupled logistic mappings, are also discussed.

Given a non-negative integer n and a complete hereditary cotorsion triple , the notion of subcategories in an abelian category is introduced. It is proved that a virtually Gorenstein ring R is n-Gorenstein if and only if the subcategory of Gorenstein injective R-modules is with respect to the cotorsion triple , where stands for the subcategory of Gorenstein projectives. In the case when a subcategory of is closed under direct summands such that each object in admits a right -approximation, a Bazzoni characterization is given for to be . Finally, an Auslander–Reiten correspondence is established between the class of subcategories and that of certain subcategories of which are -coresolving covariantly finite and closed under direct summands.

Tabling is a powerful resolution mechanism for logic programs that captures their least fixed point semantics more faithfully than plain Prolog. In many tabling applications, we are not interested in the set of all answers to a goal, but only require an aggregation of those answers. Several works have studied efficient techniques, such as lattice-based answer subsumption and mode-directed tabling, to do so for various forms of aggregation.

While much attention has been paid to expressivity and efficient implementation of the different approaches, soundness has not been considered. This paper shows that the different implementations indeed fail to produce least fixed points for some programs. As a remedy, we provide a formal framework that generalises the existing approaches and we establish a soundness criterion that explains for which programs the approach is sound.

One partially ordered set, Q, is a Tukey quotient of another, P, if there is a map (a Tukey quotient) $\phi :P \to Q$ carrying cofinal sets of P to cofinal sets of Q. Two partial orders which are mutual Tukey quotients of each other are said to be Tukey equivalent. Let ${\cal D}_{\rm{}} $ be the partially ordered set of Tukey equivalence classes of directed sets of size $ \le {\rm{}}$. It is shown that ${\cal D}_{\rm{}} $ contains an antichain of size $2^{\rm{}} $, and so has size $2^{\rm{}} $. The elements of the antichain are of the form ${\cal K}\left( M \right)$, the set of compact subsets of a separable metrizable space M, ordered by inclusion. The order structure of such ${\cal K}\left( M \right)$’s under Tukey quotients is investigated. Relative Tukey quotients are introduced. Applications are given to function spaces and to the complexity of weakly countably determined Banach spaces and Gul’ko compacta.

Rooted monounary algebras can be considered as an algebraic counterpart of directed rooted trees. We work towards a characterization of the lattice of compatible quasiorders by describing its join- and meet-irreducible elements. We introduce the limit $\cB _\infty $ of all $d$-dimensional Boolean cubes $\Two ^d$ as a monounary algebra; then the natural order on $\Two ^d$ is meet-irreducible. Our main result is that any completely meet-irreducible quasiorder of a rooted algebra is a homomorphic preimage of the natural partial order (or its inverse) of a suitable subalgebra of $\cB _\infty $. For a partial order, it is known that complete meet-irreducibility means that the corresponding partially ordered structure is subdirectly irreducible. For a rooted monounary algebra it is shown that this property implies that the unary operation has finitely many nontrivial kernel classes and its graph is a binary tree.

In this paper we study the properties of total time on test transforms of order n and examine their applications in reliability analysis. It is shown that the successive transforms produce either distributions with increasing or bathtub-shaped failure rates or distributions with decreasing or upside bathtub-shaped failure rates. The ageing properties of the baseline distribution is compared with those of transformed distributions, and a partial order based on nth-order transforms and their implications are discussed.

We provide an existence theorem for stable sets which is equivalent to Zorn's lemma and study the connections between the unique stable set for majorization and the stable sets for the dominance relation.

Any preorder P on a set X has an associated preorder P′, P″, P‴, … The proerties of this sequence are studied. When X is finite the sequence is eventually periodic with period P = 1 or p = 1, the eventual constant preorder is full p = 2 the possible forms which the eventual alternating order can take are examined: first, the possible combinations of components are enumerated; second, the notion of ramification at a caste is used to show that X may in a heuristic sense be of unbounded complexity. If X is orderdense the periodicity starts at P′.