English
Related papers

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

200 papers

A known result for the finite general linear group $\GL(n,\FF_q)$ and for the finite unitary group $\U(n,\FF_{q^2})$ posits that the sum of the irreducible character degrees is equal to the number of symmetric matrices in the group. Fulman…

Representation Theory · Mathematics 2007-09-20 Nathaniel Thiem , C. Ryan Vinroot

We study sums of Dirichlet characters over polynomials in $\mathbb{F}_q[t]$ with a prescribed number of irreducible factors. Our main results are explicit formulae for these sums in terms of zeros of Dirichlet L-functions. We also exhibit…

Number Theory · Mathematics 2020-03-27 Samuel Porritt

Tur\'an observed that logarithmic partial sums $\sum_{n\le x}\frac{f(n)}{n}$ of completely multiplicative functions (in the particular case of the Liouville function $f(n)=\lambda(n)$) tend to be positive. We develop a general approach to…

Number Theory · Mathematics 2022-11-11 Bryce Kerr , Oleksiy Klurman

We prove a stratification result for certain families of $n$-dimensional (complete algebraic) multiplicative character sums. The character sums we consider are sums of products of $r$ multiplicative characters evaluated at rational…

Number Theory · Mathematics 2017-09-07 Junyan Xu

We consider the problem of finding a sparse multiple of a polynomial. Given f in F[x] of degree d over a field F, and a desired sparsity t, our goal is to determine if there exists a multiple h in F[x] of f such that h has at most t…

Symbolic Computation · Computer Science 2011-01-04 Mark Giesbrecht , Daniel S. Roche , Hrushikesh Tilak

Let F be any field. Let p(F) be the characteristic of F if F is not of characteristic zero, and let p(F)=+\infty otherwise. Let A_1,...,A_n be finite nonempty subsets of F, and let $$f(x_1,...,x_n)=a_1x_1^k+...+a_nx_n^k+g(x_1,...,x_n)\in…

Number Theory · Mathematics 2008-04-02 Zhi-Wei Sun

Let $p$ be a prime, $k$ a positive integer and let $\mathbb{F}_q$ be the finite field of $q=p^k$ elements. Let $f(x)$ be a polynomial over $\mathbb F_q$ and $a\in\mathbb F_q$. We denote by $N_{s}(f,a)$ the number of zeros of…

Number Theory · Mathematics 2021-08-13 Chaoxi Zhu , Yulu Feng , Shaofang Hong , Junyong Zhao

Consider any nonzero univariate polynomial with rational coefficients, presented as an elementary algebraic expression (using only integer exponents). Letting sigma(f) denotes the additive complexity of f, we show that the number of…

Number Theory · Mathematics 2007-05-23 J. Maurice Rojas

We classify Artin-Schreier extensions of valued fields with non-trivial defect according to whether they are connected with purely inseparable extensions with non-trivial defect, or not. We use this classification to show that in positive…

Commutative Algebra · Mathematics 2013-04-02 Franz-Viktor Kuhlmann

We classify finite non-solvable groups with a faithful primitive irreducible complex character that vanishes on a unique conjugacy class. Our results answer a question of Dixon and Rahnamai Barghi and suggest an extension of Burnside's…

Group Theory · Mathematics 2020-06-25 Sesuai Y. Madanha

V.I. Arnold has recently defined the complexity of finite sequences of zeroes and ones in terms of periods and preperiods of attractors of a dynamic system of the operator of finite differentiation. Arnold has set up a hypothesis that the…

Number Theory · Mathematics 2007-10-11 E. Yu. Lerner

The Landau-Selberg-Delange method provides an asymptotic formula for the partial sums of a multiplicative function whose average value on primes is a fixed complex number $v$. The shape of this asymptotic implies that $f$ can get very small…

Number Theory · Mathematics 2020-05-13 Dimitris Koukoulopoulos , K. Soundararajan

Assuming the Generalized Riemann Hypothesis, the authors study when a character sum over all n <= x is o(x); they show that this holds if log x / log log q -> infinity and q -> infinity (q is the size of the finite field).

Number Theory · Mathematics 2016-09-07 Andrew Granville , K. Soundararajan

A finite semifield is a division algebra over a finite field where multiplication is not necessarily associative. We consider here the complexity of the multiplication in small semifields and finite field extensions. For this operation, the…

Symbolic Computation · Computer Science 2026-02-11 Jean-Guillaume Dumas , Stefano Lia , John Sheekey

A function $f$ defined on $[0, 1]^d$ is called strongly chargeable if there is a continuous vector-field $v$ such that $f(x_1, \dots,x_d)$ equals the flux of $v$ through the rectangle $[0, x_1] \times \cdots \times [0, x_d]$ for all $(x_1,…

Probability · Mathematics 2024-01-30 Philippe Bouafia , Thierry De Pauw

V.I. Arnold has recently defined the complexity of a sequence of $n$ zeros and ones with the help of the operator of finite differences. In this paper we describe the results obtained for almost most complicated sequences of elements of a…

Number Theory · Mathematics 2012-07-10 E. Yu Lerner

In this short note we prove the following result: If a completely multiplicative function $f:\mathbb{N}\to[-1,1]$ is small on average in the sense that $\sum_{n\leq x}f(n)\ll x^{1-\delta}$, for some $\delta>0$, and if the Dirichlet series…

Number Theory · Mathematics 2021-11-30 Marco Aymone

Completely multiplicative functions whose sum is zero ($CMO$).The paper deals with $CMO$, meaning completely multiplicative ($CM$) functions $f$ such that $f(1)=1$ and $\sum\limits\_1^\infty f(n)=0$. $CM$ means $f(ab)=f(a)f(b)$ for all…

Number Theory · Mathematics 2015-07-20 Jean-Pierre Kahane , Eric Saias

We prove, assuming resolution of singularities in positive characteristic, an analogue of Siegel's theorem on sum of squares in positive characteristic. The method of proof combines techniques from central simple algebras with model theory…

Logic · Mathematics 2024-10-31 Carlos Martinez-Ranero , Javier Utreras

We study exponential sums whose coefficients are completely multiplicative and belong to the complex unit disc. Our main result shows that such a sum has substantial cancellation unless the coefficient function is essentially a Dirichlet…

Number Theory · Mathematics 2010-10-25 Leo Goldmakher