Related papers: Upper bounds for the Steklov eigenvalues on trees

In this paper, we study some spanning trees with bounded degree and leaf degree from eigenvalues. For any integer $k\geq2$, a $k$-tree is a spanning tree in which every vertex has degree no more than $k$. Let $T$ be a spanning tree of a…

We study questions inspired by Erd\H os' celebrated distance problems with dot products in lieu of distances, and for more than a single pair of points. In particular, we study point configurations present in large finite point sets in the…

We study infinite tree and ultrametric matrices, and their action on the boundary of the tree. For each tree matrix we show the existence of a symmetric random walk associated to it and we study its Green potential. We provide a…

In this note we study the eigenvalue growth of infinite graphs with discrete spectrum. We assume that the corresponding Dirichlet forms satisfy certain Sobolev-type inequalities and that the total measure is finite. In this sense, the…

The occurrence and the distribution of patterns of trees associated to natural numbers are investigated. Bounds from above and below are proven for certain natural quantities.

A weighted recursive tree is an evolving tree in which vertices are assigned random vertex-weights and new vertices connect to a predecessor with a probability proportional to its weight. Here, we study the maximum degree and near-maximum…

Let $G$ be a nontrivial graph with minimum degree $\delta$ and $k$ an integer with $k\ge 2$. In the literature, there are eigenvalue conditions that imply $G$ contains $k$ edge-disjoint spanning trees. We give eigenvalue conditions that…

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…

This is a continuation of our previous work arXiv:1601.05617 on trace and inverse trace of Steklov eigenvalues. More new inequalities for the trace and inverse trace of Steklov eigenvalues are obtained.

In this paper, we extend a lower bound estimate for Steklov eigenvalues by Perrin \cite{Pe} on unit-weighted graphs to general weighted graphs and characterise its rigidity.

We consider the problem of computing the measure of a regular language of infinite binary trees. While the general case remains unsolved, we show that the measure of a language defined by a first-order formula with no descendant relation or…

We establish in this paper an upper bound on the second eigenvalue of n-dimensional spheres in the conformal class of the round sphere. This upper bound holds in all dimensions and is asymptotically sharp as the dimension increases.

In the present paper, we study the variational properties of Steklov transmission eigenvalues, which can be seen as eigenvalues of the sum of two Dirichlet-to-Neumann operators on two different sides of a given curve contained in a surface.…

We study the eigenvalues of the Dirichlet-to-Neumann operator on a finite subgraph of the integer lattice Zn. We estimate the first n+1 eigenvalues using the number of vertices of the subgraph. As a corollary, we prove that the first…

We consider a variant of the classic Steklov eigenvalue problem, which arises in the study of the best trace constant for functions in Sobolev space. We prove that the elementary symmetric functions of the eigenvalues depend…

We analyze the eigenvalues of the adjacency matrices of a wide variety of random trees. Using general, broadly applicable arguments based on the interlacing inequalities for the eigenvalues of a principal submatrix of a Hermitian matrix and…

We prove some Liouville type theorems on smooth compact Riemannian manifolds with nonnegative sectional curvature and strictly convex boundary. This gives a nonlinear generalization in low dimension of the recent sharp lower bound of the…

A rigorous way to obtain sharp bounds for Stokes constants is introduced and illustrated on a concrete problem arising in applications.

We introduce a graph $\Gamma$ which is roughly isometric to the hyperbolic plane and we study the Steklov eigenvalues of a subgraph with boundary $\Omega$ of $\Gamma$. For $(\Omega_l)_{l\geq 1}$ a sequence of subraphs of $\Gamma$ such that…

We prove that the Weinstock inequality for the first nonzero Steklov eigenvalue holds in $\mathbb{R}^n$, for $n\ge 3$, in the class of convex sets with prescribed surface area. The key result is a sharp isoperimetric inequality involving…