Related papers: Estimates for the Bergman Kernel and the Multidime…
By relating the number of images of a function with finite domain to a certain parameter, we obtain both an upper and lower bound for the image set. Even though the arguments are elementary, the bounds are, in some sense, best possible. The…
In this paper, we present an explicit description for the boundary behavior of the Bergman kernel function, the Bergman metric, and the associated curvatures along certain sequences converging to an $h$-extendible boundary point.
We prove finite-sample concentration and anti-concentration bounds for dimension estimation using Gaussian kernel sums. Our bounds provide explicit dependence on sample size, bandwidth, and local geometric and distributional parameters,…
The Polynomial Freiman-Ruzsa conjecture is one of the central open problems in additive combinatorics. If true, it would give tight quantitative bounds relating combinatorial and algebraic notions of approximate subgroups. In this note, we…
We prove an almost constant lower bound of the isoperimetric coefficient in the KLS conjecture. The lower bound has the dimension dependency $d^{-o_d(1)}$. When the dimension is large enough, our lower bound is tighter than the previous…
We give a proof of the Greene-Krantz conjecture on convex domains in $\CC^2$. Curiously, the proof technique depends on subelliptic estimates for the $\bar{\partial}$ problem.
We~identify the standard weighted Bergman kernels of spaces of nearly holomorphic functions, in~the sense of Shimura, on~bounded symmetric domains. This also yields a description of the analogous kernels for spaces of…
We develop the theory for the Bergman spaces of generalized $L_p$-solutions of the bicomplex-Vekua equation $\overline{\boldsymbol{\partial}}W=aW+b\overline{W}$ on bounded domains, where the coefficients $a$ and $b$ are bounded…
We present a method of obtaining a lower bound estimate of the curvatures of the Bergman metric without using the regularity of the kernel function on the boundary. As an application, we prove the existence of an uniform lower bound of the…
The Multiplicity Conjecture (MC) of Huneke and Srinivasan provides upper and lower bounds for the multiplicity of a Cohen-Macaulay algebra $A$ in terms of the shifts appearing in the modules of the minimal free resolution (MFR) of $A$. All…
We establish the second part of Milnor's conjecture on the volume of simplexes in hyperbolic and spherical spaces. A characterization of the closure of the space of the angle Gram matrices of simplexes is also obtained.
We introduce tree dimension and its leveled variant in order to measure the complexity of leaf sets in binary trees. We then provide a tight upper bound on the size of such sets using leveled tree dimension. This, in turn, implies both the…
In this paper we prove that the Watanabe-Yoshida conjecture holds up to dimension $7$. Our primary new tool is a function, $\varphi_J\left(R; z^t\right),$ that interpolates between the Hilbert-Kunz multiplicities of a base ring, $R$, and…
We bound the supnorm of half-integral weight Hecke eigenforms in the Kohnen plus space of level $4$ in the weight aspect, by combining bounds obtained from the Fourier expansion with the amplification method using a Bergman kernel.
We construct Green's functions for elliptic operators of the form $\mathcal{L}u=-\text{div}(A\nabla u+bu)+c\nabla u+du$ in domains $\Omega\subseteq\mathbb R^n$, under the assumption $d\geq\text{div}b$, or $d\geq\text{div}c$. We show that,…
This paper discuss an intrinsic relation among congruent relations \cite{CLPZ}, cyclotomic expansion and Volume Conjecture for $SU(n)$ invariants. Motivated by the congruent relations for $SU(n)$ invariants obtained in our previous work…
We prove a query complexity variant of the weak polynomial Freiman-Ruzsa conjecture in the following form. For any $\epsilon > 0$, a set $A \subset \mathbb{Z}^d$ with doubling $K$ has a subset of size at least $K^{-\frac{4}{\epsilon}}|A|$…
Our main result marks progress on an old conjecture of Vitushkin. We show that a compact set in the plane with plenty of big projections (PBP) has positive analytic capacity, along with a quantitative lower bound. A higher dimensional…
We use convex geometry tools, in particular John ellipsoids, to obtain a size estimate for the Szeg\H{o} kernel on the boundary of a class of unbounded convex domains in $\mathbb{C}^n.$ Given a polynomial $b:\mathbb{R}^n \rightarrow…
A two-dimensional Besicovitch set over a finite field is a subset of the finite plane containing a line in each direction. In this paper, we conjecture a sharp lower bound for the size of such a subset and prove some results toward this…