相关论文: Notes on planar semimodular lattices. I. Construct…

In an earlier paper, to describe how a congruence spreads from a prime interval to another in a finite lattice, I introduced the concept of prime-perspectivity and its transitive extension, prime-projectivity and proved the…

We introduce a systematic method for constructing a class of lattice structures that we call ``partial line graphs''.In tight-binding models on partial line graphs, energy bands with flat energy dispersions emerge.This method can be applied…

A method of constructing a class of bihamiltonian structures is presented. Elements of this class are generalizations of the so-called bihamiltonian structures of general position on odd-dimensional manifolds. The method consists in a…

This paper examines the structure of poset matrices by formulating a set of new construction rules for this purpose. In this direction, the technique of partial composition operation will be introduced as the basis for the construction of…

We completely determine all semigroup varieties satysfiyng a permutational identity of length 3 that are modular elements of the lattice of all semigroup varieties. Using this result, we provide an example of a semigroup variety that is a…

Positive semidefinite matrices partitioned into a small number of Hermitian blocks have a remarkable property. Such a matrix may be written in a simple way from the sum of its diagonal blocks

In recent work, M. Just and the second author defined a class of "semi-modular forms" on $\mathbb C$, in analogy with classical modular forms, that are "half modular" in a particular sense; and constructed families of such functions as…

We introduce the extra slow Tamari lattices, a new family of lattices defined on faithfully balanced tableaux. These tableaux arise naturally from the representation theory of type \( A \) quivers, and our construction extends the classical…

We consider the problem of constructing semisimple subalgebras of real (semi-) simple Lie algebras. We develop computational methods that help to deal with this problem. Our methods boil down to solving a set of polynomial equations. In…

Let $L$ be a planar semimodular lattice. We call $L$ \emph{slim}, if it has no $\mthree$ sublattice. Let us define an \emph{SPS lattice} as a slim, planar, semimodular lattice $L$. In 2016, I proved a property of congruences of SPS lattices…

Quasi-lattices are introduced in terms of 'join' and 'meet' operations. It is observed that quasi-lattices become lattices when these operations are associative and when these operations satisfy 'modularity' conditions. A fundamental…

We present a simple construction of hat tilings. The construction can be carried out by superimposing a triangular grid on a specially colored image and reading off the orientation of the tiles. We show that our construction produces valid…

Realistic 3D-conformations of protein structures can be embedded in a cubic lattice using exclusively integer numbers, additions, subtractions and boolean operations.

This paper deals with join-semilattices whose sections, i.e. principal filters, are pseudocomplemented lattices. The pseudocomplement of a\vee b in the section [b,1] is denoted by a\rightarrow b and can be considered as the connective…

We construct and classify all Poisson structures on quasimodular forms that extend the one coming from the first Rankin-Cohen bracket on the modular forms. We use them to build formal deformations on the algebra of quasimodular forms.

This paper investigates the theory of lattices, focusing on extending lattices relative to abstract classes, modular lattices, and torsion lattices. Definitions of type-1 and type-2 extending lattices are provided, along with their weakly…

Motivated by the classical work of Halmos on functional monadic Boolean algebras we derive three basic sup-semilattice constructions, among other things the so-called powersets and powerset operators. Such constructions are extremely useful…

The $E_8$ root lattice can be constructed from the modular curve $X(13)$ by the invariant theory for the simple group $\text{PSL}(2, 13)$. This gives a different construction of the $E_8$ root lattice. It also gives an explicit construction…

Finite (upper) nearlattices are essentially the same mathematical entities as finite semilattices, finite commutative idempotent semigroups, finite join-enriched meet semilattices, and chopped lattices. We prove that if an $n$-element…

We consider posets of lattice paths (endowed with a natural order) and begin the study of such structures. We give an algebraic condition to recognize which ones of these posets are lattices. Next we study the class of Dyck lattices (i.e.,…