Let $M$ be a compact Hausdorff space. We prove that in this paper, every self--adjoint matrix over $C(M)$ is approximately diagonalizable iff $\dim M\le 2$ and $\HO^2(M,\mathbb Z)\cong 0$. Using this result, we show that every unitary matrix over $C(M)$ is approximately diagonalizable iff $\dim M\le 2$, $\HO^1(M,\mathbb Z)\cong\HO^2(M,\mathbb Z)\cong 0$ when $M$ is a compact metric space.

Yifeng Xue

For any real numbers $b,c\in\mathbb{R}$, we form the sequence of polynomials $\left\{ H_{m}(z)\right\} _{m=0}^{\infty}$ satisfying the four-term recurrence \[ H_{m}(z)+cH_{m-1}(z)+bH_{m-2}(z)+zH_{m-3}(z)=0,\qquad m\ge3, \] with the initial conditions $H_{0}(z)=1$, $H_{1}(z)=$$-c$, and $H_{2}(z)=-b+c^{2}$. We find necessary and sufficient conditions on $b$ and $c$ under which the zeros of $H_{m}(z)$ are real for all $m$, and provide an explicit real interval on which ${\displaystyle \bigcup_{m=0}^{\infty}\mathcal{Z}(H_{m})}$ is dense where $\mathcal{Z}(H_{m})$ is the set of zeros of $H_{m}(z)$.

Khang Tran Andres Zumba

Let $P_{<n}(z)$ be the Rudin-Shapiro polynomial of degree $n-1$. We show that $|P_{<n}(z)|\le \sqrt{6n-2}-1$ for all $n\ge0$ and $|z|=1$, confirming a longstanding conjecture. This bound is sharp in the case when $n=(2\cdot 4^k+1)/3$ and $z=1$. We also show that for $n\ge m\ge0$, $|P_{<n}(z)-P_{<m}(z)|\le \sqrt{10(n-m)}$, which is asymptotically sharp in the sense that for any $\varepsilon>0$ there exists $n>m\ge0$ and $z$ with $|z|=1$ and $|P_{<n}(z)-P_{<m}(z)|\ge\sqrt{(10-\varepsilon)(n-m)}$, contradicting a conjecture of Montgomery.

Paul Balister

For any $A(z),B(z),C(z)\in\mathbb{C}[z]$, we study the zero distribution of a table of polynomials $\left\{ P_{m,n}(z)\right\} _{m,n\in\mathbb{N}_{0}}$ satisfying the recurrence relation \[ P_{m,n}(z)=A(z)P_{m-1,n}(z)+B(z)P_{m,n-1}(z)+C(z)P_{m-1,n-1}(z) \] with the initial condition $P_{0,0}(z)=1$ and $P_{-m,-n}(z)=0$ $\forall m,n\in\mathbb{N}$. We show that the zeros of $P_{m,n}(z)$ lie on a curve whose equation is given explicitly in terms of $A(z),B(z)$, and $C(z)$. We also study the zero distribution of a case with a general initial condition.

Jack Luong Khang Tran

For each $\alpha>0$ and $A(z),B(z)\in\mathbb{C}[z]$, we study the zero distribution of the sequence of polynomials $\left\{ P_{m}^{(\alpha)}(z)\right\} _{m=0}^{\infty}$ generated by $(1+B(z)t+A(z)t^{3})^{-\alpha}$. We show that for large $m$, the zeros of $P_{m}^{(\alpha)}(z)$ lie on an explicit curve on the complex plane.

Travis Steele Khang Tran

We present a comprehensive analysis of z>8 galaxies based on ultra-deep WFC3/IR data. We constrain the evolution of the UV luminosity function (LF) and luminosity densities from z~11 to z~8 by exploiting all the WFC3/IR data over the Hubble Ultra-Deep Field from the HUDF09 and the new HUDF12 program, in addition to the HUDF09 parallel field data, as well as wider area WFC3/IR imaging over GOODS-South. Galaxies are selected based on the Lyman Break Technique in three samples centered around z~9, z~10 and z~11, with seven z~9 galaxy candidates, and one each at z~10 and z~11. We confirm a new z~10 candidate (with z=9.8+-0.6) that was not convincingly identified in our first z~10 sample. The deeper data over the HUDF confirms all our previous z>~7.5 candidates as genuine high-redshift candidates, and extends our samples to higher redshift and fainter limits (H_160~29.8 mag). We perform one of the first estimates of the z~9 UV LF and improve our previous constraints at z~10. Extrapolating the lower redshift UV LF evolution should have revealed 17 z~9 and 9 z~10 sources, i.e., a factor ~3x and 9x larger than observed. The inferred star-formation rate density (SFRD) in galaxies above 0.7 M_sun/yr decreases by 0.6+-0.2 dex from z~8 to z~9, in good agreement with previous estimates. The low number of sources found at z>8 is consistent with a very rapid build-up of galaxies across z~10 to z~8. From a combination of all current measurements, we find a best estimate of a factor 10x decrease in the SFRD from z~8 to z~10, following (1+z)^(-11.4+-3.1). Our measurements thus confirm our previous finding of an accelerated evolution beyond z~8, and signify a rapid build-up of galaxies with M_UV<-17.7 within only ~200 Myr from z~10 to z~8, in the heart of cosmic reionization.

P. A. Oesch R. J. Bouwens G. D. Illingworth I. Labbe M. Franx P. G. van Dokkum M. Trenti M. Stiavelli V. Gonzalez D. Magee

We solve the several complex variables preSchwarzian operator equation $[Df(z)]^{-1}D^2f(z)=A(z)$, $z\in \C^n$, where $A(z)$ is a bilinear operator and $f$ is a $\C^n$ valued locally biholomorphic function on a domain in $\C^n$. Then one can define a several variables $f\to f_\alpha$ transform via the operator equation $[Df_\alpha(z)]^{-1}D^2f_\alpha(z)=\alpha[Df(z)]^{-1}D^2f(z)$, and thereby, study properties of $f_\alpha$. This is a natural generalization of the one variable operator $f_\alpha(z)$ in \cite{DSS66} and the study of its univalence properties, e.g., the work of Royster \cite{Ro65} and many others. M\"{o}bius invariance and the multivariables Schwarzian derivative operator of T. Oda \cite{O} play a central role in this work.

Hernández Rodrigo

Given a string $S$, the \emph{compressed indexing problem} is to preprocess $S$ into a compressed representation that supports fast \emph{substring queries}. The goal is to use little space relative to the compressed size of $S$ while supporting fast queries. We present a compressed index based on the Lempel--Ziv 1977 compression scheme. We obtain the following time-space trade-offs: For constant-sized alphabets; (i) $O(m + occ \lg\lg n)$ time using $O(z\lg(n/z)\lg\lg z)$ space, or (ii) $O(m(1 + \frac{\lg^\epsilon z}{\lg(n/z)}) + occ(\lg\lg n + \lg^\epsilon z))$ time using $O(z\lg(n/z))$ space. For integer alphabets polynomially bounded by $n$; (iii) $O(m(1 + \frac{\lg^\epsilon z}{\lg(n/z)}) + occ(\lg\lg n + \lg^\epsilon z))$ time using $O(z(\lg(n/z) + \lg\lg z))$ space, or (iv) $O(m + occ(\lg\lg n + \lg^{\epsilon} z))$ time using $O(z(\lg(n/z) + \lg^{\epsilon} z))$ space, where $n$ and $m$ are the length of the input string and query string respectively, $z$ is the number of phrases in the LZ77 parse of the input string, $occ$ is the number of occurrences of the query in the input and $\epsilon > 0$ is an arbitrarily small constant. In particular, (i) improves the leading term in the query time of the previous best solution from $O(m\lg m)$ to $O(m)$ at the cost of increasing the space by a factor $\lg \lg z$. Alternatively, (ii) matches the previous best space bound, but has a leading term in the query time of $O(m(1+\frac{\lg^{\epsilon} z}{\lg (n/z)}))$. However, for any polynomial compression ratio, i.e., $z = O(n^{1-\delta})$, for constant $\delta > 0$, this becomes $O(m)$. Our index also supports extraction of any substring of length $\ell$ in $O(\ell + \lg(n/z))$ time. Technically, our results are obtained by novel extensions and combinations of existing data structures of independent interest, including a new batched variant of weak prefix search.

Philip Bille Mikko Berggren Ettienne Inge Li Gørtz Hjalte Wedel Vildhøj

Let $F(z)=z-H(z)$ with order $o(H(z))\geq 1$ be a formal map from $\bC^n$ to $\bC^n$ and $G(z)$ the formal inverse map of $F(z)$. We first study the deformation $F_t(z)=z-tH(z)$ of $F(z)$ and its formal inverse $G_t(z)=z+tN_t(z)$. (Note that $G_{t=1}(z)=G(z)$ when $o(H(z))\geq 2$.) We show that $N_t(z)$ is the unique power series solution of a Cauchy problem of a PDE, from which we derive a recurrent formula for $G_t(z)$. Secondly, motivated by the gradient reduction obtained by M. de Bondt, A. van den Essen \cite{BE1} and G. Meng \cite{M} for the Jacobian conjecture, we consider the formal maps $F(z)=z-H(z)$ satisfying the gradient condition, i.e. $H(z)=\nabla P(z)$ for some $P(z)\in \bC[[z]]$ of order $o(P(z))\geq 2$. We show that, under the gradient condition, $N_t(z)=\nabla Q_t(z)$ for some $Q_t(z)\in \bC[[z, t]]$ and the PDE satisfied by $N_t(z)$ becomes the $n$-dimensional inviscid Burgers' equation, from which a recurrent formula for $Q_t(z)$ also follows. Furthermore, we clarify some close relationships among the inversion problem, Legendre transform and the inviscid Burgers' equations. In particular the Jacobian conjecture is reduced to a problem on the inviscid Burgers' equations. Finally, under the gradient condition, we derive a binary rooted tree expansion inversion formula for $Q_t(z)$. The recurrent inversion formula and the binary rooted tree expansion inversion formula derived in this paper can also be used as computational algorithms for solutions of certain Cauchy problems of the inviscid Burgers' equations and Legendre transforms of the power series $f(z)$ of $o(f(z))\geq 2$.

Wenhua Zhao

M. Biernacki gave concrete forms of the variability regions of $z/f(z)$ and $zf'(z)/f(z)$ of close-to-convex functions $f$ for a fixed $z$ with $|z|<1$ in 1936. The forms are, however, not necessarily convenient to determine the shape of the full variability region of $zf'(z)/f(z)$ over all close-to-convex functions $f$ and all points $z$ with $|z|<1.$ We will propose a couple of other forms of the variability regions and see that the full variability region of $zf'(z)/f(z)$ is indeed the complex plane minus the origin. We also apply them to study the variability regions of $\log[z/f(z)]$ and $\log[zf'(z)/f(z)].$

Takao Kato Toshiyuki Sugawa Li-Mei Wang