12,567 reputation
34467
bio website
location
age
visits member for 1 year, 2 months
seen 27 secs ago

Oct
14
reviewed Close Proving that Riesz map is bijection
Oct
14
reviewed Close Could it be possible to use Selberg trace formula to prove that the irreducible characters of representation form an orthonormal basis?
Oct
14
reviewed Close Squares sum problem
Oct
11
reviewed Leave Closed The periodic architecture underlying the natural numbers
Oct
11
awarded  Electorate
Oct
10
comment The periodic architecture underlying the natural numbers
I'm voting to close since I don't see a real question here.
Oct
8
reviewed No Action Needed Multivariate polynomial interpolations
Oct
8
reviewed Close Convert linear programming problem into its standard form
Oct
8
reviewed Close Is there an efficient algorithm for sampling from the negative hypergeometric distribution?
Oct
7
reviewed Leave Closed investigating positivity/negativity of a function
Oct
6
reviewed No Action Needed Restricting the Steinberg representation of $SL_{2n}$ over a finite field to the symplectic group
Oct
6
reviewed No Action Needed Iwasawa's mu-invariant for noncyclotomic $\mathbf{Z}_p$ extensions of cyclotomic fields?
Oct
5
comment Why do roots of polynomials tend to have absolute value close to 1?
The pdf of the Science Direct article is in fact free at the link that you gave. Articles in many Springer & Elsevier journals are freely available four years after publication (and the same holds for all AMS journals).
Oct
5
reviewed Close A question about some notation involving the exclamation mark
Oct
5
reviewed Close What are the most fundamental classes of mathematical algorithms?
Oct
2
reviewed Leave Closed The relation between Gromov hausdorff convergence and inverse limit of compact metric spaces
Oct
2
reviewed Leave Closed On the reductive group
Sep
30
awarded  Explainer
Sep
19
comment Number of solutions in a sum of squares Diophantine equation
For fixed $p\ge 3$ the answer is correct and the bound is tight, as you note. But for $p=2$ you need an extra $\log n$ factor.
Sep
19
comment Inequality due to Siegel (assumptions) and upper bounds on number field discriminants
The inequality in (*) should give a lower bound for $d$ rather than an upper bound. It looks like you're interested in lower bounds for discriminants. Look up Odlyzko's survey article on this (available from his website).