English
Related papers

Related papers: Harmonic analysis invariants for infinite graphs v…

200 papers

In this paper, we introduce a magneto-spectral invariant for finite graphs. This invariant vanishes on trees and is maximized by complete graphs. We compute this invariant for cycles, complete graphs, wheel graphs, hypercubes, complete…

Spectral Theory · Mathematics 2025-12-30 Chunyang Hu , Bobo Hua , Supanat Kamtue , Shiping Liu , Florentin Münch , Norbert Peyerimhoff

We analyse the asymptotic symmetries of Maxwell theory at spatial infinity through the Hamiltonian formalism. Precise, consistent boundary conditions are explicitly given and shown to be invariant under asymptotic angle-dependent…

High Energy Physics - Theory · Physics 2018-05-30 Marc Henneaux , Cédric Troessaert

We review recent probabilistic results on covariant Schr\"odinger operators on vector bundles over (possibly locally infinite) weighted graphs, and explain applications like semiclassical limits. We also clarify the relationship between…

Mathematical Physics · Physics 2014-05-06 Batu Güneysu , Ognjen Milatovic

Graphons are infinite-dimensional objects that represent the limit of convergent sequences of graphs as their number of nodes goes to infinity. This paper derives a theory of graphon signal processing centered on the notions of graphon…

Signal Processing · Electrical Eng. & Systems 2023-12-18 Luana Ruiz , Luiz F. O. Chamon , Alejandro Ribeiro

Indicial operators are model operators associated to an elliptic differential operator near a corner singularity on a stratified manifold. These model operators are defined on generalized tangent cone configurations and exhibit a natural…

Analysis of PDEs · Mathematics 2021-07-06 Thomas Krainer

In finite graphs, finite-order tangles offer an abstract description of highly connected substructures. In infinite graphs, infinite-order tangles compactify the graphs in the same way the ends compactify connected locally finite graphs.…

Combinatorics · Mathematics 2019-08-28 Jan Kurkofka

Let $E$ and $F$ be Hilbert $C^*$-modules over a $C^*$-algebra $\CAlg{A}$. New classes of (possibly unbounded) operators $t:E\to F$ are introduced and investigated. Instead of the density of the domain $\Def(t)$ we only assume that $t$ is…

Operator Algebras · Mathematics 2015-07-09 René Gebhardt , Konrad Schmüdgen

We define a range of new coarse geometric invariants based on various graph-theoretic measures of complexity for finite graphs, including: treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these…

Metric Geometry · Mathematics 2025-08-07 Wanying Huang , David Hume , Samuel J. Kelly , Ryan Lam

Affiliated and normal operators in octonion Hilbert spaces are studied. Theorems about their properties and of related algebras are demonstrated. Spectra of unbounded normal operators are investigated.

Functional Analysis · Mathematics 2018-12-18 S. V. Ludkovsky

We study indecomposable representations of quivers on separable infinite-dimensional Hilbert spaces by bounded operators. We consider a complement of Gabriel's theorem for these representations. Let $\Gamma$ be a finite, connected quiver.…

Operator Algebras · Mathematics 2007-07-09 Masatoshi Enomoto , Yasuo Watatani

We investigate quantum graphs with infinitely many vertices and edges without the common restriction on the geometry of the underlying metric graph that there is a positive lower bound on the lengths of its edges. Our central result is a…

Mathematical Physics · Physics 2018-10-30 Pavel Exner , Aleksey Kostenko , Mark Malamud , Hagen Neidhardt

We focus on two specific generalizations of the chromatic symmetric function: one involving universal graphs and the other concerning vertex-weighted graphs. In this paper, we introduce a unified generalization that incorporates both…

Combinatorics · Mathematics 2025-04-01 Yosuke Sato

Over a $p$-adic local field $F$ of characteristic zero, we develop a new type of harmonic analysis on an extended symplectic group $G={\mathbb G}_m\times{\mathrm Sp}_{2n}$. It is associated to the Langlands $\gamma$-functions attached to…

Number Theory · Mathematics 2021-09-02 Dihua Jiang , Zhilin Luo , Lei Zhang

We provide a complete invariant for graph C*-algebras which are amplified in the sense that whenever there is an edge between two vertices, there are infinitely many. The invariant used is the standard primitive ideal space adorned with a…

Operator Algebras · Mathematics 2013-02-06 Søren Eilers , Efren Ruiz , Adam P. W. Sørensen

We study harmonic morphisms of graphs as a natural discrete analogue of holomorphic maps between Riemann surfaces. We formulate a graph-theoretic analogue of the classical Riemann-Hurwitz formula, study the functorial maps on Jacobians and…

Combinatorics · Mathematics 2007-07-18 Matthew Baker , Serguei Norine

In this paper, we study convex analysis and its theoretical applications. We first apply important tools of convex analysis to Optimization and to Analysis. We then show various deep applications of convex analysis and especially infimal…

Functional Analysis · Mathematics 2013-07-23 Francisco J. Aragón Artacho , Jonathan M. Borwein , Victoria Martín-Márquez , Liangjin Yao

Finite order invariants (Vassiliev invariants) of knots are expressed in terms of weight systems, that is, functions on chord diagrams satisfying the four-term relations. Weight systems have graph analogues, so-called $4$-invariants of…

Combinatorics · Mathematics 2018-06-01 V. I. Zhukov

Initial steps in the study of inner expansion properties of infinite Cayley graphs and other infinite graphs, such as hyperbolic ones, are taken, in a flavor similar to the well-known Lipton-Tarjan square root separation result for planar…

Metric Geometry · Mathematics 2011-09-14 Itai Benjamini , Oded Schramm , Adam Timar

A Riemann-Roch theorem on graph was initiated by M. Baker and S. Norine. In their article [2], a Riemann-Roch theorem on a finite graph with uniform vertex-weight and uniform edge-weight was established and it was suggested a Riemann-Roch…

Combinatorics · Mathematics 2022-01-20 Atsushi Atsuji , Hiroshi Kaneko

Determining the Shannon capacity of graphs is a long-standing open problem in information theory, graph theory and combinatorial optimization. Over decades, a wide range of upper and lower bound methods have been developed to analyze this…

Combinatorics · Mathematics 2024-04-26 David de Boer , Pjotr Buys , Jeroen Zuiddam