Related papers: On Fredholm determinants in topology
Consider the classical action of ${\rm GL}_n$ on a sum of $q$ copies of the defining representation and $p$ copies of its dual; by Howe duality, the polynomial functions on this space decompose under the joint action of ${\rm GL}_n$ and…
This note is concerned with series of the forms $\sum f(a^n)$ and $\sum f(n^{-a})$ where f(a) possesses a Mellin transform and $a > 1$ or $a<0$ respectively. Integral representations are derived and used to transform these series in several…
Given a graph and one of its weighted Laplacian matrix, a Fiedler vector is an eigenvector with respect to the second smallest eigenvalue. The Fiedler vectors have been used widely for graph partitioning, graph drawing, spectral clustering,…
The topological invariant responsible for the stability of Fermi point/Fermi surface in homogeneous systems is expressed through the one particle Green function, which depends on momentum. It is given by an integral over the 3D hypersurface…
Broadhurst conjectured that the Feynman integral associated to the polynomial corresponding to $t=1$ in the one-parameter family $(1+x_1+x_2+x_3)(1+x_1^{-1}+x_2^{-1}+x_3^{-1})-t$ is expressible in terms of $L(f,2),$ where $f$ is a cusp form…
We develop a topological lens on relational schema design by encoding functional dependencies (FDs) as simplices of an abstract simplicial complex. This dependency complex exposes multi-attribute interactions and enables homological…
Let $\alpha\colon G\curvearrowright A$ be an action of a countable discrete group on a separable unital $C^*$-algebra. We study the simplex $\mathrm{T}(A)^G$ of $G$-invariant traces and ask when it is Bauer. Our main result is a…
A finite abstract simplicial complex G defines the Barycentric refinement graph phi(G) = (G,{ (a,b), a subset b or b subset a }) and the connection graph psi(G) = (G,{ (a,b), a intersected with b not empty }). We note here that both…
Let $G$ be a finite simple graph. The line graph $L(G)$ represents the adjacencies between edges of $G$. We define first the line simplicial complex $\Delta_L(G)$ of $G$ containing Gallai and anti-Gallai simplicial complexes…
In the setting of several commuting operators on a Hilbert space one defines the notions of invertibility and Fredholmness in terms of the associated Koszul complex. The index problem then consists of computing the Euler characteristic of…
We give a geometric construction of the W_{1+infty} vertex algebra as the infinitesimal form of a factorization structure on an adelic Grassmannian. This gives a concise interpretation of the higher symmetries and Backlund-Darboux…
We characterize the irreducible polynomials that occur as a characteristic polynomial of an automorphism of an even unimodular lattice of given signature, generalizing a theorem of Gross and McMullen. As part of the proof, we give a general…
This chapter describes topological (Dirac and Weyl) semimetals from the viewpoint of their observable electromagnetic response. We argue that this response may be represented by topological terms with unquantized (non-integer) coefficients…
The concept and the construction of modular graph functions are generalized from genus-one to higher genus surfaces. The integrand of the four-graviton superstring amplitude at genus-two provides a generating function for a special class of…
The algebraic connectivity $a(G)$, defined as the second smallest eigenvalue of the Laplacian matrix $L(G)$, admits a well-known variational characterization involving the minimization of a quadratic form subject to an $\ell_{2}$-norm…
The probability that an interval $I$ is free of eigenvalues in a matrix ensemble with unitary symmetry is given by a Fredholm determinant. When the weight function in the matrix ensemble is a classical weight function, and the interval $I$…
Let Gamma be a Q-polynomial distance-regular graph with vertex set X, diameter D geq 3 and adjacency matrix A. Fix x in X and let A*=A*(x) be the corresponding dual adjacency matrix. Recall that the Terwilliger algebra T=T(x) is the…
Let $G$ be a graph and $A$ be its adjacency matrix. A graph $G$ is invertible if its adjacency matrix $A$ is invertible and the inverse of $G$ is a weighted graph with adjacency matrix $A^{-1}$. A signed graph $(G,\sigma)$ is a weighted…
The aim of the present work is to show how, using the differential calculus associated to Dirichlet forms, it is possible to construct Fredholm modules on post critically finite fractals by regular harmonic structures. The modules are…
An unorthodox unified theory is developed to describe external and internal attributes and symmetries of fundamental fermions, quarks and leptons. Basic ingredients of the theory are an algebra which consists of all the…