Related papers: Quadrics in arithmetic statistics
We give a parametrization of square roots of the ideal class of the inverse different of rings defined by binary forms in terms of the orbits of a coregular representation. This parametrization, which can be construed as a new integral…
We develop geometry-of-numbers methods to count orbits in coregular vector spaces having bounded invariants over any global field. We apply these techniques to bound the average ranks and determine average Selmer group sizes of elliptic…
In this article, we combine Bhargava's geometry-of-numbers methods with the dynamical point-counting methods of Eskin--McMullen and Benoist--Oh to develop a new technique for counting integral points on symmetric varieties lying within…
This paper introduces an algorithmic approach to the analysis of bifurcation of limit cycles from the centers of nonlinear continuous differential systems via the averaging method. We develop three algorithms to implement the averaging…
We describe an algorithm, meant to be very general, to compute a presentation of the group of units of an order in a (semi)simple algebra over Q. Our method is based on a generalisation of Vorono\"i's algorithm for computing perfect forms,…
We study the average rank of elliptic curves $E_{A,B} : y^2 = x^3 + Ax + B$ over $\mathbb{Q}$, ordered by the height function $h(E_{A,B}) := \text{max}(|A|, |B|)$. Understanding this average rank requires estimating the number of…
We prove a theorem giving the asymptotic number of binary quartic forms having bounded invariants; this extends, to the quartic case, the classical results of Gauss and Davenport in the quadratic and cubic cases, respectively. Our…
Bhargava and Shankar prove that as E varies over all elliptic curves over Q, the average rank of the finitely generated abelian group E(Q) is bounded. This result follows from an exact formula for the average size of the 2-Selmer group,…
The purpose of this article is to discuss the circle method and its quantitative role in understanding pointwise almost everywhere convergence phenomena for polynomial ergodic averaging operators. Specifically, we will use the circle method…
An arc in $\mathbb F_q^2$ is a set $P \subset \mathbb F_q^2$ such that no three points of $P$ are collinear. We use the method of hypergraph containers to prove several counting results for arcs. Let $\mathcal A(q)$ denote the family of all…
Recently, Alp\"oge-Bhargava-Shnidman determined the average size of the $2$-Selmer group in the cubic twist family of any elliptic curve over $\mathbb{Q}$ with $j$-invariant $0$. We obtain the distribution of the $3$-Selmer groups in the…
We review some aspects of the use of a technique known as group averaging, which provides a tool for the study of constrained systems. We focus our attention on the case where the gauge group is non-compact, and a `renormalized' group…
In a previous paper [11] we introduced a weighted binary average of two 2D point-normal pairs, termed circle average, and investigated subdivision schemes based on it. These schemes refine point-normal pairs in 2D, and converge to limit…
Let K be a multiquadratic number field. We investigate the average dimension of 2-Selmer groups over K for the family of all elliptic curves over the rational numbers (ordered by height). We give upper and lower bounds for this average. In…
One of the main open problems in the qualitative theory of real planar differential systems is the study of limit cycles. In this article, we present an algorithmic approach for detecting how many limit cycles can bifurcate from the…
The methods of obtaining the average spectral shape in a low statistics regime are presented. Different approaches to averaging are extensively tested with simulated spectra, based on the ASCA responses. The issue of binning up the spectrum…
The technique known as group averaging provides powerful machinery for the study of constrained systems. However, it is likely to be well defined only in a limited set of cases. Here, we investigate the possibility of using a `renormalized'…
We use the circle method to count $\mathbb{F}_q(t)$-rational points of bounded naive height on a quadric hypersurface $X\subseteq \mathbb{P}^{n-1}$ defined over $\mathbb{F}_q$, provided that $\mathrm{char}(\mathbb{F}_q)>2$ and $n\ge 3$.…
We present a method of computing elements of spin groups in the case of arbitrary dimension. This method generalizes Hestenes method for the case of dimension 4. We use the method of averaging in Clifford's geometric algebra previously…
The complex Langevin method, a numerical method used to compute the ensemble average with a complex partition function, often suffers from runaway instability. We study the regularization of the complex Langevin method via augmenting the…