comment
Lotteries, Turan's problem, and minimization of risk
Part of it maybe the 5s and 6s effect. In that random sample, the max is 222, in there are 9 fives and 1 six, giving an "extra" four count of 36+14 above independence. The import of duplicates in the 138180 is similar, as a twofer guarantees an extra 28 non-independent for some lottery occurrence. Triplicates are likely too (80% chance).
revised
Lotteries, Turan's problem, and minimization of risk
deleted 310 characters in body; added 9 characters in body
Loading…
revised
Lotteries, Turan's problem, and minimization of risk
added 64 characters in body; deleted 392 characters in body; added 273 characters in body
Loading…
revised
Lotteries, Turan's problem, and minimization of risk
added 281 characters in body
Loading…
revised
Lotteries, Turan's problem, and minimization of risk
added 493 characters in body
Loading…
revised
Lotteries, Turan's problem, and minimization of risk
added 1539 characters in body
Loading…
revised
Lotteries, Turan's problem, and minimization of risk
deleted 190 characters in body
Loading…
Loading…
comment
What are the limits of the Erdős-Rankin method for covering intervals by arithmetic progressions?
Maier-Pomerance indicate that they expect $z(\log z)^2$ as the limit (see 1.5), if one knew prime $k$-tuples. They basically use an on-average version of that (in AP), in the paper improving the constant. Thus for large primes, they can't show that any of them individually sieves out more than 1 number, but on average they can show at least 1.31, and Pintz 2. When knowing prime $k$-tuples, at least with uniformity enough, the large primes would then be shown to be more optimal, in sieving out.
comment
Axiomatizing Gross-Zagier formulae
My recollection is that if you take level 122, nontrivial real character, weight 2 newform over $Q(i)$ -- then $L(f,1)=0$ but the sign is merely some random number on the unit circle. It is an example to investigate. I don't know whether $L'(f,1)$ is meaningful. Usually I expect, as per David Loeffler that the 0th derivative is nonvanishing. What does this mean in the Heegner construction context?
awarded
awarded
comment
CM abelian variety from an algebraic Hecke character?
See Schappacher's book, Periods of Hecke characters (chapter un on Motives). dx.doi.org/10.1007/BFb0082094 See also the thread mathoverflow.net/questions/33269/fontaine-mazur-for-gl-1
comment
any software to compute multivariable resultant?
Fermat should do this home.bway.net/lewis And I think Magma can too, via either eliminating variables sequentially, or possibly with EliminationIdeal. They have an online calculator, if the problem is not too bulky.
comment
'Reference' request: Program to work with cyclic quotient singularities.
Magma does too much more and different than you want. The $a_i$ shall come from the global desingularization. Then the HomAdjoints will give canonical sheaf sections. If you work just at one alone singularity, you might need to rip open the Magma code to see how they do it. The main file is package/Geometry/SrfHyp/surface_resolution.m
awarded
revised
Loading…
awarded
comment
What is the name for a finite-group representation that is the sum of all the irreducibles (once)?
You might mean a Gelfand model. See Garge and Oesterle, and references degruyter.com/view/j/jgth.2010.13.issue-3/jgt.2009.060/…
comment
Smart elliptic curve rational point search given Reg*#Sha
"To make thing fast, they use overcongergent modular symbols to compute it. " I guess it takes time $N^2$ or $N^3$ in the level. They work with twists, to soften this. The classical method can emulate the same idea for twists, as with Elkies (1994), and a paper of Delaunay and Roblot. jtnb.cedram.org/item?id=JTNB_2008__20_3_601_0