Related papers: Bigalois extensions and the graph isomorphism game
We study a class of nonlocal games, called transitive games, for which the set of perfect strategies forms a semigroup. We establish several interesting correspondences of bisynchronous transitive games with the theory of compact quantum…
We supplement the study of Galois theory for algebraic quantum groups started in the paper 'Galois Theory for Multiplier Hopf Algebras with Integrals' by A. Van Daele and Y.H. Zhang. We examine the structure of the Galois objects: algebras…
Comparability graphs are graphs which have transitive orientations. The dimension of a poset is the least number of linear orders whose intersection gives this poset. The dimension ${\rm dim}(X)$ of a comparability graph $X$ is the…
We clarify the correspondence between the two approaches to quantum graphs: via quantum adjacency matrices and via quantum relations. We show how the choice of a (possibly non-tracial) weight manifests itself on the quantum relation side…
We introduce a quantum automorphism group for hypergraphs, which turns out to generalize the quantum automorphism group of Bichon for classical graphs. Further, we show that our quantum automorphism group acts on hypergraph C*-algebras as…
A graph is pseudo 2-factor isomorphic if all of its 2-factors have the same parity of number of cycles. Abreu et al. [J. Comb. Theory, Ser. B. 98 (2008) 432--442] conjectured that $K_{3,3}$, the Heawood graph and the Pappus graph are the…
This is a further investigation of our approach to group actions in homological algebra in the settings of homology of {\Gamma}-simplicial groups, particularly of {\Gamma}-equivariant homology and cohomology of {\Gamma}-groups. This…
The purpose of this paper is to constructively develop a Galois theory on irreducible shifts of finite type (SFTs) and to analyze the automorphism groups of SFTs using this framework. Let $X$ and $Y$ be irreducible SFTs. We demonstrate that…
The traditional mathematical model for an impartial combinatorial game is defined recursively as a set of the options of the game, where the options are games themselves. We propose a model called gamegraph, together with its generalization…
We describe proper actors from the underlying groupoid of a graph C*-algebra to another \'etale groupoid in terms of bisections. This allows to understand graph morphisms and the *-homomorphisms that they induce more conceptually. More…
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…
Quantum walks on graphs have shown prioritized benefits and applications in wide areas. In some scenarios, however, it may be more natural and accurate to mandate high-order relationships for hypergraphs, due to the density of information…
We show that numerical approximations of Kolmogorov complexity (K) applied to graph adjacency matrices capture some group-theoretic and topological properties of graphs and empirical networks ranging from metabolic to social networks. That…
If $X$ is a locally compact space which admits commuting free and proper actions of locally compact groups $G$ and $H$, then the Brauer groups $\Br_H(G/X)$ and $\Br_G(X/H)$ are naturally isomorphic.
One of the key points in Galois theory via field extensions is to build up a correspondence between subfields of a field and subgroups of its automorphism group, so as to study fields via methods of groups. As an analogue of the Galois…
We prove quantum ergodicity for a family of graphs that are obtained from ergodic one-dimensional maps of an interval using a procedure introduced by Pakonski et al (J. Phys. A, v. 34, 9303-9317 (2001)). As observables we take the L^2…
It is unknown whether two graphs can be tested for isomorphism in polynomial time. A classical approach to the Graph Isomorphism Problem is the d-dimensional Weisfeiler-Lehman algorithm. The d-dimensional WL-algorithm can distinguish many…
New criteria for which Cayley graphs of cyclic groups of any order can be completely determined--up to isomorphism--by the eigenvalues of their adjacency matrices is presented. Secondly, a new construction for pairs of nonisomorphic Cayley…
Graph neural networks (GNNs) are commonly described as being permutation equivariant with respect to node relabeling in the graph. This symmetry of GNNs is often compared to the translation equivariance of Euclidean convolution neural…
The study focuses on strategic-form games extended in the Eisert-Wilkens-Lewenstein scheme by two unitary operations. Conditions are determined under which the pair of unitary operators, along with classical strategies, form a game…