English
Related papers

Related papers: On the reducibility behaviour of Thue polynomials

200 papers

A method to construct irreducible unitary representations of a hyperspecial compact subgroup of a reductive group over p-adic field with odd p is presented. Our method is based upon Cliffods theory and Weil representations over finite…

Group Theory · Mathematics 2018-05-17 Koichi Takase

After the language of module and theirs morphisms, this short course presents matricial calculus and determinants in a commutative ring as appliction of ``remarquable identities'' in the ring of polynomials with integer coefficients with…

History and Overview · Mathematics 2025-08-08 Alexis Marin

We show that the principal specialization of the Schubert polynomial at $w$ is bounded below by $1+p_{132}(w)+p_{1432}(w)$ where $p_u(w)$ is the number of occurrences of the pattern $u$ in $w$, strengthening a previous result by A.…

Combinatorics · Mathematics 2019-10-22 Yibo Gao

Say a trinomial $x^n+A x^m+B \in \Q[x]$ has reducibility type $(n_1,n_2,...,n_k)$ if there exists a factorization of the trinomial into irreducible polynomials in $\Q[x]$ of degrees $n_1$, $n_2$,...,$n_k$, ordered so that $n_1 \leq n_2 \leq…

Number Theory · Mathematics 2011-12-20 Andrew Bremner , Maciej Ulas

Answering a question asked by Hsia and Tucker in their paper on the finiteness of greatest common divisors of iterates of polynomials, we prove that if $f, g \in \mathbb{C}(X)$ are compositionally independent rational functions and $c \in…

Dynamical Systems · Mathematics 2026-02-03 Chatchai Noytaptim , Xiao Zhong

We prove a theorem which gives a bijection between the support $\tau$-tilting modules over a given finite-dimensional algebra $A$ and the support $\tau$-tilting modules over $A/I$, where $I$ is the ideal generated by the intersection of the…

Representation Theory · Mathematics 2020-03-26 Florian Eisele , Geoffrey Janssens , Theo Raedschelders

As an extension of the classical irreducibility result of Dumas, a factorization result for polynomials over any valued field with a Krull valuation of arbitrary rank is proved. Further, a lower degree factor bound on factors of a given…

Number Theory · Mathematics 2025-11-27 Rishu Garg , Jitender Singh

We study the family of rational sets of words, called completely reducible and which are such that the syntactic representation of their characteristic series is completely reducible. This family contains, by a result of Reutenauer, the…

Formal Languages and Automata Theory · Computer Science 2016-11-22 Dominique Perrin

In this paper we present algorithmic considerations and theoretical results about the relation between the orders of certain groups associated to the components of a polynomial and the order of the group that corresponds to the polynomial,…

Symbolic Computation · Computer Science 2008-05-15 Jaime Gutierrez , David Sevilla

We consider some combinatorial problems on matrix polynomials over finite fields. Using results from control theory we give a proof of a result of Helmke, Jordan and Lieb on the number of linear unimodular matrix polynomials over a finite…

Combinatorics · Mathematics 2020-05-11 Akansha Arora , Samrith Ram , Ayineedi Venkateswarlu

Let $m, n$ be positive integers such that $m>1$ divides $n$. In this paper, we introduce a special class of piecewise-affine permutations of the finite set $[1, n]:=\{1, \ldots, n\}$ with the property that the reduction $\pmod m$ of $m$…

Number Theory · Mathematics 2020-03-13 Lucas Reis , Sávio Ribas

We present a new proof of a theorem of Schur's determining the least common multiple of the orders of all finite groups of complex $n \times n$-matrices whose elements have traces in the field of rational numbers. The basic method of proof…

Group Theory · Mathematics 2007-05-23 Robert M. Guralnick , Martin Lorenz

In this paper we study the behaviour of modules over finite dimensional algebras whose endomorphism algebra is a division ring. We show that there are finitely many such modules in the module category of an algebra if and only if the length…

Representation Theory · Mathematics 2020-06-09 Sibylle Schroll , Hipolito Treffinger

This article precisely defines huge proofs within the system of Natural Deduction for the Minimal implicational propositional logic \mil. This is what we call an unlimited family of super-polynomial proofs. We consider huge families of…

Logic in Computer Science · Computer Science 2021-03-25 Edward Hermann Haeusler

In this paper, we obtain several new factorization results for certain classes of polynomials having integer coefficients. In doing so, we use the information about prime factorization of the value taken up by such polynomials and their…

Number Theory · Mathematics 2025-12-24 Rishu Garg , Jitender Singh

In this paper we give a factorization theorem for the ring of exponential polynomials in many variables over an algebraically closed field of characteristic 0 with an exponentiation. This is a generalization of the factorization theorem due…

Rings and Algebras · Mathematics 2012-06-29 P. D'Aquino , G. Terzo

We prove R = T theorems for certain reducible residual Galois representations. We answer in the positive a question of Gross and Lubin on whether certain Hecke algebras T are discrete valuation rings. In order to prove these results we…

Number Theory · Mathematics 2007-05-23 Frank Calegari

Extending work of J. Raleigh, we compute polynomials $P_{n,F}(x)$ associated to certain families $F = \{f_m\}_{m = 3, 4, ...}$ of modular forms for Hecke groups $G(\lambda_m)$ with the property that $P_{n,F}(m)$ is the $n^{th}$ coefficient…

Number Theory · Mathematics 2021-09-16 Barry Brent

We show that the common theory of all modules over a tubular algebra (over a recursive algebraically closed field) is decidable. This result supports a long standing conjecture of Mike Prest which says that a finite-dimensional algebra…

Logic · Mathematics 2024-12-23 Lorna Gregory

We prove a recent conjecture by Ulas on reducible polynomial substitutions.

Number Theory · Mathematics 2019-08-01 Peter Müller