English
Related papers

Related papers: Characterizing absolutely irreducible integer-valu…

200 papers

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…

Rings and Algebras · Mathematics 2021-07-19 G. Peruginelli , N. J. Werner

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}$,…

Number Theory · Mathematics 2025-04-16 Laurent Berger , Johannes Sprang

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…

Number Theory · Mathematics 2023-12-04 Sajad Salami

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…

Rings and Algebras · Mathematics 2015-09-03 Nicholas R. Baeth , Daniel Smertnig

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…

Number Theory · Mathematics 2016-09-06 Lucas Reis

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…

Number Theory · Mathematics 2018-03-30 William Sawin , Mark Shusterman , Michael Stoll

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…

Logic · Mathematics 2018-02-12 Russell Miller , Alexandra Shlapentokh

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)$…

Number Theory · Mathematics 2021-11-24 David DeMark , Wade Hindes , Rafe Jones , Moses Misplon , Michael Stoll , Michael Stoneman

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…

Number Theory · Mathematics 2019-08-06 Lucas Reis

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…

Group Theory · Mathematics 2019-03-04 M. J. Felipe , A. Martínez-Pastor , V. M. Ortiz-Sotomayor

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…

Combinatorics · Mathematics 2018-07-24 Guillermo Matera , Mariana Pérez , Melina Privitelli

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,…

Representation Theory · Mathematics 2025-10-22 Stephen Griffeth , David Guevara

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…

Representation Theory · Mathematics 2019-06-05 Vladimir V Kornyak

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…

Rings and Algebras · Mathematics 2025-07-08 Nicholas J. Werner

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.

Group Theory · Mathematics 2023-01-02 Juan Martínez

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…

Representation Theory · Mathematics 2020-06-09 V. Futorny , J. Hartwig , E. Wilson

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…

Commutative Algebra · Mathematics 2013-11-12 Joachim von zur Gathen , Alfredo Viola , Konstantin Ziegler

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…

Algebraic Geometry · Mathematics 2021-05-11 Ali Abbas , Abdallah Assi

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,…

Computational Complexity · Computer Science 2015-04-03 Swastik Kopparty , Mrinal Kumar , Michael Saks

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…

Algebraic Geometry · Mathematics 2016-06-09 Fernando De Terán , Froilán M. Dopico , J. M. Landsberg
‹ Prev 1 8 9 10 Next ›