Related papers: Approximate convexity and an edge-isoperimetric es…

For the minimal graph with strict convex level sets, we find an auxiliary function to study the Gaussian curvature of the level sets. We prove that this curvature function is a concave function with respect to the height of the minimal…

The aim of this paper is to show that the discrete maximal function $$\mathcal{M}_{h}f(x)=\sup_{N\in\mathbb{N}}\frac{1}{|\mathbf{N}_{h}\cap[1, N]|}\Big|\sum_{n\in \mathbf{N}_{h}\cap[1, N]}f(x-n)\Big|,\ \ \mbox{for $x\in\mathbb{Z}$},$$ is of…

We study the Bakry-\'Emery curvature function $\mathcal{K}_{G,x}:(0,\infty]\to \mathbb{R}$ of a vertex $x$ in a locally finite graph $G$ systematically. Here $\mathcal{K}_{G,x}(\mathcal{N})$ is defined as the optimal curvature lower bound…

Discrete Fenchel duality is one of the central issues in discrete convex analysis. The Fenchel-type min-max theorem for a pair of integer-valued M-natural-convex functions generalizes the min-max formulas for polymatroid intersection and…

In this paper, we provide near-optimal accelerated first-order methods for minimizing a broad class of smooth nonconvex functions that are strictly unimodal on all lines through a minimizer. This function class, which we call the class of…

We study some properties of the Cayley graph of the R.Thompson's group F in generators $x_0$, $x_1$. We show that the density of this graph, that is, the least upper bound of the average vertex degree of its finite subgraphs is at least 3.…

We study the pointwise supremum of convex integral functionals $\mathcal{I}_{f,\gamma}(\xi)= \sup_{Q} \left( \int_\Omega f(\omega,\xi(\omega))Q(d\omega)-\gamma(Q)\right)$ on $L^\infty(\Omega,\mathcal{F},\mathbb{P})$ where…

This note deals with certain properties of convex functions. We provide results on the convexity of the set of minima of these functions, the behaviour of their subgradient set under restriction, and optimization of these functions over an…

The condition number of a differentiable convex function, namely the ratio of its smoothness to strong convexity constants, is closely tied to fundamental properties of the function. In particular, the condition number of a quadratic convex…

For all $p>1$ and all centrally symmetric convex bodies $K\subset \mathbb{R}^d$ define $Mf$ as the centered maximal function associated to $K$. We show that when $d=1$ or $d=2$, we have $||Mf||_p\ge (1+\epsilon(p,K))||f||_p$. For $d\ge 3$,…

Fractional matching extendability is a concept that brings together two widely studied topics in graph theory, namely that of fractional matchings and that of matching extendability. A {\em fractional matching} of a graph $\Gamma$ with edge…

For a function $f\colon [0,1]\to\mathbb R$, we consider the set $E(f)$ of points at which $f$ cuts the real axis. Given $f\colon [0,1]\to\mathbb R$ and a Cantor set $D\subset [0,1]$ with $\{0,1\}\subset D$, we obtain conditions equivalent…

Let $f$ and $g$ be normalized Hecke-Maass cusp forms for the full modular group having spectral parameters $t_f$ and $t_g$ respectively with $t_f,t_g\asymp T\rightarrow \infty $. In this paper we show that the Rankin Selberg $L$-function…

A class of real functions, which is the generalization of a family of convex functions, is introduced; in this connection, we have defined $X$-convex, strictly $X$-convex, quasi-$X$-convex, strictly quasi-$X$-convex, and semi-strictly…

We prove that if the Cayley graph of a finitely generated group enjoys the property L_delta then the group is almost convex and has a sub-cubic isoperimetric function.

In this article, we prove the existence of extremal functions in higher-order affine Sobolev inequalities. Proofs rely on concentration-compactness methods in spaces of integer or fractional regularity. The tools we use, available in spaces…

We study the following question: Given an open set $\Omega$, symmetric about 0, and a continuous, integrable, positive definite function $f$, supported in $\Omega$ and with $f(0)=1$, how large can $\int f$ be? This problem has been studied…

Approximate algebraic structures play a defining role in arithmetic combinatorics and have found remarkable applications to basic questions in number theory and pseudorandomness. Here we study approximate representations of finite groups:…

This paper tackles the unconstrained minimization of a class of nonsmooth and nonconvex functions that can be written as finite max-functions. A gradient and function-based sampling method is proposed which, under special circumstances,…

We study the maximum number of edges in an $n$ vertex graph with Colin de Verdi\`{e}re parameter no more than $t$. We conjecture that for every integer $t$, if $G$ is a graph with at least $t$ vertices and Colin de Verdi\`{e}re parameter at…