Related papers: Subconvex bounds for compact toric integrals

Toric log del Pezzo surfaces correspond to convex lattice polygons containing the origin in their interior and having only primitive vertices. An upper bound on the volume and on the number of boundary lattice points of these polygons is…

Generalizing the framework of an ultra-weak formulation for a hypersingular integral equation on closed polygons in [N. Heuer, F. Pinochet, arXiv 1309.1697 (to appear in SIAM J. Numer. Anal.)], we study the case of a hypersingular integral…

We refine the conditions for the lower bound in an abstract large deviation result with nonconvex rate function we had previously introduced. We apply the results to certain stochastic recursive schemes.

This paper presents a novel convex optimization-based method for finding the globally optimal solutions of a class of mixed-integer non-convex optimal control problems. We consider problems with non-convex constraints that restrict the…

We study the two dimensional least gradient problem in a convex polygonal set in the plane. We show existence of solutions when the boundary data are attained in the trace sense. Due to the lack of strict convexity, the classical results…

Gardner, Gronchi and Zong posed the problem to find a discrete analogue of M. Meyer's inequality bounding the volume of a convex body from below by the geometric mean of the volumes of its slices with the coordinate hyperplanes. Motivated…

We apply the local discontinuous Galerkin (LDG for short) method to solve a mixed boundary value problems for the Helmholtz equation in bounded polygonal domain in 2D. Under some assumptions on regularity of the solution of an adjoint…

Let $\pi$ be a fixed Hecke--Maass cusp form for $\mathrm{SL}(3,\mathbb{Z})$ and $\chi$ be a primitive Dirichlet character modulo $M$, which we assume to be a prime. Let $L(s,\pi\otimes \chi)$ be the $L$-function associated to $\pi\otimes…

In this paper, I mainly prove the following results. For every energy value below the minimum of the first, second and third critical value, each bounded component of the regularized energy hypersurface of the Lagrange problem under some…

In this paper, we prove strong subconvexity bounds for self-dual $\mathrm{GL}(3)$ $L$-functions in the $t$-aspect and for $\mathrm{GL}(3)\times\mathrm{GL}(2)$ $L$-functions in the $\mathrm{GL}(2)$-spectral aspect. The bounds are strong in…

Vogt's theorem, concerning boundary angles of a convex arc with monotonic curvature (spiral arc), is taken as a starting point to establish basic properties of spirals. The theorem is expanded by removing requirements of convexity and…

It is proved for a strongly pseudoconvex domain $D$ in $\Bbb C^d$ with $\mathcal C^{2,\alpha}$-smooth boundary that any complex geodesic through every two close points of $D$ sufficiently close to $\partial D$ and whose difference is…

Using a geometric construction, we solve Plateau's Problem in the Heisenberg group $\mathbb{H}^{1}$ for intrinsic graphs defined on a convex domain $D$, under a smallness condition either on the boundary $\partial D$ or on the Lipschitz…

We consider the problem of lower bounding a generalized Minkowski measure of subsets of a convex body with a log-concave probability measure, conditioned on the set size. A bound is given in terms of diameter and set size, which is sharp…

This work is concerned with an abstract inf-sup problem generated by a bilinear Lagrangian and convex constraints. We study the conditions that guarantee no gap between the inf-sup and related sup-inf problems. The key assumption introduced…

We prove Gaussian upper and lower bounds for the fundamental solutions of a class of degenerate parabolic equations satisfying a weak Hormander condition. The bound is independent of the smoothness of the coefficients and generalizes…

A framework is presented whereby a general convex conic optimization problem is transformed into an equivalent convex optimization problem whose only constraints are linear equations and whose objective function is Lipschitz continuous.…

We prove a lower bound on the number of the convex components of a compact set with non-empty interior in $\mathbb{R}^n$ for all $n\ge2$. Our result generalizes and improves the inequalities previously obtained in M. Carozza, F. Giannetti,…

In this paper we extend the classical sub-supersolution Sattinger iteration method to $1$-Laplace type boundary value problems of the form \begin{equation*} \begin{cases} \displaystyle -\Delta_1 u = F(x,u) & \text{in}\;\Omega,\\ \newline…

We identify and analyze a fundamental limitation of the classical projected subgradient method in nonsmooth convex optimization: the inevitable failure caused by the absence of valid subgradients at boundary points. We show that, under…