Related papers: Eikonal algebra on a graph of simple structure

We report on results about a study of algebraic graph invariants, based on computer exploration, and motivated by graph-isomorphism and reconstruction problems.

Convolution is a ubiquitous operation in mathematics and computing. The Kripke semantics for substructural and interval logics motivates its study for quantale-valued functions relative to ternary relations. The resulting notion of…

Let A be a C*-algebra with real rank zero which has the stable weak cancellation property. Let I be an ideal of A such that I is stable and satisfies the corona factorization property. We prove that 0->I->A->A/I->0 is a full extension if…

Given a system of coverings of k-graphs, we show that the cohomology of the resulting (k+1)-graph is isomorphic to that of any one of the k-graphs in the system. We then consider Bratteli diagrams of 2-graphs whose twisted C*-algebras are…

In this paper, we study the Reconstruction Conjecture for finite simple graphs. Let $\Gamma$ and $\Gamma'$ be finite simple graphs with at least three vertices such that there exists a bijective map $f:V(\Gamma) \rightarrow V(\Gamma')$ and…

For a simple graph $G$, the energy $\mathcal{E}(G)$ is defined as the sum of the absolute values of all the eigenvalues of its adjacency matrix $A(G)$. Let $n, m$, respectively, be the number of vertices and edges of $G$. One well-known…

The goal of these notes is to present the C*-algebra $C^*(B,L,\theta)$ of a Boolean dynamical system $(B,L,\theta)$, that generalizes the $C^*$-algebra associated to Labelled graphs introduced by Bates and Pask, and to determine its…

For compact regions Omega in R^3 with generic smooth boundary B, we consider geometric properties of Omega which lie midway between their topology and geometry and can be summarized by the term "geometric complexity". The "geometric…

A normal form for edge metrics is derived under the necessary conditions that the metric be normalized and exact. The normal forms for such an edge metric are shown to be in 1-1 correspondence with representative metrics for a reduced…

We realize Kellendonk'?s C*-algebra of an aperiodic tiling as the tight C*-algebra of the inverse semigroup associated to the tiling, thus providing further evidence that the tight C*-algebra is a good candidate to be the natural…

Many previously studied path algebras or self-similar group algebras may be viewed as Steinberg algebras of self-similar groupoids. By way of inverse semigroup algebras, we characterize when the Steinberg algebra of a self-similar groupoid…

A {\em $3$-graph} is a connected cubic graph such that each vertex is is equipped with a cyclic order of the edges incident with it. A {\em weight system} is a function $f$ on the collection of $3$-graphs which is {\em antisymmetric}:…

Let $G$ be a non-Engel group and let $L(G)$ be the set of all left Engel elements of $G$. Associate with $G$ a graph $\mathcal{E}_G$ as follows: Take $G\backslash L(G)$ as vertices of $\mathcal{E}_G$ and join two distinct vertices $x$ and…

We establish a general link between integrable systems in algebraic geometry (expressed as Jacobian flows on spectral curves) and soliton equations (expressed as evolution equations on flat connections). Our main result is a natural…

A tiling with infinite rotational symmetry, such as the Conway-Radin Pinwheel Tiling, gives rise to a topological dynamical system to which an \'etale equivalence relation is associated. A groupoid C*-algebra for a tiling is produced and a…

We obtain several sharp spectral bounds, approximations, and exact values for the isoperimetric number and related edge-expansion parameters of graphs. Our results focus on graph powers and on families of graphs with rich algebraic or…

The structure of the $C^*$-algebras corresponding to even-dimensional mirror quantum spheres is investigated. It is shown that they are isomorphic to both Cuntz-Pimsner algebras of certain $C^*$-correspondences and $C^*$-algebras of certain…

Learning the structure of a causal graphical model using both observational and interventional data is a fundamental problem in many scientific fields. A promising direction is continuous optimization for score-based methods, which,…

Let $\Gamma$ denote a finite, undirected, connected graph, with vertex set $X$. Fix a vertex $x \in X$. Associated with $x$ is a certain subalgebra $T=T(x)$ of ${\rm Mat}_X(\mathbb C)$, called the subconstituent algebra. The algebra $T$ is…

Denotational semantics can be based on algebras with additional structure (order, metric, etc.) which makes it possible to interpret recursive specifications. It was the idea of Elgot to base denotational semantics on iterative theories…