We show that if G is a graph minimal with respect to having crossing number at least k, and G has no vertices of degree 3, then G has crossing number at most 2k+35. ## 2000 Academic Press Richter and Thomassen proved that if G is minimal with respect to having crossing number at least k, then the
On a Number-Theoretic Result of Sylvester-Kronecker-Zsigmondy
โ Scribed by G. Steidl; M. Tasche
- Publisher
- John Wiley and Sons
- Year
- 1989
- Tongue
- English
- Weight
- 713 KB
- Volume
- 140
- Category
- Article
- ISSN
- 0025-584X
No coin nor oath required. For personal study only.
โฆ Synopsis
Let K be an algebraic extension field of Q . Further. let CIc be the domain of algebraic integers of K , and let @,(x) be the n-th cyclotomic ~iolynomial. This paper is devoted to the factorization of the principal ideal sPn(c) DK ( e E QI{) into prime ideals of s),c. The main result (Theorem 3.4) cnn be considered as A generalization of a known result of SYLVESTER, KRONECEER and ZSIGMONDY on the prime factorization of @,(e) ( e E Z). With Theorem 3.4., we improve corresponding results of REDEI [ll] and SACHS [14]. We generalize a technique developed in [ 8 ] and [3] and we study also the cases that 1. is a quadratic field and a cyclotomic field, respectively. Finally, we apply the results to the parameter determination of FonmR-Like number-theoretic transforms in k ? ~.
๐ SIMILAR VOLUMES
Number theoretic results are used to prove that there exist only a lirtite number of k, for a given ~., satisfying the equation k(k -1) = )~(v -1), when v is of a special form.