No abstract uploaded!

We derive bounds for eigenvalues of the Laplacian of graphs using discrete versions of the Sobolev inequalities and heat kernel estimates.

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.

No abstract uploaded!

In 1975, P. Erd\H os proposed the problem of determining the maximum number $f(n)$ of edges in a graph with $n$ vertices in which any two cycles are of different lengths. The sequence $(c_1,c_2,\cdots,c_n)$ is the cycle length distribution of a graph $G$ of order $n$， where $c_i$ is the number of cycles of length $i$ in $G$. Let $f(a_1,a_2,\cdots,$ $a_n)$ denote the maximum possible number of edges in a graph which satisfies $c_i\leq a_i$ where $a_i$ is a nonnegative integer. In 1991, Shi posed the problem of determining $f(a_1,a_2,\cdots,a_n)，$ which extended the problem due to Erd\H os, it is clear that $f(n)=f(1,1,\cdots,1)$. Let $g(n,m)=f(a_1,a_2,\cdots,a_n),$ $a_i=1$ for all $i/m$ be integer, $a_i=0$ for all $i/m$ be not integer. It is clear that $f(n)=g(n,1)$. We prove that $\liminf\sb {n \to \infty} {f(n)-n \over \sqrt n} \geq \sqrt {2 + \frac{40}{99}},$ which is better than the previous bounds $\sqrt 2$ (Shi, 1988), $\sqrt {2 + \frac{7654}{19071}}$ (Lai, 2017). We show that $\liminf_{n \rightarrow \infty} {g(n,m)-n\over \sqrt \frac{n}{m}} > \sqrt {2.444},$ for all even integers $m$. We make the following conjecture: $\liminf\sb {n \to \infty} {f(n)-n \over \sqrt n} > \sqrt {2.444}.$