Related papers: Comparison between the first Steklov eigenvalue an…
In this article the authors continue the discussion in \cite{ALM} about inverse problems for second order elliptic and hyperbolic equations on metric trees from boundary measurements. In the present paper we prove the identifiability of…
We prove that every oriented tree on $n$ vertices with bounded maximum degree appears as a spanning subdigraph of every directed graph on $n$ vertices with minimum semidegree at least $n/2+o(n)$. This can be seen as a directed graph…
We show that trees and their products meet octahedron comparison.
We characterise the bracketing identities satisfied by linear quasigroups with the help of certain equivalence relations on binary trees that are based on the left and right depths of the leaves modulo some integers. The numbers of…
Rotation distances measure the differences in structure between rooted ordered binary trees. The one-dimensional skeleta of associahedra are rotation graphs, where two vertices representing trees are connected by an edge if they differ by a…
Inspired by the Li--Yau eigenvalue-diameter estimates, we investigate lower bounds for the first Dirichlet eigenvalue in terms of the diameter (or inscribed radius) of a graph. Let $G = (V, E)$ be a graph with boundary $B$. Assume that the…
An automaton is called reachable if every state is reachable from the initial state. This notion has been generalized coalgebraically in two ways: first, via a universal property on pointed coalgebras, namely, that a reachable coalgebra has…
Haagerup's inequality for convolvers on free groups may be interpreted as a result on $\tA_1$ buildings, i.e. trees. Here are proved analogous inequalities for discrete groups acting freely on the vertices of $\tA_1\times\tA_1$ and $\tA_2$…
Choi-Wang obtained a lower bound of the first eigenvalue of the Laplacian on closed minimal hypersurfaces. On minimal hypersurfaces with boundary, Fraser-Li established an inequality giving a lower bound of the first Steklov eigenvalue as a…
We prove a Matrix-Tree Theorem enumerating the spanning trees of a cell complex in terms of the eigenvalues of its cellular Laplacian operators, generalizing a previous result for simplicial complexes. As an application, we obtain explicit…
For $d\ge 2$ and an odd prime power $q$, consider the vector space $\mathbb{F}_q^d$ over the finite field $\mathbb{F}_q$, where the distance between two points $(x_1,\ldots,x_d)$ and $(y_1,\ldots,y_d)$ is defined as $\sum_{i=1}^d…
We prove two upper bounds for the Steklov eigenvalues of a compact Riemannian manifold with boundary. The first involves the volume of the manifold and of its boundary, as well as packing and volume growth constants of the boundary and its…
We investigate the relationship between the Neumann and Steklov principal eigenvalues emerging from the study of collapsing convex domains in $\mathbb{R}^2$. Such a relationship allows us to give a partial proof of a conjecture concerning…
We consider Steklov eigenvalues of nearly circular domains in $\R^{2}$ of fixed unitary area. In \cite{viator2018}, the authors treated such domains as perturbations of the disk, and they computed the first-order term of the asymptotic…
We consider stochastic processes with (or without) memory whose evolution is encoded by a finite or infinite rooted tree. The main goal is to compare the entropy rates of a given base process and a second one, to be considered as a…
This paper investigates spectral properties of the deformed Laplacian matrix, which merges the Laplacian and signless Laplacian matrices of a graph through a one-parameter family of matrices. We present general results on the eigenvalues of…
On a finite connected metric graph, we establish upper bounds for the eigenvalues of the Laplacian. These bounds depend on the length, the Betti number, and the number of pendant vertices. For trees, these estimates are sharp. We also…
For a graph $G$, let $L(G)$ and $Q(G)$ be the Laplacian and signless Laplacian matrices of $G$, respectively, and $\tau(G)$ be the number of spanning trees of $G$. We prove that if $G$ has an odd number of vertices and $\tau(G)$ is not…
We introduce a new biharmonic Steklov problem on differential forms with Dirichlet-type boundary conditions and show that it is elliptic. We prove the existence of a discrete spectrum for this problem and give variational characterizations…
Cartesian product networks are always regarded as a tool for ``combining'' two given networks with established properties to obtain a new one that inherits properties from both. For a graph $F=(V,E)$ and a set $S\subseteq V(F)$ of at least…