Results 11 to 20 of about 68,753 (202)
The distance to an irreducible polynomial, II [PDF]
Mathematics of Computation, 2012 A classical question of Turán asks for the existence of an absolute constant \(C\) such that for every polynomial \(f\) having integer coefficients there exists an irreducible polynomial \(g\) having integer coefficients, for which \(\deg(g)\leq\deg(f)\) and \(L(f-g)\leq C\).
Michael Filaseta, Michael J. Mossinghoff
openaire +1 more source
A Spin Analogue of Kerov Polynomials [PDF]
, 2018 Kerov polynomials describe normalized irreducible characters of the symmetric groups in terms of the free cumulants associated with Young diagrams.
Matsumoto, Sho
core +3 more sources
GALOIS IRREDUCIBLE POLYNOMIALS
Communications of the Korean Mathematical Society, 2017 Summary: In this paper, the fundamental theorem of Galois Theory is used to generalize cyclotomic polynomials and construct irreducible polynomials associated with the \(n\)-th primitive roots of unity.
Kwon, Miyeon, Lee, Ji-Eun, Lee, Ki-Suk
openaire +2 more sources
Irreducibility properties of Keller maps [PDF]
, 2016 Jedrzejewicz showed that a polynomial map over a field of characteristic zero is invertible, if and only if the corresponding endomorphism maps irreducible polynomials to irreducible polynomials.
de Bondt, Michiel, Yan, Dan
core +2 more sources
On the irreducibility of Hecke polynomials [PDF]
Mathematics of Computation, 2008 Summary: Let \(T_{n,k}(X)\) be the characteristic polynomial of the \(n\)th Hecke operator acting on the space of cusp forms of weight \(k\) for the full modular group. We record a simple criterion which can be used to check the irreducibility of the polynomials \(T_{n,k}(X)\).
openaire +2 more sources
Distribution of constant terms of irreducible polynomials in ℤₚ[x] whose degree is a product of two distinct odd primes [PDF]
Notes on Number Theory and Discrete MathematicsWe obtain explicit formulas for the number of monic irreducible polynomials with prescribed constant term and degree q₁q₂ over a finite field, where q₁ and q₂ are distinct odd primes. These formulas are derived from work done by Yucas.
Sarah C. Cobb +4 more
doaj +1 more source
Dual combinatorics of zonal polynomials [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 In this paper we establish a new combinatorial formula for zonal polynomials in terms of power-sums. The proof relies on the sign-reversing involution principle.
Valentin Féray, Piotr Sniady
doaj +1 more source
Recursive n-gram hashing is pairwise independent, at best [PDF]
, 2010 Many applications use sequences of n consecutive symbols (n-grams). Hashing these n-grams can be a performance bottleneck. For more speed, recursive hash families compute hash values by updating previous values.
Carter +12 more
core +2 more sources
Automaticity of primitive words and irreducible polynomials [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 Automata, Logic and ...
Anne Lacroix, Narad Rampersad
doaj +1 more source
A new class of irreducible polynomials [PDF]
Communications in Algebra, 2021 In this article, we propose a few sufficient conditions on polynomials having integer coefficients all of whose zeros lie outside a closed disc centered at the origin in the complex plane and deduce the irreducibility over the ring of integers.
Jitender Singh, Sanjeev Kumar
openaire +2 more sources