Displaying similar documents to “A class of irreducible polynomials”

Asymptotic values of modular multiplicities for GL 2

Sandra Rozensztajn (2014)

Journal de Théorie des Nombres de Bordeaux

Similarity:

We study the irreducible constituents of the reduction modulo p of irreducible algebraic representations V of the group Res K / p GL 2 for K a finite extension of p . We show that asymptotically, the multiplicity of each constituent depends only on the dimension of V and the central character of its reduction modulo p . As an application, we compute the asymptotic value of multiplicities that are the object of the Breuil-Mézard conjecture.

A new characterization for the simple group PSL ( 2 , p 2 ) by order and some character degrees

Behrooz Khosravi, Behnam Khosravi, Bahman Khosravi, Zahra Momen (2015)

Czechoslovak Mathematical Journal

Similarity:

Let G be a finite group and p a prime number. We prove that if G is a finite group of order | PSL ( 2 , p 2 ) | such that G has an irreducible character of degree p 2 and we know that G has no irreducible character θ such that 2 p θ ( 1 ) , then G is isomorphic to PSL ( 2 , p 2 ) . As a consequence of our result we prove that PSL ( 2 , p 2 ) is uniquely determined by the structure of its complex group algebra.

The factorization of f ( x ) x n + g ( x ) with f ( x ) monic and of degree 2 .

Joshua Harrington, Andrew Vincent, Daniel White (2013)

Journal de Théorie des Nombres de Bordeaux

Similarity:

In this paper we investigate the factorization of the polynomials f ( x ) x n + g ( x ) [ x ] in the special case where f ( x ) is a monic quadratic polynomial with negative discriminant. We also mention similar results in the case that f ( x ) is monic and linear.

The multiplicity of the zero at 1 of polynomials with constrained coefficients

Peter Borwein, Tamás Erdélyi, Géza Kós (2013)

Acta Arithmetica

Similarity:

For n ∈ ℕ, L > 0, and p ≥ 1 let κ p ( n , L ) be the largest possible value of k for which there is a polynomial P ≠ 0 of the form P ( x ) = j = 0 n a j x j , | a 0 | L ( j = 1 n | a j | p 1/p , aj ∈ ℂ , such that ( x - 1 ) k divides P(x). For n ∈ ℕ and L > 0 let κ ( n , L ) be the largest possible value of k for which there is a polynomial P ≠ 0 of the form P ( x ) = j = 0 n a j x j , | a 0 | L m a x 1 j n | a j | , a j , such that ( x - 1 ) k divides P(x). We prove that there are absolute constants c₁ > 0 and c₂ > 0 such that c 1 ( n / L ) - 1 κ ( n , L ) c 2 ( n / L ) for every L ≥ 1. This complements an earlier result of the authors valid for every n ∈ ℕ and L ∈...

A class of non-rational surface singularities with bijective Nash map

Camille Plénat, Patrick Popescu-Pampu (2006)

Bulletin de la Société Mathématique de France

Similarity:

Let ( 𝒮 , 0 ) be a germ of complex analytic normal surface. On its minimal resolution, we consider the reduced exceptional divisor E and its irreducible components E i , i I . The Nash map associates to each irreducible component C k of the space of arcs through 0 on 𝒮 the unique component of E cut by the strict transform of the generic arc in C k . Nash proved its injectivity and asked if it was bijective. As a particular case of our main theorem, we prove that this is the case if E · E i < 0 for any  i I . ...

Monodromy of a family of hypersurfaces

Vincenzo Di Gennaro, Davide Franco (2009)

Annales scientifiques de l'École Normale Supérieure

Similarity:

Let Y be an ( m + 1 ) -dimensional irreducible smooth complex projective variety embedded in a projective space. Let Z be a closed subscheme of Y , and δ be a positive integer such that Z , Y ( δ ) is generated by global sections. Fix an integer d δ + 1 , and assume the general divisor X | H 0 ( Y , Z , Y ( d ) ) | is smooth. Denote by H m ( X ; ) Z van the quotient of H m ( X ; ) by the cohomology of Y and also by the cycle classes of the irreducible components of dimension m of Z . In the present paper we prove that the monodromy representation on H m ( X ; ) Z van for the family...

Coppersmith-Rivlin type inequalities and the order of vanishing of polynomials at 1

(2016)

Acta Arithmetica

Similarity:

For n ∈ ℕ, L > 0, and p ≥ 1 let κ p ( n , L ) be the largest possible value of k for which there is a polynomial P ≢ 0 of the form P ( x ) = j = 0 n a j x j , | a 0 | L ( j = 1 n | a j | p ) 1 / p , a j , such that ( x - 1 ) k divides P(x). For n ∈ ℕ, L > 0, and q ≥ 1 let μ q ( n , L ) be the smallest value of k for which there is a polynomial Q of degree k with complex coefficients such that | Q ( 0 ) | > 1 / L ( j = 1 n | Q ( j ) | q ) 1 / q . We find the size of κ p ( n , L ) and μ q ( n , L ) for all n ∈ ℕ, L > 0, and 1 ≤ p,q ≤ ∞. The result about μ ( n , L ) is due to Coppersmith and Rivlin, but our proof is completely different and much shorter even...

On the lattice of polynomials with integer coefficients: the covering radius in L p ( 0 , 1 )

Wojciech Banaszczyk, Artur Lipnicki (2015)

Annales Polonici Mathematici

Similarity:

The paper deals with the approximation by polynomials with integer coefficients in L p ( 0 , 1 ) , 1 ≤ p ≤ ∞. Let P n , r be the space of polynomials of degree ≤ n which are divisible by the polynomial x r ( 1 - x ) r , r ≥ 0, and let P n , r P n , r be the set of polynomials with integer coefficients. Let μ ( P n , r ; L p ) be the maximal distance of elements of P n , r from P n , r in L p ( 0 , 1 ) . We give rather precise quantitative estimates of μ ( P n , r ; L ) for n ≳ 6r. Then we obtain similar, somewhat less precise, estimates of μ ( P n , r ; L p ) for p ≠ 2. It follows that μ ( P n , r ; L p ) n - 2 r - 2 / p as n → ∞. The results...

The norm of the polynomial truncation operator on the unit disk and on [-1,1]

Tamás Erdélyi (2001)

Colloquium Mathematicae

Similarity:

Let D and ∂D denote the open unit disk and the unit circle of the complex plane, respectively. We denote by ₙ (resp. c ) the set of all polynomials of degree at most n with real (resp. complex) coefficients. We define the truncation operators Sₙ for polynomials P c of the form P ( z ) : = j = 0 n a j z j , a j C , by S ( P ) ( z ) : = j = 0 n a ̃ j z j , a ̃ j : = a j | a j | m i n | a j | , 1 (here 0/0 is interpreted as 1). We define the norms of the truncation operators by S , D r e a l : = s u p P ( m a x z D | S ( P ) ( z ) | ) / ( m a x z D | P ( z ) | ) , S , D c o m p : = s u p P c ( m a x z D | S ( P ) ( z ) | ) / ( m a x z D | P ( z ) | . Our main theorem establishes the right order of magnitude of the above norms: there is an absolute constant c₁...

Discriminants of Chebyshev radical extensions

T. Alden Gassert (2014)

Journal de Théorie des Nombres de Bordeaux

Similarity:

Let t be any integer and fix an odd prime . Let Φ ( x ) = T n ( x ) - t denote the n -fold composition of the Chebyshev polynomial of degree shifted by t . If this polynomial is irreducible, let K = ( θ ) , where θ is a root of Φ . We use a theorem of Dedekind in conjunction with previous results of the author to give conditions on t that ensure K is monogenic. For other values of t , we apply a result of Guàrdia, Montes, and Nart to obtain a formula for the discriminant of K and compute an integral basis for the ring...

Explicit bounds for the Łojasiewicz exponent in the gradient inequality for polynomials

Didier D'Acunto, Krzysztof Kurdyka (2005)

Annales Polonici Mathematici

Similarity:

Let f: ℝⁿ → ℝ be a polynomial function of degree d with f(0) = 0 and ∇f(0) = 0. Łojasiewicz’s gradient inequality states that there exist C > 0 and ϱ ∈ (0,1) such that | f | C | f | ϱ in a neighbourhood of the origin. We prove that the smallest such exponent ϱ is not greater than 1 - R ( n , d ) - 1 with R ( n , d ) = d ( 3 d - 3 ) n - 1 .

A quantitative aspect of non-unique factorizations: the Narkiewicz constants II

Weidong Gao, Yuanlin Li, Jiangtao Peng (2011)

Colloquium Mathematicae

Similarity:

Let K be an algebraic number field with non-trivial class group G and K be its ring of integers. For k ∈ ℕ and some real x ≥ 1, let F k ( x ) denote the number of non-zero principal ideals a K with norm bounded by x such that a has at most k distinct factorizations into irreducible elements. It is well known that F k ( x ) behaves, for x → ∞, asymptotically like x ( l o g x ) 1 / | G | - 1 ( l o g l o g x ) k ( G ) . In this article, it is proved that for every prime p, ( C p C p ) = 2 p , and it is also proved that ( C m p C m p ) = 2 m p if ( C m C m ) = 2 m and m is large enough. In particular, it is shown...

Beyond two criteria for supersingularity: coefficients of division polynomials

Christophe Debry (2014)

Journal de Théorie des Nombres de Bordeaux

Similarity:

Let f ( x ) be a cubic, monic and separable polynomial over a field of characteristic p 3 and let E be the elliptic curve given by y 2 = f ( x ) . In this paper we prove that the coefficient at x 1 2 p ( p - 1 ) in the p –th division polynomial of E equals the coefficient at x p - 1 in f ( x ) 1 2 ( p - 1 ) . For elliptic curves over a finite field of characteristic p , the first coefficient is zero if and only if E is supersingular, which by a classical criterion of Deuring (1941) is also equivalent to the vanishing of the second coefficient. So the...

Sparsity of the intersection of polynomial images of an interval

Mei-Chu Chang (2014)

Acta Arithmetica

Similarity:

We show that the intersection of the images of two polynomial maps on a given interval is sparse. More precisely, we prove the following. Let f ( x ) , g ( x ) p [ x ] be polynomials of degrees d and e with d ≥ e ≥ 2. Suppose M ∈ ℤ satisfies p 1 / E ( 1 + κ / ( 1 - κ ) > M > p ε , where E = e(e+1)/2 and κ = (1/d - 1/d²) (E-1)/E + ε. Assume f(x)-g(y) is absolutely irreducible. Then | f ( [ 0 , M ] ) g ( [ 0 , M ] ) | M 1 - ε .

Calculation of the greatest common divisor of perturbed polynomials

Zítko, Jan, Eliaš, Ján

Similarity:

The coefficients of the greatest common divisor of two polynomials f and g (GCD ( f , g ) ) can be obtained from the Sylvester subresultant matrix S j ( f , g ) transformed to lower triangular form, where 1 j d and d = deg(GCD ( f , g ) ) needs to be computed. Firstly, it is supposed that the coefficients of polynomials are given exactly. Transformations of S j ( f , g ) for an arbitrary allowable j are in details described and an algorithm for the calculation of the GCD ( f , g ) is formulated. If inexact polynomials are given, then an approximate...

Dual Blobs and Plancherel Formulas

Ju-Lee Kim (2004)

Bulletin de la Société Mathématique de France

Similarity:

Let k be a p -adic field. Let G be the group of k -rational points of a connected reductive group 𝖦 defined over k , and let 𝔤 be its Lie algebra. Under certain hypotheses on 𝖦 and k , wethe tempered dual G ^ of G via the Plancherel formula on 𝔤 , using some character expansions. This involves matching spectral decomposition factors of the Plancherel formulas on 𝔤 and G . As a consequence, we prove that any tempered representation contains a good minimal 𝖪 -type; we extend this result to irreducible...