Related papers: Trees with a large Laplacian eigenvalue multiplici…
One of the main virtues of trees is to represent formal solutions of various functional equations which can be cast in the form of fixed point problems. Basic examples include differential equations and functional (Lagrange) inversion in…
The class of self-nested trees presents remarkable compression properties because of the systematic repetition of subtrees in their structure. In this paper, we provide a better combinatorial characterization of this specific family of…
In this paper, we characterize all connected graphs with exactly three distinct normalized Laplacian eigenvalues of which one is equal to $1$, determine all connected bipartite graphs with at least one vertex of degree $1$ having exactly…
We study properties of eigenvalues of a matrix associated with a randomly chosen partial automorphism of a regular rooted tree. We show that asymptotically, as the numbers of levels goes to infinity, the fraction of non-zero eigenvalues…
We present examples of rooted tree graphs for which the Laplacian has singular continuous spectral measures. For some of these examples we further establish fractional Hausdorff dimensions. The singular continuous components, in these…
The sum of the first $n \geq 1$ eigenvalues of the Laplacian is shown to be maximal among simplexes for the regular simplex (the regular tetrahedron, in three dimensions), maximal among parallelepipeds for the hypercube, and maximal among…
We consider parametric equations driven by the sum of a $p$-Laplacian and a Laplace operator (the so-called $(p,2)$-equations). We study the existence and multiplicity of solutions when the parameter $\lambda>0$ is near the principal…
Any positive power of the Laplacian is related via its Fourier symbol to a hypersingular integral with finite differences. We show how this yields a pointwise evaluation which is more flexible than other notions used so far in the…
The dimensions of sets of matrices of various types, with specified eigenvalue multiplicities, are determined. The dimensions of the sets of matrices with given Jordan form and with given singular value multiplicities are also found. Each…
We present here another proof of Oscar Rojo's theorems about the spectrum of graph Laplacian on certain balanced trees, by taking advantage of the symmetry properties of the trees in question, and looking into the eigenfunctions of…
We consider two eigenvalue problems for Laplacian on some specific doubly connected domain. In particular, we study the following two eigenvalue problems. Let $B_1$ be an open ball in $\mathbb{R}^n$ and $B_0$ be a ball contained in $B_1$.…
We consider a compact Riemannian manifold M endowed with a potential 1-form A and study the magnetic Laplacian associated with those data (with Neumann magnetic boundary condition if the bpoundary of M is not empty). We first establish a…
We study the maximal Steklov eigenvalues of trees with given number of boundary vertices and total number of vertices. Trees can be regarded as discrete analogue of Hadamard manifolds, namely simply-connected Riemannian manifolds of…
The Matrix-Tree Theorem states that the number of spanning trees of a graph is given by the absolute value of any cofactor of the Laplacian matrix of the graph. We propose a very short proof of this result which amounts to comparing Taylor…
Let $G$ be a connected tree on $n$ vertices and let $L = D-A$ denote the Laplacian matrix on $G$. The second-smallest eigenvalue $\lambda_{2}(G) > 0$, also known as the algebraic connectivity, as well as the associated eigenvector $\phi_2$…
In this paper, we use a new and correct method to determine the $n$-vertex $k$-trees with the first three largest signless Laplacian indices.
(DRAFT VERSION) In this article we present a proof of the famous Kirchoff's Matrix-Tree theorem, which relates the number of spanning trees in a connected graph with the cofactors (and eigenvalues) of its combinatorial Laplacian matrix.…
We consider a network of interconnected dynamical systems. Spectral network identification consists in recovering the eigenvalues of the network Laplacian from the measurements of a very limited number (possibly one) of signals. These…
A theorem of Strichartz states that if a uniformly bounded bi-infinite sequence of functions on the Euclidean spaces, satisfies the condition that the Laplacian acting on a function in this sequence yields the next one, then each function…
We introduce an efficient way, called Newton algorithm, to study arbitrary ideals in C[[x,y]], using a finite succession of Newton polygons. We codify most of the data of the algorithm in a useful combinatorial object, the Newton tree. For…