2000
DOI: 10.1017/cbo9780511542916
|View full text |Cite
|
Sign up to set email alerts
|

Polynomials with Special Regard to Reducibility

Abstract: Stopping times and directed processes C. Sims Computation with finitely presented groups T. Palmer Banach algebras and the general theory of *-algebras F. Borceux Handbook of categorical algebra I F. Borceux Handbook of categorical algebra II F. Borceux Handbook of categorical algebra III A. Katok and B. Hassleblatt Introduction to the modern theory of dynamical systems V. N. Sachkov Combinatorial methods in discrete mathematics V. N. Sachkov Probabilistic methods in discrete mathematics

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

3
210
0
2

Year Published

2002
2002
2014
2014

Publication Types

Select...
5
4
1

Relationship

0
10

Authors

Journals

citations
Cited by 248 publications
(215 citation statements)
references
References 2 publications
3
210
0
2
Order By: Relevance
“…Since λ k > 1 is an integer, by the theorem of Capelli (see [20] or p. 92 in [24]), λ is an algebraic integer of degree k. Thus the difference between two distinct numbers in the form of k−1 j=0 b j λ j is non-integer. We conclude that A G1 (w) = p(e 2πiw )(1 − e −2πiw ) h .…”
Section: Consider the Fourier Transformmentioning
confidence: 99%
“…Since λ k > 1 is an integer, by the theorem of Capelli (see [20] or p. 92 in [24]), λ is an algebraic integer of degree k. Thus the difference between two distinct numbers in the form of k−1 j=0 b j λ j is non-integer. We conclude that A G1 (w) = p(e 2πiw )(1 − e −2πiw ) h .…”
Section: Consider the Fourier Transformmentioning
confidence: 99%
“…The usual criterion for the irreducibility of conics in the projective plane, in terms of the non-vanishing of the determinant of the associated quadratic form ( [11], p. 212), now applies to show that Q k is reducible if and only if k = 0, 1.…”
Section: Examplesmentioning
confidence: 99%
“…Of special importance is Schinzel's book [12], which contains beautiful proofs using (in most cases) only basic properties of polynomials. In the first few sections of this paper, we include new proofs of some known results.…”
Section: α) and [K(α) : K] Is Divisible By A Prime Greater Than Max(mentioning
confidence: 99%