We prove that the Hilbert scheme of
Harmonic Hilbert spaces on locally compact abelian groups are reproducing kernel Hilbert spaces (RKHSs) of continuous functions constructed by Fourier transform of weighted
- NSF-PAR ID:
- 10471228
- Publisher / Repository:
- Springer
- Date Published:
- Journal Name:
- Journal of Fourier Analysis and Applications
- Volume:
- 29
- Issue:
- 1
- ISSN:
- 1069-5869
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
Abstract k points on ($${\mathbb {C}}^2$$ ) is self-dual under three-dimensional mirror symmetry using methods of geometry and integrability. Namely, we demonstrate that the corresponding quantum equivariant K-theory is invariant upon interchanging its Kähler and equivariant parameters as well as inverting the weight of the$$\hbox {Hilb}^k[{\mathbb {C}}^2]$$ -action. First, we find a two-parameter family$${\mathbb {C}}^\times _\hbar $$ of self-mirror quiver varieties of type A and study their quantum K-theory algebras. The desired quantum K-theory of$$X_{k,l}$$ is obtained via direct limit$$\hbox {Hilb}^k[{\mathbb {C}}^2]$$ and by imposing certain periodic boundary conditions on the quiver data. Throughout the proof, we employ the quantum/classical (q-Langlands) correspondence between XXZ Bethe Ansatz equations and spaces of twisted$$l\longrightarrow \infty $$ -opers. In the end, we propose the 3d mirror dual for the moduli spaces of torsion-free rank-$$\hbar $$ N sheaves on with the help of a different (three-parametric) family of type A quiver varieties with known mirror dual.$${\mathbb {P}}^2$$ -
Abstract We construct an example of a group
for a finite abelian group$$G = \mathbb {Z}^2 \times G_0$$ , a subset$$G_0$$ E of , and two finite subsets$$G_0$$ of$$F_1,F_2$$ G , such that it is undecidable in ZFC whether can be tiled by translations of$$\mathbb {Z}^2\times E$$ . In particular, this implies that this tiling problem is$$F_1,F_2$$ aperiodic , in the sense that (in the standard universe of ZFC) there exist translational tilings ofE by the tiles , but no periodic tilings. Previously, such aperiodic or undecidable translational tilings were only constructed for sets of eleven or more tiles (mostly in$$F_1,F_2$$ ). A similar construction also applies for$$\mathbb {Z}^2$$ for sufficiently large$$G=\mathbb {Z}^d$$ d . If one allows the group to be non-abelian, a variant of the construction produces an undecidable translational tiling with only one tile$$G_0$$ F . The argument proceeds by first observing that a single tiling equation is able to encode an arbitrary system of tiling equations, which in turn can encode an arbitrary system of certain functional equations once one has two or more tiles. In particular, one can use two tiles to encode tiling problems for an arbitrary number of tiles. -
Abstract In this paper, we study multistage stochastic mixed-integer nonlinear programs (MS-MINLP). This general class of problems encompasses, as important special cases, multistage stochastic convex optimization with
non-Lipschitzian value functions and multistage stochastic mixed-integer linear optimization. We develop stochastic dual dynamic programming (SDDP) type algorithms with nested decomposition, deterministic sampling, and stochastic sampling. The key ingredient is a new type of cuts based on generalized conjugacy. Several interesting classes of MS-MINLP are identified, where the new algorithms are guaranteed to obtain the global optimum without the assumption of complete recourse. This significantly generalizes the classic SDDP algorithms. We also characterize the iteration complexity of the proposed algorithms. In particular, for a -stage stochastic MINLP satisfying$$(T+1)$$ L -exact Lipschitz regularization withd -dimensional state spaces, to obtain an -optimal root node solution, we prove that the number of iterations of the proposed deterministic sampling algorithm is upper bounded by$$\varepsilon $$ , and is lower bounded by$${\mathcal {O}}((\frac{2LT}{\varepsilon })^d)$$ for the general case or by$${\mathcal {O}}((\frac{LT}{4\varepsilon })^d)$$ for the convex case. This shows that the obtained complexity bounds are rather sharp. It also reveals that the iteration complexity depends$${\mathcal {O}}((\frac{LT}{8\varepsilon })^{d/2-1})$$ polynomially on the number of stages. We further show that the iteration complexity dependslinearly onT , if all the state spaces are finite sets, or if we seek a -optimal solution when the state spaces are infinite sets, i.e. allowing the optimality gap to scale with$$(T\varepsilon )$$ T . To the best of our knowledge, this is the first work that reports global optimization algorithms as well as iteration complexity results for solving such a large class of multistage stochastic programs. The iteration complexity study resolves a conjecture by the late Prof. Shabbir Ahmed in the general setting of multistage stochastic mixed-integer optimization. -
Abstract It has been recently established in David and Mayboroda (Approximation of green functions and domains with uniformly rectifiable boundaries of all dimensions.
arXiv:2010.09793 ) that on uniformly rectifiable sets the Green function is almost affine in the weak sense, and moreover, in some scenarios such Green function estimates are equivalent to the uniform rectifiability of a set. The present paper tackles a strong analogue of these results, starting with the “flagship degenerate operators on sets with lower dimensional boundaries. We consider the elliptic operators associated to a domain$$L_{\beta ,\gamma } =- {\text {div}}D^{d+1+\gamma -n} \nabla $$ with a uniformly rectifiable boundary$$\Omega \subset {\mathbb {R}}^n$$ of dimension$$\Gamma $$ , the now usual distance to the boundary$$d < n-1$$ given by$$D = D_\beta $$ for$$D_\beta (X)^{-\beta } = \int _{\Gamma } |X-y|^{-d-\beta } d\sigma (y)$$ , where$$X \in \Omega $$ and$$\beta >0$$ . In this paper we show that the Green function$$\gamma \in (-1,1)$$ G for , with pole at infinity, is well approximated by multiples of$$L_{\beta ,\gamma }$$ , in the sense that the function$$D^{1-\gamma }$$ satisfies a Carleson measure estimate on$$\big | D\nabla \big (\ln \big ( \frac{G}{D^{1-\gamma }} \big )\big )\big |^2$$ . We underline that the strong and the weak results are different in nature and, of course, at the level of the proofs: the latter extensively used compactness arguments, while the present paper relies on some intricate integration by parts and the properties of the “magical distance function from David et al. (Duke Math J, to appear).$$\Omega $$ -
Abstract The radiation of steady surface gravity waves by a uniform stream
over locally confined (width$$U_{0}$$ ) smooth topography is analyzed based on potential flow theory. The linear solution to this classical problem is readily found by Fourier transforms, and the nonlinear response has been studied extensively by numerical methods. Here, an asymptotic analysis is made for subcritical flow$$L$$ in the low-Froude-number ($$D/\lambda > 1$$ ) limit, where$$F^{2} \equiv \lambda /L \ll 1$$ is the lengthscale of radiating gravity waves and$$\lambda = U_{0}^{2} /g$$ is the uniform water depth. In this regime, the downstream wave amplitude, although formally exponentially small with respect to$$D$$ , is determined by a fully nonlinear mechanism even for small topography amplitude. It is argued that this mechanism controls the wave response for a broad range of flow conditions, in contrast to linear theory which has very limited validity.$$F$$