Let F be a finite field of cliaracteristic two and'let F'xm and FIXn denote vector spaces of m-tuples and n-tuples, respectively, over P. Let Q be a quadratic form of rank m defined on FIXm and let Q, be a quadratic form of rank n defined on F I X n . Then relative to given ordered bases for .FIXm a
A problem involving quadratic forms in a finite field
β Scribed by L. Carlitz
- Publisher
- John Wiley and Sons
- Year
- 1954
- Tongue
- English
- Weight
- 304 KB
- Volume
- 11
- Category
- Article
- ISSN
- 0025-584X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Let N be the number of affine zeros of a pair of quadratic forms in n#1 variables defined over a finite field F O . We give upper and lower bounds for N and show that these bounds are optimal. One result states that if n#1510 and every quadratic form in the pencil has order at least three, then "N!q
## Abstract The reformulationβlinearization technique (RLT) is a methodology for constructing tight linear programming relaxations of mixed discrete problems. A key construct is the multiplication of βproduct factorsβ of the discrete variables with problem constraints to form polynomial restriction