Counting prime polynomials and measuring complexity and similarity of information

Counting prime polynomials and measuring complexity and similarity of information

This dissertation explores an analogue of the prime number theorem for polynomials over finite fields as well as its connection to the necklace factorization algorithm T-transform and the string complexity measure T-complexity. Specifically, a precise asymptotic expansion for the prime polynomial co...

Full description

Bibliographic Details
Main Author: Rebenich, Niko
Other Authors: Gulliver, T. Aaron
Language:English
en
Published: 2016
Subjects:
prime numbers
prime polynomials
finite fields
irreducible polynomials
polylogarithm
Lerch transcendent
Eulerian polynomials
T-codes
NCD
necklaces
string complexity
information distance
divergent series
asymptotic approximation
randomess test
conditional complexity
necklace factorization
prime number theorem
combinatorics
T-complexity
data mining
optimal truncation
function fields
lyndon words
lyndon factorization
similarity measure
asymptotic enumeration
Online Access:http://hdl.handle.net/1828/7251

Internet

http://hdl.handle.net/1828/7251

Similar Items