Advanced Search

Let $p$ be a $k$-ary lattice term. A $k$-pointed lattice $L=(L;\vee ,\wedge$, $d_1,...,d_k)$ will be called a $p$-lattice (or a test lattice if $p$ is not specified), if $(L;\vee ,\wedge )$ is generated by $\{d_1,...,d_k\}$ and, in addition, for any $k$-ary lattice term $q$ satisfying $p(d_1,...,d_k)$ $\le$ $q(d_1$, $...,d_k)$ in $L$, the lattice identity $p\le q$ holds in all lattices. In an elementary visual way, we construct a finite $p$-lattice $L\left(p\right)$ for each $p$. If $p$ is a canonical lattice term, then $L\left(p\right)$ coincides with the optimal $p$-lattice of Freese, Ježek and Nation [Freese, R., Ježek,...

We give a new proof of the fact that finite bipartite graphs cannot be axiomatized by finitely many first-order sentences among finite graphs. (This fact is a consequence of a general theorem proved by L. Ham and M. Jackson, and the counterpart of this fact for all bipartite graphs in the class of all graphs is a well-known consequence of the compactness theorem.) Also, to exemplify that our method is applicable in various fields of mathematics, we prove that neither finite simple groups, nor the...

For a class $K$ of structures and $A\in K$ let ${Con}^{*}\left(A\right)$ resp. ${Con}^K\left(A\right)$ denote the lattices of $*$-congruences resp. $K$-congruences of $A$, cf. Weaver [25]. Let ${Con}^{*}\left(K\right):=I\{{Con}^{*}\left(A\right):A\in K\}$ where $I$ is the operator of forming isomorphic copies, and ${Con}^r\left(K\right):=I\{{Con}^K\left(A\right):A\in K\}$. For an ordered algebra $A$ the lattice of order congruences of $A$ is denoted by ${Con}^{<}\left(A\right)$, and let ${Con}^{<}\left(K\right):=I\{{Con}^{<}\left(A\right):A\in K\}$ if $K$ is a class of ordered algebras. The operators of forming subdirect squares and direct products are denoted by $Q^s$ and $P$, respectively. Let $\lambda$ be a lattice identity and let $\Sigma$ be a set of lattice identities. Let $\Sigma {\vDash }_c\lambda (r;Q^s,P)$ denote...

An elementary proof is given for Hutchinson's duality theorem, which states that if a lattice identity λ holds in all submodule lattices of modules over a ring R with unit element then so does the dual of λ.

We maximize the total height of order ideals in direct products of finitely many finite chains. We also consider several order ideals simultaneously. As a corollary, a shifting property of some integer sequences, including digit sum sequences, is derived.

A lattice $L$ is said to satisfy (the lattice theoretic version of) Frankl’s conjecture if there is a join-irreducible element $f\in L$ such that at most half of the elements $x$ of $L$ satisfy $f\le x$. Frankl’s conjecture, also called as union-closed sets conjecture, is well-known in combinatorics, and it is equivalent to the statement that every finite lattice satisfies Frankl’s conjecture. Let $m$ denote the number of nonzero join-irreducible elements of $L$. It is well-known that $L$ consists of at most $2^m$ elements....

A rotational lattice is a structure $\langle L;\vee ,\wedge ,g\rangle$ where $L=\langle L;\vee ,\wedge \rangle$ is a lattice and $g$ is a lattice automorphism of finite order. We describe the subdirectly irreducible distributive rotational lattices. Using Jónsson’s lemma, this leads to a description of all varieties of distributive rotational lattices.

Let $F$ be a subfield of the field $ℝ$ of real numbers. Equipped with the binary arithmetic mean operation, each convex subset $C$ of $F^n$ becomes a commutative binary mode, also called idempotent commutative medial (or entropic) groupoid. Let $C$ and $C^{\text{'}}$ be convex subsets of $F^n$. Assume that they are of the same dimension and at least one of them is bounded, or $F$ is the field of all rational numbers. We prove that the corresponding idempotent commutative medial groupoids are isomorphic iff the affine space $F^n$...