相关论文: Finite diamond-colored modular and distributive la…

Colouring problems arising from group-based constructions provide a natural link between combinatorics and algebra, particularly in the study of Cayley graphs and Latin squares. We introduce the notion of colouring bijections of finite…

Since for the classification of finite (congruence-)simple semirings it remains to classify the additively idempotent semirings, we progress on the characterization of finite simple additively idempotent semirings as semirings of…

We introduce the class of split regular Hom-Lie color algebras as the natural generalization of split Lie color algebras. By developing techniques of connections of roots for this kind of algebras, we show that such a split regular Hom-Lie…

We consider a class of infinite-dimensional, modular, graded Lie algebras, which includes the graded Lie algebra associated to the Nottingham group with respect to its lower central series. We identify two subclasses of Nottingham Lie…

A relational structure is homomorphism-homogeneous (HH-homogeneous for short) if every homomorphism between finite induced substructures of the structure can be extended to a homomorphism over the whole domain of the structure. Similarly, a…

We consider a class of lattice paths with certain restrictions on their ascents and down steps and use them as building blocks to construct various families of Dyck paths. We let every building block $P_j$ take on $c_j$ colors and count all…

Lattices and partially ordered sets have played an increasingly important role in coding theory, providing combinatorial frameworks for studying structural and algebraic properties of error-correcting codes. Motivated by recent works…

We introduce a canonical operator-theoretic construction associated to a finite geometric lattice, in which a simple nonassociative ``diamond product'' on the lattice basis gives rise to a family of creation operators indexed by atoms and a…

We study $k$-tilings ($k$-tuples of domino tilings) of the Aztec diamond of rank $m$. We assign a weight to each $k$-tiling, depending on the number of dominos of certain types and the number of "interactions" between the tilings. Employing…

It came to the attention of myself and the coauthors of (S., Rozowski, Silva, Rot, 2022) that a number of process calculi can be obtained by algebraically presenting the branching structure of the transition systems they specify. Labelled…

We establish a formal connection between algorithmic correspondence theory and certain dual characterization results for finite lattices, similar to Nation's characterization of a hierarchy of pseudovarieties of finite lattices,…

We show that every finite semilattice can be represented as an atomized semilattice, an algebraic structure with additional elements (atoms) that extend the semilattice's partial order. Each atom maps to one subdirectly irreducible…

A mixed lattice vector space is a partially ordered vector space with two partial orderings and certain lattice-type properties. In this paper we first give some fundamental results in mixed lattice groups, and then we investigate the…

We adapt methods from the theory of complex semisimple Lie algebras to develop a root theory for a class of simple $\mathbb{Z}_2 \times \mathbb{Z}_2$-graded (color) Lie algebras, which we call basic. As an application, assuming that the…

Model sets (also called cut and project sets) are generalizations of lattices, and multi-component model sets are generalizations of lattices with colourings. In this paper, we study self-similarities of multi-component model sets. The main…

We study a class of observables in four-dimensional superconformal Yang--Mills theories which, in the planar limit at finite 't Hooft coupling, can be expressed as determinants of semi-infinite matrices built from Bessel functions. This…

In this article, we investigate the combinatorial and algebraic properties of the lcm-lattice associated with the edge ideal of a hypergraph. Let $\H$ be a hypergraph, $I(\H)$ its corresponding edge ideal in a polynomial ring in $n$…

Birkhoff's representation theorem (Birkhoff, 1937) defines a bijection between elements of a distributive lattice and the family of upper sets of an associated poset. Although not used explicitly, this result is at the backbone of the…

A multi-component electron model on a lattice is constructed whose ground state exhibits a spontaneous ordering which follows the rule of map-coloring used in the solution of the four color problem. The number of components is determined by…

Birkhoff's representation theorem for finite distributive lattices states that any finite distributive lattice is isomorphic to the lattice of order ideals (lower sets) of the partial order of the join-irreducible elements of the lattice.…