In this note, we obtain a Gaussian concentration inequality for a class of non-Lipschitz functions. In the one-dimensional case, our results supplement those established by Paouris and Valettas [Ann. Probab. 46 (2018), pp. 1441–1454].
In this note, we obtain a Gaussian concentration inequality for a class of non-Lipschitz functions. In the one-dimensional case, our results supplement those established by Paouris and Valettas [Ann. Probab. 46 (2018), pp. 1441–1454].
We study general elliptic equations with singular/degenerate matrix weights and measurable nonlinearities on nonsmooth bounded domains to obtain a global Calderón-Zygmund type estimate under possibly minimal assumptions that the logarithm of the matrix weight has a small bounded mean oscillation (BMO) norm, the nonlinearity is allowed to be merely measurable in one variable but has a small BMO norm in the other variables and that the boundary of the domain is sufficiently flat in Reifenberg sense.
The Petrie conjecture asserts that if a homotopy
Consider a unimodular random graph, or just a finitely generated Cayley graph. When does its cycle space have an invariant random generating set of cycles such that every edge is contained in finitely many of the cycles? Generating the free Loop
We prove that minimizers of the
In this work we examine the existence of positive classical solutions of
We consider word complexity and topological entropy for random substitution subshifts. In contrast to previous work, we do not assume that the underlying random substitution is compatible. We show that the subshift of a primitive random substitution has zero topological entropy if and only if it can be obtained as the subshift of a deterministic substitution, answering in the affirmative an open question of Rust and Spindeler [Indag. Math. (N.S.) 29 (2018), pp. 1131–1155]. For constant length primitive random substitutions, we develop a systematic approach to calculating the topological entropy of the associated subshift. Further, we prove lower and upper bounds that hold even without primitivity. For subshifts of non-primitive random substitutions, we show that the complexity function can exhibit features not possible in the deterministic or primitive random setting, such as intermediate growth, and provide a partial classification of the permissible complexity functions for subshifts of constant length random substitutions.
In this note, we relate the basepoint-freeness threshold of a polarized abelian variety, introduced by Jiang and Pareschi, with
Consider a symmetric space
In this note, we provide an adaptation of the Kohler-Jobin rearrangement technique to the setting of the Gauss space. As a result, we prove the Gaussian analogue of the Kohler-Jobin resolution of a conjecture of Pólya-Szegö: when the Gaussian torsional rigidity of a domain is fixed, the Gaussian principal frequency is minimized for the half-space. At the core of this rearrangement technique is the idea of considering a “modified” torsional rigidity, with respect to a given function, and rearranging its layers to half-spaces, in a particular way; the Rayleigh quotient decreases with this procedure.
We emphasize that the analogy of the Gaussian case with the Lebesgue case is not to be expected here, as in addition to some soft symmetrization ideas, the argument relies on the properties of some special functions; the fact that this analogy does hold is somewhat of a miracle.
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：