Motivated by the works of Liu, we provide a unified approach to find Appell-Lerch series and Hecke-type series representations for mock theta functions. We establish a number of parameterized identities with two parameters $a$ and $b$. Specializing the choices of $(a,b)$, we not only give various known and new representations for the mock theta functions of orders 2, 3, 5, 6 and 8, but also present many other interesting identities. We find that some mock theta functions of different orders are related to each other, in the sense that their representations can be deduced from the same $(a,b)$-parameterized identity. Furthermore, we introduce the concept of false Appell-Lerch series. We then express the Appell-Lerch series, false Appell-Lerch series and Hecke-type series in this paper using the building blocks $m(x,q,z)$ and $f_{a,b,c}(x,y,q)$ introduced by Hickerson and Mortenson, as well as $\overline{m}(x,q,z)$ and $\overline{f}_{a,b,c}(x,y,q)$ introduced in this paper. We also show the equivalences of our new representations for several mock theta functions and the known representations.

Let $f(x)=\sum_{n=0}^{\infty}\frac{1}{n!}q^{n(n-1)/2}x^n$ ($0<q<1$) be the deformed exponential function. It is known that the zeros of $f(x)$ are real and form a negative decreasing sequence $(x_k)$ ($k\ge 1$). We investigate the complete asymptotic expansion for $x_{k}$ and prove that for any $n\ge1$, as $k\to \infty$, \begin{align*} x_k=-kq^{1-k}\Big(1+\sum_{i=1}^{n}C_i(q)k^{-1-i}+o(k^{-1-n})\Big), \end{align*} where $C_i(q)$ are some $q$ series which can be determined recursively. We show that each $C_{i}(q)\in \mathbb{Q}[A_0,A_1,A_2]$, where $A_{i}=\sum_{m=1}^{\infty}m^i\sigma(m)q^m$ and $\sigma(m)$ denotes the sum of positive divisors of $m$. When writing $C_{i}$ as a polynomial in $A_0, A_1$ and $A_2$, we find explicit formulas for the coefficients of the linear terms by using Bernoulli numbers. Moreover, we also prove that $C_{i}(q)\in \mathbb{Q}[E_2,E_4,E_6]$, where $E_2$, $E_4$ and $E_6$ are the classical Eisenstein series of weight 2, 4 and 6, respectively.

Persistent homology is constrained to purely topological persistence, while multiscale graphs account only for geometric information. This work introduces persistent spectral theory to create a unified low-dimensional multiscale paradigm for revealing topological persistence and extracting geometric shapes from high-dimensional datasets. For a point-cloud dataset, a filtration procedure is used to generate a sequence of chain complexes and associated families of simplicial complexes and chains, from which we construct persistent combinatorial Laplacian matrices. We show that a full set of topological persistence can be completely recovered from the harmonic persistent spectra, that is, the spectra that have zero eigenvalues, of the persistent combinatorial Laplacian matrices. However, non-harmonic spectra of the Laplacian matrices induced by the filtration offer another powerful tool for data analysis, modeling, and prediction. In this work, fullerene stability is predicted by using both harmonic spectra and non-harmonic persistent spectra, while the latter spectra are successfully devised to analyze the structure of fullerenes and model protein flexibility, which cannot be straightforwardly extracted from the current persistent homology. The proposed method is found to provide excellent predictions of the protein B-factors for which current popular biophysical models break down.

In this paper, we show that every $(2^{n-1}+1)$-vertex induced subgraph of the $n$-dimensional cube graph has maximum degree at least $\sqrt{n}$. This result is best possible, and improves a logarithmic lower bound shown by Chung, F\"uredi, Graham and Seymour in 1988. As a direct consequence, we prove that the sensitivity and degree of a boolean function are polynomially related, solving an outstanding foundational problem in theoretical computer science, the Sensitivity Conjecture of Nisan and Szegedy.

We study pretty good quantum state transfer (ie, state transfer that becomes arbitrarily close to perfect) between vertices of graphs with an involution in the presence of an energy potential. In particular, we show that if a graph has an involution that fixes at least one vertex or at least one edge, then there exists a choice of potential on the vertex set of the graph for which we get pretty good state transfer between symmetric vertices of the graph. We show further that in many cases, the potential can be chosen so that it is only non-zero at the vertices between which we want pretty good state transfer. As a special case of this, we show that such a potential can be chosen on the endpoints of a path to induce pretty good state transfer in paths of any length. This is in contrast to the result of [6], in which the authors show that there cannot be perfect state transfer in paths of length 4 or more, no matter what potential is chosen.