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 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 We report on a measurement of Spin Density Matrix Elements (SDMEs) in hard exclusive
meson muoproduction at COMPASS using 160 GeV/$$\rho ^0$$ c polarised and$$ \mu ^{+}$$ beams impinging on a liquid hydrogen target. The measurement covers the kinematic range 5.0 GeV/$$ \mu ^{-}$$ $$c^2$$ 17.0 GeV/$$< W<$$ , 1.0 (GeV/$$c^2$$ c )$$^2$$ 10.0 (GeV/$$< Q^2<$$ c ) and 0.01 (GeV/$$^2$$ c )$$^2$$ 0.5 (GeV/$$< p_{\textrm{T}}^2<$$ c ) . Here,$$^2$$ W denotes the mass of the final hadronic system, the virtuality of the exchanged photon, and$$Q^2$$ the transverse momentum of the$$p_{\textrm{T}}$$ meson with respect to the virtual-photon direction. The measured non-zero SDMEs for the transitions of transversely polarised virtual photons to longitudinally polarised vector mesons ($$\rho ^0$$ ) indicate a violation of$$\gamma ^*_T \rightarrow V^{ }_L$$ s -channel helicity conservation. Additionally, we observe a dominant contribution of natural-parity-exchange transitions and a very small contribution of unnatural-parity-exchange transitions, which is compatible with zero within experimental uncertainties. The results provide important input for modelling Generalised Parton Distributions (GPDs). In particular, they may allow one to evaluate in a model-dependent way the role of parton helicity-flip GPDs in exclusive production.$$\rho ^0$$ -
Abstract Rooted binary
galled trees generalize rooted binary trees to allow a restricted class of cycles, known asgalls . We build upon the Wedderburn-Etherington enumeration of rooted binary unlabeled trees withn leaves to enumerate rooted binary unlabeled galled trees withn leaves, also enumerating rooted binary unlabeled galled trees withn leaves andg galls, . The enumerations rely on a recursive decomposition that considers subtrees descended from the nodes of a gall, adopting a restriction on galls that amounts to considering only the rooted binary$$0 \leqslant g \leqslant \lfloor \frac{n-1}{2} \rfloor $$ normal unlabeled galled trees in our enumeration. We write an implicit expression for the generating function encoding the numbers of trees for alln . We show that the number of rooted binary unlabeled galled trees grows with , exceeding the growth$$0.0779(4.8230^n)n^{-\frac{3}{2}}$$ of the number of rooted binary unlabeled trees without galls. However, the growth of the number of galled trees with only one gall has the same exponential order 2.4833 as the number with no galls, exceeding it only in the subexponential term,$$0.3188(2.4833^n)n^{-\frac{3}{2}}$$ compared to$$0.3910n^{\frac{1}{2}}$$ . For a fixed number of leaves$$0.3188n^{-\frac{3}{2}}$$ n , the number of gallsg that produces the largest number of rooted binary unlabeled galled trees lies intermediate between the minimum of and the maximum of$$g=0$$ . We discuss implications in mathematical phylogenetics.$$g=\lfloor \frac{n-1}{2} \rfloor $$