Related papers: On reduction for eigenfunctions of graphs

The paper introduces a general method to construct conformal measures for a local homeomorphism on a locally compact non-compact Hausdorff space, subject to mild irreducibility-like conditions. Among others the method is used to give…

In this paper, we show that a connected graph with smallest eigenvalue at least -3 and large enough minimal degree is 2-integrable. This result generalizes a 1977 result of Hoffman for connected graphs with smallest eigenvalue at least -2.

The aim of this short note is to show how to construct a rationnal Remmert reduction for the universal cover of a smooth K\"ahler orbifold. Doins this, we are led to introduce some singular K\"ahler metrics adapted to the orbifold…

We consider vertex decompositions of (di)graphs which appear in Automata Theory, and establish some their properties. Then we apply them to the problem of forbidden subgraphs.

In a previous work, the second-named author gave a complete description of the action of automorphisms on the ordinary irreducible characters of the finite symplectic groups. We generalise this in two directions. Firstly, using work of the…

In part one we prove a theorem about the automorphism of solutions to Ramanujan's differential equations. We also investigate possible applications of the result. In part two we prove a similar theorem about the automorphism of solutions to…

Geometric modeling by constraints leads to large systems of algebraic equations. This paper studies bipartite graphs underlaid by systems of equations. It shows how these graphs make possible to polynomially decompose these systems into…

We prove an upper bound for the independence number of a graph in terms of the largest Laplacian eigenvalue, and of a certain induced subgraph. Our bound is a refinement of a well-known Hoffman-type bound.

We consider when automorphisms of a graph can be induced by homeomorphisms of embeddings of the graph in a $3$-manifold. In particular, we prove that every automorphism of a graph is induced by a homeomorphism of some embedding of the graph…

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…

Eigenvalues inequalities involving (log) convex/concav functions and Hermitian matrices, positive unital maps are considered. Simple proofs of Bhatia-Kittaneh inequality and Naimark dilation theorem are given.

Two emerging topics in graph theory are the study of cospectral vertices of a graph, and the study of isospectral reductions of graphs. In this paper, we prove a fundamental relationship between these two areas, which is that two vertices…

The reduced norm-one group G of a central simple algebra is an inner form of the special linear group, and an involution on the algebra induces an automorphism of G. We study the action of such automorphisms in the cohomology of arithmetic…

Modular graph forms are a class of modular covariant functions which appear in the genus-one contribution to the low-energy expansion of closed string scattering amplitudes. Modular graph forms with holomorphic subgraphs enjoy the…

Graph C*-algebras have been celebrated as C*-algebras that can be seen, because many important properties may be determined by looking at the underlying graph. This paper introduces the permutation graph for a permutative endomorphism of a…

Recently Bowden, Hensel and Webb defined the fine curve graph for surfaces, extending the notion of curve graphs for the study of homeomorphism or diffeomorphism groups of surfaces. Later Long, Margalit, Pham, Verberne and Yao proved that…

We prove that certain classes of metrically homogeneous graphs omitting triangles of odd short perimeter as well as triangles of long perimeter have the extension property for partial automorphisms and we describe their Ramsey expansions.

In the present paper, we examine in detail the method of "graph compactifications" of topological groups. The graph and Ellis methods of constructing proper compactifications of topological groups are applied for the investigation of…

From a spectral identity we obtain asymptotics with error term for the second integral moments of families of automorphic L-functions for GL(2) over an arbitrary number field according to twists by idele characters with arbitrary…

Motivated by circle graphs, and the enumeration of Euler circuits, we define a one-variable ``interlace polynomial'' for any graph. The polynomial satisfies a beautiful and unexpected reduction relation, quite different from the cut and…