相关论文: Decreasing equisingular approximations with analyt…
A formula for the irregularity of abelian coverings of the projective plane is established and some applications are presented.
The purpose of this short article is to prove some potential estimates that naturally arise in the study of subelliptic Sobolev inequalites for functions. This will allow us to prove a local subelliptic Sobolev inequality with the optimal…
We pose the approximation problem for scalar nonnegative input-output systems via impulse response convolutions of finite order, i.e. finite order moving averages, based on repeated observations of input/output signal pairs. The problem is…
Weighted least squares polynomial approximation uses random samples to determine projections of functions onto spaces of polynomials. It has been shown that, using an optimal distribution of sample locations, the number of samples required…
This paper is concerned with existence and qualitative properties of positive solutions of semilinear elliptic equations in bounded domains with Dirichlet boundary conditions. We show the existence of positive solutions in the vicinity of…
We derive sufficient conditions for sampling with derivatives in shift-invariant spaces generated by a periodic exponential B-spline. The sufficient conditions are expressed with a new notion of measuring the gap between consecutive…
We study the convergence of Langevin-Simulated Annealing type algorithms with multiplicative noise, i.e. for $V : \mathbb{R}^d \to \mathbb{R}$ a potential function to minimize, we consider the stochastic equation $dY_t = - \sigma…
Some new sufficient conditions for the weighted Chebyshev's inequality for real numbers to hold are provided.
We study ample divisors X with only rational singularities on abelian varieties that decompose into a sum of two lower dimensional subvarieties, X=V+W. For instance, we prove an optimal lower bound on the degree of the corresponding…
Joint measurements of qubit observables have recently been studied in conjunction with quantum information processing tasks such as cloning. Considerations of such joint measurements have until now been restricted to a certain class of…
We give a necessary and sufficient condition for a simplicial complex to be approximately Cohen-Macaulay. Namely it is approximately Cohen-Macaulay if and only if the ideal associated to its Alexander dual is componentwise linear and…
We study the proximal sampler of Lee, Shen, and Tian (2021) and obtain new convergence guarantees under weaker assumptions than strong log-concavity: namely, our results hold for (1) weakly log-concave targets, and (2) targets satisfying…
We study approximations of polytopes in the standard model for computing polytopes using Minkowski sums and (convex hulls of) unions. Specifically, we study the ability to approximate a target polytope by polytopes of a given depth. Our…
We establish new quantitative estimates for general systems of functions with wavelet-type dyadic structure. These estimates are applied to obtain the optimal growth of various types of Weyl multipliers for certain wavelet-type systems.…
The error term in the approximate functional equation for exponential sums involving the divisor function will be improved under certain conditions for the parameters of the approximate functional equation.
In this paper, we establish a new estimate (including lower and upper bounds) for an important quantity involved in the convergence analysis of smoothed aggregation algebraic multigrid methods. The new upper bound improves the existing…
In the first part of this paper, we study the properties of some particular plurisubharmonic functions, namely the toric ones. The main result of this part is a precise description of their multiplier ideal sheaves, which generalizes the…
We give necessary and sufficient conditions for the Chebyshev inequality to be an equality.
We deal with the random combinatorial structures called assemblies. By weakening the logarithmic condition which assures regularity of the number of components of a given order, we extend the notion of logarithmic assemblies. Using the…
We present a novel iterative algorithm for approximating the linear least squares solution with low complexity. After a motivation of the algorithm we discuss the algorithm's properties including its complexity, and we present theoretical…