The jump number of Z-free ordered sets

An ordered set P is called Z-free if it does not contain a four-element subset {a, b, c, d} such that a and c are the only comparabilities among these elements. In this paper we present a polynomial algorithm to find the jump number of finite Z-free ordered sets and that of their duals.     

Cyclic antiautomorphisms of directed triple systems

A transitive triple, (a,b,c), is defined to be the set {(a,b), (b,c), (a,c)} of ordered pairs. A directed triple system of order v, DTS(v), is a pair (D,β), where D is a set of v points and β is a collection of transitive triples of pairwise distinct points of D such that any ordered pair of distinct points of D is contained in precisely one transitive triple of β. An antiautomorphism of a Directed triple system, (D,β), is a permutation of D that maps β to β⁻¹, where β ⁻¹ = {(c,b,a)|(a,b,c) E β}. In this article we give necessary and sufficient conditions for the existence of a Directed triple system of order v admitting an antiautomorphism consisting of a single cycle of length d and having v − d fixed points. Further, we give a more general result for partial Directed triple systems in which the missing ordered pairs are precisely those containing two fixed points. © 1996 John Wiley & Sons, Inc.     

Factorization of elements in noncommutative rings,II

The mathematical object that describes the factorizations of an element a of an arbitrary ring R is the partially ordered set of all principal right ideals of R that contain aR. We present a hierarchy of situations that depend on the structure of this partially ordered set and describe the factorizations of a.     

Cauchy’s residue theorem for a class of real valued functions

Let [a, b] be an interval in ℝ Rand let F be a real valued function defined at the endpoints of [a, b] and with a certain number of discontinuities within [a, b]. Assuming F to be differentiable on a set [a, b] | E to the derivative f, where E is a subset of [a, b] at whose points F can take values ±∞ or not be defined at all, we adopt the convention that F and f are equal to 0 at all points of E and show that KH-vt ∝ _a ^b f = F(b) − F(a), where KH-vt denotes the total value of the Kurzweil-Henstock integral. The paper ends with a few examples that illustrate the theory.     

Regular monoids generated by two galois connections

Consider a Galois connection (α, α) on an ordered setP and a Galois connection (β, β) on the dually ordered set . Arbitrary compositions of these Galois connections form a monoid. In this paper we will examine this monoid. First we prove that it is a regular monoid and then we construct two special Galois connectionsa andb such that every monoid of the above type is a homomorphic image of the monoid generated bya andb, and we give a solution of the word problem of the latter monoid.     

Almost Schreier monoids

In an earlier paper, we introduced and studied the class of commutative integral domains D having the following property: if a, b₁, b₂ ? D{a, b_1, b_2 \in D} and a|b ₁ b ₂, there exist an integer k ≥ 1 and a₁, a₂ ? D{a_1, a_2 \in D} such that a ^k = a ₁ a ₂ and a_i|b_i^k , i = 1, 2{a_i|b{_i}^k , i = 1, 2} . In this paper, we show that many of our earlier results are purely multiplicative in the sense they can be extended to the setting of commutative cancellative monoids.     

Stable Marriage and Genetic Algorithms: A Fertile Union

We describe a pair of genetic algorithms for solving two stable matching problems. Both stable matching problems we will consider involve a set of applicants for positions and a set of employers. Each applicant and each employer prepares a rank order list of a subset of the actors in the other set. The goal is to find an assignment of applicants to employers in which if applicant a is not assigned to employer b then either a prefers his assignment to b or b prefers its assignment toa . In other words, no applicant/employer pair can both improve their situations by dropping their current assignments in favor of each other. Our goal will be to enumerate the stable matchings. One of the problems we will consider is the well-known stable marriage problem, in which neither applicant nor employer preference lists are linked. In the other problem, we will allow pairs of applicants who form a couple to submit joint rank order lists of ordered pairs of employers.     

Method of solution to fuzzy relation equations in a complete Brouwerian lattice

Up to now, how to solve a fuzzy relation equation in a complete Brouwerian lattice is still an open problem as Di Nola et al. point out. To this problem, the key problem is whether there exists a minimal element in the solution set when a fuzzy relation equation is solvable. In this paper, we first show that there is a minimal element in the solution set of a fuzzy relation equation AX=b (where A=(a₁,a₂,…,a_n) and b are known, and X=(x₁,x₂,…,x_n)^T is unknown) when its solution set is nonempty, and b has an irredundant finite join-decomposition. Further, we give the method to solve AX=b in a complete Brouwerian lattice under the same conditions. Finally, a method to solve a more general fuzzy relation equation in a complete Brouwerian lattice when its solution set is nonempty is also given under similar conditions.     

On the structure of varieties with equationally definable principal congruences IV

The notion of apseudo-interior algebra is introduced; it is a hybrid of a (topological) interior algebra and a residuated partially ordered monoid. The elementary arithmetic of pseudo-interior algebras is developed leading to a simple equational axiomatization. A notion ofopen filter analogous to the open filters of interior algebras is investigated. Pseudo-interior algebras represent, in algebraic form, the logic inherent in varieties with acommutative, regular ternary deductive (TD) term p(x, y, z), which is defined by the conditions: (1)p(x,y,z) z (mod(x, y)); (2) for fixed elementsa, b of an algebra A, {p(a, b, z):z A} is a transversal of the set of equivalence classes of (a, b); (3)p(a, b, z) andp(a,b,z) define the same transversal whenever(a,b)=(a,b); (4)(p(x, y, 1), 1)= (x, y) for some constant term 1. The TD term generalizes the (affine) ternary discriminator. Varieties with a commutative, regular TD term include most of the varieties of traditional algebraic logic as well as all double-pointed affine discriminator varieties andn-potent hoops (residuated commutative po-monoids in which the partial ordering is inverse divisibility). The main theorem:A variety has a commutative, regular TD term iff it is termwise definitionally equivalent to a pseudo-interior algebra with additional operations that are compatible with the open filters in a natural way.Presented by R. W. Quackenbush.The authors gratefully acknowledge the support of National Science Foundation Grants DMS-8703743 and DMS-8805870.     

[a,b]-factorization of a graph

Let a and b be integers such that 0 ? a ? b. Then a graph G is called an [a, b]-graph if a ? d_G(x) ? b for every x ? V(G), and an [a, b]-factor of a graph is defined to be its spanning subgraph F such that a ? d_F(x) ? b for every vertex x, where d_G(x) and d_F(x) denote the degrees of x in G and F, respectively. If the edges of a graph can be decomposed into [a.b]-factors then we say that the graph is [2a, 2a]-factorable. We prove the following two theorems: (i) a graph G is [2a, 2b)-factorable if and only if G is a [2am,2bm]-graph for some integer m, and (ii) every [8m + 2k, 10m + 2k]-graph is [1,2]-factorable.     

Smarandache Vertices of the Graphs Associated to the Commutative Rings

Let R be a commutative ring with identity 1 ≠ 0. A nonzero element a in R is said to be a Smarandache zero-divisor if there exist three different nonzero elements x, y, and b (≠ a) in R such that ax = ab = by = 0, but xy ≠ 0. We will generalize this notion to the Smarandache vertex of an arbitrary simple graph and characterize the Smarandache zero-divisors of commutative rings (resp. with respect to an ideal) via their associated zero-divisor graphs. We illustrate them with examples and prove some interesting results about them.     

Additive property of Drazin invertibility of elements in a ring

In this article, we investigate additive properties on the Drazin inverse of elements in rings. Under the commutative condition of ab?=?ba, we show that a?+?b is Drazin invertible if and only if 1?+?a ^D b is Drazin invertible. Not only the explicit representations of the Drazin inverse (a?+?b) ^D in terms of a, a ^D , b and b ^D , but also (1?+?a ^D b) ^D is given. Further, the same property is inherited by the generalized Drazin invertibility in a Banach algebra and is extended to bounded linear operators.     

Integral Transforms of Functionals in L 2(C a,b [0,T])

In this paper we use generalized Fourier-Hermite functionals to obtain a complete orthonormal set in L ²(C _a,b [0,T]) where C _a,b [0,T] is a very general function space. We then proceed to give a necessary and sufficient condition that a functional F in L ²(C _a,b [0,T]) has an integral transform ℱ _γ,β F also belonging to L ²(C _a,b [0,T]).     

On the algebraic independence in the selberg class

We prove that a functionF of the Selberg class ℐ is ab-th power in ℐ, i.e.,F=H ^b for someHσ ℐ, if and only ifb divides the order of every zero ofF and of everyp-componentF _p. This implies that the equationF ^a=G^b with (a, b)=1 has the unique solutionF=H ^b andG=H ^a in ℐ. As a consequence, we prove that ifF andG are distinct primitive elements of ℐ, then the transcendence degree of ℂ[F,G] over ℂ is two.     

Computing commutator length in free groups

We study commutator length in free groups. (By a commutator lengthcl(g) of an element g in a derived subgroup G′ of a group G we mean the least natural number k such that g is a product of k commutators.) A purely algebraic algorithm is constructed for computing commutator length in a free group F₂ (Thm. 1). Moreover, for every element z ε F′₂ and for any natural m, the following estimate derives:cl(z^m) ≥ (ms(z) + 6)/12, where s(z) is a nonnegative number defined by an element z (Thm. 2). This estimate is used to compute commutator length of some particular elements. By analogy with the concept of width of a derived subgroup known in group theory, we define the concept of width of a derived subalgebra. The width of a derived subalgebra is computed for an algebra P of pairs, and also for its corresponding Lie algebra P_L. The algebra of pairs arises naturally in proving Theorem 2 and enjoys a number of interesting properties. We state that in a free group F_2k with free generators a₁, b₁, ..., a_k, b_k, k εN, every natural m satisfiescl(([a₁, b₁] ... [a_k, b_k])^m)=[(2 − m)/2] + mk. For k=1, this entails a known result of Culler. The notion of a growth function as applied to a finitely generated group G is well known. Associated with a derived subgroup of F₂ is some series depending on two variables which bears information not only on the number of elements of prescribed length but also on the number of elements of prescribed commutator length. A number of open questions are formulated. Supported by RFFR grant No. 98-01-00699. Translated fromAlgebra i Logika, Vol. 39, No. 4, pp. 395–440, July–August, 2000.     

ON K 2 OF DIVISION ALGEBRAS

ABSTRACT

In this paper, it is proved that if F is a global field, then for any integer n > 3, there is an extension field E over F of degree n such that K ₂ E is not generated by the Steinberg symbols {a, b} with a ∈ F*, b, ∈ E*. If however, F is a number field and D is a finite-dimensional central division F-algebra with square free index, then K ₂ D is always generated by the Steinberg symbols {a, b} with a ∈ F*, b ∈ D*. Finally, the tame kernels of central division algebras over F are expressed explicitly.     

Geometry of free cyclic submodules over ternions

Given the algebra T of ternions (upper triangular 2×2 matrices) over a commutative field F we consider as set of points of a projective line over T the set of all free cyclic submodules of T ². This set of points can be represented as a set of planes in the projective space over F ⁶. We exhibit this model, its adjacency relation, and its automorphic collineations. Despite the fact that T admits an F-linear antiautomorphism, the plane model of our projective line does not admit any duality.     

Minimal underlying division rings of sets of points of a projective space

Let V be a vector space over a division ring K. Let P be a spanning set of points in Σ:=PG(V). Denote by K(P) the family of sub-division rings F of K having the property that there exists a basis B_F of V such that all points of P are represented as F-linear combinations of B_F. We prove that when K is commutative, then K(P) admits a least element. When K is not commutative, then, in general, K(P) does not admit a minimal element. However we prove that under certain very mild conditions on P, any two minimal elements of K(P) are conjugate in K, and if K is a quaternion division algebra then K(P) admits a minimal element.     

On the mean square of the error term for the asymmetric two-dimensional divisor problem (I)

Suppose a and b are two fixed positive integers such that (a, b) = 1. In this paper we shall establish an asymptotic formula for the mean square of the error term Δ _a,b (x) of the general two-dimensional divisor problem.