Related papers: Irreducibility of Semigroup Morphisms
The free singularity locus of a noncommutative polynomial f is defined to be the sequence $Z_n(f)=\{X\in M_n^g : \det f(X)=0\}$ of hypersurfaces. The main theorem of this article shows that f is irreducible if and only if $Z_n(f)$ is…
We prove that the Fermi surface of a connected doubly periodic self-adjoint discrete graph operator is irreducible at all but finitely many energies provided that the graph (1) can be drawn in the plane without crossing edges (2) has…
Suppose $f(x,y) + \frac{\kappa}{2} \|x\|^2 - \frac{\sigma}{2}\|y\|^2$ is convex where $\sigma>0$, and the argmin function $\gamma(x) = \{ \gamma : \inf_y f(x,y) = f(x,\gamma)\}$ exists and is single valued. We will prove $\gamma$ is…
In this paper, we classify irreducible representations of affine group superschemes over fields $F$ of characteristic not two in terms of those over a separable closure $F^{\mathrm{sep}}$ and their Galois twists. We also compute the…
Given a polynomial P in several variables over an algebraically closed field, we show that except in some special cases that we fully describe, if one coefficient is allowed to vary, then the polynomial is irreducible for all but at most…
A new scheme for proving pseudoidentities from a given set {\Sigma} of pseudoidentities, which is clearly sound, is also shown to be complete in many instances, such as when {\Sigma} defines a locally finite variety, a pseudovariety of…
In this paper we prove that a pure, regular, totally odd, polarizable weakly compatible system of $l$-adic representations is potentially automorphic. The innovation is that we make no irreducibility assumption, but we make a purity…
The literature contains interesting examples of inclusions of simple C$^*$-algebras with the property that all intermediate C$^*$-algebras likewise are simple. In this article we take up a systematic study of such inclusions, which we refer…
A regular bipartite graph $\Gamma$ is called semisymmetric if its full automorphism group $\mathrm{Aut}(\Gamma)$ acts transitively on the edge set but not on the vertex set. For a subgroup $G$ of $\mathrm{Aut}(\Gamma)$ that stabilizes the…
We study groups of germs of complex diffeomorphisms having a property called irreducibility. The notion is motivated by the similar property of the fundamental group of the complement of na irreducible hypersurface in the complex projective…
We prove that for an abelian group $G$ of order $n$ the morphism $ \varphi\colon \mathbf{P}(V^*)\longrightarrow \mathbf{P} ((\mathrm{sym}^n V^*)^G)$ defined by $\varphi([f]) = [\prod_{\sigma\in G} \sigma \cdot f ]$ is nondegenerate for…
We prove that given a finite rank free group $\mathbb{F}$ of rank $\geq 3$ and two exponentially growing outer automorphisms $\psi$ and $\phi$ with dual lamination pairs $\Lambda^\pm_\psi$ and $\Lambda^\pm_\phi$ associated to them, and…
A semigroup is \emph{amiable} if there is exactly one idempotent in each $\mathcal{R}^*$-class and in each $\mathcal{L}^*$-class. A semigroup is \emph{adequate} if it is amiable and if its idempotents commute. We characterize adequate…
Recent algorithmic advances in algebraic automata theory drew attention to semigroupoids (semicategories). These are mathematical descriptions of typed computational processes, but they have not been studied systematically in the context of…
Given a geometrically irreducible subscheme X in P^n over F_q of dimension at least 2, we prove that the fraction of degree d hypersurfaces H such that the intersection of H and X is geometrically irreducible tends to 1 as d tends to…
The avoidability, or unavoidability of patterns in words over finite alphabets has been studied extensively. A word (pattern) over a finite set is said to be unavoidable if, for all but finitely many words, there exists a morphism mapping…
Let $\sigma=\{\sigma_{i}|i\in I\}$ be a partition of the set of all primes $\mathbb{P}$, $G$ a finite group and $\sigma(G)=\{\sigma_{i}|\sigma_{i}\cap \pi(|G|)\neq\emptyset\}$. A subgroup $S$ of a group $G$ is called a $\sigma_i$-sylowizer…
The paper studies the solvability for square systems of pseudodifferential operators. We assume that the system is of principal type, i.e., the principal symbol vanishes of first order on the kernel. We shall also assume that the…
Let G be a finite group and N be a non-trivial normal subgroup of G, such that the average character degree of irreducible characters in Irr(G|N) is less than or equal to 16=5. Then we prove that N is solvable. Also, we prove the…
A permutation $\sigma\in S_n$ is said to be $k$-universal or a $k$-superpattern if for every $\pi\in S_k$, there is a subsequence of $\sigma$ that is order-isomorphic to $\pi$. A simple counting argument shows that $\sigma$ can be a…