Related papers: Embedding Groups into Distributive Subsets of the …
A semiring generalises the notion of a ring, replacing the additive abelian group structure with that of a commutative monoid. In this paper, we study a notion positioned between a ring and a semiring -- a semiring whose additive monoid is…
Finite groups that are embeddable in the multiplicative groups of division rings $K$ were completely determined by S. A. Amitsur in 1955. In case $K$ has characteristic $p>0$, the only possible finite subgroups of $K^*$ are cyclic groups,…
A subshift $X$ is called $c$-block gluing if for any integer $n\geq c$ and any two blocks $u$ and $v$ from the language of $X$ there exists an element of $X$ which has occurrences of $u$ and $v$ at distance $n$. In this note we study the…
An executable binary typically contains a large number of machine instructions. Although the statistics of popular instructions is well known, the distribution of non-popular instructions has been relatively under explored. Our finding…
Let $X$ be a nonempty set and let $i,j \in \{1,2,3,4\}$. We say that a binary operation $F:X^2\to X$ is $(i,j)$-selective if $$ F(F(x_1,x_2),F(x_3,x_4))~=~F(x_i,x_j), $$ for all $x_1,x_2,x_3,x_4\in X$. In this paper we provide…
Separable elements in Weyl groups are generalizations of the well-known class of separable permutations in symmetric groups. Gaetz and Gao showed that for any pair $(X,Y)$ of subsets of the symmetric group $\mathfrak{S}_n$, the…
Let $j:Y \to X$ be a continuous surjection of compact metric spaces. Whyburn proved that $j$ is irreducible, meaning that $j(F) \subsetneq X$ for any proper closed subset $F \subsetneq Y$, if and only if $j$ is almost one-to-one, in the…
Let $d > 1$, and let $(X,\alpha)$ and $(Y,\beta)$ be two zero-entropy ${\mathbb{Z}}^d$-actions on compact abelian groups by $d$ commuting automorphisms. We show that if all lower rank subactions of $\alpha$ and $\beta$ have completely…
We use mathematical induction to prove that the horizontal composition in the class of coherently diagonal complexes is indeed a binary operation. That is to say, the embedding of two coherently diagonal complexes in an alternating planar…
A unitary representation of a, possibly infinite dimensional, Lie group $G$ is called semibounded if the corresponding operators $i\dd\pi(x)$ from the derived representation are uniformly bounded from above on some non-empty open subset of…
The power graph of a group is the simple graph with vertices as the group elements, in which two distinct vertices are adjacent if and only if one of them can be obtained as an integral power of the other. We study (minimal) cut-sets of the…
Properties of a given symmetry group G are very important in investigation of a physical system invariant under its action. In the case of finite spin systems (magnetic rings, some planar macromolecules) the symmetry group is isomorphic…
We present recent results about the asymptotic behavior of ergodic products of isometries of a metric space X. If we assume that the displacement is integrable, then either there is a sublinear diffusion or there is, for almost every…
We show that every algebraic group scheme over a field with at least 8 elements can be realized as the group of automorphisms of a nonassociative algebra. This is only a modest improvement of the theorem of Gordeev and Popov (2003), but it…
In a former paper we introduced partial infinitary noncommutative semigroups and showed, among other, that significant differences arise in comparison with the commutative case, previously studied in the literature. For example, in the…
The distribution of a given sequence in the set of all sequences with n ones and m = M - n zeros are found by relating the problem to the partitions of a natural number in m natural summands, taking into account the order. The formulas…
We show that in any infinitely distributive inverse semigroup the existing binary meets distribute over all the joins that exist.
We study actions of countable discrete groups which are amenable in the sense that there exists a mean on X which is invariant under the action of G. Assuming that G is nonamenable, we obtain structural results for the stabilizer subgroups…
We show that the binary coin set minimizes the number of coins needed to guarantee the ability to make change in any one transaction and its asymptotic uniform average cost is no worse than that of any completely greedy coin set.
The symmetric group on a set acts transitively on its subsets of a given size. We define homomorphisms between the corresponding permutation modules, defined over a field of characteristic two, which generalize the boundary maps from…