English
Related papers

Related papers: On a character sum problem of H. Cohn

200 papers

We prove that every non-trivial valuation on an infinite superrosy field of positive characteristic has divisible value group and algebraically closed residue field. In fact, we prove the following more general result. Let $K$ be a field…

Logic · Mathematics 2013-08-16 Krzysztof Krupinski

In this paper we give a refinement of the bound of D. A. Burgess for multiplicative character sums modulo a prime number $q$. This continues a series of previous logarithmic improvements, which are mostly due to H. Iwaniec and E. Kowalski.…

Number Theory · Mathematics 2019-05-09 Bryce Kerr , Igor E. Shparlinski , Kam Hung Yau

Building on work of Kuhlmann and Lisinski, we study the theory of the Hahn series field $\mathbb{F}_{q}(\!(\mathbb{Q})\!)$, over a finite field $\mathbb{F}_{q}$, equipped with the $t$-adic valuation, in a language of valued fields. We prove…

Logic · Mathematics 2026-04-30 Sylvy Anscombe , Blaise Boissonneau

Let R be the ring of S-integers of an algebraic function field (in one variable) over a perfect field, where S is finite and not empty. It is shown that for every positive integer N there exist elements of R that can not be written as a sum…

Number Theory · Mathematics 2013-11-20 Christopher Frei

Let $X$ be an algebraic variety over a finite field $\bF_q$, homogeneous under a linear algebraic group. We show that the number of rational points of $X$ over $\bF_{q^n}$ is a periodic polynomial function of $q^n$ with integer…

Algebraic Geometry · Mathematics 2009-04-17 Michel Brion , Emmanuel Peyre

Let f be a polinomial with coefficients in a finite field F. Let $\Psi : F \to C^{\ast}$ be a non-trivial additive character. In this paper we give bounds for the exponential sums $\sum_{x\in F^n} \Psi (Tr_{F/F_p} (f(x)))$ in some cases…

alg-geom · Mathematics 2008-02-03 Ricardo Garcia Lopez

Let $\mathbb{K}$ be an uncountable field of characteristic zero and let $f$ be a function from $\mathbb{K}^n$ to $\mathbb{K}$. We show that if the restriction of $f$ to every affine plane $L\subset\mathbb{K}^n$ is regular, then $f$ is a…

Algebraic Geometry · Mathematics 2024-12-10 Beata Gryszka , Janusz Gwoździewicz

Let $c_1(x),c_2(x),f_1(x),f_2(x)$ be polynomials with rational coefficients. With obvious exceptions, there can be at most finitely many roots of unity among the zeros of the polynomials $c_1(x)f_1(x)^n+c_2(x)f_2(x)^n$ with $n=1,2\ldots$.…

Number Theory · Mathematics 2020-11-24 Yuri Bilu , Florian Luca

We prove that for all $q>61$, every non-zero element in the finite field $\mathbb{F}_{q}$ can be written as a linear combination of two primitive roots of $\mathbb{F}_{q}$. This resolves a conjecture posed by Cohen and Mullen.

Number Theory · Mathematics 2014-03-19 Stephen D. Cohen , Tomás Oliveira e Silva , Tim Trudgian

We prove the real non-attractive fixed point conjecture for complex polynomial and rational harmonic functions. A harmonic function $f=h+\overline{g}$ is polynomial (rational) if both $h$ and $g$ are polynomials (rational functions) of…

Complex Variables · Mathematics 2025-07-25 Mohd Vaseem

We prove certain polynomial relations between the values of complex irreducible characters of general finite symmetric groups. We use it to find some sets of conjugacy classes such that no finite symmetric group has a complex irreducible…

Representation Theory · Mathematics 2026-01-19 Lee Tae Young

Given a finite group G, let cd(G) denote the set of degrees of the irreducible complex characters of G. The character degree graph of G is defined as the simple undirected graph whose vertices are the prime divisors of the numbers in cd(G),…

Group Theory · Mathematics 2018-09-28 Zeinab Akhlaghi , Carlo Casolo , Silvio Dolfi , Emanuele Pacifici , Lucia Sanus

The existence of string functions, which are not polynomial time computable, but whose graph is checkable in polynomial time, is a basic assumption in cryptography. We prove that in the framework of algebraic complexity, there are no such…

Computational Complexity · Computer Science 2018-12-18 Peter Bürgisser

Let $f(x) = \sum\limits _{i=0}^{n} a_i x^i $ be a polynomial with coefficients from the ring $\mathbb{Z}$ of integers satisfying either $(i)$ $0 < a_0 \leq a_{1} \leq \cdots \leq a_{k-1} < a_{k} < a_{k+1} \leq \cdots \leq a_n$ for some $k$,…

Commutative Algebra · Mathematics 2016-12-07 Anuj Jakhar , Neeraj Sangwan

When restricted to some non-negative multiplicative function, say f, bounded on primes and that vanishes on non square-free integers, our result provides us with an asymptotic for $\sum_{n \le X}f(n)/n$ with error term $O((\log…

Number Theory · Mathematics 2022-01-21 Olivier Ramare , Alisa Sedunova , Ritika Sharma

We show that the counts of low degree irreducible factors of a random polynomial $f$ over $\mathbb{F}_q$ with independent but non-uniform coefficients behave like that of a uniform random polynomial, exhibiting a form of universality for…

Probability · Mathematics 2022-09-07 Jimmy He , Huy Tuan Pham , Max Wenqiang Xu

In an earlier work, the authors have determined all possible weights $n$ for which there exists a vanishing sum $\zeta_1+\cdots +\zeta_n=0$ of $m$th roots of unity $\zeta_i$ in characteristic 0. In this paper, the same problem is studied in…

Number Theory · Mathematics 2016-09-06 T. Y. Lam , K. H. Leung

We classify those finite fields $\mathbb{F}_q$, for $q$ a power of some fixed prime number, whose members are the sum of an $n$-potent element with $n>1$ and a 4-potent element. It is shown that there are precisely ten non-trivial pairs…

Rings and Algebras · Mathematics 2025-03-11 Stephen D. Cohen , Peter V. Danchev , Tomás Oliveira e Silva

Let $n$ and $k$ be integers such that $1\le k\le n$ and $f(x)$ be a nonzero polynomial of integer coefficients such that $f(m)\ne 0$ for any positive integer $m$. For any $k$-tuple $\vec{s}=(s_1, ..., s_k)$ of positive integers, we define…

Number Theory · Mathematics 2018-07-03 Shaofang Hong , Liping Yang , Qiuyu Yin , Min Qiu

Hybrid character sums are an important class of exponential sums which have nice applications in coding theory and sequence design. Let $\gf_{p^m}$ be the finite field with $p^m$ elements for a prime $p$ and a positive integer $m$. Let…

Information Theory · Computer Science 2025-07-01 Ziling Heng , Peng Wang , Chengju Li
‹ Prev 1 3 4 5 6 7 10 Next ›