Lacunary polynomials and finite geometry
|
|
- Christine Bailey
- 6 years ago
- Views:
Transcription
1 Tamás Szőnyi ELTE, CAI HAS June 24th, 2013, Lille, France
2 Fully reducible, and lacunary polynomials Definition A polynomial over a field F is called fully reducible if it factors into linear factors over F. A polynomial is lacunary if in the sequence of its coefficients a long run of zeroes occurs. The monograph Lacunary polynomials over finite fields by László Rédei is devoted entirely to such polynomials and their applications. We survey the results of that book and some more recent applications of the theory. Many results can be found in my paper Around Rédei s theorem, Discrete Math
3 László Rédei,
4 The 2nd triumvirate in Szeged
5 Rédei s problems Problem Let d be a fixed divisor of q 1. Determine those polynomials f(x) = x (q 1)/d +g(x) which are fully reducible, are not divisible by x, do not have multiple roots, and deg(g) q 1 d 2. Problem Determine the polynomials f(x) GF(q)[x]\GF(q)[x p ], which have the form f(x) = x q +h(x), are fully reducible and deg(h) q+1 2.
6 Problem I Theorem (Rédei) For d > 2 the solutions of Problem 1 are the Euler-binomials x (q 1)/d α (where α = u (q 1)/d for a nonzero u). For d = 2 there are other solutions, namely the polynomials: (x q 1 4 β when q 1 (mod 4). )(x q 1 4 γ ), (β 2 = 1, γ 2 = 1), This is Theorem 5 in Paragraph 9 in Rédei s book.
7 Part of the solution to Problem II Theorem (Rédei) Let f(x) = x q +g(x) be fully reducible and suppose that f (x) 0. Then deg(g) (q +1)/2, or f(x) = x q x. This is proven in Paragraph 10 of Rédei s book: Let f(x) = s(x)m(x), where s(x) = product of roots with multiplicity 1, and let m(x) = multiple roots. Then s(x) f(x) (x q x) = g(x)+x, m(x) f (x) = g (x). If f(x) x q x, then f(x) (g(x)+x)g (x). Hence deg(f) deg(g)+(deg(g) 1).
8 Solutions for q = p Theorem (Rédei) If q = p 2 prime, then the solutions of Problem II are ) f(x) = (x +a) ((x +a) p 1 2 σ )((x +a) p 1 2 στ, (σ = ±1, τ = 0,1). Sketch of the proof. Continue the previous proof: for deg(g) = (q +1)/2, we have f(x) = c (g(x)+x)g (x). Let g(x) = a 0 x (p+1)/2 +a 1 x (p 1)/ a (p+1)/2. Using a translation x x +c we can suppose that a 1 = 0. From above, (1) Therefore, a (xq +g(x)) = (g(x)+x)g (x). (i) g(x)+x and g (x) are fully reducible, and
9 Solution for q = p, II. (ii) g(x)+x divides x q x, that is it has only simple roots. In equation (1), left-hand side is lacunary, i.e. coefficient of x p 1,...,x (p+3)/2 is zero. Hence (2) k (1 2i)a i a k i = 0, (k = 1,...(p 3)/2). i=0 (this comes from the coefficient of x p k ). Using a 1 = 0 it implies a 1 = a 2 =... = a (p 3)/2 = 0. Therefore g(x) = a 0 x (p+1)/2 +a (p 1)/2 x +a (p+1)/2.
10 General solutions The actual theorem of Rédei is too complicated, so we just illustrate it. Let us take q = p 2 : we start from a nice (lacunary) factorization of x p2 x. Take (x p+1 1) (p 1)/2 +1)(x p+1 1) (p 1)/2 1). It is x p+1 (x p2 1 1) x p+1, 1 As the above factors are lacunary, we can write down fully reducible and (very) lacunary polynomials dividing x q x. Intuitively, what happened is that in place of x +a we put the expression N(x + )+a in the solutions given in the rpevious Theorem. In the general case we can repeat this procedure for each chain of subfields in GF(q). However, in the geometric applications, this general theorem was not (yet) used (not even for q = p 2 ).
11 The degenerate solutions Theorem (Rédei, Thm. 18) Let h(x) = x q/pe +g(x) for some 1 e < n (where q = p n, n 2). Suppose that h is fully reducible and h (x) 0. If e n/2, then deg(g) q +pe p e (p e +1). If e > n/2, then deg(g) p e.
12 Blokhuis generalizations I. Theorem (Blokhuis) Let f(x) = x q g(x)+h(x) be a fully reducible lacunary polynomial over GF(q) and assume that (g(x),h(x)) = 1 and f (x) 0. Then either x q x divides f(x), or the maximum of the degrees of g and h is at least (q +1)/2. Sketch of the proof. Copy Rédei s proof and observe that s(x) xg(x)+h(x) and m(x) f(x)g (x) f (x)g(x).
13 Aart Blokhuis
14 Blokhuis generalizations II. Theorem (Blokhuis) Let h(x) = x q/pe f(x)+g(x) for some 1 e < n (where q = p n, n 2). Suppose that h is fully reducible, (f(x),g(x)) = 1 and h (x) 0. If e n/2, then max{deg(f),deg(g)} q +pe p e (p e +1). If e > n/2, then max{deg(f),deg(g)} p e Combine the proof of the previous result and Rédei s proof to bound the degree in case of the degenerate solutions. The bound can be further improved: max{deg(g),deg(f)} (q/p e +1)/(p e +1) p e. Remark: For e n the theorem is essentially sharp.
15 Trace and Norm In the special case e = n/2, the previous bound gives max{deg(g),deg(f)} q. In case of equality BALL and GÁCS-SzT proved that h(x) is either the Trace or the Norm function from GF(q) to GF( q). They also showed that max{deg(f),deg(g)} = 2 q is not possible.
16 Leo Storme
17 Improvements by Blokhuis, Storme, SzT Theorem (Blokhuis, Storme, SzT) Let f GF(q)[x] be fully reducible, f(x) = x q g(x)+h(x), where (g,h) = 1. Let k < q be max(deg(g),deg(h)). Let e be maximal such that f is a p e -th power. Then we have one of the following: (1) e = n and k = 0, (2) e 2n/3 and k p e, (3) 2n/3 > e > n/2 and k p n e/2 3 2 pn e, (4) e = n/2 and k = p e and f(x) = atr(bx +c)+d or f(x) = an(bx +c)+d for suitable constants a,b,c,d. Here Tr and N respectively denote the trace and the norm function from GF(q) to GF( q),
18 Improvements by Blokhuis, Storme, SzT, II Theorem (BBS continued) Let f GF(q)[x] be fully reducible, f(x) = x q g(x)+h(x), where (g,h) = 1. Let k < q be max(deg(g),deg(h)). Let e be maximal such that f is a p e -th power. Then we have one of the following: (5) e = n/2 and k p e (p e +1)/2 (6) n/2 > e > n/3 and k p (n+e)/2 p n e p e /2, or if 3e = n+1 and p 3, then k p e (p e +1)/2, (7) n/3 e > 0 and k p e (p n e +1)/(p e +1), (8) e = 0 and k (q +1)/2 (9) e = 0, k = 1 and f(x) = a(x q x).
19 Directions Problem (Rédei, Par. 36) Given a function f on GF(q) how many different values can the difference quotients (f(x) f(y))/(x y) take? Geometrically, this is equivalent to the following question. How many directions are determined by a set U of q points in the affine plane AG(2, q)? Definition A direction (or an infinite point of AG(2,q)) is determined by U if there is a pair of points in U so that the line joining them passes through this infinite point.
20 Determined and non-determined directions 8( ) Y=mX+b (m) ( m0 ) (0,b) l8 AG(2,q)
21 The Rédei polynomial Consider a subset U = {(a i,b i ) : i = 1,..., U } of the affine plane AG(2,q). Recall that the lines of this plane have equation X = c or Y yx +x = 0. The Rédei polynomial of U is H(X,Y) := i (X+a i Y b i ) = X U +h 1 (Y)X U h U (Y). Note that for all j = 1,..., U : deg(h j ) j. The trick will always be to consider H(X,Y) for a fixed Y = y. It encodes line intersections of U. Lemma The value X = b is an r-fold root of the polynomial H(X,m) if and only if the line with equation Y = mx +b meets U in exactly r points.
22 The Rédei-Megyesi theorem Theorem (Rédei-Megyesi, Thm. 24 ) A set of p points in AG(2,p), (p prime), is either a line or determines at least (p + 3)/2 directions. Sketch of the proof. Let D be the set of directions determined by U and suppose that D. The point (y) is not determined by U if and only if H(X,y) = X p X.
23 Proof of Rédei-Megyesi Therefore h j (y) = 0 for at least q +1 D different y s, which implies that h 1 (y),...,h q D (y) are identically zero. If one considers H(X,y) for y D, then H(X,y) = X p +g y (X) with deg(g y ) D 1 and it is fully reducible. D 1 (p +1)/2, by the theorem of Rédei on lacunary polynomials (case q = p). This result, together with the theorem on lacunary polynomials was rediscovered by Dress, Klin, Muzychuk.
24 The projective triangle ( ) 8 (0,b): b= l8 (0,0) (a,0): a= (0)
25 László Lovász
26 Lex Schrijver
27 The Lovász-Schrijver theorem Theorem (Lovász-Schrijver) A set U determining (p + 3)/2 directions is projectively equivalent to {(0,a) : a (p 1)/2 = 1} {(b,0) : b (p 1)/2 = 1} {(0,0)}. This actually follows from Rédei s characterization of the solutions of his Problem II for q = p. Geometrically, it gives that lines through an ideal point either meet the set U in 2 points ((p 1)/2 times) and 1 point once, or there is a line with (p +1)/2 points and the remaining lines meet U in 1 point.
28 The Rédei-Megyesi construction I l8 ( ) 8 M (0,b): b M (0,0) (a,0): a M (0)
29 The Rédei-Megyesi construction II ( ) 8 A (1,b): b A l8 (0,a): a A
30 Gács s theorem for q = p Looking at the examples given when q = p is a prime, we see that one can obtain sets determining (p +3)/2, and the next example coming from Megyesi s construction will have size at least 2+2(p 1)/3. The following theorem almost reaches this bound. Theorem (Gács) Let U be a set of size p in AG(2,p), where p is prime. Then either U is the affine part of the projective triangle or D U 1+[2(p 1)/3].
31 András Gács,
32 Gács-Lovász-SzT for q = p 2 Theorem (GLS) Any set in AG(2,p 2 ) of size p 2 determining (p 2 +3)/2 directions has to be equivalent to the affine part of the projective triangle. If the set determines more than this number of directions, then it determines at least (p 2 +p)/2 directions. The proof does not use Rédei s general (and difficult) theorem on the solutions of Problem II. The bound here is sharp, Polverino, SzT and Weiner constructed examples of this size.
33 Rédei s results on directions for general q Theorem (Rédei, Thm 24) Let f : K K (K =GF(q)) be any function, and let N be the number of directions determined by the graph of f. Then either N = 1, and f is linear, or N (q +1)/2, or 1+(q 1)/(p e +1) N (q 1)/(p e 1) for some e, 1 e [n/2]. Slight improvements on Rédei s theorem are contained in Blokhuis, Brouwer, SzT. For example, we proved that N (q +3)/2 (instead of (q +1)/2) and that the e s for which n/3 < e < n/2 do not occur.
34 Aart Blokhuis and Andries Brouwer
35 Andries Brouwer and Simeon Ball
36 Leo Storme
37 The Blokhuis,Ball,Brouwer,Storme, SzT thm Theorem (Blokhuis, Ball, Brouwer, Storme, SzT) Let U K 2 be a point set of size q containing the origin, let D be the set of directions determined by U, and put N := D. Let e (with 0 e n) be the largest integer such that each line with slope in D meets U in a multiple of p e points. Then we have one of the following: (i) e = 0 and (q +3)/2 N q +1, (ii) e = 1, p = 2, and (q +5)/3 N q 1, (iii) p e > 2, e n, and q/p e +1 N (q 1)/(p e 1), (iv) e = n and N = 1. Moreover, if p e > 3 or (p e = 3 and N = q/3+1), then U is GF(p e )-linear, and all possibilities for N can be determined explicitly (in principle).
38 Ball s improvement Simeon Ball found a beautiful new proof of this result, which deals with the missing cases. This means that for p e = 2 he proved the lower bound q/2+1 N, and for p e = 3 his method gives the GF(3)-linearity of the set U.
39 Directions determined by < q pts Theorem (SzT) A set of k = p n points in AG(2,p) is either contained in a line, or it determines at least (p +3 n)/2 = (k +3)/2 directions. Sometimes sharp: put a multiplicative subgroup on the two axes. About the proof: Rédei type results for polynomials which are not fully reducible, but have many roots in GF(q). Generalization for q = p h : FANCSALI, SZIKLAI, TAKÁTS
40 Ball, Blokhuis, Gács, Sziklai
41 The Fancsali, Sziklai, Takáts thm Theorem Let U be a subset of AG(2,q), D be the set of determined directions. Let s = p e be max. s.t. every line meets U in 0 mod s points. Let t denote another parameter defined by using the Rédei pol. Then s t. If U is not contained in a line then either (1) 1 = s t < q, and U 1 t+1 +2 D q +1, or (2) 1 < s t < q, and U 1 t+1 +2 D U 1 s 1.
42 Blocking sets Definition A blocking set is a set of points in PG(2,q) which meets every line. It is called non-trivial if it contains no line. It is minimal if deletion of any of its points results in a set which does not meet every line. Geometrically, this means that there is a tangent line at each point of the blocking set. Combinatorial result: BRUEN(-PELIKÁN) for a non-trivial blocking set B q + q +1, and in case of equality we have a subplane of order q. A blocking set is of Rédei type if there is a line l with B \l = q. This is essentially equivalent with the direction problem.
43 Lower bound for blocking sets Theorem (Blokhuis) Let B be a non-trivial blocking set of PG(2,q). If q is a prime, then B 3(p +1)/2. If q = p h is not a prime, then B q + pq +1. The proof uses lacunary polynomials and the Rédei polynomial.
44 Small minimal blocking sets A blocking set is called small if it has size less than 3(q +1)/2. Such minimal blocking sets are characterized in some cases. Theorem (1) (Blokhuis) If q = p prime, then there are no small minimal non-trivial blocking sets in PG(2, p) at all; (2) (SzT) If q = p 2, p prime, then small minimal non-trivial blocking sets in PG(2,p 2 ) are Baer subplanes; (3) (Polverino) If q = p 3, p prime, p 7, then small minimal non-trivial blocking sets in PG(2,p 3 ) have size p 3 +p 2 +1 or p 3 +p 2 +p +1 and they are of Rédei type.
45 Péter Sziklai
46 1 modulo p results There is a result which serves as a main tool in the proof of many particular cases of the Linearity Conjecture. Theorem (i) (SzT) In PG(2,q), q = p h, if B is a minimal blocking set of size less than 3(q +1)/2, then each line intersects it in 1 modulo p e points for some e 1; (ii) (Sziklai) here e h, so GF(p e ) is a subfield of GF(q). Moreover, most of the secant lines intersect B in a pointset isomorphic to PG(1,p e ), i.e. in a linear pointset. These results, together with standard counting arguments give lower and upper bounds for the possible sizes of minimal blocking sets.
47 Zsuzsa Weiner
48 A stability result Theorem (Weiner-SzT) Let B be a set of points of PG(2,q), q = p prime, with at most 3 2 (q +1) β points. Suppose that the number δ of 0-secants is less than ( 2 3 (β +1))2 /2. Then there is a line that contains at least q 2δ q+1 points. The proof is again by using almost fully reducible lacunary polynomials.
49 Ferret, Gács, Kovács, Sziklai
50 An application for character sums Theorem (Rédei, Thm. 26) Let be a p-th root of unity, S = a 0 +a a p 1 p 1 0, a a p 1 = p,a i N,a i < p. In other words, S is a p-term sum consisting of p-th roots of unity (p 2), so that not all terms in S are equal and S is not p 1. If S is divisible by (1 ) t then t (p 1)/2. Let Γ be the Gaussian sum i2. If S is divisible by (1 ) (p 1)/2 then for some integer a we have as = Γ, or as = Γ, or as = 1 (p ±Γ). 2
51 Character sums II. Then Rédei goes on to specialize Theorem 2.7 for sums of type S = ± ± 2 ±...± p 1. Using Theorem 2.1 he proves that such an S can be divisible by at most the (p 1)/4-th power of (1 ) if it is different from the exceptions given in Theorem 2.7. Using Theorem 2.1 also the case of equality can be characterized. As far as I know, this is the only place where Theorem 2.1 is applied. These results were proved independently by Carlitz. Rédei also proved similar divisibility conditions for certain signed sums, in which not all p-th roots of unity occur, see Thm. 27.
52 Application to planar functions Definition A function f : F F is planar if x f(x +a) f(x) is bijective for every a 0. Trivial examples of planar functions are quadratic functions over fields of odd characteristic. Theorem (Hiramine, Gluck, Rónyai-SzT) Over the field GF(p), p prime, every planar function is quadratic.
53 THANK YOU LÁSZLÓ RÉDEI THANK YOU FOR YOUR ATTENTION
1 Lacunary Polynomials over Finite Fields.
1 Lacunary Polynomials over Finite Fields. 1.1 Introduction In 1970 Rédei published his treatise Lückenhafte Polynome über endlichen Körpern [34], soon followed by the English translation Lacunary Polynomials
More informationThe 2-blocking number and the upper chromatic number of PG(2, q)
The 2-blocking number and the upper chromatic number of PG(2, q) Tamás Szőnyi Joint work with Gábor Bacsó and Tamás Héger Eötvös Loránd University, MTA-ELTE GAC Research Group and Ghent University Budapest
More informationLacunary Polynomials over Finite Fields Course notes
Lacunary Polynomials over Finite Fields Course notes Javier Herranz Abstract This is a summary of the course Lacunary Polynomials over Finite Fields, given by Simeon Ball, from the University of London,
More informationThe number of directions determined by less than q points
The number of directions determined by less than q points arxiv:1407.5638v1 [math.co] 21 Jul 2014 Szabolcs L. Fancsali, Péter Sziklai and Marcella Takáts February 28, 2012 NOTICE: this is the author s
More informationValue sets of special polynomials and blocking sets
Value sets of special polynomials and blocking sets Tamás Szőnyi Eötvös Loránd University and MTA-ELTE GAC Research Group Budapest 29th June, 2016 PhD Summer School in Discrete Mathematics, Rogla This
More informationTwo Remarks on Blocking Sets and Nuclei in Planes of Prime Order
Designs, Codes and Cryptography, 10, 9 39 (1997) c 1997 Kluwer Academic Publishers, Boston. Manufactured in The Netherlands. Two Remarks on Blocking Sets and Nuclei in Planes of Prime Order ANDRÁS GÁCS
More informationOn the stability of small blocking sets
J Algebr Comb (04) 40:79 9 DOI 0.007/s080-03-0487-0 On the stability of small blocking sets Tamás Szőnyi Zsuzsa Weiner Received: April 0 / Accepted: 6 November 03 / Published online: 3 December 03 Springer
More informationLinear Point Sets and Rédei Type k-blocking
Journal of Algebraic Combinatorics 14 (2001), 221 228 c 2001 Kluwer Academic Publishers. Manufactured in The Netherlands. Linear Point Sets and Rédei Type k-blocking Sets in PG(n, q) L. STORME ls@cage.rug.ac.be
More informationThe 2-blocking number and the upper chromatic number of PG(2, q)
The 2-blocking number and the upper chromatic number of PG(2, q) Tamás Héger Joint work with Gábor Bacsó and Tamás Szőnyi Eötvös Loránd University Budapest September 18, 2012 The problem Color the vertices
More informationON LINEAR CODES WHOSE WEIGHTS AND LENGTH HAVE A COMMON DIVISOR. 1. Introduction
ON LINEAR CODES WHOSE WEIGHTS AND LENGTH HAVE A COMMON DIVISOR SIMEON BALL, AART BLOKHUIS, ANDRÁS GÁCS, PETER SZIKLAI, AND ZSUZSA WEINER Abstract. In this paper we prove that a set of points (in a projective
More informationArcs and blocking sets in non-desarguesian planes
Arcs and blocking sets in non-desarguesian planes Tamás Szőnyi Eötvös Loránd University and MTA-ELTE GAC Research Group Budapest June 3, 2016 General overview First we summarize results about arcs, blocking
More informationPolynomials and Codes
TU/e Eindhoven 13 September, 2012, Trieste ICTP-IPM Workshop and Conference in Combinatorics and Graph Theory. Reza and Richard: Thanks for a wonderful meeting. From now on: p is prime and q is a power
More informationBounds and spectrum results in Galois geometry and coding theory. Eötvös Loránd University
Synopsis of the Ph.D. thesis Bounds and spectrum results in Galois geometry and coding theory Szabolcs Levente Fancsali Eötvös Loránd University Institute of Mathematics Doctoral School: Mathematics Director:
More informationJournal of Discrete Mathematical Sciences & Cryptography Vol. 9 (2006), No. 1, pp
Some generalizations of Rédei s theorem T. Alderson Department of Mathematical Sciences University of New Brunswick Saint John, New Brunswick Canada EL 4L5 Abstract By the famous theorems of Rédei, a set
More informationAPPLICATIONS OF POLYNOMIALS OVER FINITE FIELDS. Péter Sziklai
APPLICATIONS OF POLYNOMIALS OVER FINITE FIELDS Péter Sziklai A doctoral dissertation submitted to the Hungarian Academy of Sciences Budapest, 2013 2 Foreword 3 0 Foreword A most efficient way of investigating
More informationSome graph theoretic aspects of finite geometries
Eötvös Loránd University Institute of Mathematics Ph.D. thesis Some graph theoretic aspects of finite geometries Tamás Héger Doctoral School: Mathematics Director: Miklós Laczkovich, D.Sc. Professor, Member
More informationA spectrum result on minimal blocking sets with respect to the planes of PG(3, q), q odd
A spectrum result on minimal blocking sets with respect to the planes of PG(3, q), q odd C. Rößing L. Storme January 12, 2010 Abstract This article presents a spectrum result on minimal blocking sets with
More informationSome new results on semiarcs in finite projective planes and on inverse-closed subsets in fields
Universitá degli Studi della Basilicata Some new results on semiarcs in finite projective planes and on inverse-closed subsets in fields Dottorato di Ricerca in Matematica János Bolyai MAT 03 Coordinatore
More informationComplete arcs on the parabolic quadric Q(4,q)
Finite Fields and Their Applications 14 (008) 14 1 http://www.elsevier.com/locate/ffa Complete arcs on the parabolic quadric Q(4,q) Jan De Beule a,,1, András Gács b, a Department of Pure Mathematics and
More informationCodewords of small weight in the (dual) code of points and k-spaces of P G(n, q)
Codewords of small weight in the (dual) code of points and k-spaces of P G(n, q) M. Lavrauw L. Storme G. Van de Voorde October 4, 2007 Abstract In this paper, we study the p-ary linear code C k (n, q),
More informationOn two-intersection sets with respect to hyperplanes in projective spaces
with respect to hyperplanes in projective spaces Aart Blokhuis Technische Universiteit Eindhoven, Postbox 513, 5600 MB Eindhoven, The Netherlands and Michel Lavrauw Technische Universiteit Eindhoven, Postbox
More informationSemiarcs with a long secant in PG(2,q)
Innovations in Incidence Geometry Volume 14 (2015), Pages 1 26 ISSN 1781-6475 Semiarcs with a long secant in PG(2,q) Bence Csajbók Tamás Héger György Kiss Abstract At-semiarc is a point sets t with the
More informationAbout Maximal Partial 2-Spreads in PG(3m 1, q)
Innovations in Incidence Geometry Volume 00 (XXXX), Pages 000 000 ISSN 1781-6475 About Maximal Partial 2-Spreads in PG(3m 1, q) Sz. L. Fancsali and P. Sziklai Abstract In this article we construct maximal
More informationOn the structure of the directions not determined by a large affine point set
On the structure of the directions not determined by a large affine point set Jan De Beule, Peter Sziklai, and Marcella Takáts January 12, 2011 Abstract Given a point set U in an n-dimensional affine space
More informationSome practice problems for midterm 2
Some practice problems for midterm 2 Kiumars Kaveh November 14, 2011 Problem: Let Z = {a G ax = xa, x G} be the center of a group G. Prove that Z is a normal subgroup of G. Solution: First we prove Z is
More informationMath 429/581 (Advanced) Group Theory. Summary of Definitions, Examples, and Theorems by Stefan Gille
Math 429/581 (Advanced) Group Theory Summary of Definitions, Examples, and Theorems by Stefan Gille 1 2 0. Group Operations 0.1. Definition. Let G be a group and X a set. A (left) operation of G on X is
More informationPolynomial Rings. i=0
Polynomial Rings 4-15-2018 If R is a ring, the ring of polynomials in x with coefficients in R is denoted R[x]. It consists of all formal sums a i x i. Here a i = 0 for all but finitely many values of
More informationFILTERED RINGS AND MODULES. GRADINGS AND COMPLETIONS.
FILTERED RINGS AND MODULES. GRADINGS AND COMPLETIONS. Let A be a ring, for simplicity assumed commutative. A filtering, or filtration, of an A module M means a descending sequence of submodules M = M 0
More informationMath 120. Groups and Rings Midterm Exam (November 8, 2017) 2 Hours
Math 120. Groups and Rings Midterm Exam (November 8, 2017) 2 Hours Name: Please read the questions carefully. You will not be given partial credit on the basis of having misunderstood a question, and please
More informationCHAPTER I. Rings. Definition A ring R is a set with two binary operations, addition + and
CHAPTER I Rings 1.1 Definitions and Examples Definition 1.1.1. A ring R is a set with two binary operations, addition + and multiplication satisfying the following conditions for all a, b, c in R : (i)
More informationOn linear sets on a projective line
On linear sets on a projective line M. Lavrauw G. Van de Voorde August 14, 2013 Abstract Linear sets generalise the concept of subgeometries in a projective space. They have many applications in finite
More informationLinks among Finite Geometries, Graphs and Groups
Links among Finite Geometries, Graphs and Groups Ph.D. dissertation János Ru Supervisor: György Kiss, Ph.D. Doctoral School in Mathematics and Computer Science University of Szeged Bolyai Institute 2010
More informationMath /Foundations of Algebra/Fall 2017 Numbers at the Foundations: Real Numbers In calculus, the derivative of a function f(x) is defined
Math 400-001/Foundations of Algebra/Fall 2017 Numbers at the Foundations: Real Numbers In calculus, the derivative of a function f(x) is defined using limits. As a particular case, the derivative of f(x)
More informationOutline. MSRI-UP 2009 Coding Theory Seminar, Week 2. The definition. Link to polynomials
Outline MSRI-UP 2009 Coding Theory Seminar, Week 2 John B. Little Department of Mathematics and Computer Science College of the Holy Cross Cyclic Codes Polynomial Algebra More on cyclic codes Finite fields
More informationHomework 8 Solutions to Selected Problems
Homework 8 Solutions to Selected Problems June 7, 01 1 Chapter 17, Problem Let f(x D[x] and suppose f(x is reducible in D[x]. That is, there exist polynomials g(x and h(x in D[x] such that g(x and h(x
More informationTHE CLASSIFICATION OF PLANAR MONOMIALS OVER FIELDS OF PRIME SQUARE ORDER
THE CLASSIFICATION OF PLANAR MONOMIALS OVER FIELDS OF PRIME SQUARE ORDER ROBERT S COULTER Abstract Planar functions were introduced by Dembowski and Ostrom in [3] to describe affine planes possessing collineation
More informationOn q-analogues and stability theorems
On q-analogues and stability theorems Aart Blokhuis, Andries Brouwer, Tamás Szőnyi and Zsuzsa Weiner Abstract. In this survey recent results about q-analogues of some classical theorems in extremal set
More informationAnalytic Geometry and Calculus I Exam 1 Practice Problems Solutions 2/19/7
Analytic Geometry and Calculus I Exam 1 Practice Problems Solutions /19/7 Question 1 Write the following as an integer: log 4 (9)+log (5) We have: log 4 (9)+log (5) = ( log 4 (9)) ( log (5)) = 5 ( log
More informationHomework 9 Solutions to Selected Problems
Homework 9 Solutions to Selected Problems June 11, 2012 1 Chapter 17, Problem 12 Since x 2 + x + 4 has degree 2 and Z 11 is a eld, we may use Theorem 17.1 and show that f(x) is irreducible because it has
More informationQuasi-reducible Polynomials
Quasi-reducible Polynomials Jacques Willekens 06-Dec-2008 Abstract In this article, we investigate polynomials that are irreducible over Q, but are reducible modulo any prime number. 1 Introduction Let
More information8. Prime Factorization and Primary Decompositions
70 Andreas Gathmann 8. Prime Factorization and Primary Decompositions 13 When it comes to actual computations, Euclidean domains (or more generally principal ideal domains) are probably the nicest rings
More informationDefinition. Example: In Z 13
Difference Sets Definition Suppose that G = (G,+) is a finite group of order v with identity 0 written additively but not necessarily abelian. A (v,k,λ)-difference set in G is a subset D of G of size k
More informationSection VI.33. Finite Fields
VI.33 Finite Fields 1 Section VI.33. Finite Fields Note. In this section, finite fields are completely classified. For every prime p and n N, there is exactly one (up to isomorphism) field of order p n,
More informationFinite Fields. Saravanan Vijayakumaran Department of Electrical Engineering Indian Institute of Technology Bombay
1 / 25 Finite Fields Saravanan Vijayakumaran sarva@ee.iitb.ac.in Department of Electrical Engineering Indian Institute of Technology Bombay September 25, 2014 2 / 25 Fields Definition A set F together
More information1) The line has a slope of ) The line passes through (2, 11) and. 6) r(x) = x + 4. From memory match each equation with its graph.
Review Test 2 Math 1314 Name Write an equation of the line satisfying the given conditions. Write the answer in standard form. 1) The line has a slope of - 2 7 and contains the point (3, 1). Use the point-slope
More informationMATH 361: NUMBER THEORY TENTH LECTURE
MATH 361: NUMBER THEORY TENTH LECTURE The subject of this lecture is finite fields. 1. Root Fields Let k be any field, and let f(x) k[x] be irreducible and have positive degree. We want to construct a
More informationAlgebra Qualifying Exam August 2001 Do all 5 problems. 1. Let G be afinite group of order 504 = 23 32 7. a. Show that G cannot be isomorphic to a subgroup of the alternating group Alt 7. (5 points) b.
More informationThe minimum weight of dual codes from projective planes
The minimum weight of dual codes from projective planes J. D. Key Department of Mathematical Sciences Clemson University, University of Wales Aberystwyth, University of the Western Cape and University
More informationARCS IN FINITE PROJECTIVE SPACES. Basic objects and definitions
ARCS IN FINITE PROJECTIVE SPACES SIMEON BALL Abstract. These notes are an outline of a course on arcs given at the Finite Geometry Summer School, University of Sussex, June 26-30, 2017. Let K denote an
More informationLECTURE NOTES IN CRYPTOGRAPHY
1 LECTURE NOTES IN CRYPTOGRAPHY Thomas Johansson 2005/2006 c Thomas Johansson 2006 2 Chapter 1 Abstract algebra and Number theory Before we start the treatment of cryptography we need to review some basic
More informationMATH 3030, Abstract Algebra FALL 2012 Toby Kenney Midyear Examination Friday 7th December: 7:00-10:00 PM
MATH 3030, Abstract Algebra FALL 2012 Toby Kenney Midyear Examination Friday 7th December: 7:00-10:00 PM Basic Questions 1. Compute the factor group Z 3 Z 9 / (1, 6). The subgroup generated by (1, 6) is
More informationCHAPTER 14. Ideals and Factor Rings
CHAPTER 14 Ideals and Factor Rings Ideals Definition (Ideal). A subring A of a ring R is called a (two-sided) ideal of R if for every r 2 R and every a 2 A, ra 2 A and ar 2 A. Note. (1) A absorbs elements
More informationSelf-Complementary Arc-Transitive Graphs and Their Imposters
Self-Complementary Arc-Transitive Graphs and Their Imposters by Natalie Mullin A thesis presented to the University of Waterloo in fulfillment of the thesis requirement for the degree of Master of Mathematics
More informationarxiv: v1 [cs.it] 12 Jun 2016
New Permutation Trinomials From Niho Exponents over Finite Fields with Even Characteristic arxiv:606.03768v [cs.it] 2 Jun 206 Nian Li and Tor Helleseth Abstract In this paper, a class of permutation trinomials
More informationClassification of Finite Fields
Classification of Finite Fields In these notes we use the properties of the polynomial x pd x to classify finite fields. The importance of this polynomial is explained by the following basic proposition.
More informationCHAPTER 2 POLYNOMIALS KEY POINTS
CHAPTER POLYNOMIALS KEY POINTS 1. Polynomials of degrees 1, and 3 are called linear, quadratic and cubic polynomials respectively.. A quadratic polynomial in x with real coefficient is of the form a x
More informationU + V = (U V ) (V U), UV = U V.
Solution of Some Homework Problems (3.1) Prove that a commutative ring R has a unique 1. Proof: Let 1 R and 1 R be two multiplicative identities of R. Then since 1 R is an identity, 1 R = 1 R 1 R. Since
More information(Rgs) Rings Math 683L (Summer 2003)
(Rgs) Rings Math 683L (Summer 2003) We will first summarise the general results that we will need from the theory of rings. A unital ring, R, is a set equipped with two binary operations + and such that
More informationMATH 431 PART 2: POLYNOMIAL RINGS AND FACTORIZATION
MATH 431 PART 2: POLYNOMIAL RINGS AND FACTORIZATION 1. Polynomial rings (review) Definition 1. A polynomial f(x) with coefficients in a ring R is n f(x) = a i x i = a 0 + a 1 x + a 2 x 2 + + a n x n i=0
More informationSection 33 Finite fields
Section 33 Finite fields Instructor: Yifan Yang Spring 2007 Review Corollary (23.6) Let G be a finite subgroup of the multiplicative group of nonzero elements in a field F, then G is cyclic. Theorem (27.19)
More informationPUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include
PUTNAM TRAINING POLYNOMIALS (Last updated: December 11, 2017) Remark. This is a list of exercises on polynomials. Miguel A. Lerma Exercises 1. Find a polynomial with integral coefficients whose zeros include
More informationGauss periods and related Combinatorics
momihara@educkumamoto-uacjp 23-01-2015 Fundamentals of characters of abelian groups A character ψ of G is a homomorphism from G to C Ĝ: the set of all characters of G e: the exponent of G Remark The image
More informationExercise Sheet 3 - Solutions
Algebraic Geometry D-MATH, FS 2016 Prof. Pandharipande Exercise Sheet 3 - Solutions 1. Prove the following basic facts about algebraic maps. a) For f : X Y and g : Y Z algebraic morphisms of quasi-projective
More informationSome Two Character Sets
Some Two Character Sets A. Cossidente Dipartimento di Matematica e Informatica Università degli Studi della Basilicata Contrada Macchia Romana 85100 Potenza (ITALY) E mail: cossidente@unibas.it Oliver
More informationMath Introduction to Modern Algebra
Math 343 - Introduction to Modern Algebra Notes Field Theory Basics Let R be a ring. M is called a maximal ideal of R if M is a proper ideal of R and there is no proper ideal of R that properly contains
More informationInformation Theory. Lecture 7
Information Theory Lecture 7 Finite fields continued: R3 and R7 the field GF(p m ),... Cyclic Codes Intro. to cyclic codes: R8.1 3 Mikael Skoglund, Information Theory 1/17 The Field GF(p m ) π(x) irreducible
More informationSection 0.2 & 0.3 Worksheet. Types of Functions
MATH 1142 NAME Section 0.2 & 0.3 Worksheet Types of Functions Now that we have discussed what functions are and some of their characteristics, we will explore different types of functions. Section 0.2
More informationELLIPTIC CURVES BJORN POONEN
ELLIPTIC CURVES BJORN POONEN 1. Introduction The theme of this lecture is to show how geometry can be used to understand the rational number solutions to a polynomial equation. We will illustrate this
More informationMTH310 EXAM 2 REVIEW
MTH310 EXAM 2 REVIEW SA LI 4.1 Polynomial Arithmetic and the Division Algorithm A. Polynomial Arithmetic *Polynomial Rings If R is a ring, then there exists a ring T containing an element x that is not
More informationChapter 8. P-adic numbers. 8.1 Absolute values
Chapter 8 P-adic numbers Literature: N. Koblitz, p-adic Numbers, p-adic Analysis, and Zeta-Functions, 2nd edition, Graduate Texts in Mathematics 58, Springer Verlag 1984, corrected 2nd printing 1996, Chap.
More information= 1 2x. x 2 a ) 0 (mod p n ), (x 2 + 2a + a2. x a ) 2
8. p-adic numbers 8.1. Motivation: Solving x 2 a (mod p n ). Take an odd prime p, and ( an) integer a coprime to p. Then, as we know, x 2 a (mod p) has a solution x Z iff = 1. In this case we can suppose
More informationFinite Fields. Sophie Huczynska. Semester 2, Academic Year
Finite Fields Sophie Huczynska Semester 2, Academic Year 2005-06 2 Chapter 1. Introduction Finite fields is a branch of mathematics which has come to the fore in the last 50 years due to its numerous applications,
More informationDefinitions, Theorems and Exercises. Abstract Algebra Math 332. Ethan D. Bloch
Definitions, Theorems and Exercises Abstract Algebra Math 332 Ethan D. Bloch December 26, 2013 ii Contents 1 Binary Operations 3 1.1 Binary Operations............................... 4 1.2 Isomorphic Binary
More informationSection III.6. Factorization in Polynomial Rings
III.6. Factorization in Polynomial Rings 1 Section III.6. Factorization in Polynomial Rings Note. We push several of the results in Section III.3 (such as divisibility, irreducibility, and unique factorization)
More informationPYTHAGOREAN TRIPLES KEITH CONRAD
PYTHAGOREAN TRIPLES KEITH CONRAD 1. Introduction A Pythagorean triple is a triple of positive integers (a, b, c) where a + b = c. Examples include (3, 4, 5), (5, 1, 13), and (8, 15, 17). Below is an ancient
More information1 Rings 1 RINGS 1. Theorem 1.1 (Substitution Principle). Let ϕ : R R be a ring homomorphism
1 RINGS 1 1 Rings Theorem 1.1 (Substitution Principle). Let ϕ : R R be a ring homomorphism (a) Given an element α R there is a unique homomorphism Φ : R[x] R which agrees with the map ϕ on constant polynomials
More informationDesign Theory Notes 1:
----------------------------------------------------------------------------------------------- Math 6023 Topics in Discrete Math: Design and Graph Theory Fall 2007 ------------------------------------------------------------------------------------------------
More informationTight Sets and m-ovoids of Quadrics 1
Tight Sets and m-ovoids of Quadrics 1 Qing Xiang Department of Mathematical Sciences University of Delaware Newark, DE 19716 USA xiang@mathudeledu Joint work with Tao Feng and Koji Momihara 1 T Feng, K
More informationCYCLOTOMIC POLYNOMIALS
CYCLOTOMIC POLYNOMIALS 1. The Derivative and Repeated Factors The usual definition of derivative in calculus involves the nonalgebraic notion of limit that requires a field such as R or C (or others) where
More informationTo hand in: (a) Prove that a group G is abelian (= commutative) if and only if (xy) 2 = x 2 y 2 for all x, y G.
Homework #6. Due Thursday, October 14th Reading: For this homework assignment: Sections 3.3 and 3.4 (up to page 167) Before the class next Thursday: Sections 3.5 and 3.4 (pp. 168-171). Also review the
More informationRings. Chapter 1. Definition 1.2. A commutative ring R is a ring in which multiplication is commutative. That is, ab = ba for all a, b R.
Chapter 1 Rings We have spent the term studying groups. A group is a set with a binary operation that satisfies certain properties. But many algebraic structures such as R, Z, and Z n come with two binary
More informationD-MATH Algebra I HS 2013 Prof. Brent Doran. Exercise 11. Rings: definitions, units, zero divisors, polynomial rings
D-MATH Algebra I HS 2013 Prof. Brent Doran Exercise 11 Rings: definitions, units, zero divisors, polynomial rings 1. Show that the matrices M(n n, C) form a noncommutative ring. What are the units of M(n
More informationCYCLOTOMIC POLYNOMIALS
CYCLOTOMIC POLYNOMIALS 1. The Derivative and Repeated Factors The usual definition of derivative in calculus involves the nonalgebraic notion of limit that requires a field such as R or C (or others) where
More informationMATH 1902: Mathematics for the Physical Sciences I
MATH 1902: Mathematics for the Physical Sciences I Dr Dana Mackey School of Mathematical Sciences Room A305 A Email: Dana.Mackey@dit.ie Dana Mackey (DIT) MATH 1902 1 / 46 Module content/assessment Functions
More informationMATH HL OPTION - REVISION SETS, RELATIONS AND GROUPS Compiled by: Christos Nikolaidis
MATH HL OPTION - REVISION SETS, RELATIONS AND GROUPS Compiled by: Christos Nikolaidis PART B: GROUPS GROUPS 1. ab The binary operation a * b is defined by a * b = a+ b +. (a) Prove that * is associative.
More informationMATH 3030, Abstract Algebra Winter 2012 Toby Kenney Sample Midterm Examination Model Solutions
MATH 3030, Abstract Algebra Winter 2012 Toby Kenney Sample Midterm Examination Model Solutions Basic Questions 1. Give an example of a prime ideal which is not maximal. In the ring Z Z, the ideal {(0,
More information55 Separable Extensions
55 Separable Extensions In 54, we established the foundations of Galois theory, but we have no handy criterion for determining whether a given field extension is Galois or not. Even in the quite simple
More informationELG 5372 Error Control Coding. Lecture 12: Ideals in Rings and Algebraic Description of Cyclic Codes
ELG 5372 Error Control Coding Lecture 12: Ideals in Rings and Algebraic Description of Cyclic Codes Quotient Ring Example + Quotient Ring Example Quotient Ring Recall the quotient ring R={,,, }, where
More informationFinite Fields and Error-Correcting Codes
Lecture Notes in Mathematics Finite Fields and Error-Correcting Codes Karl-Gustav Andersson (Lund University) (version 1.013-16 September 2015) Translated from Swedish by Sigmundur Gudmundsson Contents
More informationA Generalization of Wilson s Theorem
A Generalization of Wilson s Theorem R. Andrew Ohana June 3, 2009 Contents 1 Introduction 2 2 Background Algebra 2 2.1 Groups................................. 2 2.2 Rings.................................
More informationFactorization in Integral Domains II
Factorization in Integral Domains II 1 Statement of the main theorem Throughout these notes, unless otherwise specified, R is a UFD with field of quotients F. The main examples will be R = Z, F = Q, and
More informationLimits at Infinity. Horizontal Asymptotes. Definition (Limits at Infinity) Horizontal Asymptotes
Limits at Infinity If a function f has a domain that is unbounded, that is, one of the endpoints of its domain is ±, we can determine the long term behavior of the function using a it at infinity. Definition
More informationHMMT February 2018 February 10, 2018
HMMT February 018 February 10, 018 Algebra and Number Theory 1. For some real number c, the graphs of the equation y = x 0 + x + 18 and the line y = x + c intersect at exactly one point. What is c? 18
More informationFinite Fields: An introduction through exercises Jonathan Buss Spring 2014
Finite Fields: An introduction through exercises Jonathan Buss Spring 2014 A typical course in abstract algebra starts with groups, and then moves on to rings, vector spaces, fields, etc. This sequence
More informationMINIMAL GENERATING SETS OF GROUPS, RINGS, AND FIELDS
MINIMAL GENERATING SETS OF GROUPS, RINGS, AND FIELDS LORENZ HALBEISEN, MARTIN HAMILTON, AND PAVEL RŮŽIČKA Abstract. A subset X of a group (or a ring, or a field) is called generating, if the smallest subgroup
More informationUnit IV Derivatives 20 Hours Finish by Christmas
Unit IV Derivatives 20 Hours Finish by Christmas Calculus There two main streams of Calculus: Differentiation Integration Differentiation is used to find the rate of change of variables relative to one
More informationUnit IV Derivatives 20 Hours Finish by Christmas
Unit IV Derivatives 20 Hours Finish by Christmas Calculus There two main streams of Calculus: Differentiation Integration Differentiation is used to find the rate of change of variables relative to one
More informationMath 46 Final Exam Review Packet
Math 46 Final Exam Review Packet Question 1. Perform the indicated operation. Simplify if possible. 7 x x 2 2x + 3 2 x Question 2. The sum of a number and its square is 72. Find the number. Question 3.
More informationPart IX ( 45-47) Factorization
Part IX ( 45-47) Factorization Satya Mandal University of Kansas, Lawrence KS 66045 USA January 22 45 Unique Factorization Domain (UFD) Abstract We prove evey PID is an UFD. We also prove if D is a UFD,
More informationAlgebra Review. Instructor: Laszlo Babai Notes by Vincent Lucarelli and the instructor. June 15, 2001
Algebra Review Instructor: Laszlo Babai Notes by Vincent Lucarelli and the instructor June 15, 2001 1 Groups Definition 1.1 A semigroup (G, ) is a set G with a binary operation such that: Axiom 1 ( a,
More information