Related papers: The minimal clones above the permutations

The upper estimate of the percolation threshold of the Bernoulli random field on the hexagonal lattice is found. It is done on the basis of the cluster decomposition. Each term of the decomposition is estimated using the number estimate of…

A permutation is called {\it {block-wise simple}} if it contains no interval of the form $p_1\oplus p_2$ or $p_1 \ominus p_2$. We present this new set of permutations and explore some of its combinatorial properties. We present a generating…

Let kappa be an uncountable regular cardinal. Assuming 2^kappa=kappa^+, we show that the clone lattice on a set of size kappa is not dually atomic.

We introduce ballot matrices, a signed combinatorial structure whose definition naturally follows from the generating function for labeled interval orders. A sign reversing involution on ballot matrices is defined. We show that matrices…

A permutation polytope is the convex hull of a group of permutation matrices. In this paper we investigate the combinatorics of permutation polytopes and their faces. As applications we completely classify permutation polytopes in…

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…

In this paper, firstly we show that the entropy constants of the number of independent sets on certain plane lattices are the same as the entropy constants of the corresponding cylindrical and toroidal lattices. Secondly, we consider three…

The theory of limits of permutations leads to limit objects called permutons, which are certain Borel measures on the unit square. We prove that permutons avoiding a given permutation of order $k$ have a particularly simple structure.…

We determine the minimal polynomial of each element of the double cover $G$ of the symmetric or alternating group in every irreducible spin representation of $G$.

We survey results devoted to the lattice of varieties of monoids. Along with known results, some unpublished results are given with proofs. A number of open questions and problems are also formulated.

We obtain an upper and lower bound for the number of reduced words for a permutation in terms of the number of braid classes and the number of commutation classes of the permutation. We classify the permutations that achieve each of these…

It is shown that the lattices of flats of boolean representable simplicial complexes are always atomistic, but semimodular if and only if the complex is a matroid. A canonical construction is introduced for arbitrary finite atomistic…

The idea that the elementary particles might have the symmetry of knots has had a long history. In any current formulation of this idea, however, the knot must be quantized. The present review is a summary of a small set of papers that…

We show that many important varieties and sets of varieties of semigroups may be defined by relatively simple and transparent first-order formulas in the lattice of all semigroup varieties.

We completely determine all lower-modular elements of the lattice of all semigroup varieties. As a corollary, we show that a lower-modular element of this lattice is modular.

For finite permutation groups, simplicity of the augmentation submodule is equivalent to $2$-transitivity over the field of complex numbers. We note that this is not the case for transformation monoids. We characterize the finite…

We introduce the notion of clone algebra, intended to found a one-sorted, purely algebraic theory of clones. Clone algebras are defined by true identities and thus form a variety in the sense of universal algebra. The most natural clone…

We consider the problem of factoring permutations as a product of special types of transpositions, namely, those transpositions involving two positions with bounded distances. In particular, we investigate the minimum number, $\delta$, such…

We characterize the finite intervals of the Muchnik lattice by proving that they are a certain proper subclass of the finite distributive lattices.

A numerical monoid is an additive submonoid of the non-negative integers. Given a numerical monoid $S$, consider the family of "shifted" monoids $M_n$ obtained by adding $n$ to each generator of $S$. In this paper, we examine minimal…