Related papers: Irreducibility of Semigroup Morphisms

We present a few factorizations of polynomials over finite fields. These factorizations are related to traces, compositions of polynomials and binomial coefficients. As a corollary we obtain a description of all irreducible polynomials…

Let $\mathscr{C}$ be an additive category with an involution $\ast$. Suppose that $\varphi : X \rightarrow X$ is a morphism of $\mathscr{C}$ with core inverse $\varphi^{\co} : X \rightarrow X$ and $\eta : X \rightarrow X$ is a morphism of…

The purpose of this paper is to give an algorithm for deciding the irreducibility of reduced algebroid curves over an algebraically closed field of arbitrary characteristic. To do this, we introduce a new notion of local tropical variety…

The character of an irreducible admissible representation of a $p$-adic reductive group is known to be a constant function in some neighborhood of any regular semisimple element $\gamma$ in the group. Under certain mild restrictions on…

Let $G$ be a simple linear algebraic group defined over an algebraically closed field of characteristic $p\geq 0$ and let $\phi$ be a $p$-restricted irreducible representation of $G$. Let $T$ be a maximal torus of $G$ and $s\in T$. We say…

Let $S$ be one of $\{aba,bcb\}$ and $\{aba, aca\}$, and let $w$ be an infinite square-free word over $\Sigma=\{a,b,c\}$ with no factor in $S$. Suppose that $f:\Sigma\rightarrow T^*$ is a non-erasing morphism. Word $f(w)$ is square-free if…

We transfer several elementary geometric properties of rigid-analytic spaces to the world of adic spaces, more precisely to the category of adic spaces which are locally of (weakly) finite type over a non-archimedean field. This includes…

We study first-order logic (FO) over the structure consisting of finite words over some alphabet $A$, together with the (non-contiguous) subword ordering. In terms of decidability of quantifier alternation fragments, this logic is…

We show that the word problem for an amalgam $[S_1,S_2;U,\omega_1,\omega_2]$ of inverse semigroups may be undecidable even if we assume $S_1$ and $S_2$ (and therefore $U$) to have finite $\mathcal{R}$-classes and $\omega_1,\omega_2$ to be…

The first part of the paper centers in the study of embeddability between partially commutative groups. In [KK], for a finite simplicial graph $\Gamma$, the authors introduce an infinite, locally infinite graph $\Gamma^e$, called the…

We prove that a finite-dimensional irreducible Hopf algebra $H$ in positive characteristic is semisimple, if and only if it is commutative and semisimple, if and only if the restricted Lie algebra $P(H)$ of the primitives is a torus. This…

Let $G$ be a finite group and $\sigma_1(G)=\frac{1}{|G|}\sum_{H\leq G}\,|H|$. In this paper, we prove that if $\sigma_1(G)<2+\frac{11}{|G|}$\,, then $G$ is supersolvable. In particular, some new characterizations of the well-known groups…

A closed subgroup of a semisimple algebraic group is called irreducible if it lies in no proper parabolic subgroup. In this paper we classify all irreducible $A_1$ subgroups of exceptional algebraic groups $G$. Consequences are given…

In this article, we obtain upper bounds on the number of irreducible factors of some classes of polynomials having integer coefficients, which in particular yield some of the well known irreducibility criteria. For devising our results, we…

We give a combinatorial description of all affine spherical varieties with prescribed weight monoid $\Gamma$. As an application, we obtain a characterization of the irreducible components of Alexeev and Brion's moduli scheme $\mathrm…

Positive $C_0$-semigroups that occur in concrete applications are, more often than not, irreducible. Therefore a deep and extensive theory of irreducibility has been developed that includes characterizations, perturbation analysis, and…

The authors [3] proved that the endomorphism semiring of a nontrivial semilattice is always subdirectly irreducible and described its monolith. Here we prove that the endomorphism semiring of a commutative inverse semigroup with at least…

A function on a discrete group is weakly combable if its discrete derivative with respect to a combing can be calculated by a finite state automaton. A weakly combable function is bicombable if it is Lipschitz in both the left and right…

This article deals with the notion of factorability. Elements of a factorable group or monoid possess a normal form, which leads to a small complex homotopy equivalent to its bar complex, thus computing its homology. We investigate the…

For sets $A, B\subset \mathbb N$, their sumset is $A + B := \{a+b: a\in A, b\in B\}$. If we cannot write a set $C$ as $C = A+B$ with $|A|, |B|\geq 2$, then we say that $C$ is $\textit{irreducible}$. The question of whether a given set $C$…