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
Learning particle swarming models from data with Gaussian processes
Interacting particle or agent systems that exhibit diverse swarming behaviors are prevalent in science and engineering. Developing effective differential equation models to understand the connection between individual interaction rules and swarming is a fundamental and challenging goal. In this paper, we study the data-driven discovery of a second-order particle swarming model that describes the evolution of particles in under radial interactions. We propose a learning approach that models the latent radial interaction function as Gaussian processes, which can simultaneously fulfill two inference goals: one is the nonparametric inference of the interaction function with pointwise uncertainty quantification, and the other is the inference of unknown scalar parameters in the noncollective friction forces of the system. We formulate the learning problem as a statistical inverse learning problem and introduce an operator-theoretic framework that provides a detailed analysis of recoverability conditions, establishing that a coercivity condition is sufficient for recoverability. Given data collected from i.i.d trajectories with independent Gaussian observational noise, we provide a finite-sample analysis, showing that our posterior mean estimator converges in a Reproducing Kernel Hilbert Space norm, at an optimal rate in equal to the one in the classical 1-dimensional Kernel Ridge regression. As a byproduct, we show we can obtain a parametric learning rate in for the posterior marginal variance using norm and that the rate could also involve and (the number of observation time instances for each trajectory) depending on the condition number of the inverse problem. We provide numerical results on systems exhibiting different swarming behaviors, highlighting the effectiveness of our approach in the scarce, noisy trajectory data regime.
more »
« less
- PAR ID:
- 10625969
- Publisher / Repository:
- AMS
- Date Published:
- Journal Name:
- Mathematics of Computation
- Volume:
- 93
- Issue:
- 349
- ISSN:
- 0025-5718
- Page Range / eLocation ID:
- 2391 to 2437
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
A subset of integers is a set of Bohr recurrence if every rotation on returns arbitrarily close to zero under some non-zero multiple of . We show that the set is a set of Bohr recurrence. This is a particular case of a more general statement about images of such sets under any integer polynomial with zero constant term. We also show that if is a real polynomial with at least one non-constant irrational coefficient, then the set is dense in , thus providing a joint generalization of two well-known results, one of Furstenberg and one of Weyl.more » « less
-
Let be a bounded -Reifenberg flat domain, with small enough, possibly with locally infinite surface measure. Assume also that is an NTA (non-tangentially accessible) domain as well and denote by and the respective harmonic measures of and with poles . In this paper we show that the condition that is equivalent to being a chord-arc domain with inner unit normal belonging to .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
An official website of the United States government

