Related papers: An Identity of Distributive Lattices
For a finite group $G$, we associate the quantity $\beta(G)=\frac{|L(G)|}{|G|}$, where $L(G)$ is the subgroup lattice of $G$. Different properties and problems related to this ratio are studied throughout the paper. We determine the second…
In this paper we introduce and study a variety of algebras that properly includes integral distributive commutative residuated lattices and weak Heyting algebras. Our main goal is to give a characterization of the principal congruences in…
Let $L$ be a solvable Lie algebra of dimension less than or equal to 4 over finite fields. We compute and record, in explicit symbolic form, the zeta functions enumerating subalgebras or ideals of $L$, and study their properties. We also…
We prove that any non-cocompact irreducible lattice in a higher rank semi-simple Lie group contains a subgroup of finite index, which has three generators.
Let $G$ be a finite group and construct a graph $\Delta(G)$ by taking $G\setminus\{1\}$ as the vertex set of $\Delta(G)$ and by drawing an edge between two vertices $x$ and $y$ if $\langle x,y\rangle$ is cyclic. Let $K(G)$ be the set…
Recently a function was constructed that satisfies all known properties of a tree-level scattering of four massless scalars via the exchange of an infinite tower of particles with masses given by the non-trivial zeroes of the Riemann zeta…
For a finite lattice L, the congruence lattice Con L of L can be easily computed from the partially ordered set J(L) of join-irreducible elements of L and the join-dependency relation D\_L on J(L). We establish a similar version of this…
This note reformulates certain classical combinatorial duality theorems in the context of order lattices. For source-target networks, we generalize bottleneck path-cut and flow-cut duality results to edges with capacities in a distributive…
A (v,0)-semilattice is ultraboolean, if it is a directed union of finite Boolean (v,0)-semilattices. We prove that every distributive (v,0)-semilattice is a retract of some ultraboolean (v,0)-semilattices. This is established by proving…
Given an entire function $f$ of finite order $\rho$, let $L(z,f)=\sum_{j=0}^{m}b_{j}(z)f^{(k_{j})}(z+c_{j})$ be a linear delay-differential polynomial of $f$ with small coefficients in the sense of $O(r^{\lambda+\varepsilon})+S(r,f)$,…
Various embedding problems of lattices into complete lattices are solved. We prove that for any join-semilattice S with the minimal join-cover refinement property, the ideal lattice IdS of S is both algebraic and dually algebraic.…
A filter lattice is a distributive lattice formed by all filters of a poset in the anti-inclusion order. We study the combinatorial properties of the Hasse diagrams of filter lattices of certain posets, so called Fibonacci-like cubes, in…
An $L(2,1)$-labelling of a finite graph $\Gamma$ is a function that assigns integer values to the vertices $V(\Gamma)$ of $\Gamma$ (colouring of $V(\Gamma)$ by ${\mathbb{Z}}$) so that the absolute difference of two such values is at least…
Distributivity is a well-established and extensively studied notion in lattice theory. In the context of data analysis, particularly within Formal Concept Analysis (FCA), lattices are often observed to exhibit a high degree of…
A resolution of the intersection of a finite number of subgroups of an abelian group by means of their sums is constructed, provided the lattice generated by these subgroups is distributive. This is used for detecting singularities of…
Let $L$ be a finite lattice and $\mathcal{E}(L)$ be the set of join endomorphisms of $L$. We consider the problem of given $L$ and $f,g \in \mathcal{E}(L)$, finding the greatest lower bound $f \sqcap_{{\scriptsize \mathcal{E}(L)}} g$ in the…
The congruence lattices of all algebras defined on a fixed finite set $A$ ordered by inclusion form a finite atomistic lattice $\mathcal E$. We describe the atoms and coatoms. Each meet-irreducible element of $\mathcal E$ being determined…
We enumerate lattice paths in the planar integer lattice consisting of positively directed unit vertical and horizontal steps with respect to a specific elliptic weight function. The elliptic generating function of paths from a given…
We introduce a simple extension of the $\lambda$-calculus with pairs---called the distributive $\lambda$-calculus---obtained by adding a computational interpretation of the valid distributivity isomorphism $A \Rightarrow (B\wedge C)\ \…
This paper is concerned with the problem of determining the number of division algebras which share the same collection of finite splitting fields. As a corollary we are able to determine when two central division algebras may be…