Related papers: The number of Hecke eigenvalues of same signs
This paper studies eigenvalues of the buckling problem of arbitrary order on bounded domains in Euclidean spaces and spheres. We prove universal bounds for the k-th eigenvalue in terms of the lower ones independent of the domains. Our…
In this note, we present the determinant, the inverse and a lower bound for the smallest eigenvalue for some Hankel matrices
We give improved uniform estimates for the rate of convergence to Plancherel measure of Hecke eigenvalues of holomorphic forms of weight 2 and level N. These are applied to determine the sharp cutoff for the non-backtracking random walk on…
The standard approach to evaluate Hecke eigenvalues of a Siegel modular eigenform F is to determine a large number of Fourier coefficients of F and then compute the Hecke action on those coefficients. We present a new method based on the…
Let $f$ be a holomorphic or Maass Hecke cusp form for the full modular group and write $\lambda_f(n)$ for the corresponding Hecke eigenvalues. We are interested in the signs of those eigenvalues. In the holomorphic case, we show that for…
We obtain sharp lower bounds for the first eigenvalue of four types of eigenvalue problem defined by the bi-Laplace operator on compact manifolds with boundary and determine all the eigenvalues and the corresponding eigenfunctions of a…
In this paper we characterise the indeterminate case by the eigenvalues of the Hankel matrices being bounded below by a strictly positive constant. An explicit lower bound is given in terms of the orthonormal polynomials and we find…
We determine the asymptotic behavior of the coefficients of Hecke polynomials. In particular, this allows us to determine signs of these coefficients when the level or the weight is sufficiently large. In all but finitely many cases, this…
For a given complex square matrix $A$ with constant row sum, we establish two new eigenvalue inclusion sets. Using these bounds, first we derive bounds for the second largest and smallest eigenvalues of adjacency matrices of $k$-regular…
In this paper, we obtain a sharp upper bound for the sum of the first $k$-th eigenvalues for this Dirichlet problem of poly-Laplacian with any order, which is viewed as an extension of the result due to Cheng and Wei (Journal of…
Shifted convolution sums play a prominent r\^ole in analytic number theory. We investigate pointwise bounds, mean-square bounds, and average bounds for shifted convolution sums for Hecke eigenforms.
We prove some upper bounds for the Dirichlet eigenvalues of a class of fully nonlinear elliptic equations, namely the Hessian equations
In this article, we investigate large prime factors of Fourier coefficients of non-CM normalized cuspidal Hecke eigenforms in short intervals. One of the new ingredients involves deriving an explicit version of Chebotarev density theorem in…
We give lower bounds for the first non-zero Steklov eigenvalue on connected graphs. These bounds depend on the extrinsic diameter of the boundary and not on the diameter of the graph. We obtain a lower bound which is sharp when the cardinal…
In this paper, we give estimates for both upper and lower bounds of eigenvalues of a simple matrix. The estimates are shaper than the known results.
For signed graphs we provide a cubic polynomial upper bound on the multiplicity of its eigenvalues. We show that this bound is sharp by providing examples of signed graphs in which it is attained. We also discuss particular cases in which…
We investigate some key analytic properties of Fourier coefficients and Hecke eigenvalues attached to scalar-valued Siegel cusp forms $F$ of degree 2, weight $k$ and level $N$. First, assuming that $F$ is a Hecke eigenform that is not of…
Eigenvalue estimates that are optimal in some sense have self-evident appeal and leave estimators with a sense of virtue and economy. So, it is natural that ongoing searches for effective strategies for difficult tasks such as estimating…
We study the minimum number of distinct eigenvalues over a collection of matrices associated with a graph. Lower bounds are derived based on the existence or non-existence of certain cycle(s) in a graph. A key result proves that every…
We study the rate of convergence for (variational) eigenvalues of several non-linear problems involving oscillating weights and subject to different kinds of boundary conditions in bounded domains.