Related papers: Approximations of Isomorphism and Logics with Line…

The Weisfeiler-Leman (WL) algorithms form a family of incomplete approaches to the graph isomorphism problem. They recently found various applications in algorithmic group theory and machine learning. In fact, the algorithms form a…

We study automorphic Lie algebras and their applications to integrable systems. Automorphic Lie algebras are a natural generalisation of celebrated Kac-Moody algebras to the case when the group of automorphisms is not cyclic. They are…

This paper extends the Bakry-\'{E}mery theorem connecting the Ricci curvature and log-Sobolev inequalities to the matrix-valued setting. Using tools from noncommuative geometry, it is shown that for a right invariant second order…

In this paper we study the operator inequality \phi(X)\leq X and the operator equation \phi(X)= X, where \phi is a w^*-continuous positive (resp. completely positive) linear map on B(H). We show that their solutions are in one-to-one…

Recently, the Weisfeiler-Lehman (WL) graph isomorphism test was used to measure the expressive power of graph neural networks (GNN). It was shown that the popular message passing GNN cannot distinguish between graphs that are…

Laplacian operators on finite compact metric graphs are considered under the assumption that matching conditions at graph vertices are of $\delta$ and $\delta'$ types. An infinite series of trace formulae is obtained which link together two…

Choiceless Polynomial Time (CPT) is currently the only candidate logic for capturing PTIME (that is, it is contained in PTIME and has not been separated from it). A prominent example of a decision problem in PTIME that is not known to be…

Two graphs are homomorphism indistinguishable over a graph class $\mathcal{F}$, denoted by $G \equiv_{\mathcal{F}} H$, if $\operatorname{hom}(F,G) = \operatorname{hom}(F,H)$ for all $F \in \mathcal{F}$ where $\operatorname{hom}(F,G)$…

We present the following reflexivity-like result concerning the automorphism group of the $C^*$-algebra B(H), H being a separable Hilbert space. Let $\phi:B(H)\to B(H)$ be a multiplicative map (no linearity or continuity is assumed) which…

We introduce the framework of Deep Weisfeiler Leman algorithms (DeepWL), which allows the design of purely combinatorial graph isomorphism tests that are more powerful than the well-known Weisfeiler-Leman algorithm. We prove that, as an…

Building upon work of Y. Shalom we give a homological-algebra flavored definition of an induction map in group homology associated to a topological coupling. As an application we obtain estimates of the (co)homological dimension of groups G…

In this paper we continue the study of prime graphs of finite solvable groups. The prime graph, or Gruenberg-Kegel graph, of a finite group G has vertices consisting of the prime divisors of the order of G and an edge from primes p to q if…

Given a pair of graphs $\textbf{A}$ and $\textbf{B}$, the problems of deciding whether there exists either a homomorphism or an isomorphism from $\textbf{A}$ to $\textbf{B}$ have received a lot of attention. While graph homomorphism is…

Operator learning has been highly successful for continuous mappings between infinite-dimensional spaces, such as PDE solution operators. However, many operators of interest-including differential operators-are discontinuous or set-valued,…

We consider isomorphism of controllable graphs and cospectrality of distance-regularized graphs (which are known to be distance-regular or distance-biregular) in relation to logical definability. While most characterizations of these…

The Weisfeiler-Leman (WL) algorithm is a combinatorial procedure that computes colorings on graphs, which can often be used to detect their (non-)isomorphism. Particularly the 1- and 2-dimensional versions 1-WL and 2-WL have received much…

The graph isomorphism (GI) problem is the computational problem of finding a permutation of vertices of a given graph $G_1$ that transforms $G_1$ to another given graph $G_2$ and preserves the adjacency. In this work, we propose a quantum…

We describe proper correspondences from graph C*-algebras to arbitrary C*-algebras by K-theoretic data. If the target C*-algebra is a graph C*-algebra as well, we may lift an isomorphism on a certain invariant to correspondences back and…

We initiate a systematic study of quantum properties of finite graphs, namely, quantum asymmetry, quantum symmetry, and quantum isomorphism. We define the Schmidt alternative for a class of graphs, which reveals to be a useful tool for…

Inquisitive modal logic, InqML, is a generalisation of standard Kripke-style modal logic. In its epistemic incarnation, it extends standard epistemic logic to capture not just the information that agents have, but also the questions that…