Related papers: Sharp endpoint extension inequalities for the mome…

Sharp restriction theory and the finite field extension problem have both received a great deal of attention in the last two decades, but so far they have not intersected. In this paper, we initiate the study of sharp restriction theory on…

This article investigates sharp comparison of moments for various classes of random variables appearing in a geometric context. In the first part of our work we find the optimal constants in the Khintchine inequality for random vectors…

In this paper, we will use a suitable tranform to investigate the sharp constants and optimizers for the following Caffarelli-Kohn-Nirenberg inequalities for a wide range of parameters $(r,p,q,s,\mu,\sigma)$ and $0\leq a\leq1$:…

We study the continuity of an abstract generalization of the maximum-entropy inference - a maximizer. It is defined as a right-inverse of a linear map restricted to a convex body which uniquely maximizes on each fiber of the linear map a…

The $L^2 \to L^p$ adjoint Fourier restriction inequality on the $d$-dimensional hyperboloid $\mathbb{H}^d \subset \mathbb{R}^{d+1}$ holds provided $6 \leq p < \infty$, if $d=1$, and $2(d+2)/d \leq p\leq 2(d+1)/(d-1)$, if $d\geq2$.…

We investigate numerically the optimal constants in Lieb-Thirring inequalities by studying the associated maximization problem. We use a monotonic fixed-point algorithm and a finite element discretization to obtain trial potentials which…

Sharp Fourier restriction theory and finite field extension theory have both been topics of interest in the last decades. Very recently, in \cite{GonzalezOliveira}, the research into the intersection of these two topics started. There it…

In this note, we study maximizers for Fourier extension inequalities on the sphere. We prove that constant functions are local maximizers for the $L^p(\mathbb{S}^{d-1})$ to $L^p(\mathbb{R}^d)$ Fourier extension estimates in the same range…

We identify the compactness threshold for optimizing sequences of the Airy-- Strichartz inequality as an explicit multiple of the sharp constant in the Strichartz inequality. In particular, if the sharp constant in the Airy--Strichartz…

For an appropriate class of convex functions $\phi$, we study the Fourier extension operator on the surface $\{(y, |y|^2+\phi(y)):y\in\mathbb{R}^2\}$ equipped with projection measure. For the corresponding extension inequality, we compute…

In this paper we study extension theorems associated with general varieties in two dimensional vector spaces over finite fields. Applying Bezout's theorem, we obtain the sufficient and necessary conditions on general curves where sharp…

We sharpen the moment comparison inequalities with sharp constants for sums of random vectors uniform on Euclidean spheres, providing a deficit term (optimal in high dimensions).

We prove the existence of maximizers and the precompactness of $L^p$-normalized maximizing sequences modulo symmetries for all valid scale-invariant Fourier extension inequalities on the cone in $\mathbb R^{1+d}$. In the range for which…

We study existence of maximizer for the Trudinger-Moser inequality with general nonlinearity of the critical growth on $R^2$, as well as on the disk. We derive a very sharp threshold nonlinearity between the existence and the non-existence…

We propose a detailed study of a canonical bound which relates the numbers of rational points of a curve over a finite field with that over its quadratic extension. Alternative proofs which make a connection with the variance enable to…

A basis of the ideal of the complement of a linear subspace in a projective space over a finite field is given. As an application, the second largest number of points of plane curves of degree $d$ over the finite field of $q$ elements is…

We study autocorrelation inequalities, in the spirit of Barnard and Steinerberger's work. In particular, we obtain improvements on the sharp constants in some of the inequalities previously considered by these authors, and also prove…

Computing the edge expansion of a graph is a famously hard combinatorial problem for which there have been many approximation studies. We present two variants of exact algorithms using semidefinite programming (SDP) to compute this constant…

We consider finite element approximations to the optimal constant for the Hardy inequality with exponent $p=2$ in bounded domains of dimension $n=1$ or $n \geq 3$. For finite element spaces of piecewise linear and continuous functions on a…

We consider the problem of finding curves of minimum pointwise-maximum curvature, i.e., curves of minimax curvature, among planar curves of fixed length with prescribed endpoints and tangents at the endpoints. We reformulate the problem in…