English
Related papers

Related papers: Sums of three cubes over a function field

200 papers

Let $\mathbb{F}_q$ denote the finite field of odd characteristic $p$ with $q$ elements ($q=p^{n},n\in \mathbb{N} $) and $\mathbb{F}_q^*$ represent the nonzero elements of $\mathbb{F}_{q}$. In this paper, by using the Smith normal form we…

Number Theory · Mathematics 2016-03-08 Shuangnian Hu , Shaofang Hong , Xiaoer Qin

The representation of any integer as the sum of two cubes to a fixed modulus is always possible if and only if the modulus is not divisible by seven or nine. For a positive non-prime integer N there is given an inductive way to find its…

Number Theory · Mathematics 2011-09-05 Ala Avoyan , David Tsirekidze

Let $\psi$ and $F$ be positive definite forms with integral coefficients of equal degree. Using the circle method, we establish an asymptotic formula for the number of identical representations of $\psi$ by $F$, provided $\psi$ is…

Number Theory · Mathematics 2015-08-17 Julia Brandes

Friedberg, Hoffstein and Lieman have constructed two related multiple Dirichlet series from quadratic and higher-order $L$-functions and Gauss sums. We compute these multiple Dirichlet series explicitly in the case of the rational function…

Number Theory · Mathematics 2007-06-20 Gautam Chinta , Joel B. Mohler

We show that for a large class of cubic polynomials $f$, every sufficiently large number can be written as a sum of seven positive values of $f$. As a special case, we show that every number greater than $e^{10^7}$ is a sum of seven…

Number Theory · Mathematics 2018-06-05 Zarathustra Brady

The size function for a number field is an analogue of the dimension of the Riemann-Roch spaces of divisors on an algebraic curve. It was conjectured to attain its maximum at the trivial class of Arakelov divisors. This conjecture was…

Number Theory · Mathematics 2017-06-27 Ha Thanh Nguyen Tran , Peng Tian

We discuss the problem of constructing a small subset of a finite field containing primitive elements of the field. Given a finite field, $\mathbb{F}_{q^n}$, small $q$ and large $n$, we show that the set of all low degree polynomials…

Number Theory · Mathematics 2014-12-24 Abhishek Bhowmick , Thái Hoàng Lê

Let $\boldsymbol{\alpha}\in \mathbb{R}^N$ and $Q\geq 1$. We consider the sum $\sum_{\boldsymbol{q}\in [-Q,Q]^N\cap\mathbb{Z}^N\backslash\{\boldsymbol{0}\}}\|\boldsymbol{\alpha}\cdot\boldsymbol{q}\|^{-1}$. Sharp upper bounds are known when…

Number Theory · Mathematics 2018-05-03 Reynold Fregoli

We study the minimal number of variables required by a totally positive definite diagonal universal quadratic form over a real quadratic field $\mathbb Q(\sqrt D)$ and obtain lower and upper bounds for it in terms of certain sums of…

Number Theory · Mathematics 2018-07-05 Valentin Blomer , Vítězslav Kala

Let $G$ be a split reductive group over a finite field $\Fq$. Let $F=\Fq(t)$ and let $\A$ denote the ad\`eles of $F$. We show that every double coset in $G(F)\bsl G(\A)/ K$ has a representative in a maximal split torus of $G$. Here $K$ is…

Representation Theory · Mathematics 2010-06-15 Amritanshu Prasad

We prove some cases of a conjecture by Farhi on the representation of every positive integer as the sum of three terms of the sequence $ \left\lfloor\frac{n^2}{a}\right\rfloor$. This is done by generalizing a method used by Farhi in his…

Continuing previous work, this paper focuses on the summability problem of multivariate rational functions in the mixed case in which both shift and $q$-shift operators can appear. Our summability criteria rely on three ingredients…

Symbolic Computation · Computer Science 2026-02-04 Shaoshi Chen , Lixin Du , Hanqian Fang , Yisen Wang

We present new combinatorial proofs of Nicomachus's Theorem for the sum of the third powers of the first n natural numbers. The key step is that we define a 4-dimensional block which comprises unit hyper-cubes. In our first proof we…

Combinatorics · Mathematics 2025-09-30 Joseph Alfano , Emily Armstrong , Vincent DeNolf , Jonah Sagarin

Let k be a quadratic field. We give an explicit formula for the Dirichlet series enumerating cubic fields whose quadratic resolvent field is isomorphic to k. Our work is a sequel to previous work of Cohen and Morra, where such formulas are…

Number Theory · Mathematics 2013-08-15 Henri Cohen , Frank Thorne

Hecke studies the distribution of fractional parts of quadratic irrationals with Fourier expansion of Dirichlet series. This method is generalized by Behnke and Ash-Friedberg, to study the distribution of the number of totally positive…

Number Theory · Mathematics 2016-06-14 Tianyi Mao

It is classically known that the circle method produces an asymptotic for the number of representations of a tuple of integers $(n_1,\ldots,n_R)$ by a system of quadratic forms $Q_1,\ldots, Q_R$ in $k$ variables, as long as $k$ is…

Number Theory · Mathematics 2017-07-04 Lillian B. Pierce , Damaris Schindler , Melanie Matchett Wood

Let $\F$ be the finite field of odd prime power order $q$, We find explicit expressions for the number of triples $\{\al-1,\al,\al+1 \}$ of consecutive non-zero squares in $\F$ and similarly for the number of triples of consecutive…

Number Theory · Mathematics 2025-08-07 Stephen D. Cohen

Let $\mathbb{F}_q$ be the finite field of $q$ elements, and let $k\mid q-1$ be a positive integer. Let $f(x)=ax^2+bx+c$ be a quadratic polynomial in $\mathbb{F}_q[x]$ with $b^2-4ac\ne0$. In this paper, we show that if…

Number Theory · Mathematics 2021-04-27 Hai-Liang Wu , Yue-Feng She

Let $\mathbb{F}_{q}$ be a finite field, $\mathbb{F}_{q^s}$ be an extension of $\mathbb{F}_q$, let $f(x)\in \mathbb{F}_q[x]$ be a polynomial of degree $n$ with $\gcd(n,q)=1$. We present a recursive formula for evaluating the exponential sum…

Information Theory · Computer Science 2010-01-29 Xiwang Cao , Lei Hu

Let $\mathbb{F}_{q}$ be a finite field, $\mathbb{F}_{q^s}$ be an extension of $\mathbb{F}_q$, let $f(x)\in \mathbb{F}_q[x]$ be a polynomial of degree $n$ with $\gcd(n,q)=1$. We present a recursive formula for evaluating the exponential sum…

Information Theory · Computer Science 2010-01-26 Xiwang Cao , Lei Hu
‹ Prev 1 4 5 6 7 8 10 Next ›