Abstract. A classical conjecture predicts how often a polynomial in Z[T] takes prime values. The natural analogous conjecture for prime values of a polynomial f(T) ∈ κ[u][T], where κ is a finite field, is false. The conjecture over κ[u] was modified in earlier work by introducing a correction factor that encodes unexpected periodicity of the Möbius function at the values of f on κ[u] when f ∈ κ[u][T p], where p is the characteristic of κ. In this paper, for p 6 = 2 we extend the Möbius periodicity results for κ[u] – the affine κ-line – to the case when f has coefficients in the coordinate ring A of any higher-genus smooth affine κ-curve with one geometric point at infinity. The basic strategy is to pull up results from the genus-0 case ...
The dissertation consists of four chapters. The first chapter is an introduction, where we formulate...
The dissertation consists of four chapters. The first chapter is an introduction, where we formulate...
For any positive integers n ≥ 3 and r ≥ 1, we prove that the number of monic irreducible polynomials...
Abstract. A classical conjecture predicts how often a polynomial in Z[T] takes prime values. The nat...
AbstractA classical conjecture of Bouniakowsky says that a non-constant irreducible polynomial in Z[...
Fix an odd prime p. If r is a positive integer and f is a polynomial with coefficients in Fpr, let P...
Let K be a number field, and suppose λ(x,t)∈K[x,t] is irreducible over K(t). Using algebraic geometr...
96 pages including large numerical tables and PARI programsSome PARI programs have bring out a prope...
96 pages including large numerical tables and PARI programsSome PARI programs have bring out a prope...
96 pages including large numerical tables and PARI programsSome PARI programs have bring out a prope...
96 pages including large numerical tables and PARI programsSome PARI programs have bring out a prope...
Any irreducible polynomial f(x) in [special characters omitted][x] such that the set of values f([sp...
AbstractA classical conjecture of Bouniakowsky says that a non-constant irreducible polynomial in Z[...
Let K be a number field, and suppose λ(x,t)∈K[x,t] is irreducible over K(t). Using algebraic geometr...
Let K be a number field, and suppose λ(x,t)∈K[x,t] is irreducible over K(t). Using algebraic geometr...
The dissertation consists of four chapters. The first chapter is an introduction, where we formulate...
The dissertation consists of four chapters. The first chapter is an introduction, where we formulate...
For any positive integers n ≥ 3 and r ≥ 1, we prove that the number of monic irreducible polynomials...
Abstract. A classical conjecture predicts how often a polynomial in Z[T] takes prime values. The nat...
AbstractA classical conjecture of Bouniakowsky says that a non-constant irreducible polynomial in Z[...
Fix an odd prime p. If r is a positive integer and f is a polynomial with coefficients in Fpr, let P...
Let K be a number field, and suppose λ(x,t)∈K[x,t] is irreducible over K(t). Using algebraic geometr...
96 pages including large numerical tables and PARI programsSome PARI programs have bring out a prope...
96 pages including large numerical tables and PARI programsSome PARI programs have bring out a prope...
96 pages including large numerical tables and PARI programsSome PARI programs have bring out a prope...
96 pages including large numerical tables and PARI programsSome PARI programs have bring out a prope...
Any irreducible polynomial f(x) in [special characters omitted][x] such that the set of values f([sp...
AbstractA classical conjecture of Bouniakowsky says that a non-constant irreducible polynomial in Z[...
Let K be a number field, and suppose λ(x,t)∈K[x,t] is irreducible over K(t). Using algebraic geometr...
Let K be a number field, and suppose λ(x,t)∈K[x,t] is irreducible over K(t). Using algebraic geometr...
The dissertation consists of four chapters. The first chapter is an introduction, where we formulate...
The dissertation consists of four chapters. The first chapter is an introduction, where we formulate...
For any positive integers n ≥ 3 and r ≥ 1, we prove that the number of monic irreducible polynomials...