Uq-sharp subsets of a finite field

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

Let f ∈ Fq[cursive Greek chi] where Fq is a finite field of characteristic p. Wan et al discovered a lower bound for the value set of f in terms of an invariant uq(f) associated to the polynomial f. We define a notion of uq-sharp subsets of Fq and discuss related problems. We show how the notion of uq-sharp sets may be used to give yet another proof of the classical Cauchy-Davenport theorem.

Original languageEnglish (US)
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsGary L. Mullen, Alain Poli, Henning Stichtenoth
PublisherSpringer Verlag
Pages249-253
Number of pages5
ISBN (Print)9783540213246
DOIs
StatePublished - 2004

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2948
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'U<sub>q</sub>-sharp subsets of a finite field'. Together they form a unique fingerprint.

  • Cite this

    Das, P. (2004). Uq-sharp subsets of a finite field. In G. L. Mullen, A. Poli, & H. Stichtenoth (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp. 249-253). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2948). Springer Verlag. https://doi.org/10.1007/978-3-540-24633-6_18