Restricted left principal ideal rings

A ring is an LD-ring ifR is left bounded, ifR/J is a left Artinian left principal ideal ring for every proper idealJ inR, and ifR has finite left Goldie dimension. IfR is non-Artinian thenR is an order in a simple Artinian ringS. The ideal theory of LD-rings is investigated, and we discuss some conditions under which an LD-ring is an hereditary ring, and some under which an LD-ring is a Noetherian, bounded, maximal Asano order. A central localization of an LD-ring is an LD-ring, and the center of some LD-rings is a Krull-domain. This research was supported in part by the National Science Foundation Grant GP 23861.     

A$\mathcal{T}$-algebras and extensions of A$\mathbb{T}$-algebras

Lin and Su classified A$ \mathcal{T} $ \mathcal{T} -algebras of real rank zero. This class includes all A$ \mathbb{T} $ \mathbb{T} -algebras of real rank zero as well as many C*-algebras which are not stably finite. An A$ \mathcal{T} $ \mathcal{T} -algebra often becomes an extension of an A$ \mathbb{T} $ \mathbb{T} -algebra by an AF-algebra. In this paper, we show that there is an essential extension of an A$ \mathbb{T} $ \mathbb{T} -algebra by an AF-algebra which is not an A$ \mathcal{T} $ \mathcal{T} -algebra. We describe a characterization of an extension E of an A$ \mathbb{T} $ \mathbb{T} -algebra by an AF-algebra if E is an A$ \mathcal{T} $ \mathcal{T} -algebra.     

Cleavability over ordinals

In this paper we show that if X is an infinite compactum cleavable over an ordinal, then X must be homeomorphic to an ordinal. X must also therefore be a LOTS. This answers two fundamental questions in the area of cleavability. We also leave it as an open question whether cleavability of an infinite compactum X over an ordinal λ implies X is embeddable into λ.     

On Orderable Poly Engel Groups

It is known that an orderable n-Engel group is nilpotent. We show that an orderable group that is an extension of an n-Engel group by an n-Engel group is nilpotent-by-nilpotent. However, a finitely generated orderable poly n-Engel group need not be solvable in general.     

On flatness of acts

We consider monoids $S=G\dot \cup I$ where G is a group and I is an ideal of S and show that if an S-act is principally weakly flat, (weakly) flat, torsion free or satisfies conditions (P) or (P_E) as an I¹-act, then it has these properties as an S-act. We also show that an S-act which is free, projective or strongly flat as an I¹-act may not generally have these properties as an S-act.     

Kinematische abbildung der ebenen isotropen zwangläufe

The BLASCHKE — GRONWALD — map associates to each curve of a quasi elliptic space a planar euclidean one — parameter motion. K. STRBECKER has shown, that there exists an analog kinematic mapping for motions in an isotropic plane; image space is an isotropic space. Here it is proved, that this image space may also be a three — dimensional flag space. Considering the image curve of an one — parameter motion in an isotropic plane in this flag space we find an interpretation of all known properties of this motion.

---

---

Herrn Prof. Dr. K. Strubecker zum 80. Geburtstag gewidmet     

On shrinking arcs in metric spaces

By a sin (1/x)-curve is meant a metric continuum that is a 1-1 continuous image of the disjoint union of an arc and a semi-open interval that has the image of the arc as continuum of convergence. It is shown that ifM is a compact metric space,A ⊂M an arc, whileM/A is an arc havingA/A as an end-point, thenM is an arc, a triod, some sin (1/x)-curve, or some sin (1/x)-curve with an arc attached at one point, or some sin (1/x)-curve with two arcs attached. The case of shrinking finitely many arcs is also considered in an attaching theorem. Prepared under a NASA Research Grant No. NsG-568 at Kent State University.     

Archimedean ordered semigroups as ideal extensions

The main result of the paper is a structure theorem concerning the ideal extensions of archimedean ordered semigroups. We prove that an archimedean ordered semigroup which contains an idempotent is an ideal extension of a simple ordered semigroup containing an idempotent by a nil ordered semigroup. Conversely, if an ordered semigroup S is an ideal extension of a simple ordered semigroup by a nil ordered semigroup, then S is archimedean. As a consequence, an ordered semigroup is archimedean and contains an idempotent if and only if it is an ideal extension of a simple ordered semigroup containing an idempotent by a nil ordered semigroup.     

Conditions on Normal Spaces of Finite Rank That Guarantee C(X) is SV

An f-ring A is an SV f-ring if for every minimal prime ?-ideal P of A, A/P is a valuation domain. A topological space X is an SV space if C(X) is an SV f-ring. For normal spaces, several conditions are shown to guarantee the space is an SV space. For example, a normal space of finite rank for which the closure of the set of points of rank greater than 1 is an F-subspace, is an SV space. For normal spaces of rank 2, a characterization of SV spaces is given.     

Attractors of generalized IFSs that are not attractors of IFSs

Mihail and Miculescu introduced the notion of a generalized iterated function system (GIFS in short), and proved that every GIFS generates an attractor. (In our previous paper we gave this notion a more general setting.) In this paper we show that for any m≥2$m\ge 2$, there exists a Cantor subset of the plane which is an attractor of some GIFS of order m  , but is not an attractor of a GIFS of order m−1$m-1$. In particular, this result shows that there is a subset of the plane which is an attractor of some GIFS, but is not an attractor of an IFS. We also give an example of a Cantor set which is not an attractor of a GIFS.     

Generalized Blocks of Unipotent Characters in the Finite General Linear Group

In an article of 2003, Külshammer, Olsson, and Robinson defined ?-blocks for the symmetric groups, where ? > 1 is an arbitrary integer, and proved that they satisfy an analogue of the Nakayama Conjecture. Inspired by this work and the definitions of generalized blocks and sections given by the authors, we give in this article a definition of d-sections in the finite general linear group, and construct d-blocks of unipotent characters, where d ≥ 1 is an arbitrary integer. We prove that they satisfy one direction of an analogue of the Nakayama Conjecture, and, in some cases, prove the other direction. We also prove that they satisfy an analogue of Brauer's Second Main Theorem.     

Ordered interval routing schemes

An Interval Routing Scheme (IRS) represents the routing tables in a network in a space-efficient way by labeling each vertex with an unique integer address, and the outgoing edges at each vertex with disjoint subintervals of these addresses. An IRS that has at most k intervals per edge label is called a k-IRS. In this paper, we propose a new type of interval routing scheme, called an Ordered Interval Routing Scheme (OIRS), that uses an ordering of the outgoing edges at each vertex and allows non-disjoint intervals in the labels of those edges. We show for a number of graph classes that using an OIRS instead of an IRS reduces the size of the routing tables in the case of optimal routing, i.e., routing along shortest paths. We show that optimal routing in any k-tree is possible using an OIRS with at most 2^k−1 intervals per edge label, although the best known result for an IRS is 2^k+1 intervals per edge label. Any torus has an optimal 1-OIRS, although it may not have an optimal 1-IRS. We present similar results for the Petersen graph, k-garland graphs and a few other graphs.     

Approximation of Planar Convex Sets from Hyperplane Probes

This paper studies a geometric probing problem. Suppose that an unknown convex set in R ² can be probed by an oracle which, when given a unit vector, will return the position of the supporting hyperplane of the convex set that has the given vector as an outward normal. We present an on-line algorithm for choosing probing directions so that, after n probes, an inner and an outer estimate of the convex set are obtained that are within of each other in Hausdorff distance. This is optimal since there exist convex sets that, even if visible, cannot be approximated better than with n-sided polygons, for example, a circle. Received April 18, 1995, and in revised form March 28, 1996.     

On Chains in <Emphasis Type="BoldItalic">H</Emphasis>-Closed Topological Pospaces

We study chains in an H-closed topological partially ordered space. We give sufficient conditions for a maximal chain L in an H-closed topological partially ordered space (H-closed topological semilattice) under which L contains a maximal (minimal) element. We also give sufficient conditions for a linearly ordered topological partially ordered space to be H-closed. We prove that a linearly ordered H-closed topological semilattice is an H-closed topological pospace and show that in general, this is not true. We construct an example of an H-closed topological pospace with a non-H-closed maximal chain and give sufficient conditions under which a maximal chain of an H-closed topological pospace is an H-closed topological pospace.     

Exotic Actions on Trees

We give an explicit example of an exotic (non-simplicial), geometricfree action of the free group F₃ on an R-tree T. We begin byassociating an interval translation mapping of the unit intervalto an automorphism of F₃. We use a result of D. Gaboriau andG. Levitt to obtain an F₃-action on an R-tree T. We show thatfor our particular choice of , the resulting F₃-action is minimal,free and exotic. 1991 Mathematics Subject Classification 20E36.     

Notes on the Hochschild homology dimension and truncated cycles

In this paper, we show that if an algebra KQ/I with an ideal I of KQ contained in \({R^{m}_{Q}}\) for an integer m ≥ 2 has an m-truncated cycle, then this algebra has infinitely many nonzero Hochschild homology groups, where R _Q denotes the arrow ideal. Consequently, such an algebra of finite global dimension has no m-truncated cycles and satisfies an m-truncated cycles version of the “no loops conjecture".     

Equivariant Poincaré series of filtrations and topology

Earlier, for an action of a finite group G on a germ of an analytic variety, an equivariant G-Poincaré series of a multi-index filtration in the ring of germs of functions on the variety was defined as an element of the Grothendieck ring of G-sets with an additional structure. We discuss to which extent the G-Poincaré series of a filtration defined by a set of curve or divisorial valuations on the ring of germs of analytic functions in two variables determines the (equivariant) topology of the curve or of the set of divisors.     

Mise en position optimale de tores par rapport à un flot d'Anosov

Let Φ′ be an Anosov flow on a (non atoroidal) 3-manifoldM. We say that an incompressible torusT embedded inM admits an optimal position with respect to Φ′ if it is isotopic to a torus transverse to Φ′ outside a finite number of periodic orbits contained inT (there's an additional condition we dont's mention here). The first remark is that such an optimal position is quasi unique, i.e., we prove that if two tori in optimal position are homotopics inM, then they are homotopics along the flow. Then we give some sufficient condition for a torus admiting an optimal position. Eventually, we show that if a finite collection of disjoint tori is such that each torus admits an optimal position, then these optimal positions can be chosen disjoints one from each other.      

Some conditions for the existence of f-factors

Let m, l, n be three odd integers such that m > l > n. It is proved that if a graph G has an m-factor and an n-factor, then it also has an l-factor. In addition, we obtain sufficient conditions for the existence of an f-factor, in terms of vertex-deleted subgraphs.     

On the power and limitations of affine policies in two-stage adaptive optimization

We consider a two-stage adaptive linear optimization problem under right hand side uncertainty with a min–max objective and give a sharp characterization of the power and limitations of affine policies (where the second stage solution is an affine function of the right hand side uncertainty). In particular, we show that the worst-case cost of an optimal affine policy can be times the worst-case cost of an optimal fully-adaptable solution for any δ > 0, where m is the number of linear constraints. We also show that the worst-case cost of the best affine policy is times the optimal cost when the first-stage constraint matrix has non-negative coefficients. Moreover, if there are only k ≤ m uncertain parameters, we generalize the performance bound for affine policies to , which is particularly useful if only a few parameters are uncertain. We also provide an -approximation algorithm for the general case without any restriction on the constraint matrix but the solution is not an affine function of the uncertain parameters. We also give a tight characterization of the conditions under which an affine policy is optimal for the above model. In particular, we show that if the uncertainty set, is a simplex, then an affine policy is optimal. However, an affine policy is suboptimal even if is a convex combination of only (m + 3) extreme points (only two more extreme points than a simplex) and the worst-case cost of an optimal affine policy can be a factor (2 − δ) worse than the worst-case cost of an optimal fully-adaptable solution for any δ > 0.