An official website of the United States government
Abstract We provide necessary and sufficient conditions for joint ergodicity results for systems of commuting measure preserving transformations for an iterated Hardy field function of polynomial growth. Our method builds on and improves recent techniques due to Frantzikinakis and Tsinas, who dealt with multiple ergodic averages along Hardy field functions; it also enhances an approach introduced by the authors and Ferré Moragues to study polynomial iterates. The more general expression, in which the iterate is a linear combination of a Hardy field function of polynomial growth and a tempered function, is studied as well.
more »
« less
Equidistribution of polynomial sequences in function fields, with applications
We prove a function field analog of Weyl's classical theorem on equidistribution of polynomial sequences. Our result covers the case in which the degree of the polynomial is greater than or equal to the characteristic of the field, which is a natural barrier when applying the Weyl differencing process to function fields. We also discuss applications to van der Corput, intersective and Glasner sets in function fields.
more »
« less
- PAR ID:
- 10638870
- Publisher / Repository:
- Elsevier
- Date Published:
- Journal Name:
- Advances in mathematics
- Volume:
- 479
- Issue:
- article no. 110424
- ISSN:
- 1090-2082
- Page Range / eLocation ID:
- 44pp
- Subject(s) / Keyword(s):
- Equidistribution function fields intersective sets van der Corput sets Glasner sets
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
null (Ed.)Multiplicity code decoders are based on Hermite polynomial interpolation with error correction. In order to have a unique Hermite interpolant one assumes that the field of scalars has characteristic 0 or >= k+1, where k is the maximum order of the derivatives in the list of values of the polynomial and its derivatives which are interpolated. For scalar fields of characteristic k+1, the minimum number of values for interpolating a polynomial of degree <= D is D+1+2E(k+1) when <= E of the values are erroneous. Here we give an error-correcting Hermite interpolation algorithm that can tolerate more errors, assuming that the characteristic of the scalar field is either 0 or >= D+1. Our algorithm requires (k+1)D + 1 - (k+1)k/2 + 2E values. As an example, we consider k = 2. If the error ratio (number of errors)/(number of evaluations) <= 0.16, our new algorithm requires ceiling( (4+7/17) D - (1+8 /17) ) values, while multiplicity decoding requires 25D+25 values. If the error ratio is <= 0.2, our algorithm requires 5D-2 evaluations over characteristic 0 or >= D+1, while multiplicity decoding for an error ratio 0.2 over fields of characteristic 3 is not possible for D >= 3. Our algorithm is based on Reed-Solomon interpolation without multiplicities, which becomes possible for Hermite interpolation because of the high redundancy necessary for error-correction.more » « less
-
null (Ed.)This work serves as a bridge between two approaches to analysis of dynamical systems: the local, geometric analysis, and the global operator theoretic Koopman analysis. We explicitly construct vector fields where the instantaneous Lyapunov exponent field is a Koopman eigenfunction. Restricting ourselves to polynomial vector fields to make this construction easier, we find that such vector fields do exist, and we explore whether such vector fields have a special structure, thus making a link between the geometric theory and the transfer operator theory.more » « less
-
Real-time coupled cluster (CC) methods have several advantages over their frequency-domain counterparts, namely, response and equation of motion CC theories. Broadband spectra, strong fields, and pulse manipulation allow for the simulation of complex spectroscopies that are unreachable using frequency-domain approaches. Due to the high-order polynomial scaling, the required numerical time propagation of the CC residual expressions is a computationally demanding process. This scaling may be reduced by local correlation schemes, which aim to reduce the size of the (virtual) orbital space by truncation according to user-defined parameters. We present the first application of local correlation to real-time CC. As in previous studies of locally correlated frequency-domain CC, traditional local correlation schemes are of limited utility for field-dependent properties; however, a perturbation-aware scheme proves promising. A detailed analysis of the amplitude dynamics suggests that the main challenge is a strong time dependence of the wave function sparsity.more » « less
-
null (Ed.)A collection of sets displays a proximity gap with respect to some property if for every set in the collection, either (i) all members are δ-close to the property in relative Hamming distance or (ii) only a tiny fraction of members are δ-close to the property. In particular, no set in the collection has roughly half of its members δ-close to the property and the others δ-far from it. We show that the collection of affine spaces displays a proximity gap with respect to Reed-Solomon (RS) codes, even over small fields, of size polynomial in the dimension of the code, and the gap applies to any δ smaller than the Johnson/Guruswami-Sudan list-decoding bound of the RS code. We also show near-optimal gap results, over fields of (at least) linear size in the RS code dimension, for δ smaller than the unique decoding radius. Concretely, if δ is smaller than half the minimal distance of an RS code V ⊂ Fq n , every affine space is either entirely δ-close to the code, or alternatively at most an ( n/q)-fraction of it is δ-close to the code. Finally, we discuss several applications of our proximity gap results to distributed storage, multi-party cryptographic protocols, and concretely efficient proof systems. We prove the proximity gap results by analyzing the execution of classical algebraic decoding algorithms for Reed-Solomon codes (due to Berlekamp-Welch and Guruswami-Sudan) on a formal element of an affine space. This involves working with Reed-Solomon codes whose base field is an (infinite) rational function field. Our proofs are obtained by developing an extension (to function fields) of a strategy of Arora and Sudan for analyzing low-degree tests.more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript
- Journal Article:
- The DOI is not currently available.
