Die Verbände mit nichteinfacher Funktionenalgebra

Let V; , be a lattice, thenF(V), the set of all functions fromV toV, becomes a lattice by defining the operations and pointwise. If we also consider the composition of functions as an operation onF(V), we get the function algebra F(V); , ,·. In this paper we give a characterization of the lattices with nonsimple function algebras. Moreover, the congruence lattice of these function algebras turns out to be a three-element chain.     

A Homotopy 2-Groupoid of a Hausdorff Space

If X is a Hausdorff space we construct a 2-groupoid G ₂ X with the following properties. The underlying category of G ₂ X is the `path groupoid" of X whose objects are the points of X and whose morphisms are equivalence classes f, g of paths f, g in X under a relation of thin relative homotopy. The groupoid of 2-morphisms of G ₂ X is a quotient groupoid X / N X, where X is the groupoid whose objects are paths and whose morphisms are relative homotopy classes of homotopies between paths. N X is a normal subgroupoid of X determined by the thin relative homotopies. There is an isomorphism G ₂ X(f,f) ₂(X, f(0)) between the 2-endomorphism group of f and the second homotopy group of X based at the initial point of the path f. The 2-groupoids of function spaces yield a 2-groupoid enrichment of a (convenient) category of pointed spaces.We show how the 2-morphisms may be regarded as 2-tracks. We make precise how cubical diagrams inhabited by 2-tracks can be pasted.     

A finitely based theory of a non-trivial language,with exactly ℵ0 subcovers

LetL=f, g be the language with two unary operation symbols. I prove that the finitely based equational theory =[f₀=₀] ofL covers exactly ₀ others.Presented by S. Burris.Dedicated to George McNulty, my mentor in equational logic.     

Semimodular lattices with isomorphic graphs

Two discrete modular lattice and have isomorphic graphs if and only if is of the form A × and is of the form A × for some lattices A and and . We prove that for discrete semimodular lattices and this latter condition holds if and only if and have isomorphic graphs and the isomorphism preserves the order on all cover-preserving sublattices of which are isomorphic to the seven-element, semimodular, nonmodular lattice (see Figure 1). This answers in the affirmative a question posed by J. Jakubik.     

Non removable edges in 3-connected cubic graphs

LetG be a cyclicallyk-edge-connected cubic graph withk 3. Lete be an edge ofG. LetG be the cubic graph obtained fromG by deletinge and its end vertices. The edgee is said to bek-removable ifG is also cyclicallyk-edge-connected. Let us denote by S _k (G) the graph induced by thek-removable edges and by N _k (G) the graph induced by the non 3-removable edges ofG. In a previous paper [7], we have proved that N ₃(G) is empty if and only ifG is cyclically 4-edge connected and that if N ₃(G) is not empty then it is a forest containing at least three trees. Andersen, Fleischner and Jackson [1] and, independently, McCuaig [11] studied N ₄(G). Here, we study the structure of N _k (G) fork 5 and we give some constructions of graphs such thatN _k (G) = E(G). We note that the main result of this paper (Theorem 5) has been announced independently by McCuaig [11].

---

Résumé SoitG un graphe cubique cyliquementk-arête-connexe, aveck 3. Soite une arête deG et soitG le graphe cubique obtenu à partir deG en supprimante et ses extrémités. L'arêtee est ditek-suppressible siG est aussi cycliquementk-arête-connexe. Désignons par S _k (G) le graphe induit par les arêtesk-suppressibles et par N _k (G) celui induit par les arêtes nonk-suppressibles. Dans un précédent article [7], nous avons montré que N ₃(G) est vide si et seulement siG est cycliquement 4-arête-connexe et que si N ₃(G) n'est pas vide alors c'est une forêt possédant au moins trois arbres. Andersen, Fleischner and Jackson [1] et, indépendemment, McCuaig [11] ont étudié N ₄(G). Ici, nous étudions la structure de N _k (G) pourk 5 et nous donnons des constructions de graphes pour lesquelsN _k (G) = E(G). Nous signalons que le résultat principal de cet article (Théorème 5) a été annoncé indépendamment par McCuaig [11].

     

Conic decompositions of a class of lattices and universal algebras

We call an elementa of a finite-height latticeL conic if all coversb _i , ofa form coverings a,b _i which are related suitably (by strict projective equivalence) inL. This leads to existence and uniqueness theorems forconic decompositions. All of this is defined in general lattices, the class of lattices with a.c.c. and a generalized form of semimodularity calledConesemimodularity being the natural framework for most of the results. In a varietyV of universal algebras, we call an algebraA conic if it is a homomorphic image of some algebraA L with kernel, say, such that is conic in ConA. Conic decomposition of the 0 congruence leads to a subdirect product decomposition with conic algebras as factors. Special properties of conic algebras are given. We also consider a dual notion, which in suitable lattices leads to join-decompositions of lattice elements.Presented by B. Jonsson.     

A horn sentence for involution lattices of quasiorders

The quasiorders of a setA form a lattice Quord(A) with an involution ^–1={x, y: y, x}. Some results in [1] and Chajda and Pinus [2] lead to the problem whether every lattice with involution can be embedded in Quord(A) for some setA. Using the author's approach to the word problem of lattices (cf. [3]), which also applies for involution lattices, it is shown that the answer is negative.Research supported by the Hungarian National Foundation for Scientific Research (OTKA), under grant no. T 7442.     

Congruences of Clone Lattices, II

We continue the study of congruences of clone lattices _A , where A is finite, started in an earlier paper by the author and A. P. Semigrodskikh. We prove that each clone that either contains all unary operations or consists of essentially unary operations forms a one-element class of any non-trivial congruence of _A . As a consequence, we get that _A has the greatest non-trivial congruence provided the lattice is not simple, that _A is directly indecomposable, and that it has neither distributive nor dually distributive elements except for the trivial ones.For |A|>2, no example of a non-trivial congruence is known so far. We exhibit some reasons why such congruences are not easy to find.     

Local completeness I

An infinite algebra is locally complete if its local closure is the set of all finitary operations. We give a local completeness criterion in terms of a system R of finitary relations on A such that the polymorph Pol of each R is locally incomplete and for every locally incomplete algebra A; F we have F Pol for some R. This system consists of (i) certain natural relations whose polymorphs are best possible in the sense that they are co-atoms in the lattice of locally closed incomplete algebras, (ii) five types of binary relations, (iii) one type of ternary relations and (iv) at least ternary totally reflexive and symmetric relations that are not locally central.Presented by K. A. Baker.     

Constructive methods of approximation by ridge functions and radial functions

Let be a univariant function, and letg(x) be the average of (x,u) asu runs over the unit sphere in ⁿ . We give a necessary and sufficient condition forg to be a kernel function, i.e., thatg be inL ¹ ( ⁿ ) and have integral 1. The result is used to give a constructive proof of the density of the ridge functions based upon the function .     

Construction of Certain Cyclic Distance-Preserving Codes Having Linear-Algebraic Characteristics

An ordered list of binary words of length n is called a distance-preserving m, n-code, if the list distance between two words is equal to their Hamming distance, for distances up to m. A technique for constructing cyclic m, n-codes is presented, based on the standard Gray code and on some simple tools from linear algebra.     

RC *-fields

It is stated that if a Boolean family W of valuation rings of a field F satisfies the block approximation property (BAP) and a global analog of the Hensel-Rychlick property (THR), in which case F, W is called an RC^*-field, then F is regularly closed with respect to the family W (The-orem 1). It is proved that every pair F, W, where W is a weakly Boolean family of valuation rings of a field F, is embedded in the RC^*-field F₀, W₀ in such a manner that R₀ R₀ F, R₀ W₀ is a continuous map, W₀ is homeomorphic over W to a given Boolean space, and R₀ is a superstructure of R₀ F for every R₀ W₀ (Theorem 2).Translated fromAlgebra i Logika, Vol. 33, No. 4, pp. 367–386, July-August, 1994.     

Convergence and summability of Gabor expansions at the Nyquist density

It is well known that Gabor expansions generated by a lattice of Nyquist density are numerically unstable, in the sense that they do not constitute frame decompositions. In this paper, we clarify exactly how bad such Gabor expansions are, we make it clear precisely where the edge is between enough and too little, and we find a remedy for their shortcomings in terms of a certain summability method. This is done through an investigation of somewhat more general sequences of points in the time-frequency plane than lattices (all of Nyquist density), which in a sense yields information about the uncertainty principle on a finer scale than allowed by traditional density considerations. An important role is played by certain Hilbert scales of function spaces, most notably by what we call the Schwartz scale and the Bargmann scale, and the intrinsically interesting fact that the Bargmann transform provides a bounded invertible mapping between these two scales. This permits us to turn the problems into interpolation problems in spaces of entire functions, which we are able to treat.     

The Lattice of Ordered Compactifications of a Direct Sum of Totally Ordered Spaces

The lattice of ordered compactifications of a topological sum of a finite number of totally ordered spaces is investigated. This investigation proceeds by decomposing the lattice into equivalence classes determined by the identification of essential pairs of singularities. This lattice of equivalence classes is isomorphic to a power set lattice. Each of these equivalence classes is further decomposed into equivalence classes determined by admissible partially ordered partitions of the ordered Stone–ech remainder. The lattice structure within each equivalence class is determined using an algorithm based on the incidence matrix of the partially ordered partition. As examples, the ordered compactification lattices for the spaces [0,1)[0,1),[0,1)[0,1)[0,1),RR, and R/{0}R/{0} are determined.     

On some non-obvious connections between graphs and unary partial algebras

In the present paper we generalize a few algebraic concepts to graphs. Applying this graph language we solve some problems on subalgebra lattices of unary partial algebras. In this paper three such problems are solved, other will be solved in papers [Pió I], [Pió II], [Pió III], [Pió IV]. More precisely, in the present paper first another proof of the following algebraic result from [Bar1] is given: for two unary partial algebras A and B, their weak subalgebra lattices are isomorphic if and only if their graphs G*(A) and G*(B) are isomorphic. Secondly, it is shown that for two unary partial algebras A and B if their digraphs G(A) and G(B) are isomorphic, then their (weak, relative, strong) subalgebra lattices are also isomorphic. Thirdly, we characterize pairs , where A is a unary partial algebra and L is a lattice such that the weak subalgebra lattice of A is isomorphic to L.     

Birkhoff Centre of a Poset

In this paper, it is proved that the Boolean centre of a semigroup S with sufficiently many commuting idempotents is isomorphic to the inverse limit of the directed family of Birkhoff centres (or Boolean centres) of a class of bounded semigroups. The Birkhoff centre is defined for any poset and proved that it is a relatively complemented distributive lattice whenever it is nonempty. It is observed that for a semilattice S, the Birkhoff centres as a semigroup and as a poset coincide. Also it is observed that for a Lattice (L, , ), the Birkhoff centres of the semilattices (L, ) and (L, ) coincide with the Birkhoff centre of L. Finally it is proved that for a lattice (L, , ), the Boolean centres of the semilattices (L, ) and (L, ) coincide with the Boolean centre of L.AMS Subject classification (1991): 06A12, 20M15     

D'Alembert's functional equation on restricted domains

Summary In the class of functionalsf:X , whereX is an inner product space with dimX 3, we study the D'Alembert functional equationf(x + y) + f(x – y) = 2f(x)f(y) (1) on the restricted domainsX ₁ = {(x, y) X ²/x, y = 0} andX ₂ = {(x, y) X ²/x = y}. In this paper we prove that the equation (1) restricted toX ₁ is not equivalent to (1) on the whole spaceX. We also succeed in characterizing all common solutions if we add the conditionf(2x) = 2f²(x) – 1. Using this result, we prove the equivalence between (1) restricted toX ₂ and (1) on the whole spaceX. This research follows similar previous studies concerning the additive, exponential and quadratic functional equations.     

Finite Quasi-uniform Extensions. II

The lattice of finite extensions of quasi-uniformities for prescribed topologies are examined. An example is presented which shows that in the finite and strict case there can occur that there exists no coarsest compatible extension. It is also verified that inf in the lattice of extensions. In the strict case there exists a coarsest compatible extension if and only if there exists a coarsest extension for X {p} for every p Y - X. It is shown that certain special sup-distributive lattices can be represented by the lattice of extensions. For example every finite distributive lattice is isomorphic to the lattice of extensions for a suitable system.     

Sharpening of Stečkin's theorem to strong approximation with exponentp

— , B _n , B p1., , p=1 , - . , , , p.     

On ηα-groups and fields

Let :=. The following are known: two -sets of power are isomorphic. Let >0. Two ordered divisible Abelian groups that are -sets of power are isomorphic, two real closed fields that are -sets of power are isomorphic. The following is shown: (1) there exist 2 nonisomorphic ordered Abelian groups (respectively ordered fields) that are -sets of power ; (2) there exist 2 nonisomorphic ordered divisible Abelian groups (respectively real closed fields) of power all having the same order type; (3) there exist 2 nonisomorphic ordered divisible Abelian groups (respectively real closed fields) that are -sets having the same order type.