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.     

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.     

The Turaev genus of an adequate knot

The Turaev genus of a knot is an obstruction to the knot being alternating. An adequate knot is a generalization of an alternating knot. A natural problem is a characterization of the Turaev genus of an adequate knot. In this paper, we show that the Turaev genus of an adequate knot is realized by the genus of the Turaev surface associated to an adequate diagram of the knot using the Khovanov homology. As a result, we obtain the additivity of the Turaev genus of adequate knots, and show that the Turaev genus of an adequate knot is “often” preserved under mutation. We also show that an n-semi-alternating knot is of Turaev genus n. This is the first examples of adequate knots of Turaev genus two or more.     

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.     

Images and Open Subspaces of SV Spaces

A topological space is finitely an F-space if its Stone–?ech compactification is a union of finitely many closed F-spaces and a space is SV if C(X) has the property that C(X)/P is a valuation domain for each prime ring ideal P of C(X). This article studies the images under open continuous functions and the open subspaces of spaces that are finitely an F-space or are SV. It is shown that an open continuous image of a compact space that is finitely an F-space is finitely an F-space and an open continuous image of certain SV spaces is SV. Also, it is shown cozerosets, but not necessarily open sets, of SV spaces are SV spaces and a similar situation holds for spaces that are finitely an F-space.     

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.     

Characterization of reducible hexagons and fast decomposition of elementary benzenoid graphs

A benzenoid graph is a finite connected plane graph with no cut vertices in which every interior region is bounded by a regular hexagon of a side length one. A benzenoid graph G is elementary if every edge belongs to a 1-factor of G. A hexagon h of an elementary benzenoid graph is reducible, if the removal of boundary edges and vertices of h results in an elementary benzenoid graph. We characterize the reducible hexagons of an elementary benzenoid graph. The characterization is the basis for an algorithm which finds the sequence of reducible hexagons that decompose a graph of this class in O(n²) time. Moreover, we present an algorithm which decomposes an elementary benzenoid graph with at most one pericondensed component in linear time.     

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.     

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.     

Relations Between Algebras and Their Subalgebras of Invariants

We prove that, if H is a finite-dimensional semisimple Hopf algebra, and A is an FCR H-module algebra over an algebraically closed field, then A is a PI-algebra, provided the subalgebra of invariants is a PI-algebra. We also show that if A is an affine algebra with an action of a finite group G by automorphisms, the subalgebra of the fixed points A^G is in the center of A, and the characteristic of the ground field is either zero or relatively prime to the order of G, then A^G is affine. Analogous results are proved for graded algebras and H-module algebras over a semisimple triangular Hopf algebra over a field of characteristic zero. We prove also that, if A is an H-module algebra with an identity element, and H is either a semisimple group algebra or its dual, then, if A is semiprimitive (semiprime), then so is A^H.     

Stochastic adaptive control for continuous-time linear systems with quadratic cost

An adaptive control problem is formulated and solved for a completely observed, continuous-time, linear stochastic system with an ergodic quadratic cost criterion. The linear transformationsA of the state,B of the control, andC of the noise are assumed to be unknown. Assuming only thatA is stable and that the pair (A, C) is controllable and using a diminishing excitation control that is asymptotically negligible for an ergodic, quadratic cost criterion it is shown that a family of least-squares estimates is strongly consistent. Furthermore, an adaptive control is given using switchings that is self-optimizing for an ergodic, quadratic cost criterion.This research was partially supported b y NSF Grants ECS-9102714, ECS-9113029, and DMS-9305936.     

A dual control problem and application to marketing

The general approach to adaptive and dual control is to formulate an optimal stochastic control problem. However, for such an approach only mathematical representations of the solution are available which allow little insight into the structure of the optimal controller. Here, an alternative deterministic approach is presented based upon determining a control in which a disturbance attenuation function remains bounded for all allowable (L₂ functions) disturbances. The disturbance attenuation function is composed of the ratio of an L₂ function of the desired outputs over an L₂ function of the disturbance inputs. This disturbance attenuation problem is converted to a differential game. For this game, the optimal control law, in a closed-form, is obtained by performing a minmax operation with respect to a quadratic cost function subjected to a bilinear system. The resulting controller is time-varying and depends nonlinearly on the state and the parameter estimates vector, and on an associated Riccati-type matrix. We provide insights into the structure of the resulting dual controller and illustrate the method by two examples. One of the examples is an application to marketing, to set promotional spending of a company, considering that the effect of promotional effort on sales is unknown.     

有限ATI-群的类保持Coleman自同构

设G是一个有限群,对G的任意阿贝尔子群A及任意g∈G,若A∩A~g=1或A,则称G为一个ATI-群.本文证明了,对任意p∈τ(G),如果ATI-群G的一个p-方幂阶类保持自同构在G的任意Sylow子群上的限制等于G的某个内自同构的限制,则它必定是一个内自同构.作为该结果的一个直接推论,我们也证明了有限ATI-群G有正规化性质.     

Semi-algebraic Absolute Valued Algebras with an Involution

Abstract

Let A be an absolute valued algebra. In El-Mallah (El-Mallah,M. L. (1988). Absolute valued algebras with an involution. Arch. Math. 51: 39–49) we proved that,if A is algebraic with an involution,then A is finite dimensional. This result had been generalized in El-Amin et al. (El-Amin,K.,Ramirez,M. I.,Rodriguez,A. (1997). Absolute valued algebraic algebras are finite dimensional. J. Algebra 195:295–307),by showing that the condition “algebraic” is sufficient for A to be finite dimensional. In the present paper we give a generalization of the concept “algebraic”,which will be called “semi-algebraic”,and prove that if A is semi-algebraic with an involution then A is finite dimensional. We give an example of an absolute valued algebra which is semi-algebraic and infinite dimensional. This example shows that the assumption “with an involution” cannot be removed in our result.     

Open Rectangle-of-Influence Drawings of Inner Triangulated Plane Graphs

A straight-line drawing of a plane graph is called an open rectangle-of-influence drawing if there is no vertex in the proper inside of the axis-parallel rectangle defined by the two ends of every edge. In an inner triangulated plane graph, every inner face is a triangle although the outer face is not necessarily a triangle. In this paper, we first obtain a sufficient condition for an inner triangulated plane graph G to have an open rectangle-of-influence drawing; the condition is expressed in terms of a labeling of angles of a subgraph of G. We then present an O(n ^1.5/log n)-time algorithm to examine whether G satisfies the condition and, if so, construct an open rectangle-of-influence drawing of G on an (n−1)×(n−1) integer grid, where n is the number of vertices in G.     

Multiple supersingular elliptic fibers on elliptic surfaces

Elliptic surfaces over an algebraically closed field in characteristic p>0 with multiple supersingular elliptic fibers, that is, multiple fibers of a supersingular elliptic curve, are investigated. In particular, it is shown that for an elliptic surface with q=g+1 and a supersingular elliptic curve as a general fiber, where q is the dimension of an Albanese variety of the surface and g is the genus of the base curve, the multiplicities of the multiple supersingular elliptic fibers are not divisible by p². As an application of this result, the structure of false hyperelliptic surfaces is discussed on this basis.     

Decompositions into codimension two spheres and approximate fibrations

Let M denote an orientable (n+2)-manifold (n?1) and G an upper semicontinuous decomposition of M into compacta having the shape of the n-sphere. In this context it is shown that the decomposition space is a 2-manifold. Moreover, it is established that the decomposition map is an approximate fibration for n>1, while for n=1 the map is an approximate fibration over the complement of a locally finite set.     

Inspection scheduling for imperfect production processes under free repair warranty contract

The paper considers scheduling of inspections for imperfect production processes where the process shift time from an ‘in-control’ state to an ‘out-of-control’ state is assumed to follow an arbitrary probability distribution with an increasing failure (hazard) rate and the products are sold with a free repair warranty (FRW) contract. During each production run, the process is monitored through inspections to assess its state. If at any inspection the process is found in ‘out-of-control’ state, then restoration is performed. The model is formulated under two different inspection policies: (i) no action is taken during a production run unless the system is discovered in an ‘out-of-control’ state by inspection and (ii) preventive repair action is undertaken once the ‘in-control’ state of the process is detected by inspection. The expected sum of pre-sale and post-sale costs per unit item is taken as a criterion of optimality. We propose a computational algorithm to determine the optimal inspection policy numerically, as it is quite hard to derive analytically. To ease the computational difficulties, we further employ an approximate method which determines a suboptimal inspection policy. A comparison between the optimal and suboptimal inspection policies is made and the impact of FRW on the optimal inspection policy is investigated in a numerical example.     

Ovoids with a pencil of translation ovals

We show that if an ovoid of PG(3, q), where q>2 is even, has a pencil of translation ovals and if the carrier of the pencil is not an axis of at least one of the ovals in the pencil, then the ovoid is a Tits ovoid. It follows, as a corollary of this and a result of Penttila and Praeger, that if an ovoid of PG(3, q), where q>2 is even, has a pencil of translation ovals then the ovoid is either an elliptic quadric or a Tits ovoid.