Related papers: The submaximal clones on the three-element set wit…
In a finite real reflection group, the reflection length of each element is equal to the codimension of its fixed space, and the two coincident functions determine a partial order structure called the absolute order. In complex reflection…
Characterizations of "almost associative" binary operations generating a minimal clone are given for two interpretations of the term "almost associative". One of them uses the associative spectrum, the other one uses the index of…
We consider varieties generated by finite closure algebras whose canonical relations have two levels, and whose restriction to a level is an "extremal" relation, i.e. the identity or the universal relation. The corresponding logics have…
In this paper we study the real rank of monomials and we give an upper bound for the real rank of all monomials. We show that the real and the complex ranks of a monomial coincide if and only if the least exponent is equal to one.
We establish one-to-one correspondences between maximal antichains in products of two finite linear orders and other mathematical objects, such as certain alignments of two strings, walks on a grid, lattice paths, words of two or three…
We classify all finite groups with five relative commutativity degrees. Also, we give a partial answer to our previous conjecture on a lower bound of the number of relative commutativity degrees of finite groups.
Let $X$ be a finite or infinite chain and let $O(X)$ be the monoid of all endomorphisms of $X$. In this paper, we describe the largest regular subsemigroup of $O(X)$ and Green's relations on $O(X)$. In fact, more generally, if $Y$ is a…
Let $G$ be a finite almost simple group. It is well known that $G$ can be generated by 3 elements, and in previous work we showed that 6 generators suffice for all maximal subgroups of $G$. In this paper we consider subgroups at the next…
Clonoids are sets of finitary operations between two algebraic structures that are closed under composition with their term operations on both sides. We conjecture that, for finite modules $\mathbf A$ and $\mathbf B$ there are only finitely…
For any link and for any modulus $m$ we introduce an equivalence relation on the set of non-trivial m-colorings of the link (an m-coloring has values in Z/mZ). Given a diagram of the link, the equivalence class of a non-trivial m-coloring…
We determine the maximum number of maximal independent sets of arbitrary graphs in terms of their covering numbers and we completely characterize the extremal graphs. As an application, we give a similar result for K\"onig-Egerv\'ary graphs…
The following result has been shown recently in the form of a dichotomy: For every total clone $C$ on $\mathbf{2} := \{0,1\}$, the set $\mathcal{I}(C)$ of all partial clones on $\mathbf{2}$ whose total component is $C$, is either finite or…
A family $\mathcal L$ of subsets of a set $X$ is called linked if $A\cap B\ne\emptyset$ for any $A,B\in\mathcal L$. A linked family $\mathcal M$ of subsets of $X$ is maximal linked if $\mathcal M$ coincides with each linked family $\mathcal…
Every semigroup which is a finite disjoint union of copies of the free monogenic semigroup (natural numbers under addition) is finitely presented and residually finite.
A standard tool for classifying the complexity of equivalence relations on $\omega$ is provided by computable reducibility. This reducibility gives rise to a rich degree structure. The paper studies equivalence relations, which induce…
We study the ABDK relation using maximal cuts of one- and two-loop integrals with up to five external legs. We show how to find a special combination of integrals that allows the relation to exist, and how to reconstruct the terms with…
Recall that a $p$-group of order $p^ {n} >p^ {3} $ is of maximal class, if its nilpotency class is $n-1$. In this paper, we study the $p$-groups of maximal class. Furthermore, we introduce a subgroup of a $p$-group of maximal class called…
Let $R$ be an associative ring with 1, $G=GL(n, R)$ be the general linear group of degree $n\ge 3$ over $R$. In this paper we calculate the relative centralisers of the relative elementary subgroups or the principal congruence subgroups,…
Minimal prime graphs are connected graphs on at least two vertices whose complements satisfy the following conditions: triangle-freeness, 3-colorability, and edge-maximality with respect to the latter two properties. These graphs are prime…
We prove that every finite idempotent semigroup (band) is finitely related, which means that the clone of its term operations (i.e. operations induced by words) is determined by finitely many relations. This solves an open problem posed by…