English
Related papers

Related papers: A nonabelian circle method

200 papers

We present a two-dimensional delta symbol method that facilitates a version of the Kloosterman refinement of the circle method, addressing a question posed by Heath-Brown. As an application, we establish the asymptotic formula for the…

Number Theory · Mathematics 2026-04-30 Junxian Li , Simon L. Rydin Myerson , Pankaj Vishe

We apply the circle method with a Gaussian weight to obtain an asymptotic formula for the density of representations of non-zero integers by non-singular quadratic forms in at least four variables.

Number Theory · Mathematics 2009-05-11 Nic Niedermowwe

Let $F$ be a non-degenerate quadratic form on an $n$-dimensional vector space $V$ over the rational numbers. One is interested in counting the number of zeros of the quadratic form whose coordinates are restricted in a smoothed box of size…

Number Theory · Mathematics 2019-11-01 Thomas Huong Tran

Uniform asymptotic expansions are derived for the zeros of the reverse generalized Bessel polynomials of large degree $n$ and real parameter $a$. It is assumed that $-\Delta_{1} n+\frac{3}{2} \leq a \leq \Delta_{2} n$ for fixed arbitrary…

Classical Analysis and ODEs · Mathematics 2025-11-04 T. M. Dunster , Amparo Gil , Diego Ruiz-Antolin , Javier Segura

A kind of self-dual quasi-abelian codes of index $2$ over any finite field $F$ is introduced. By counting the number of such codes and the number of the codes of this kind whose relative minimum weights are small, such codes are proved to…

Information Theory · Computer Science 2021-08-18 Liren Lin , Yun Fan

Let $\Delta(x)$ denote the error term in the Dirichlet divisor problem. Our main results are the asymptotic formulas $$ \int_1^X \Delta^3(x){\rm d}x = BX^{7/4} + O_\epsilon(X^{\beta+\epsilon}) \qquad(B > 0) $$ and $$ \int_1^X…

Number Theory · Mathematics 2007-09-24 Aleksandar Ivić , Patrick Sargos

Let $K$ be a number field, $k\geq 2$ an integer, $(K^*)^k$ the $k$-fold direct product of $K^*$ with coordinatewise multiplication, and $\Gamma$ a finitely generated subgroup of rank $r$ of $(K^*)^k$. Further, let $H(\alpha )$ denote the…

Number Theory · Mathematics 2026-05-29 Jan-Hendrik Evertse , Kálmán Győry , Lajos Hajdu , Florian Luca , László Remete

We obtain asymptotic for the quantity $\int_0^1 \bigg|\sum_{n\le X}\tau_k(n)e(n\alpha)\bigg|d\alpha$ where $\tau_k(n) = \sum_{d_1\dots d_k = n} 1$. This follows from a quick application of the circle method. Along the way, we find minor arc…

Number Theory · Mathematics 2020-01-03 Mayank Pandey

We give an exact formula for the value of the derivative at zero of the gap probability in finite n x n Gaussian ensembles. As n goes to infinity our computation provides an asymptotic (with an explicit constant) of the order n^(1/2). As a…

Probability · Mathematics 2013-09-24 Antonio Lerario , Erik Lundberg

Let N(n, t) be the minimal number of points in a spherical t-design on the unit sphere S^n in R^{n+1}. For each n >= 3, we prove a new asymptotic upper bound N(n, t) <= C(n)t^{a_n}, where C(n) is a constant depending only on n, a_3 <= 4,…

Numerical Analysis · Mathematics 2008-11-04 Andriy V. Bondarenko , Maryna S. Viazovska

The sequence of 1/2-discrepancy sums of $\{x + i \theta \bmod 1\}$ is realized through a sequence of substitutions on an alphabet of three symbols; particular attention is paid to $x=0$. The first application is to show that any asymptotic…

Dynamical Systems · Mathematics 2011-05-31 David Ralston

We discuss and compare upper and lower bounds obtained by two different methods for the positive zero of the ultraspherical polynomial $C_{n}^{(\lambda)}$ that is greater than $1$ when $-3/2 < \lambda < -1/2.$ Our first approach uses mixed…

Classical Analysis and ODEs · Mathematics 2016-02-12 Kathy Driver , Martin E. Muldoon

For any $\varepsilon >0$, we obtain an asymptotic formula for the number of solutions $n \le x$ to $$ \lVert \alpha n + \beta \rVert < x^{-\frac{1}{4}+\varepsilon} $$ where $n$ is $[y,z]$-smooth for infinitely many real number $x$. In…

Number Theory · Mathematics 2019-05-02 Kam Hung Yau

A finitely presented, torsion free, abelian-by-cyclic group can always be written as an ascending HNN extension Gamma_M of Z^n, determined by an n x n integer matrix M with det(M) \ne 0. The group Gamma_M is polycyclic if and only if…

Group Theory · Mathematics 2007-05-23 Benson Farb , Lee Mosher

For a finite (not necessarily Abelian) group $(\Gamma,\cdot)$, let $n(\Gamma) \in \mathbb{N}$ denote the smallest positive integer $n$ such that for every labelling of the arcs of the complete digraph of order $n$ using elements from…

Combinatorics · Mathematics 2024-07-16 Rutger Campbell , J. Pascal Gollin , Kevin Hendrey , Raphael Steiner

Let $\{X_n,n\ge1\}$ be a sequence of independent and identically distributed random variables, taking non-negative integer values, and call $X_n$ a $\delta$-record if $X_n>\max\{X_1,...,X_{n-1}\}+\delta$, where $\delta$ is an integer…

Probability · Mathematics 2009-09-29 Raúl Gouet , F. Javier López , Gerardo Sanz

Let $n_k(s)$ be the maximal length $n$ such that a quaternary additive $[n,k,n-s]_4$-code exists. We solve a natural asymptotic problem by determining the lim sup $\lambda_k$ of $n_k(s)/s,$ and the smallest value of $s$ such that…

Combinatorics · Mathematics 2023-10-19 Jürgen Bierbrauer , Stefano Marcugini , Fernanda Pambianco

Strong asymptotics on the whole complex plane of a sequence of monic Jacobi polynomials $P_n^{(\alpha_n, \beta_n)}$ is studied, assuming that $$ \lim_{n\to\infty} \frac{\alpha_n}{n}=A, \qquad \lim_{n\to\infty} \frac{\beta _n}{n}=B, $$ with…

Classical Analysis and ODEs · Mathematics 2007-05-23 A. B. J. Kuijlaars , A. Martinez-Finkelshtein

We count algebraic points of bounded height and degree on the graphs of certain functions analytic on the unit disk, obtaining a bound which is polynomial in the degree and in the logarithm of the multiplicative height. We combine this work…

Number Theory · Mathematics 2019-02-12 Gareth Boxall , Gareth Jones , Harry Schmidt

We prove an asymptotic formula for the number of Eulerian circuits for graphs with strong mixing properties and with vertices having even degrees. The exact value is determined up to the multiplicative error $O(n^{-1/2+\varepsilon})$, where…

Combinatorics · Mathematics 2015-06-11 Mikhail Isaev
‹ Prev 1 2 3 10 Next ›