Related papers: A note on a spectral constant associated with an a…
A graph is called $K$-almost regular if its maximum degree is at most $K$ times the minimum degree. Erd\H{o}s and Simonovits showed that for a constant $0< \varepsilon< 1$ and a sufficiently large integer $n$, any $n$-vertex graph with more…
We consider a bounded linear operator $T$ on a complex Banach space $X$ and show that its spectral radius $r(T)$ satisfies $r(T) < 1$ if all sequences $(< x',T^nx>)_{n \in \mathbb{N}_0}$ ($x \in X$, $x' \in X'$) are, up to a certain…
Write $\rho\left( G\right) $ for the spectral radius of a graph $G$ and $S_{n,r}$ for the join $K_{r}\vee\overline{K}_{n-r}.$ Let $n>r\geq2$ and $G$ be a $K_{r+1}$-saturated graph of order $n.$ Recently Kim, Kim, Kostochka, and O determined…
Crouzeix and Palencia recently showed that the numerical range of a Hilbert-space operator is a $(1+\sqrt2)$-spectral set for the operator. One of the principal ingredients of their proof can be formulated as an abstract functional-analysis…
We define the complete numerical radius norm for homomorphisms from any operator algebra into ${\mathcal B}({\mathcal H})$, and show that this norm can be computed explicitly in terms of the completely bounded norm. This is used to show…
Let $T:D(T)\rightarrow H_2$ be a densely defined closed operator with domain $D(T)\subset H_1$. We say $T$ to be absolutely minimum attaining if for every closed subspace $M$ of $H_1$, the restriction operator $T|_M:D(T)\cap M\rightarrow…
We prove that if two closed disks X_1 and X_2 of the Riemann sphere are spectral sets for a bounded linear operator A on a Hilbert space, then the intersection X_1\cap X_2 is a complete (2+2/\sqrt{3})-spectral set for A. When the…
Let $r_A(T)$ denote the $A$-spectral radius of an operator $T$ which is bounded with respect to the seminorm induced by a positive operator $A$ on a complex Hilbert space $\mathcal{H}$. In this paper, we aim to establish some $A$-spectral…
In [{\em The Numerical Range is a $(1 + \sqrt{2})$-Spectral Set}, SIAM J. Matrix Anal. Appl. 38 (2017), pp.~649-655], Crouzeix and Palencia show that the numerical range of a square matrix or linear operator $A$ is a $(1 +…
For a finite set $A\subset \mathbb{R}$ and real $\lambda$, let $A+\lambda A:=\{a+\lambda b :\, a,b\in A\}$. Combining a structural theorem of Freiman on sets with small doubling constants together with a discrete analogue of…
In an attempt to progress towards proving the conjecture the numerical range W (A) is a 2--spectral set for the matrix A, we propose a study of various constants. We review some partial results, many problems are still open. We describe our…
We show that there is a constant $K > 0$ such that for all $N, s \in \N$, $s \le N$, the point set consisting of $N$ points chosen uniformly at random in the $s$-dimensional unit cube $[0,1]^s$ with probability at least $1-\exp(-\Theta(s))$…
Let $R$ be a commutative unitary ring. An idempotent in $R$ is an element $e\in R$ with $e^2=e$. The Erd\H{o}s-Burgess constant associated with the ring $R$ is the smallest positive integer $\ell$ (if exists) such that for any given $\ell$…
For $r\geq 3$, let $f_r\colon [0,\infty)\to [1,\infty)$ be the unique analytic function such that $f_r({k\choose r})={k-1\choose r-1}$ for any $k\geq r-1$. We prove that the spectral radius of an $r$-uniform hypergraph $H$ with $e$ edges is…
For every $k\ge 2$ and $\Delta$, we prove that there exists a constant $C_{\Delta,k}$ such that the following holds. For every graph $H$ with $\chi(H)=k$ and every tree with at least $C_{\Delta,k}|H|$ vertices and maximum degree at most…
We prove that there exists an absolute constant $\alpha >1$ with the following property: if $K$ is a convex body in ${\mathbb R}^n$ whose center of mass is at the origin, then a random subset $X\subset K$ of cardinality ${\rm…
Let $G$ be a finite abelian group, and $r$ be a multiple of its exponent. The generalized Erd\H{o}s-Ginzburg-Ziv constant $s_r(G)$ is the smallest integer $s$ such that every sequence of length $s$ over $G$ has a zero-sum subsequence of…
A well-known result of Verstra\"ete \cite{V00} shows that for each integer $k\geq 2$ every graph $G$ with average degree at least $8k$ contains cycles of $k$ consecutive even lengths, the shortest of which is at most twice the radius of…
For $ 0 < r < 1 $, let $ \mathbb{A}_r = \{ z \in \mathbb{C} : r < |z| < 1 \} $ be the annulus with boundary $ \partial \overline{\mathbb{A}}_r = \mathbb{T} \cup r\mathbb{T} $, where $ \mathbb{T} $ is the unit circle in the complex plane…
The induced Ramsey number $R_{\mathrm{ind}}(H; r)$ of a graph $H$ is the minimum number $N$ such that there exists a graph with $N$ vertices for which all $r$-colourings of its edges contain a monochromatic induced copy of $H$. Our main…