Related papers: Limitations of the Invertible-Map Equivalences

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…

Motivated by string diagrammatic approach to undirected tracial quantum graphs by Musto, Reutter, Verdon (2018), in the former part of this paper we diagrammatically formulate directed nontracial quantum graphs by Brannan, Chirvasitu,…

Given a null-homologous knot $K$ in a rational homology 3-sphere $M$, and the standard infinite cyclic covering $\tilde{X}$ of $(M,K)$, we define an invariant of triples of curves in $\tilde{X}$, by means of equivariant triple intersections…

Color refinement is a classical technique used to show that two given graphs G and H are non-isomorphic; it is very efficient, although it does not succeed on all graphs. We call a graph G amenable to color refinement if it succeeds in…

Let $F: C^n \rightarrow C^m$ be a polynomial map with $degF=d \geq 2$. We prove that $F$ is invertible if $m = n$ and $\sum^{d-1}_{i=1} JF(\alpha_i)$ is invertible for all $i$, which is trivially the case for invertible quadratic maps. More…

We give an overview of recent advances on the graph isomorphism problem. Our main focus will be on Babai's quasi-polynomial time isomorphism test and subsequent developments that led to the design of isomorphism algorithms with a…

Let $K$ be any field, let $L_n$ denote the Leavitt algebra of type $(1,n-1)$ having coefficients in $K$, and let ${\rm M}_d(L_n)$ denote the ring of $d \times d$ matrices over $L_n$. In our main result, we show that ${\rm M}_d(L_n) \cong…

These notes concern aspects of various graphs whose vertex set is a group $G$ and whose edges reflect group structure in some way (so that they are invariant under the action of the automorphism group of $G$). The graphs I will discuss are…

Let A be a finitely generated connected graded k-algebra defined by a finite number of monomial relations. Then there is a finite directed graph, Q, the Ufnarovskii graph of A, for which the categories QGr(A) and QGr(kQ) are equivalent:…

The symmetries described by Pin groups are the result of combining a finite number of discrete reflections in (hyper)planes. The current work shows how an analysis using geometric algebra provides a picture complementary to that of the…

We construct quantum K-invariants in non-archimedean analytic geometry. Contrary to the classical approach in algebraic geometry via perfect obstruction theory, we build on our previous works on the foundations of derived non-archimedean…

Consider a multimodal interval map $f$ of $C^3$ with non-flat critical points. We establish several characterizations of the map $f$ is quasi-symmetrically conjugated to a piecewise affine map in the case $f$ is topologically exact and all…

This is a largely expository paper, providing a self-contained account on the results of [Sch-Si1, Sch-Si2], in the cases denoted there 2Q and 2M. These papers of Sch\"afke and Singer supplied new proofs to the main theorems of [Bez-Bou,…

Much of the work in loop quantum gravity and quantum geometry rests on a mathematically rigorous integration theory on spaces of distributional connections. Most notably, a diffeomorphism invariant representation of the algebra of basic…

We develop the basics of a theory of almost isometries for spaces endowed with a quasi-metric. The case of non-reversible Finsler (more specifically, Randers) metrics is of particular interest, and it is studied in more detail. The main…

The Colour Refinement algorithm is a classical procedure to detect symmetries in graphs, whose most prominent application is in graph-isomorphism tests. The algorithm and its generalisation, the Weisfeiler-Leman algorithm, evaluate local…

From a system consisting of a right non-degenerate ring $R$, a pair of $R$-bimodules $Q$ and $P$ and an $R$-bimodule homomorphism $\psi:P\otimes Q\longrightarrow R$ we construct a $\Z$-graded ring $\mathcal{T}_{(P,Q,\psi)}$ called the…

Motivated by the quest for a logic for PTIME and recent insights that the descriptive complexity of problems from linear algebra is a crucial aspect of this problem, we study the solvability of linear equation systems over finite groups and…

Let $\Gamma$ be a dual polar graph with diameter $D \geqslant 3$, having as vertices the maximal isotropic subspaces of a finite-dimensional vector space over the finite field $\mathbb{F}_q$ equipped with a non-degenerate form (alternating,…

Let $X, Y$ be smooth algebraic varieties of the same dimension. Let $f, g : X \to Y$ be finite polynomial mappings. We say that $f, g$ are equivalent if there exists a regular automorphism $\Phi \in Aut(X)$ such that $f = g\circ \Phi$. Of…