We formulate and prove a Conner–Floyd isomorphism for the algebraic K-theory of arbitrary qcqs derived schemes. To that end, we study a stable -category of non- -invariant motivic spectra, which turns out to be equivalent to the -category of fundamental motivic spectra satisfying elementary blowup excision, previously introduced by the first and third authors. We prove that this -category satisfies -homotopy invariance and weighted -homotopy invariance, which we use in place of -homotopy invariance to obtain analogues of several key results from -homotopy theory. These allow us in particular to define a universal oriented motivic -ring spectrum . We then prove that the algebraic K-theory of a qcqs derived scheme can be recovered from its -cohomology via a Conner–Floyd isomorphism\[ \]where is the Lazard ring and . Finally, we prove a Snaith theorem for the periodized version of . 
                        more » 
                        « less   
                    
                            
                            Super-polynomial accuracy of one dimensional randomized nets using the median of means
                        
                    
    
            Let be analytic on with for some constants and and all . We show that the median estimate of under random linear scrambling with points converges at the rate for any . We also get a super-polynomial convergence rate for the sample median of random linearly scrambled estimates, when is bounded away from zero. When has a ’th derivative that satisfies a -Hölder condition then the median of means has error for any , if as . The proof techniques use methods from analytic combinatorics that have not previously been applied to quasi-Monte Carlo methods, most notably an asymptotic expression from Hardy and Ramanujan on the number of partitions of a natural number. 
        more » 
        « less   
        
    
                            - Award ID(s):
- 2152780
- PAR ID:
- 10513780
- Publisher / Repository:
- American Mathematical Society
- Date Published:
- Journal Name:
- Mathematics of Computation
- Volume:
- 92
- Issue:
- 340
- ISSN:
- 0025-5718
- Page Range / eLocation ID:
- 805 to 837
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
- 
            
- 
            We formulate a plausible conjecture for the optimal Ehrhard-type inequality for convex symmetric sets with respect to the Gaussian measure. Namely, letting and , we conjecture that the function , given by (with an appropriate choice of a decomposition and coefficients ) satisfies, for all symmetric convex sets and , and any , We explain that this conjecture is “the most optimistic possible”, and is equivalent to the fact that for any symmetric convex set , itsGaussian concavity power is greater than or equal to , for some . We call the sets round -cylinders; they also appear as the conjectured Gaussian isoperimetric minimizers for symmetric sets, see Heilman [Amer. J. Math. 143 (2021), pp. 53–94]. In this manuscript, we make progress towards this question, and show that for any symmetric convex set in , where is the torsional rigidity of with respect to the Gaussian measure.Moreover, the equality holds if and only if for some and .As a consequence, we get where is a certain rational function of degree , the expectation is taken with respect to the restriction of the Gaussian measure onto , is the Minkowski functional of , and is the in-radius of . The result follows via a combination of some novel estimates, the method (previously studied by several authors, notably Kolesnikov and Milman [J. Geom. Anal. 27 (2017), pp. 1680–1702; Amer. J. Math. 140 (2018), pp. 1147–1185;Geometric aspects of functional analysis, Springer, Cham, 2017; Mem. Amer. Math. Soc. 277 (2022), v+78 pp.], Kolesnikov and the author [Adv. Math. 384 (2021), 23 pp.], Hosle, Kolesnikov, and the author [J. Geom. Anal. 31 (2021), pp. 5799–5836], Colesanti [Commun. Contemp. Math. 10 (2008), pp. 765–772], Colesanti, the author, and Marsiglietti [J. Funct. Anal. 273 (2017), pp. 1120–1139], Eskenazis and Moschidis [J. Funct. Anal. 280 (2021), 19 pp.]), and the analysis of the Gaussian torsional rigidity. As an auxiliary result on the way to the equality case characterization, we characterize the equality cases in the “convex set version” of the Brascamp-Lieb inequality, and moreover, obtain a quantitative stability version in the case of the standard Gaussian measure; this may be of independent interest. All the equality case characterizations rely on the careful analysis of the smooth case, the stability versions via trace theory, and local approximation arguments. In addition, we provide a non-sharp estimate for a function whose composition with is concave in the Minkowski sense for all symmetric convex sets.more » « less
- 
            We show that for primes with , the class number of is divisible by . Our methods are via congruences between Eisenstein series and cusp forms. In particular, we show that when , there is always a cusp form of weight and level whose th Fourier coefficient is congruent to modulo a prime above , for all primes . We use the Galois representation of such a cusp form to explicitly construct an unramified degree- extension of .more » « less
- 
            We prove and extend the longest-standing conjecture in ‘ -Catalan combinatorics,’ namely, the combinatorial formula for conjectured by Loehr and Warrington, where is a Schur function and is an eigenoperator on Macdonald polynomials. Our approach is to establish a stronger identity of infinite series of characters involvingSchur Catalanimals; these were recently shown by the authors to represent Schur functions in subalgebras isomorphic to the algebra of symmetric functions over , where is the elliptic Hall algebra of Burban and Schiffmann. We establish a combinatorial formula for Schur Catalanimals as weighted sums of LLT polynomials, with terms indexed by configurations of nested lattice paths callednests, having endpoints and bounding constraints controlled by data called aden. The special case for proves the Loehr-Warrington conjecture, giving as a weighted sum of LLT polynomials indexed by systems of nested Dyck paths. In general, for our formula implies a new version of the Loehr-Warrington conjecture. In the case where each nest consists of a single lattice path, the nests in a den formula reduce to our previous shuffle theorem for paths under any line. Both this and the Loehr-Warrington formula generalize the shuffle theorem proven by Carlsson and Mellit (for ) and Mellit. Our formula here unifies these two generalizations.more » « less
- 
            We show that for any even log-concave probability measure on , any pair of symmetric convex sets and , and any , where . This constitutes progress towards the dimensional Brunn-Minkowski conjecture (see Richard J. Gardner and Artem Zvavitch [Tran. Amer. Math. Soc. 362 (2010), pp. 5333–5353]; Andrea Colesanti, Galyna V. Livshyts, Arnaud Marsiglietti [J. Funct. Anal. 273 (2017), pp. 1120–1139]). Moreover, our bound improves for various special classes of log-concave measures.more » « less
 An official website of the United States government
An official website of the United States government 
				
			 
					 
					
 
                                    