Related papers: Simple, subdirectly irreducible weakly dicomplemen…
A novel framework for a unifying treatment of quaternion valued adaptive filtering algorithms is introduced. This is achieved based on a rigorous account of quaternion differentiability, the proposed I-gradient, and the use of augmented…
For some important families of complete infinite lattices, we study some generalizations of two fundamental notions which are mostly treated for finite lattices. Specifically, for well-separated $\kappa$-lattices, and also for weakly atomic…
Let $L$ be a slim, planar, semimodular lattice (slim means that it does not contain ${\mathsf M}_3$-sublattices). We call the interval $I = [o, i]$ of $L$ \emph{rectangular}, if there are $u_l, u_r \in [o, i] - \{o,i\}$ such that $i = u_l…
By a rectangular distributive lattice we mean the direct product of two non-singleton finite chains. We prove that the retracts (ordered by set inclusion and together with the empty set) of a rectangular distributive lattice $G$ form a…
To work more accurately with elements of the semigroup of the Stone Cech compactification of the discrete semigroup of natural numbers N under multiplication. We divided these elements into ultrafilters which are on finite levels and…
Four types of discrete transforms of Weyl orbit functions on the finite point sets are developed. The point sets are formed by intersections of the dual-root lattices with the fundamental domains of the affine Weyl groups. The finite sets…
Let $L$ denote a finite lattice with at least two points and let $A$ denote the incidence algebra of $L$. We prove that $L$ is distributive if and only if $A$ is an Auslander regular ring, which gives a homological characterisation of…
By a 1997 result of R. Freese, an $n$-element lattice has at most $2^{n-1}$ congruences. This motivates us to define the congruence density cd$(L)$ of a finite $n$-element lattice as $|$Con$(L)|/2^{n-1}$, where $|$Con$(L)|$ is the number of…
We prove that the acyclic reorientation poset of a directed acyclic graph $D$ is a lattice if and only if the transitive reduction of any induced subgraph of $D$ is a forest. We then show that the acyclic reorientation lattice is always…
A sectionally pseudocomplemented poset P is one which has the top element and in which every principal order filter is a pseudocomplemented poset. The sectional pseudocomplements give rise to an implication-like operation on P which…
We prove that the very simple lattices which consist of a largest, a smallest and $2n$ pairwise incomparable elements where $n$ is a positive integer can be realized as the lattices of intermediate subfactors of finite index and finite…
Simplicial complexes are generalizations of graphs that describe higher-order network interactions among nodes in the graph. Network dynamics described by graph Laplacian flows have been widely studied in network science and control theory,…
We develop a family of simple rank one theories built over quite arbitrary sequences of finite hypergraphs. (This extends an idea from the recent proof that Keisler's order has continuum many classes, however, the construction does not…
For a finite index sublattice $L$ of the root lattice $A_{n}$, we construct a deterministic algorithm to deform the lattice ideal $I_L$ to a nearby generic lattice ideal, answering a question posed by Miller and Sturmfels. Our algorithm is…
We show that a differential algebraic group can be filtered by a finite subnormal series of differential algebraic groups such that successive quotients are almost simple, that is have no normal subgroups of the same type. We give a…
We investigate categorical and amalgamation properties of the functor Idc assigning to every partially ordered abelian group G its semilattice of compact ideals Idc G. Our main result is the following. Theorem 1. Every diagram of finite…
This work investigates linear precoding over non-singular linear channels with additive white Gaussian noise, with lattice-type inputs. The aim is to maximize the minimum distance of the received lattice points, where the precoder is…
Power-type graphs, such as the power graph, the directed power graph, the enhanced power graph and the difference graph, encode significant information about the internal structure of a finite group. Despite substantial investigation in…
Most binary superlattices created using DNA functionalization or other approaches rely on particle size differences to achieve compositional order and structural diversity. Here we study two-dimensional (2D) assembly of DNA-functionalized…
Let $S$ be an infinite discrete semigroup. The operation on $S$ extends uniquely to the Stone-\v{C}ech compactification $\beta S$ making $\beta S$ a compact right topological semigroup with $S$ contained in its topological center. As such,…