Related papers: On reduction for eigenfunctions of graphs

We consider immersions admitting uniform graph representations over the affine tangent space over a ball of fixed radius r>0. We show that for sufficiently small C^0-norm of the graph functions, each graph function is smooth with small…

Let $\mathbb{F}_q$ be a finite field with $q$ elements, $n\geq2$ a positive integer, $\mathbb{V}_0$ a $n$-dimensional vector space over $\mathbb{F}_q$ and $\mathbb{T}_0$ the set of all linear functionals from $\mathbb{V}_0$ to…

Eigenvalues of a graph are the eigenvalues of the corresponding (0,1)-adjacency matrix. The second largest eigenvalue lambda_2 provides significant information on characteristics and structure of graphs. Therefore, finding bounds for…

An asymmetric coloring of a graph is a coloring of its vertices that is not preserved by any non-identity automorphism of the graph. The motion of a graph is the minimal degree of its automorphism group, i.e., the minimum number of elements…

Extending the work of Godsil and others, we investigate the notion of the inverse of a graph (specifically, of bipartite graphs with a unique perfect matching). We provide a concise necessary and sufficient condition for the invertibility…

This is an attempt at a practical and essentially self-contained theory of automorphic representations in the framework $$\hbox{$L^2(\varGamma\backslash\r{G})$ with $\r{G}=\r{PSL}(2,\B{R})$ and $\varGamma=\r{PSL}(2,\B{Z})$.}$$

In this paper, we obtain a lower bound for the smallest eigenvalue of a regular graph containing many copies of a smaller fixed subgraph. This generalizes a result of Aharoni, Alon, and Berger in which the subgraph is a triangle. We apply…

We establish an explicit global spectral decomposition of shifted convolution sums and the second moment of automorphic $L$-functions for Maass forms with explicit integral transforms as well as explicit inversion formulae over every local…

Graph independence (also known as $\epsilon$-independence or $\lambda$-independence) is a mixture of classical independence and free independence corresponding to graph products or groups and operator algebras. Using conjugation by certain…

The purpose of this paper is to constructively develop a Galois theory on irreducible shifts of finite type (SFTs) and to analyze the automorphism groups of SFTs using this framework. Let $X$ and $Y$ be irreducible SFTs. We demonstrate that…

The aim of this note is to prove a representation theorem for left--invariant functionals in Carnot groups. As a direct consequence, we can also provide a $\Gamma$-convergence result for a smaller class of functionals.

One of the central results in the representation theory of distance-regular graphs classifies distance-regular graphs with $\mu\geq 2$ and second largest eigenvalue $\theta_1= b_1-1$. In this paper we give a classification under the…

We describe the application of differential reduction algorithms for Feynman Diagram calculation. We illustrate the procedure in the context of generalized hypergeometric functions, and give an example for a type of q-loop bubble diagram.

A description of group automorphisms of all two-dimensional algebras, considered up to isomorphism, over any basic field is provided.

We give some new bounds for the clique and independence numbers of a graph in terms of its eigenvalues.

Inspired by Franks' classification of irreducible shifts of finite type we provide a short list of allowed moves on graphs that preserves the stable isomorphism class of the associated C*-algebras. We show that if two graphs have stably…

We prove optimality of the Arf invariant formula for the generating function of even subgraphs, or, equivalently, the Ising partition function, of a graph.

A unified framework for the Expander Mixing Lemma for irregular graphs using adjacency eigenvalues is presented, as well as two new versions of it. While the existing Expander Mixing Lemmas for irregular graphs make use of the notion of…

We introduce the notion of a generalized flow on a graph with coefficients in a R-representation and show that the module of flows is isomorphic to the first derived functor of the colimit. We generalize Kirchhoff's laws and build an exact…

Many complex questions in biology, physics, and mathematics can be mapped to the graph isomorphism problem and the closely related graph automorphism problem. In particular, these problems appear in the context of network visualization,…