Related papers: Canonical forms of metric graph eikonal algebra an…
An A-infinity algebra is a generalization of a associative algebra, and an L-infinity algebra is a generalization of a Lie algebra. In this paper, we show that an L-infinity algebra with an invariant inner product determines a cycle in the…
We propose a simple and efficient local algorithm for graph isomorphism which succeeds for a large class of sparse graphs. This algorithm produces a low-depth canonical labeling, which is a labeling of the vertices of the graph that…
We develop an algebraic version of Cartan method of equivalence or an analog of Tanaka prolongation for the (extrinsic) geometry of curves of flags of a vector space $W$ with respect to the action of a subgroup $G$ of the $GL(W)$. Under…
The representation of the resolvent as an integral operator, the $m$ function, and the associated spectral representation are fundamental topics in the spectral theory of self-adjoint ordinary differential operators. Versions of these are…
For a graph $G$ and integer $k\geq1$, we define the token graph $F_k(G)$ to be the graph with vertex set all $k$-subsets of $V(G)$, where two vertices are adjacent in $F_k(G)$ whenever their symmetric difference is a pair of adjacent…
We define, for any graph $G=(V,E)$, a boundary $\partial G \subseteq V$. The definition coincides with what one would expected for the discretization of (sufficiently nice) Euclidean domains and contains all vertices from the…
The numerical range of a matrix is studied geometrically via the cone of positive semidefinite matrices (or semidefinite cone for short). In particular it is shown that the feasible set of a two-dimensional linear matrix inequality (LMI),…
The numerical range of a matrix is studied geometrically via the cone of positive semidefinite matrices (or semidefinite cone for short). In particular it is shown that the feasible set of a two-dimensional linear matrix inequality (LMI),…
We compute a canonical circular-arc representation for a given circular-arc (CA) graph which implies solving the isomorphism and recognition problem for this class. To accomplish this we split the class of CA graphs into uniform and…
To each finite frame $\varphi$ in an inner product space $\mathcal{H}$ we associate a simple graph $G(\varphi)$, called {\it frame graph}, with the vectors of the frame as vertices and there is an edge between vertices $f$ and $g$ provided…
We prove that unital graph C*-algebras often admit a convenient decomposition into amalgamated free products. We use this to give a complete characterization of when a unital graph C*-algebra is residually finite-dimensional and when it is…
In this paper we define a pair of faithful functors that map isomorphic and isotopic finite-dimensional algebras over finite fields to isomorphic graphs. These functors reduce the cost of computation that is usually required to determine…
The domination number $\gamma(G)$ of a graph $G$, its exponential domination number $\gamma_e(G)$, and its porous exponential domination number $\gamma_e^*(G)$ satisfy $\gamma_e^*(G)\leq \gamma_e(G)\leq \gamma(G)$. We contribute results…
In the $(G,H)$-isomorphism game, a verifier interacts with two non-communicating players (called provers) by privately sending each of them a random vertex from either $G$ or $H$, whose aim is to convince the verifier that two graphs $G$…
We prove a categorical duality between a class of abstract algebras of partial functions and a class of (small) topological categories. The algebras are the isomorphs of collections of partial functions closed under the operations of…
We investigate conditions on a graph $C^*$-algebra for the existence of a faithful semifinite trace. Using such a trace and the natural gauge action of the circle on the graph algebra, we construct a smooth $(1,\infty)$-summable semfinite…
A Mauldin-Williams graph $\mathcal{M}$ is a generalization of an iterated function system by a directed graph. Its invariant set $K$ plays the role of the self-similar set. We associate a $C^{*}$-algebra $\mathcal{O}_{\mathcal{M}}(K)$ with…
We propose graph canonical coherence analysis (gCChA), a novel framework that extends canonical correlation analysis to multivariate graph signals in the graph frequency domain. The proposed method addresses challenges posed by the inherent…
By a labeled graph $C^*$-algebra we mean a $C^*$-algebra associated to a labeled space $(E,\mathcal L,\mathcal E)$ consisting of a labeled graph $(E,\mathcal L)$ and the smallest normal accommodating set $\mathcal E$ of vertex subsets.…
A periodic linear graph operator acts on states (functions) defined on the vertices of a graph equipped with a free translation action. Fourier transform with respect to the translation group reveals the central spectral objects, Bloch and…