It is shown that there is a subspace $Z_q$ of ${\ell }_q$ for $1<q<2$ which is isomorphic to ${\ell }_q$ such that ${\ell }_q/Z_q$ does not have the approximation property. On the other hand, for $2<p<\infty$ there is a subspace $Y_p$ of ${\ell }_p$ such that $Y_p$ does not have the approximation property (AP) but the quotient space ${\ell }_p/Y_p$ is isomorphic to ${\ell }_p$. The result is obtained by defining random “Enflo-Davie spaces” $Y_p$ which with full probability fail AP for all $2<p\le \infty$ and have AP for all $1\le p\le 2$. For $1<p\le 2$, $Y_p$ are isomorphic to ${\ell }_p$.

Let $S_n^{\left(2\right)}$ denote the iterated partial sums. That is, $S_n^{\left(2\right)}=S_1+S_2+\cdots +S_n$, where $S_i=X_1+X_2+\cdots +X_i$. Assuming $X_1,X_2,...,X_n$ are integrable, zero-mean, i.i.d. random variables, we show that the persistence probabilities $$p_n^{\left(2\right)}:=\mathbb{P}\left(\underset{1\le i\le n}{max}{S}_i^{\left(2\right)}lt;0\right)\le c\sqrt{\frac{𝔼|S_{n+1}|}{(n+1)𝔼|X_1|}},$$ with $c\le 6\sqrt{30}$ (and $c=2$ whenever $X_1$ is symmetric). The converse inequality holds whenever the non-zero $min(-X_1,0)$ is bounded or when it has only finite third moment and in addition $X_1$ is squared integrable. Furthermore, $p_n^{\left(2\right)}\asymp n^{-1/4}$ for any non-degenerate squared integrable, i.i.d., zero-mean $X_i$. In contrast, we show that for any $0lt;\gamma lt;1/4$ there exist integrable,...

Suppose that $𝒢$ is a finite, connected graph and $X$ is a lazy random walk on $𝒢$. The lamplighter chain $X^{\diamond }$ associated with $X$ is the random walk on the wreath product ${𝒢}^{\diamond }={𝐙}_2\wr 𝒢$, the graph whose vertices consist of pairs $(\underline{f},x)$ where $f$ is a labeling of the vertices of $𝒢$ by elements of ${𝐙}_2=\{0,1\}$ and $x$ is a vertex in $𝒢$. There is an edge between $(\underline{f},x)$ and $(\underline{g},y)$ in ${𝒢}^{\diamond }$ if and only if $x$ is adjacent to $y$ in $𝒢$ and $f_z=g_z$ for all $z\ne x,y$. In each step, $X^{\diamond }$ moves from a configuration $(\underline{f},x)$ by updating $x$ to $y$ using the transition rule of $X$ and then...

For graphs $G$, $F_1$, $F_2$, we write $G\to (F_1,F_2)$ if for every red-blue colouring of the edge set of $G$ we have a red copy of $F_1$ or a blue copy of $F_2$ in $G$. The size Ramsey number $\widehat{r}(F_1,F_2)$ is the minimum number of edges of a graph $G$ such that $G\to (F_1,F_2)$. Erdős and Faudree proved that for the cycle $C_n$ of length $n$ and for $t\ge 2$ matchings $t{K}_2$, the size Ramsey number $\widehat{r}(t{K}_2,C_n)<n+(4t+3)\sqrt{n}$. We improve their upper bound for $t=2$ and $t=3$ by showing that $\widehat{r}(2K_2,C_n)\le n+2\sqrt{3n}+9$ for $n\ge 12$ and $\widehat{r}(3K_2,C_n)<n+6\sqrt{n}+9$ for $n\ge 25$.

Let $G$ be a finite group. An element $g\in G$ is called a vanishing element if there exists an irreducible complex character $\chi$ of $G$ such that $\chi \left(g\right)=0$. Denote by $\mathrm{Vo}\left(G\right)$ the set of orders of vanishing elements of $G$. Ghasemabadi, Iranmanesh, Mavadatpour (2015), in their paper presented the following conjecture: Let $G$ be a finite group and $M$ a finite nonabelian simple group such that $\mathrm{Vo}\left(G\right)=\mathrm{Vo}\left(M\right)$ and $\left|G\right|=\left|M\right|$. Then $G\cong M$. We answer in affirmative this conjecture for $M=Sz\left(q\right)$, where $q=2^{2n+1}$ and either $q-1$, $q-\sqrt{2q}+1$ or $q+\sqrt{2q}+1$ is a prime number, and $M=F_4\left(q\right)$, where...

We investigate the recovery of $k$-sparse signals using the ${\ell }_1$-${\ell }_2$ minimization model with prior support set information. The prior support set information, which is believed to contain the indices of nonzero signal elements, significantly enhances the performance of compressive recovery by improving accuracy, efficiency, reducing complexity, expanding applicability, and enhancing robustness. We assume $k$-sparse signals $𝐱$ with the prior support $T$ which is composed of $g$ true indices and $b$ wrong...

Following a suggestion of W.M. Schmidt and L. Summerer, we construct a proper $3$-system $(P_1,P_2,P_3)$ with the property ${\overline{\varphi }}_3=1$. In fact, our method generalizes to provide $n$-systems with ${\overline{\varphi }}_n=1$, for arbitrary $n\ge 3$. We visualize our constructions with graphics. We further present explicit examples of numbers ${\xi }_1,...,{\xi }_{n-1}$ that induce the $n$-systems in question.

For $X,Y\in {𝐌}_{n,m}$ it is said that $X$ is gut-majorized by $Y$, and we write $X{\prec }_{\mathrm{gut}}Y$, if there exists an $n$-by-$n$ upper triangular g-row stochastic matrix $R$ such that $X=RY$. Define the relation ${\sim }_{\mathrm{gut}}$ as follows. $X{\sim }_{\mathrm{gut}}Y$ if $X$ is gut-majorized by $Y$ and $Y$ is gut-majorized by $X$. The (strong) linear preservers of ${\prec }_{\mathrm{gut}}$ on ${ℝ}^n$ and strong linear preservers of this relation on ${𝐌}_{n,m}$ have been characterized before. This paper characterizes all (strong) linear preservers and strong linear preservers of ${\sim }_{\mathrm{gut}}$ on ${ℝ}^n$ and ${𝐌}_{n,m}$.

A nonincreasing sequence $\pi =(d_1,...,d_n)$ of nonnegative integers is a graphic sequence if it is realizable by a simple graph $G$ on $n$ vertices. In this case, $G$ is referred to as a realization of $\pi$. Given two graphs $G_1$ and $G_2$, A. Busch et al. (2014) introduced the potential-Ramsey number of $G_1$ and $G_2$, denoted by $r_{\mathrm{pot}}(G_1,G_2)$, as the smallest nonnegative integer $m$ such that for every $m$-term graphic sequence $\pi$, there is a realization $G$ of $\pi$ with $G_1\subseteq G$ or with $G_2\subseteq \overline{G}$, where $\overline{G}$ is the complement of $G$. For $t\ge 2$ and $0\le k\le \lfloor \frac{t}{2}\rfloor$, let $K_t^{-k}$ be the graph...

Let $D$ be a ${𝒞}^d$ $q$-convex intersection, $d\ge 2$, $0\le q\le n-1$, in a complex manifold $X$ of complex dimension $n$, $n\ge 2$, and let $E$ be a holomorphic vector bundle of rank $N$ over $X$. In this paper, ${𝒞}^k$-estimates, $k=2,3,\cdots ,\infty$, for solutions to the $\overline{\partial }$-equation with small loss of smoothness are obtained for $E$-valued $(0,s)$-forms on $D$ when $n-q\le s\le n$. In addition, we solve the $\overline{\partial }$-equation with a support condition in ${𝒞}^k$-spaces. More precisely, we prove that for a $\overline{\partial }$-closed form $f$ in ${𝒞}_{0,q}^k(X\setminus D,E)$, $1\le q\le n-2$, $n\ge 3$, with compact support and for $\epsilon$ with $0<\epsilon <1$ there...

Let $(X_i,i=1,2,...)$ be the normalized gaussian system such that $X_i\in N(0,1)$, i = 1,2,... and let the correlation matrix ${\rho }_{ij}=E\left(X_i{X}_j\right)$ satisfy the following hypothesis: $C=su{p}_{i\ge 1}{\sum }_{j=1}^{\infty }\left|{\rho }_{i,j}\right|<\infty$. We present Gebelein’s inequality and some of its consequences: Borel-Cantelli type lemma, iterated log law, Levy’s norm for the gaussian sequence etc. The main result is that (f(X₁) + ⋯ + f(Xₙ))/n → 0 a.s. for f ∈ L¹(ν) with (f,1)ν = 0.