The Endomorphism Kernel Property in Finite Distributive Lattices and de Morgan Algebras

Abstract

An algebra 𝒜 has the endomorphism kernel property if every congruence on 𝒜 different from the universal congruence is the kernel of an endomorphism on 𝒜. We first consider this property when 𝒜 is a finite distributive lattice, and show that it holds if and only if 𝒜 is a cartesian product of chains. We then consider the case where 𝒜 is an Ockham algebra, and describe in particular the structure of the finite de Morgan algebras that have this property.     

The Strong Endomorphism Kernel Property in Ockham Algebras

An endomorphism on an algebra 𝒜 is said to be “strong” if it is compatible with every congruence on 𝒜; and 𝒜 is said to have the “strong endomorphism kernel property” if every congruence on 𝒜, different from the universal congruence, is the kernel of a strong endomorphism on 𝒜. Here we consider this property in the context of Ockham algebras. In particular, for those MS-algebras that have this property we describe the structure of their dual space in terms of 1-point compactifications of discrete spaces.     

Almost distributive sublattices and congruence heredity

A congruence lattice L of an algebra A is hereditary if every 0-1 sublattice of L is the congruence lattice of an algebra on A. Suppose that L is a finite lattice obtained from a distributive lattice by doubling a convex subset. We prove that every congruence lattice of a finite algebra isomorphic to L is hereditary. Presented by E. W. Kiss. Received July 18, 2005; accepted in final form April 2, 2006.     

Every poset has a central element

It is proved that there exists a constant , such that in every finite partially ordered set there is an element such that the fraction of order ideals containing that element is between δ and 1−δ. It is shown that δ can be taken to be at least (3−log₂ 5)/40.17. This settles a question asked independently by Colburn and Rival, and Rosenthal. The result implies that the information-theoretic lower bound for a certain class of search problems on partially ordered sets is tight up to a multiplicative constant.     

Types of polynomial completeness of expanded groups

The polynomial functions of an algebra preserve all congruence relations. In addition, if the algebra is finite, they preserve the labelling of the congruence lattice in the sense of Tame Congruence Theory. The question is for which algebras every congruence preserving function, or at least every function that preserves the labelling of the congruence lattice, is a polynomial function. In this paper, we investigate this question for finite algebras that have a group reduct. Presented by K. Kaarli. Received March 12, 2006; accepted in final form October 16, 2008. The second author is supported by Grant No. 144011 of the Ministry of Science of the Republic of Serbia, and the Scholarship “One-Month Visits to Austria for University Graduates” WUS-Austria, from the Austrian Ministry of Education, Science and Culture.     

Finite Abelian Groups with the Strong Endomorphism Kernel Property

An endomorphism h of a group G is said to be strong whenever for every congruence θ on G, (x, y) ∈ θ implies (h(x), h(y)) ∈ θ for every x, y ∈ G. A group G is said to have the strong endomorphism kernel property if every congruence on G is the kernel of a strong endomorphism. In this note, we study the strong endomorphism kernel property in the class of Abelian groups. In particular, we show that a finite Abelian group has the strong endomorphism kernel property if and only if it is cyclic.     

Uniform Mal’cev algebras with small congruence lattices

A congruence of an algebra is called uniform if all the congruence classes are of the same size. An algebra is called uniform if each of its congruences is uniform. All algebras with a group reduct have this property. We prove that almost every finite uniform Mal’cev algebra with a congruence lattice of height at most two is polynomially equivalent to an expanded group.     

Everywhere -repetitive sequences and Sturmian words

Local constraints on an infinite sequence that imply global regularity are of general interest in combinatorics on words. We consider this topic by studying everywhere α-repetitive sequences. Such a sequence is defined by the property that there exists an integer N≥2 such that every length-N factor has a repetition of order α as a prefix. If each repetition is of order strictly larger than α, then the sequence is called everywhere α⁺-repetitive. In both cases, the number of distinct minimal α-repetitions (or α⁺-repetitions) occurring in the sequence is finite.A natural question regarding global regularity is to determine the least number, denoted by M(α), of distinct minimalα-repetitions such that an α-repetitive sequence is not necessarily ultimately periodic. We call the everywhere α-repetitive sequences witnessing this property optimal. In this paper, we study optimal 2-repetitive sequences and optimal 2⁺-repetitive sequences, and show that Sturmian words belong to both classes. We also give a characterization of 2-repetitive sequences and solve the values of M(α) for 1≤α≤15/7.     

A constructive approach to the finite congruence lattice representation problem

A finite lattice is representable if it is isomorphic to the congruence lattice of a finite algebra. In this paper, we develop methods by which we can construct new representable lattices from known ones. The techniques we employ are sufficient to show that every finite lattice which contains no three element antichains is representable. We then show that if an order polynomially complete lattice is representable then so is every one of its diagonal subdirect powers. Received August 30, 1999; accepted in final form November 29, 1999.     

Semigroups with the Congruence Extension Property

ρT on a semigroup of T of S extends to the semigroup S, if there exists a congruence _ρ on s such that _{ρ|T= ρT}. A semigroup S has the congruence extension property, CEP, if each congruence on each semigroup extends to S. In this paper we characterize the semigroups with CEP by a set of conditions on their structure (by this we answer a problem put forward in [1]). In particular, every such semigroup is a semilattice of nil extensions of rectangular groups.     

Quasiorder lattices of varieties

The set \({{\mathrm{Quo}}}(\mathbf {A})\) of compatible quasiorders (reflexive and transitive relations) of an algebra \(\mathbf {A}\) forms a lattice under inclusion, and the lattice \({{\mathrm{Con}}}(\mathbf {A})\) of congruences of \(\mathbf {A}\) is a sublattice of \({{\mathrm{Quo}}}(\mathbf {A})\). We study how the shape of congruence lattices of algebras in a variety determine the shape of quasiorder lattices in the variety. In particular, we prove that a locally finite variety is congruence distributive [modular] if and only if it is quasiorder distributive [modular]. We show that the same property does not hold for meet semi-distributivity. From tame congruence theory we know that locally finite congruence meet semi-distributive varieties are characterized by having no sublattice of congruence lattices isomorphic to the lattice \(\mathbf {M}_3\). We prove that the same holds for quasiorder lattices of finite algebras in arbitrary congruence meet semi-distributive varieties, but does not hold for quasiorder lattices of infinite algebras even in the variety of semilattices.     

A new rigidity result for holomorphic maps

In this paper we determine which vanishing order of a holomorphic map f at a point of the (non necessarily regular) boundary of a very generic domain of is required for f to be constant. In particular this vanishing order is 1 if the boundary is Dini-smooth whereas it is at least β/α if f locally maps a Dini-smooth corner of opening πα into a Dini-smooth corner of opening πβ. Finally an analogous result is stated for the case of a holomorphic map f which maps a cusp into a cusp.     

A Hamiltonian property for nilpotent algebras

In this paper we show that any finite algebra A satisfying a weak left nilpotence condition has the property that all maximal subuniverses are congruence blocks. Conversely, if every subalgebra of A ² has the property that all maximal subuniverses are congruence blocks, then A satisfies the aforementioned nilpotence condition. Received August 3, 1994; accepted in final form June 27, 1996.     

The incidence structure of subspaces with well-scaled frames

In this paper, the incidence structure of classes of subspaces that generalize the regular (unimodular) subspaces of rational coordinate spaces is studied. Let F the a field and S - F β {0}. A subspace, V, of a coordinate space over F is S-regular if every elementary vector of V can be scaled by an element of F β {0} so that all of its non-zero entries are elements of S. A subspace that is {−1, +1 }-regular over the rational field is regular.Associated with a subspace, V, over an arbitrary (respectively, ordered) field is a matroid (oriented matroid) having as circuits (signed circuits) the set of supports (signed supports) of elementary vectors of V. Fundamental representation properties are established for the matroids that arise from certain classes of subspaces. Matroids that are (minor) minimally non-representable by various classes of subspaces are identified. A unique representability results is established for the oriented matroids of subspaces that are dyadic (i.e., {±2⁰, ±2¹, ±2², …}-regular) over the rationals. A self-dual characterization is established for the matroids of S-regular subspaces which generalizes Minty's characterization of regular spaces as digraphoids.     

An Asymptotic Property of Schachermayer's Space under Renorming

Let X be a Banach space with closed unit ball B. Given k , X is said to be k-β, respectively, (k + 1)-nearly uniformly convex ((k + 1)-NUC), if for every ε > 0 there exists δ, 0 < δ < 1, so that for every x B and every ε-separated sequence (x_n) B there are indices (n_i)^k_{i = 1}, respectively, (n_i)^{k + 1}_{i = 1}, such that (1/(k + 1))||x + ∑^k_{i = 1} x_ni|| ≤ 1 − δ, respectively, (1/(k + 1))||∑^{k + 1}_{i = 1} x_ni|| ≤ 1 − δ. It is shown that a Banach space constructed by Schachermayer is 2-β, but is not isomorphic to any 2-NUC Banach space. Modifying this example, we also show that there is a 2-NUC Banach space which cannot be equivalently renormed to be 1-β.     

Polynomial projectors preserving homogeneous partial differential equations

A polynomial projector Π of degree d on is said to preserve homogeneous partial differential equations (HPDE) of degree k if for every and every homogeneous polynomial of degree k, q(z)=∑_|α|=ka_αz^α, there holds the implication: q(D)f=0q(D)Π(f)=0. We prove that a polynomial projector Π preserves HPDE of degree if and only if there are analytic functionals with such that Π is represented in the following form

with some , where u_α(z)z^α/α!. Moreover, we give an example of polynomial projectors preserving HPDE of degree k (k1) without preserving HPDE of smaller degree. We also give a characterization of Abel–Gontcharoff projectors as the only Birkhoff polynomial projectors that preserve all HPDE.     

Maximal ℓ-Frattini quotients of ℓ-Poincaré duality groups of dimension 2

Any morphism of profinite groups has maximal ℓ-Frattini quotients

A note on a theorem of Berkes and Philipp for dependent sequences

We improve an almost sure invariance principle for f-mixing sequences of real random variables with finite (2 + δ)th moment (0 < δ 2) due to Berkes and Philipp (1979). The exponent of the slow logarithmic rate of mixing in that theorem is relaxed from 160/δ to (1 + ε)(1 + 2/δ) and the undetermined quantities a_N are replaced by Nσ² for some σ > 0.     

The strength of weak proximity

This paper studies weak proximity drawings of graphs and demonstrates their advantages over strong proximity drawings in certain cases. Weak proximity drawings are straight line drawings such that if the proximity region of two points p and q representing vertices is devoid of other points representing vertices, then segment (p,q) is allowed, but not forced, to appear in the drawing. This differs from the usual, strong, notion of proximity drawing in which such segments must appear in the drawing.Most previously studied proximity regions are associated with a parameter β, 0β∞. For fixed β, weak β-drawability is at least as expressive as strong β-drawability, as a strong β-drawing is also a weak one. We give examples of graph families and β values where the two notions coincide, and a situation in which it is NP-hard to determine weak β-drawability. On the other hand, we give situations where weak proximity significantly increases the expressive power of β-drawability: we show that every graph has, for all sufficiently small β, a weak β-proximity drawing that is computable in linear time, and we show that every tree has, for every β less than 2, a weak β-drawing that is computable in linear time.