Theory of Completeness for Logical Spaces

A logical space is a pair (A, B){(A, {\mathcal{B}})} of a non-empty set A and a subset B{{\mathcal{B}}} of P A{{\mathcal{P}} A} . Since P A{{\mathcal{P}} A} is identified with {0, 1}^A and {0, 1} is a typical lattice, a pair (A, F){(A, {\mathcal{F}})} of a non-empty set A and a subset F{{\mathcal{F}}} of \mathbbB^A{{\mathbb{B}}^A} for a certain lattice \mathbbB{{\mathbb{B}}} is also called a \mathbbB{{\mathbb{B}}} -valued functional logical space. A deduction system on A is a pair (R, D) of a subset D of A and a relation R between A* and A. In terms of these simplest concepts, a general framework for studying the logical completeness is constructed.     

Integral self-affine tiles in ℝ<Superscript><Emphasis Type="Italic">n</Emphasis></Superscript> part II: Lattice tilings

Let A be an expanding n×n integer matrix with |det(A)|=m. Astandard digit set D for A is any complete set of coset representatives forℤ ⁿ /A(ℤ ⁿ ). Associated to a given D is a setT (A, D), which is the attractor of an affine iterated function system, satisfyingT=∪ _d∈D (T+d). It is known thatT (A, D) tilesℝ ⁿ by some subset ofℤ ⁿ . This paper proves that every standard digit set D gives a setT (A, D) that tilesℝ ⁿ with a lattice tiling.     

When Min(A)−1 is Hausdorff

For a commutative ring with identity, say A, its collection of minimal prime ideals is denoted by Min(A). The hull-kernel topology on Min(A) is a well-studied structure. For example, it is known that the hull-kernel topology on Min(A) has a base of clopen subsets, and classifications of when Min(A) is compact abound. Recently, a program of studying the inverse topology on Min(A) has begun. This article adds to the growing literature. In particular, we characterize when Min(A)^?1 is Hausdorff. In the final section, we consider rings of continuous functions and supply examples.     

Suresums

Asuresum is a pair (A, n),A ⊂ {1, ...,n−1}, so that wheneverA is 2-colored some monochromatic set sums ton. A “finite basis” for the suresum (A, n) with |A| ≦c is proven to exist. Forc fixed, it is shown that no suresum (A, n) exist ifn is a sufficiently large prime. Generalizations tor-colorations,r>2, are discussed.     

Minimal configuration trees

A graph is singular of nullity η if zero is an eigenvalue of its adjacency matrix with multiplicity η. If η(G)=1, then the core of G is the subgraph induced by the vertices associated with the non-zero entries of the zero-eigenvector. A connected subgraph of G with the least number of vertices and edges, that has nullity one and the same core as G, is called a minimal configuration. A subdivision of a graph G is obtained by inserting a vertex on every edge of G. We review various properties of minimal configurations. In particular, we show that a minimal configuration is a tree if and only if it is a subdivision of some other tree.     

On the semigroup nilpotency and the Lie nilpotency of associative algebras

To each associative ringR we can assign the adjoint Lie ringR ⁽⁻⁾ (with the operation(a,b)=ab−ba) and two semigroups, the multiplicative semigroupM(R) and the associated semigroupA(R) (with the operationaob=ab+a+b). It is clear that a Lie ringR ⁽⁻⁾ is commutative if and only if the semigroupM(R) (orA(R)) is commutative. In the present paper we try to generalize this observation to the case in whichR ⁽⁻⁾ is a nilpotent Lie ring. It is proved that ifR is an associative algebra with identity element over an infinite fieldF, then the algebraR ⁽⁻⁾ is nilpotent of lengthc if and only if the semigroupM(R) (orA(R)) is nilpotent of lengthc (in the sense of A. I. Mal'tsev or B. Neumann and T. Taylor). For the case in whichR is an algebra without identity element overF, this assertion remains valid forA(R), but fails forM(R). Another similar results are obtained. Translated fromMatematicheskie Zametki, Vol. 62, No. 4, pp. 510–519, October, 1997. Translated by A. I. Shtern     

On Tate-Shafarevich groups over galois extensions

LetA be an abelian variety defined over a number fieldK. LetL be a finite Galois extension ofK with Galois groupG and let III(A/K) and III(A/L) denote, respectively, the Tate-Shafarevich groups ofA overK and ofA overL. Assuming these groups are finite, we compute [III(A/L) ^G ]/[III(A/K)] and [III(A/K)]/[N(III(A/L))], where [X] is the order of a finite abelian groupX. Especially, whenL is a quadratic extension ofK, we derive a simple formula relating [III(A/L)], [III(A/K)], and [III(A ^x/K)] whereA x is the twist ofA by the non-trivial characterχ ofG.     

A property of the character table for a finite group

A character table X of a finite group is broken up into four squares: A, B, C, and D. We establish relations via which ranks of the matrices inX are connected. In particular, ifX is an l × l-matrix, A is an s × t-matrix, and, moreover, the squares A and C are opposite, thenr(A)=r(C) + s + t − l; here.r(M) is the rank of a matrix M. Associated with such each block ofX is some integral nonnegative parameter m, and we have m=0 iff A, B, C, and D are active fragments ofX. Supported by RFFR grant No. 96-01-00488. Translated fromAlgebra i Logika, Vol. 39, No. 3, pp. 273–279, May–June, 2000.     

Congruences in partial abelian semigroups

A partial abelian semigroup (PAS) is a structure , where is a partial binary operation on L with domain , which is commutative and associative (whenever the corresponding elements exist). A class of congruences on partial abelian semigroups are studied such that the corresponding quotient is again a PAS. If M is a subset of a PAS L, we say that are perspective with respect to M, if there is such that and A subset M is called weakly algebraic if perspectivity with respect to M is a congruence. Some conditions are shown under which a congruence coincides with a perspectivity with respect to an appropriate set M. Especially, conditions under which the corresponding quotient is a D-poset are found. It is also shown that every congruence of MV-algebras and orthomodular lattices is given by a perspectivity with respect to an appropriate set M. Received July 17, 1995; accepted in final form September 16, 1996.     

Set systems without a simplex or a cluster

A d-dimensional simplex is a collection of d+1 sets with empty intersection, every d of which have nonempty intersection. A k-uniform d-cluster is a collection of d+1 sets of size k with empty intersection and union of size at most 2k.     

Revisiting the Farey AF Algebra

In a recent paper, F. Boca investigates the AF algebra \mathfrakA{{\mathfrak{A}}} associated with the Farey-Stern-Brocot sequence. We show that \mathfrakA{{\mathfrak{A}}} coincides with the AF algebra \mathfrakM₁{{\mathfrak{M_{1}}}} introduced by the present author in 1988. As proved in that paper (Adv. Math., vol.68.1), the K ₀-group of \mathfrakA{\mathfrak{A}} is the lattice-ordered abelian group M₁{\mathcal{M}_{1}} of piecewise linear functions on the unit interval, each piece having integer coefficients, with the constant 1 as the distinguished order unit. Using the elementary properties of M₁{\mathcal{M}_{1}} we can give short proofs of several results in Boca’s paper. We also prove many new results: among others, \mathfrakA{{\mathfrak{A}}} is a *-subalgebra of Glimm universal algebra, tracial states of \mathfrakA{{\mathfrak{A}}} are in one-one correspondence with Borel probability measures on the unit real interval, all primitive ideals of \mathfrakA{{\mathfrak{A}}} are essential. We describe the automorphism group of \mathfrakA{{\mathfrak{A}}} . For every primitive ideal I of \mathfrakA{{{\mathfrak{A}}}} we compute K ₀(I) and K₀(\mathfrakA/I){{K_{0}(\mathfrak{A}/I)}}.     

Rings with all modules residually finite

Define a ringA to be RRF (resp. LRF) if every right (resp. left) A-module is residually finite. Refer to A as an RF ring if it is simultaneously RRF and LRF. The present paper is devoted to the study of the structure of RRF (resp. LRF) rings. We show that all finite rings are RF. IfA is semiprimary, we show thatA is RRF ⇔A is finite ⇔A is LRF. We prove that being RRF (resp. LRF) is a Morita invariant property. All boolean rings are RF. There are other infinite strongly regular rings which are RF. IfA/J(A) is of bounded index andA does not contain any infinite family of orthogonal idempotents we prove:

On the structure of inner ideals of nest algebras

IfA is a nest algebra andA _s=A ∩ A* , whereA* is the set of the adjoints of the operators lying inA, then the pair (A, A _s) forms a partial Jordan *-triple. Important tools when investigating the structure of a partial Jordan *-triple are its tripotents. In particular, given an orthogonal family of tripotents of the partial Jordan *-triple (A, A _s), the nest algebraA splits into a direct sum of subspaces known as the Peirce decomposition relative to that family. In this paper, the Peirce decomposition relative to an orthogonal family of minimal tripotents is used to investigate the structure of the inner ideals of (A, A _s), whereA is a nest algebra associated with an atomic nest. A property enjoyed by inner ideals of the partial Jordan *-triple (A, A _s) is presented as the main theorem. This result is then applied in the final part of the paper to provide examples of inner ideals. A characterization of the minimal tripotents as a certain class of rank one operators is also obtained as a means to deduce the principal theorem.     

A new approach to chordal graphs

By a chordal graph is meant a graph with no induced cycle of length ⩾ 4. By a ternary system is meant an ordered pair (W, T), where W is a finite nonempty set, and T ⊆ W × W × W. Ternary systems satisfying certain axioms (A1)–(A5) are studied in this paper; note that these axioms can be formulated in a language of the first-order logic. For every finite nonempty set W, a bijective mapping from the set of all connected chordal graphs G with V(G) = W onto the set of all ternary systems (W, T) satisfying the axioms (A1)–(A5) is found in this paper.     

Cartan-Dieudonné Theorem for {\mathcal {A}}-Modules

Like the classical Cartan-Dieudonné theorem, the sheaf-theoretic version shows that A{\mathcal {A}}-isometries on a convenient A{\mathcal {A}}-module E{\mathcal {E}} of rank n can be decomposed in at most n orthogonal symmetries (reflections) with respect to non-isotropic hyperplanes. However, the coefficient sheaf of \mathbb C{\mathbb {C}}-algebras A{\mathcal {A}} is assumed to be a PID \mathbb C{\mathbb {C}}-algebra sheaf and, if (E,f){(\mathcal {E},\phi)} is a pairing with f{\phi} a non-degenerate A{\mathcal {A}}-bilinear morphism, we assume that E{\mathcal {E}} has nowhere-zero (local) isotropic sections; but, for Riemannian sheaves of A{\mathcal {A}}-modules, this is not necessarily required.     

Fast inversion algorithms of Toeplitz-plus-Hankel matrices

Summary The paper deals with the problems of fast inversion of matricesA=T+H, whereT is Toeplitz andH is Hankel. Several algorithms are presented and compared, among them algorithms working for arbitrary strongly nonsingular matricesA=T+H.     

On finite retract lattices of monounary algebras

For a monounary algebra (A, f) we denote R ^∅(A, f) the system of all retracts (together with the empty set) of (A, f) ordered by inclusion. This system forms a lattice. We prove that if (A, f) is a connected monounary algebra and R ^∅(A, f) is finite, then this lattice contains no diamond. Next distributivity of R ^∅(A, f) is studied. We find a representation of a certain class of finite distributive lattices as retract lattices of monounary algebras.     

An atomless interval Boolean algebra A such that $ \mathfrak{a} (A) $ < $ \mathfrak{t} (A) $

For any Boolean algebra A, is the smallest cardinality of an infinite partition of unity in A. A tower in a Boolean algebra A is a subset X of A well-ordered by the Boolean ordering, with but with is the smallest cardinality of a tower of A. Given a linearly ordered set L with first element, the interval algebra of L is the algebra of subsets of L generated by the half-open intervals [a, b). We prove that there is an atomless interval algebra A such that . Received January 21, 2002; accepted in final form March 13, 2002.     

Cardinality of retracts of monounary algebras

For an uncountable monounary algebra (A, f) with cardinality κ it is proved that (A, f) has exactly 2_κ retracts. The case when (A, f) is countable is also dealt with. This work was suported by the the Slovak VEGA Grant No. 1/3003/06. This work was supported by Science and Technology Assistance Agency under the contract No. APVT-20-004104.