Mori Dream Spaces and blow-ups of weighted projective spaces

For every $n\ge 3$, we find a sufficient condition for the blow-up of a weighted projective space $\mathbb{P}(a,b,c,d_1,?,d_{n?2})$ at the identity point not to be a Mori Dream Space. We exhibit several infinite sequences of weights satisfying this condition in all dimensions $n\ge 3$.     

On invariant fields of vectors and covectors

Let ${\mathbb{F}}_q$ be the finite field of order q. Let G be one of the three groups $\mathrm{GL}(n,{\mathbb{F}}_q)$, $\mathrm{SL}(n,{\mathbb{F}}_q)$ or $\mathrm{U}(n,{\mathbb{F}}_q)$ and let W be the standard n-dimensional representation of G. For non-negative integers m and d we let $mW\oplus d{W}^{?}$ denote the representation of G given by the direct sum of m vectors and d covectors. We exhibit a minimal set of homogeneous invariant polynomials $\{{?}_1,{?}_2,\dots ,{?}_{(m+d)n}\}?{\mathbb{F}}_q{[mW\oplus d{W}^{?}]}^G$ such that ${\mathbb{F}}_q{(mW\oplus d{W}^{?})}^G={\mathbb{F}}_q({?}_1,{?}_2,\dots ,{?}_{(m+d)n})$ for all cases except when $md=0$ and $G=\mathrm{GL}(n,{\mathbb{F}}_q)$ or $\mathrm{SL}(n,{\mathbb{F}}_q)$.     

The component counts of random functions

Consider functions $f:A\to A\cup C$, where A and C are disjoint finite sets. The weakly connected components of the digraph of such a function are cycles of rooted trees, as in random mappings, and isolated rooted trees. Let $n_1=|A|$ and $n_3=|C|$. When a function is chosen from all ${(n_1+n_3)}^{n_1}$ possibilities uniformly at random, then we find the following limiting behaviour as $n_1\to \infty$. If $n_3=o(n_1)$, then the size of the maximal mapping component goes to infinity almost surely; if $n_3～\gamma n_1$, $\gamma >0$ a constant, then process counting numbers of mapping components of different sizes converges; if $n_1=o(n_3)$, then the number of mapping components converges to 0 in probability. We get estimates on the size of the largest tree component which are of order $\log ?n_3$ when $n_3～\gamma n_1$ and constant when $n_3～n_1^{\alpha }$, $\alpha >1$. These results are similar to ones obtained previously for random injections, for which the weakly connected components are cycles and linear trees.     

On the Ramsey numbers of odd-linked double stars

The linked double star $S_c(n,m)$, where $n\ge m\ge 0$, is the graph consisting of the union of two stars $K_{1,n}$ and $K_{1,m}$ with a path on c vertices joining the centers. Its Ramsey number $r(S_c(n,m))$ is the smallest integer r such that every 2-coloring of the edges of a $K_r$ admits a monochromatic $S_c(n,m)$. In this paper, we study the Ramsey numbers of linked double stars when c is odd. In particular, we establish bounds on the value of $r(S_c(n,m))$ and determine the exact value of $r(S_c(n,m))$ if $n\ge c$, or if $n\le ?\frac{c}{2}??2$ and $m=2$.     

On the chromatic number of some P5-free graphs

Let G be a graph. We say that G is perfectly divisible if for each induced subgraph H of G, $V(H)$ can be partitioned into A and B such that $H[A]$ is perfect and $\omega (H[B])<\omega (H)$. We use $P_t$ and $C_t$ to denote a path and a cycle on t vertices, respectively. For two disjoint graphs $F_1$ and $F_2$, we use $F_1\cup F_2$ to denote the graph with vertex set $V(F_1)\cup V(F_2)$ and edge set $E(F_1)\cup E(F_2)$, and use $F_1+F_2$ to denote the graph with vertex set $V(F_1)\cup V(F_2)$ and edge set $E(F_1)\cup E(F_2)\cup \{xy|x\in V(F_1)\text{ and }y\in V(F_2)\}$. In this paper, we prove that (i) $(P_5,C_5,K_{2,3})$-free graphs are perfectly divisible, (ii) $\chi (G)\le 2{\omega }^2(G)?\omega (G)?3$ if G is $(P_5,K_{2,3})$-free with $\omega (G)\ge 2$, (iii) $\chi (G)\le \frac{3}{2}({\omega }^2(G)?\omega (G))$ if G is $(P_5,K_1+2K_2)$-free, and (iv) $\chi (G)\le 3\omega (G)+11$ if G is $(P_5,K_1+(K_1\cup K_3))$-free.     

An asymptotic expansion for the expected number of real zeros of real random polynomials spanned by OPUC

Let ${\{{\phi }_i\}}_{i=0}^{\infty }$ be a sequence of orthonormal polynomials on the unit circle with respect to a positive Borel measure μ that is symmetric with respect to conjugation. We study asymptotic behavior of the expected number of real zeros, say ${\mathbb{E}}_n(\mu )$, of random polynomials

$P_n(z):=\sum _{i=0}^n{\eta }_i{\phi }_i(z),$

where ${\eta }_0,\dots ,{\eta }_n$ are i.i.d. standard Gaussian random variables. When μ is the acrlength measure such polynomials are called Kac polynomials and it was shown by Wilkins that ${\mathbb{E}}_n(|\mathrm{d}\xi |)$ admits an asymptotic expansion of the form

${\mathbb{E}}_n(|\mathrm{d}\xi |)～\frac{2}{\pi }\log ?(n+1)+\sum _{p=0}^{\infty }{A}_p{(n+1)}^{?p}$

(Kac himself obtained the leading term of this expansion). In this work we generalize the result of Wilkins to the case where μ is absolutely continuous with respect to arclength measure and its Radon–Nikodym derivative extends to a holomorphic non-vanishing function in some neighborhood of the unit circle. In this case ${\mathbb{E}}_n(\mu )$ admits an analogous expansion with the coefficients $A_p$ depending on the measure μ for $p\ge 1$ (the leading order term and $A_0$ remain the same).