Related papers: Approximations of Isomorphism and Logics with Line…
Graph isomorphism, a classical algorithmic problem, determines whether two input graphs are structurally identical or not. Interestingly, it is one of the few problems that is not yet known to belong to either the P or NP-complete…
The study of graph C*-algebras has a long history in operator algebras. Surprisingly, their quantum symmetries have never been computed so far. We close this gap by proving that the quantum automorphism group of a finite, directed graph…
We study continuous bounded cohomology of totally disconnected locally compact groups with coefficients in a non-Archimedean valued field $K$. To capture the features of classical amenability that induce the vanishing of real bounded…
Let I be a finite set and CI be the algebra of functions on I. For a finite dimensional C algebra A with \CI contained in A we show that certain moduli spaces of finite dimsional modules are isomorphic to certain Grassmannian (quot-type)…
The search for a logic capturing PTIME is a long standing open problem in finite model theory. One of the most promising candidate logics for this is Choiceless Polynomial Time with counting (CPT). Abstractly speaking, CPT is an…
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 they…
In the present paper we continue our study of non-commutative operator graphs in infinite-dimensional spaces. We consider examples of the non-commutative operator graphs generated by resolutions of identity corresponding to the…
We introduce and study a generalization of conformal rigidity for graphs. A graph is $k$-conformally rigid if the uniform edge weights simultaneously maximize the sum of the $k$ smallest nontrivial Laplacian eigenvalues and minimize the sum…
We define totally-isotropic polynomials of alternating matrix spaces over finite fields, by analogy with independence polynomials of graphs. Our main result shows that totally-isotropic polynomials of graphical alternating matrix spaces…
A map between operator spaces is called completely coarse if the sequence of its amplifications is equi-coarse. We prove that all completely coarse maps must be $\mathbb R$-linear. On the opposite direction of this result, we introduce a…
A countable, bounded degree graph is almost finite if it has a tiling with isomorphic copies of finitely many F\o lner sets, and we call it strongly almost finite, if the tiling can be randomized so that the probability that a vertex is on…
We prove that the natural homomorphism from Kirchberg's ideal-related KK-theory, KKE(e, e'), with one specified ideal, into Hom_{\Lambda} (\underline{K}_{E} (e), \underline{K}_{E} (e')) is an isomorphism for all extensions e and e' of…
Two graphs $G$ and $H$ are homomorphism indistinguishable over a class of graphs $\mathcal{F}$ if for all graphs $F \in \mathcal{F}$ the number of homomorphisms from $F$ to $G$ is equal to the number of homomorphisms from $F$ to $H$. Many…
Determining whether two graphs are structurally identical is a fundamental problem with applications spanning mathematics, computer science, chemistry, and network science. Despite decades of study, graph isomorphism remains a challenging…
To each quadratic number field $K$ and each quadratic polynomial $f$ with $K$-coefficients, one can associate a finite directed graph $G(f,K)$ whose vertices are the $K$-rational preperiodic points for $f$, and whose edges reflect the…
This paper proves a commutative algebraic extension of a generalized Skolem-Mahler-Lech theorem due to the first author. Let $A$ be a finitely generated commutative $K$-algebra over a field of characteristic $0$, and let $\sigma$ be a…
We derive an intuitive and novel method to represent nodes in a graph with special unitary operators, or quantum operators, which does not require parameter training and is competitive with classical methods on scoring similarity between…
The notion of homomorphism indistinguishability offers a combinatorial framework for characterizing equivalence relations of graphs, in particular equivalences in counting logics within finite model theory. That is, for certain graph…
Bivariant (equivariant) K-theory is the standard setting for non-commutative topology. We may carry over various techniques from homotopy theory and homological algebra to this setting. Here we do this for some basic notions from…
Lov\'asz (1967) showed that two finite relational structures A and B are isomorphic if, and only if, the number of homomorphisms from C to A is the same as the number of homomorphisms from C to B for any finite structure C. Soon after,…