Related papers: Finite complete rewriting systems for regular semi…

A combinatorial property of prositive group presentations, called completeness, is introduced, with an effective criterion for recognizing complete presentations, and an iterative method for completing an incomplete presentation. We show…

We investigate the orbits of automaton semigroups and groups to obtain algorithmic and structural results, both for general automata but also for some special subclasses. First, we show that a more general version of the finiteness problem…

Let $k$ be a perfect field such that for every $n$ there are only finitely many field extensions, up to isomorphism, of $k$ of degree $n$. If $G$ is a reductive algebraic group defined over $k$, whose characteristic is very good for $G$,…

We follow language theoretic approach to synchronizing automata and \v{C}ern\'{y}'s conjecture initiated in a series of recent papers. We find a precise lower bound for the reset complexity of a principal ideal languages. Also we show a…

If G is a semidirect product N by H with N normal and finitely generated then G has the property that every finite group is a quotient of some finite index subgroup of G if and only if one of N and H has this property. This has applications…

Let $S$ be a semigroup, let $n\in\mathbb{N}$ be a positive natural number, let $A,B\subseteq S$, let $\mathcal{U},\mathcal{V}\in\beta S$ and let let $\mathcal{F}\subseteq\{f:S^{n}\rightarrow S\}$. We say that $A$ is $\mathcal{F}$-finitely…

In this paper, we explain the importance of finite decomposition semigroups and present two theorems related to their structure.

In this paper, the complete algebraic structure of finite semisimple group algebra of a normally monomial group is described. The main result is illustrated by computing the explicit Wedderburn decomposition of finite semisimple group…

Let $M$ be a finite von Neumann algebra. In the first part, we give asymptotic results about $M$-stable sequences of weak*-continuous mappings which are related with operators belonging to $M$. In the second part, we extend, by a shorter…

In this paper, we study algorithmic problems for automaton semigroups and automaton groups related to freeness and finiteness. In the course of this study, we also exhibit some connections between the algebraic structure of automaton…

We determine the structure of the finite groups with the property that every cyclic subgroup is the intersection of maximal subgroups, comparing this property with the one where all proper subgroups are intersections of maximal subgroups.

We study finite semigroups of $n \times n$ matrices with rational entries. Such semigroups provide a rich generalization of transition monoids of unambiguous (and, in particular, deterministic) finite automata. In this paper we determine…

For a fixed Feynman graph one can consider Feynman integrals with all possible powers of propagators and try to reduce them, by linear relations, to a finite subset of integrals, the so-called master integrals. Up to now, there are numerous…

We study the class of groups having the property that every non-nilpotent subgroup is equal to its normalizer. These groups are either soluble or perfect. We completely describe the structure of soluble groups and finite perfect groups with…

The problem of computing the dimension of a left/right ideal in a group algebra F[G] of a finite group G over a field F is considered. The ideal dimension is related to the rank of a matrix originating from a regular left/right…

This thesis is dedicated to developing a dilation theory for semigroups of completely positive maps. The first part treats two-parameter semigroups, and contains also contributions to dilation theory of product system representations. The…

Let $\mathbf{K}$ be the class of countable structures $M$ with the strong small index property and locally finite algebraicity, and $\mathbf{K}_*$ the class of $M \in \mathbf{K}$ such that $acl_M(\{ a \}) = \{ a \}$ for every $a \in M$. For…

We prove that if $G$ is a finite simple group, then all irreducible complex representations of $G$ by be realized over the real numbers if and only if every element of $G$ may be written as a product of two involutions in $G$. This follows…

Gray and Ruskuc have shown that any group G occurs as the maximal subgroup of some free idempotent generated semigroup IG(E) on a biordered set of idempotents E, thus resolving a long standing open question. Given the group G, they make a…

Let $\mathcal{S}$ be a commutative semigroup, and let $T$ be a sequence of terms from the semigroup $\mathcal{S}$. We call $T$ an (additively) {\sl irreducible} sequence provided that no sum of its some terms vanishes. Given any element $a$…