相关论文: On the variety of strict pseudosemilattices
In [3], a basis of identities {u_n = v_n | n\geq 2} for the variety SPS of all strict pseudosemilattices was determined. Each one of these identities u_n = v_n has a peculiar 2-content D_n. In this paper we study the varieties of…
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…
For every semilattice $\mathcal{S}=(S,+)$, the set $\mathrm{End}(\mathcal{S})$ of its endomorphisms forms a semiring under point-wise addition and composition. We prove that the semiring of all endomorphisms of the 3-element chain has no…
Following G. Gr\"atzer and E. Knapp (2007), a slim semimodular lattice, SPS lattice for short, is a finite planar semimodular lattice having no $M_3$ as a sublattice. An SPS lattice is a slim rectangular lattice if it has exactly two doubly…
We examine varieties of epigroups as unary semigroups, that is semigroups equipped with an additional unary operation of pseudoinversion. The article contains two main results. The first of them indicates a countably infinite family of…
A new layers method is presented for multipartite separability of density matrices from simple graphs. Full separability of tripartite states is studied for graphs on degree symmetric premise. The models are generalized to multipartite…
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…
The finite basis property is often connected with the finite rank property, which it entails. Many examples have been produced of finite rank varieties which are not finitely based. In this note, we establish a result on nilpotent…
This is a survey on the finite basis problem for varieties of algebraic systems. Our exposition is in two directions: (i) We give numerous examples of varieties which are not finitely based. (ii) We give examples of important varieties with…
We introduce an algorithm for computing closure systems derived from a family of implications on a set. Semilattices presentations are explored and used in conjunction with the algorithm to compute various types of lattices freely generated…
We present scheme theoretic methods that apply to the study of secant varieties. This mainly concerns finite schemes and their smoothability. The theory generalises to the base fields of any characteristic, and even to non-algebraically…
We study lattices in free abelian groups of infinite rank that are invariant under the action of the infinite symmetric group, with emphasis on finiteness of their equivariant bases. Our framework provides a new method for proving…
In the last years many results in the area of semidefinite programming were obtained for invariant (finite dimensional, or infinite dimensional) semidefinite programs - SDPs which have symmetry. This was done for a variety of problems and…
A variety is finitely universal if its lattice of subvarieties contains an isomorphic copy of every finite lattice. Examples of finitely universal varieties of semigroups have been available since the early 1970s, but it is unknown if there…
We consider random perfect matchings on a general class of contracting bipartite graphs by letting certain edge weights be 0 on the contracting square-hexagon lattice in a periodic way. We obtain a deterministic limit shape in the scaling…
It is shown that the universal theory of the free pseudocomplemented distributive lattice is decidable and a recursive axiomatization is presented. This contrasts with the case of the full elementary theory of the finitely generated free…
In this paper we study the possibility to define irreducible representations of the symmetric groups with the help of finitely many relations. The existence of finite bases is established for the classes of representations corresponding to…
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 begin a systematic study of finite semigroups that generate join irreducible members of the lattice of pseudovarieties of finite semigroups, which are important for the spectral theory of this lattice. Finite semigroups $S$ that generate…
We show that if $\mathsf V$ is a semigroup pseudovariety containing the finite semilattices and contained in $\mathsf {DS}$, then it has a basis of pseudoidentities between finite products of regular pseudowords if, and only if, the…