惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

C
Check Point Blog
罗磊的独立博客
量子位
Microsoft Azure Blog
Microsoft Azure Blog
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
J
Java Code Geeks
M
MIT News - Artificial intelligence
月光博客
月光博客
IT之家
IT之家
D
DataBreaches.Net
A
About on SuperTechFans
博客园 - 三生石上(FineUI控件)
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
Last Week in AI
Last Week in AI
D
Docker
The GitHub Blog
The GitHub Blog
B
Blog
V
Visual Studio Blog
博客园 - Franky
N
Netflix TechBlog - Medium
博客园 - 【当耐特】
Martin Fowler
Martin Fowler
博客园 - 聂微东
U
Unit 42

math.CO updates on arXiv.org

Complement Submodular Information Measures for Balanced and Robust Data Selection A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs Laplacian Spectrum of the Weakly Zero-Divisor Graph of a Finite Commutative Ring An identity for second Eulerian numbers via lattice-point counting $t$-tone edge coloring of graphs Constructing Maximal Bumpless Pipedreams for Double Grothendieck Polynomials Mubayi's Polynomial-Ideal Conjecture and Cover-Ideal Turán Methods Implicit Binarization via Complex Phase Dynamics in Combinatorial Optimization The limits of Schur multipliers in Pólya conversion problems for the $q$-permanent function Universality theorems for generalized splines Framing Triangulations for Arbitrary Integer Flow Polytopes On the Common Generalization of Gentle Algebras and Framed Directed Acyclic Graphs The complexity of frugal digraph homomorphisms Chaotic and periodic behavior of jeu de taquin on infinite Young tableaux Enumerating Pattern Avoiding Parking Functions Incidence toric ideals and three-point functions Unique Winning Opening Move in Three-Row Chomp Strong majority colorings of graphs A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs Spectral radius and edge-disjoint connected factors of graphs New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256 Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles Balanced intersection size distributions in projective planes List Reconstruction Problem with List Size Two Is Dimensionality a Barrier for Retrieval Models? The INIEP: Irreducible and Positive Realizations The number of Pfaffian orientations on punctured polygonally cellulated surfaces Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern Finite-state enumeration of adjacency-constrained 132-avoiding permutations AMDS and quantum AMDS Constacyclic codes of length $4p^ς$ over $\mathbb{F}_{{p}^{m}}$
On adjacency operators of locally finite graphs
Vladimir I. Trofimov · 2022-08-03 · via math.CO updates on arXiv.org

A graph $Γ$ is called locally finite if, for each vertex $v$ of $Γ$, the set $Γ(v)$ of all neighbors of $v$ in $Γ$ is finite. For any locally finite graph $Γ$ with vertex set $V(Γ)$ and for any field $F$, let $F^{V(Γ)}$ be the vector space over $F$ of all functions $V(Γ) \to F$ (with natural componentwise operations) and let $A^{({\rm alg})}_{Γ,F}$ be the linear operator $F^{V(Γ)} \to F^{V(Γ)}$ defined by $(A^{({\rm alg})}_{Γ,F}(f))(v) = \sum_{u \in Γ(v)}f(u)$ for all $f \in F^{V(Γ)}$, $v \in V(Γ)$. In the case of finite graph $Γ$ the mapping $A^{({\rm alg})}_{Γ,F}$ is the well known operator defined by the adjacency matrix of $Γ$ (over $F$), and the theory of eigenvalues and eigenfunctions of such operator is a well-developed (at least in the case $F = \mathbb{C}$) part of the theory of finite graphs. In this paper we develope a theory of eigenvalues and eigenfunctions of $A^{({\rm alg})}_{Γ,F}$ for arbitrary infinite locally finite graphs $Γ$ (although a few results may be of interest for finite graphs) and fields $F$ with a special emphasis on the case when $Γ$ is connected with uniformly bounded vertex degrees and $F = \mathbb{C}$. By the author opinion, previous attempts in this direction were not quite satisfactory since were limited by consideration of rather special eigenfunctions and corresponding eigenvalues.