Related papers: Characterizing absolutely irreducible integer-valu…
Let $D$ be a commutative domain with field of fractions $K$ and let $A$ be a torsion-free $D$-algebra such that $A \cap K = D$. The ring of integer-valued polynomials on $A$ with coefficients in $K$ is ${\rm Int}_K(A) = \{f \in K[X] \mid…
The goal of this paper is to give a numerical criterion for an open question in $p$-adic Fourier theory. Let $F$ be a finite extension of $\mathbf{Q}_p$. Schneider and Teitelbaum defined and studied the character variety $\mathfrak{X}$,…
Let ${\mathcal B}=\{b_i \}_{i=1}^\infty$ be a fixed sequence of pairwise distinct elements of a number field $k$. Given the integers $2\leq s \leq r$, assuming a quantitative version of Vojta's conjecture on the bounded degree algebraic…
We study the non-uniqueness of factorizations of non zero-divisors into atoms (irreducibles) in noncommutative rings. To do so, we extend concepts from the commutative theory of non-unique factorizations to a noncommutative setting. Several…
Let $\F_q$ be the finite field with $q$ elements, $p=\Char \F_q$. The group $\GL_2(\F_q)$ acts naturally in the set of irreducible polynomials over $\F_q$ of degree at least $2$. In this paper we are interested in the characterization and…
We generalize an approach from a 1960 paper by Ljunggren, leading to a practical algorithm that determines the set of $N > \operatorname{deg}(c) + \operatorname{deg}(d)$ such that the polynomial $$f_N(x) = x^N c(x^{-1}) + d(x)$$ is…
A computably presented algebraic field $F$ has a \emph{splitting algorithm} if it is decidable which polynomials in $F[X]$ are irreducible there. We prove that such a field is computably categorical iff it is decidable which pairs of…
We study the number of irreducible factors (over $\mathbb{Q}$) of the $n$th iterate of a polynomial of the form $f_r(x) = x^2 + r$ for rational $r$. When the number of such factors is bounded independent of $n$, we call $f_r(x)$…
Let $\mathbb F_q$ be the finite field with $q$ elements, $f, g\in \mathbb F_q[x]$ be polynomials of degree at least one. This paper deals with the asymptotic growth of certain arithmetic functions associated to the factorization of the…
An element $g$ of a finite group $G$ is said to be vanishing in $G$ if there exists an irreducible character $\chi$ of $G$ such that $\chi(g)=0$; in this case, $g$ is also called a zero of $G$. The aim of this paper is to obtain structural…
We estimate the number $|\mathcal{A}_{\boldsymbol\lambda}|$ of elements on a nonlinear family $\mathcal{A}$ of monic polynomials of $\mathbb{F}_q[T]$ of degree $r$ having factorization pattern…
We compute the graded rank of the cohomology of the hyperplane complement associated with a quaternionic reflection group, and observe that it factors into irreducible factors with positive integer coefficients. For an irreducible group,…
An algorithm for irreducible decomposition of representations of finite groups over fields of characteristic zero is described. The algorithm uses the fact that the decomposition induces a partition of the invariant inner product into a…
Let $R$ be either the ring of Lipschitz quaternions, or the ring of Hurwitz quaternions. Then, $R$ is a subring of the division ring $\mathbb{D}$ of rational quaternions. For $S \subseteq R$, we study the collection $\rm{Int}(S,R) = \{f \in…
In this work, we classify all finite groups such that for every field extension F of \mathbb{Q}, F is the field of values of at most 3 irreducible characters.
We give a classification of all irreducible completely pointed $U_q(\mathfrak{sl}_{n+1})$ modules over a characteristic zero field in which $q$ is not a root of unity. This generalizes the classification result of Benkart, Britten and…
We present counting methods for some special classes of multivariate polynomials over a finite field, namely the reducible ones, the s-powerful ones (divisible by the s-th power of a nonconstant polynomial), and the relatively irreducible…
Let $\mathbb{K}$ be an algebraically closed field of characteristic zero and let $\mathbb{K}_{C}[[x_{1},...,x_{e}]]$ be the ring of formal power series in several variables with exponents in a line free cone $C$. We consider irreducible…
We study the problem of indexing irreducible polynomials over finite fields, and give the first efficient algorithm for this problem. Specifically, we show the existence of poly(n, log q)-size circuits that compute a bijection between {1,…
The set of mxn singular matrix pencils with normal rank at most r is an algebraic set with r+1 irreducible components. These components are the closure of the orbits (under strict equivalence) of r+1 matrix pencils which are in Kronecker…