Related papers: The maximum of the CUE field

Denote by $M_n$ the set of $n\times n$ complex matrices. Let $f: M_n \rightarrow [0,\infty)$ be a continuous map such that $f(\mu UAU^*)= f(A)$ for any complex unit $\mu$, $A \in M_n$ and unitary $U \in M_n$, $f(X)=0$ if and only if $X=0$…

For $f$ a Rademacher or Steinhaus random multiplicative function, we prove that $$ \max_{\theta \in [0,1]} \frac{1}{\sqrt{N}} \Bigl| \sum_{n \leq N} f(n) \mathrm{e} (n \theta) \Bigr| \gg \sqrt{\log N} ,$$ asymptotically almost surely as $N…

Let $r$ and $n$ be positive integers such that $r<n$, and $\mathbb{K}$ be an arbitrary field. In a recent work, we have determined the maximal dimension for a linear subspace of $n$ by $n$ symmetric matrices with rank less than or equal to…

The main objective of this paper is to answer the questions posed by Robinson and Sadowski [21, p. 505, Comm. Math. Phys., 2010]{[RS3]} for the Navier-Stokes equations. Firstly, we prove that the upper box dimension of the potential…

Let $n$ be a positive integer. Let $\mathbf U$ be the unit disk, $p\ge 1$ and let $h^p(\mathbf U)$ be the Hardy space of harmonic functions. Kresin and Maz'ya in a recent paper found the representation for the function $H_{n,p}(z)$ in the…

We prove that the dimension of every poset whose comparability graph has maximum degree $\Delta$ is at most $\Delta\log^{1+o(1)} \Delta$. This result improves on a 30-year old bound of F\"uredi and Kahn, and is within a $\log^{o(1)}\Delta$…

We show that the Szeg\H{o} matrices, associated with Verblunsky coefficients $\{\alpha_n\}_{n\in\mathbb{Z}_+}$ obeying $\sum_{n = 0}^\infty n^\gamma |\alpha_n|^2 < \infty$ for some $\gamma \in (0,1)$, are bounded for values $z \in \partial…

A well-known result due to Fannes is a certain upper bound on the modulus of continuity of the von Neumann entropy with respect to the trace distance between density matrices; this distance is the maximum probability of distinguishing…

Let u(n) be the n-th term of a Lucas sequence or a Lehmer sequence.In this article we shall establish an estimate from below for the greatest prime factor of u(n) which is of the form nexp(logn/104loglogn). In so doing we are able to…

We prove a sharp upper bound for the number of high degree differences in bipartite graphs: let $ (U, V, E)$ be a bipartite graph with $U=\{u_1, u_2, \dots, u_n\}$ and $V=\{v_1, v_2, \dots, v_n\}$; for $n\ge k>\frac{n}{2}$ we show that…

We present lower estimates for the best constant appearing in the weak $(1,1)$ maximal inequality in the space $(\R^n,\|\cdot\|_{\iy})$. We show that this constant grows to infinity faster than $(\log n)^{1-o(1)}$ when $n$ tends to…

Let $p(n)$ denote the number of partitions of a natural number $n$. As $ n \to \infty$, the $n$th root of $p(n)$ tends to $1$, which is related to the Cauchy--Hadamard test for power series. Andrews also discovered an elementary proof. Sun…

According to a classical result of Spencer, Szemer\'edi, and Trotter (1984), the maximum number of times the unit distance can occur among $n$ points in the plane is $O(n^{4/3})$. This is far from Erd\H{o}s's lower bound, $n^{1+O(1/\log\log…

I use quaternion free probability calculus - an extension of free probability to non-Hermitian matrices (which is introduced in a succinct but self-contained way) - to derive in the large-size limit the mean densities of the eigenvalues and…

The purpose of this note is to show that the set functions defined in \cite{trong-tuyen} can be suitably extended to all subsets $E$ of the unit disk $\mathbb{D}$. In particular we obtain uniform nearly-optimal estimates for the following…

For an analytic and univalent function $f$ in the unit disk $\mathbb{D}:=\{z\in\mathbb{C}:|z|<1\}$ with the normalization $f(0)=0=f'(0)-1$, the logarithmic coefficients $\gamma_n$ are defined by $\log \frac{f(z)}{z}= 2\sum_{n=1}^{\infty}…

We prove that the Brouwer degree $\mathrm{deg}(u,U,\cdot)$ for a function $u\in C^{0,\alpha}( U;\mathbb{R}^n)$ is in $L^p(\mathbb{R}^n)$ if $1\leq p<\frac{n\alpha}d$, where $U\subset \mathbb{R}^n$ is open and bounded and $d$ is the box…

Let ${\mathcal D}(n)$ be the maximal determinant for $n \times n$ $\{\pm 1\}$-matrices, and $\mathcal R(n) = {\mathcal D}(n)/n^{n/2}$ be the ratio of ${\mathcal D}(n)$ to the Hadamard upper bound. Using the probabilistic method, we prove…

We show that the maximum likelihood degree of a smooth very affine variety is equal to the signed topological Euler characteristic. This generalizes Orlik and Terao's solution to Varchenko's conjecture on complements of hyperplane…

Fix a dimension $d\ge 2$, and let $T_n$ be a random $d$-dimensional determinantal hypertree on $n$ vertices. We prove that \[\frac{\log|H_{d-1}(T_n,\mathbb{Z})|}{{{n\choose {d}}}}\] converges in probability to a constant $c_d$, which…