Related papers: A Gronwall-type Trigonometric Inequality

Inspired by the work of Schur on the Taylor series of the exponential and Laguerre polynomials, we study the Galois theory of trimmed exponentials $f_{n,n+k}=\sum_{i=0}^{k} \frac{x^{i}}{(n+i)!}$ and of the generalized Laguerre polynomials…

We prove that if $f(n)$ is a Steinhaus or Rademacher random multiplicative function, there almost surely exist arbitrarily large values of $x$ for which $|\sum_{n \leq x} f(n)| \geq \sqrt{x} (\log\log x)^{1/4+o(1)}$. This is the first such…

We study the scaling limit of essentially simple triangulations on the torus. We consider, for every $n\geq 1$, a uniformly random triangulation $G_n$ over the set of (appropriately rooted) essentially simple triangulations on the torus…

We improve upon a result of Steinerberger (2024) by demonstrating that for any fixed $k \in \mathbb{N}$ and sufficiently large $n$, there exist integers $1 \leq a_1, \dots, a_k \leq n$ satisfying: \begin{align*} 0 < \left\| \sum_{j=1}^{k}…

We prove that when $f$ is a Rademacher random multiplicative function for any $\epsilon>0$, then $\sum_{n \leqslant x}\frac{f(n)}{\sqrt{n}} \ll (\log\log(x))^{3/4+\epsilon}$ for almost all $f$. We also show that there exist arbitrarily…

Let \( G \) be a graph of order \( n \) with maximum degree $\Delta$, and let $P(G,x)$ denote its chromatic polynomial. We investigate several properties of $P(G,x)$ related to its derivatives and higher-order derivatives. First, we study…

In this article, we generalize our previous results joint with Pedro Gaspar to higher dimensions, prove the existence of (infinitely many) eternal weak mean curvature flows in $S^{n+1}$ (for all $n \geq 2$) connecting a Clifford…

We prove Polya's conjecture of 1943: For a real entire function of order greater than 2, with finitely many non-real zeros, the number of non-real zeros of the n-th derivative tends to infinity with n. We use the saddle point method and…

A result by N.G. Makarov [Algebra i Analiz, 1989] states that for martingales $(M_n)$ on the torus we have the strict inequality \[ \liminf_{n\to\infty} \frac{M_n}{\sum_{k=1}^n |\Delta M_k|} > 0 \] on a set of Hausdorff dimension one,…

This paper concerns with the graphical derivative of the normals to the conic constraint $g(x)\in\!K$, where $g\!:\mathbb{X}\to\mathbb{Y}$ is a twice continuously differentiable mapping and $K\subseteq\mathbb{Y}$ is a nonempty closed convex…

Using the Chern-Gauss-Bonnet theorem, we establish a sharp inequality for the total Gauss-Kronecker curvature of convex hypersurfaces in Cartan-Hadamard manifolds $M^n$ with nullity index at least $n-3$. Consequently, the Euclidean…

We study non-flat planar 3-webs with infinitesimal symmetries. Using multi-dimensional Schwarzian derivative we give a criterion for linearization of such webs and present a projective classification thereof. Using this classification we…

For a bounded three-dimensional domain with Lipschitz boundary we extend Korn's first inequality to incompatible tensor fields. For compatible tensor fields our estimate reduces to a non-standard variant of the well known Korn's first…

The classical Erd\H{o}s-Littlewood-Offord theorem says that for nonzero vectors $a_1,\dots,a_n\in \mathbb{R}^d$, any $x\in \mathbb{R}^d$, and uniformly random $(\xi_1,\dots,\xi_n)\in\{-1,1\}^n$, we have…

Iannucci considered the positive divisors of a natural number $n$ that do not exceed the square root of $n$ and found all numbers whose such divisors are in arithmetic progression. Continuing the work, we define large divisors to be…

Grothendieck's formal functions theorem states that the coherent cohomology of a Noetherian scheme can be recovered from that of a blowup and the infinitesimal thickenings of the center and of the exceptional divisor of the blowup. In this…

We obtain a uniform ergodic theorem for the sequence $\frac1{s(n)} \sum_{k=0}^n(\varDelta s)(n-k)\,T^k$, where $\varDelta$ is the inverse of the endomorphism on the vector space of scalar sequences which maps each sequence into the sequence…

Let $f(n,k)$ be the minimum number of edges that must be removed from some complete geometric graph $G$ on $n$ points, so that there exists a tree on $k$ vertices that is no longer a planar subgraph of $G$. In this paper we show that…

Chaining techniques show that if X is an isotropic log-concave random vector in R^n and Gamma is a standard Gaussian vector then E |X| < C n^{1/4} E |Gamma| for any norm |*|, where C is a universal constant. Using a completely different…

Let $\mathbb{N}_0$ be a class of natural numbers whose binary decompositions has even number of 1. We estimate of the sum $\sum\limits_{n\in \mathbf{N}_0,n\le X}\exp(2\pi i \alpha n^2)$.