English
Related papers

Related papers: Approximations of Isomorphism and Logics with Line…

200 papers

We note that the deep results of Grunewald and Segal on algorithmic problems for arithmetic groups imply the decidability of several matrix equivalence problems involving poset-blocked matrices over Z. Consequently, results of Eilers,…

Operator Algebras · Mathematics 2020-06-02 Mike Boyle , Benjamin Steinberg

In this paper, we investigate certain graphs defined on groups, with a focus on infinite groups. The graphs discussed are the power graph, the enhanced power graph, and the commuting graph whose vertex set is a group $G$. The power graph is…

Group Theory · Mathematics 2024-10-15 Surbhi , Geetha Venkataraman

Suppose a finite group acts on a scheme X and a finite-dimensional Lie algebra g. The corresponding equivariant map algebra is the Lie algebra M of equivariant regular maps from X to g. We classify the irreducible finite-dimensional…

Representation Theory · Mathematics 2012-04-11 Erhard Neher , Alistair Savage , Prasad Senesi

In the example of complex grassmannians, we demonstrate various techniques available for computing genus-0 K-theoretic GW-invariants of flag manifolds and more general quiver varieties. In particular, we address explicit reconstruction of…

Algebraic Geometry · Mathematics 2021-03-01 Alexander Givental , Xiaohan Yan

This paper demonstrates the power of the calculus developed in the two previous parts of the series for all real forms of the almost Hermitian symmetric structures on smooth manifolds, including e.g. conformal Riemannian and almost…

Differential Geometry · Mathematics 2007-05-23 Andreas Cap , Jan Slovak , Vladimir Soucek

The uniform interpolation property in a given logic can be understood as the definability of propositional quantifiers. We mechanise the computation of these quantifiers and prove correctness in the Coq proof assistant for three modal…

Logic in Computer Science · Computer Science 2024-04-30 Hugo Férée , Iris van der Giessen , Sam van Gool , Ian Shillito

We present recent advances in harmonic analysis on infinite graphs. Our approach combines combinatorial tools with new results from the theory of unbounded Hermitian operators in Hilbert space, geometry, boundary constructions, and spectral…

Combinatorics · Mathematics 2020-10-26 Sergey Bezuglyi , Palle E. T. Jorgensen

We present an infinite sequence of finite graphs with trivial automorphism group and non-trivial quantum automorphism group. These are the first known examples of graphs with this property. Moreover, to the best of our knowledge, these are…

Quantum Algebra · Mathematics 2025-11-12 Josse van Dobben de Bruyn , David E. Roberson , Simon Schmidt

Homomorphism indistinguishability is a way of characterising many natural equivalence relations on graphs. Two graphs $G$ and $H$ are called homomorphism indistinguishable over a graph class $\mathcal{F}$ if for each $F \in \mathcal{F}$,…

Quantum Physics · Physics 2026-04-21 Tim Seppelt , Gian Luca Spitzer

Given a simple undirected graph, one can construct from it a $c$-step nilpotent Lie algebra for every $c \geq 2$ and over any field $K$, in particular also over the real and complex numbers. These Lie algebras form an important class of…

Dynamical Systems · Mathematics 2022-09-15 Jonas Deré , Thomas Witdouck

The symmetries of a finite graph are described by its automorphism group; in the setting of Woronowicz's quantum groups, a notion of a quantum automorphism group has been defined by Banica capturing the quantum symmetries of the graph. In…

Quantum Algebra · Mathematics 2019-07-01 Christian Eder , Viktor Levandovskyy , Julien Schanz , Simon Schmidt , Andreas Steenpass , Moritz Weber

We begin with the characterization of quantum graphs as left ideals in $\mathcal M \otimes_{eh} \mathcal M$ (the extended Haagerup tensor product of $\mathcal M$ with itself) to avoid technicalities surrounding representation dependence of…

Operator Algebras · Mathematics 2026-05-14 Jennifer Zhu

Let $H$ be a complex Hilbert space. Consider the ortho-Grassmann graph $\Gamma^{\perp}_{k}(H)$ whose vertices are $k$-dimensional subspaces of $H$ (projections of rank $k$) and two subspaces are connected by an edge in this graph if they…

Combinatorics · Mathematics 2021-03-11 Mark Pankov , Krzysztof Petelczyc , Mariusz Zynel

As it is well known, the isomorphism problem for vertex-colored graphs with color multiplicity at most 3 is solvable by the classical 2-dimensional Weisfeiler-Leman algorithm (2-WL). On the other hand, the prominent Cai-F\"urer-Immerman…

Computational Complexity · Computer Science 2020-03-18 Frank Fuhlbrück , Johannes Köbler , Oleg Verbitsky

The expressive power of graph neural networks is usually measured by comparing how many pairs of graphs or nodes an architecture can possibly distinguish as non-isomorphic to those distinguishable by the $k$-dimensional Weisfeiler-Leman…

Machine Learning · Computer Science 2024-04-02 Arjun Subramonian , Adina Williams , Maximilian Nickel , Yizhou Sun , Levent Sagun

A new class of infinite-dimensional Lie algebras given a name of Lax operator algebras, and the related unifying approach to finite-dimensional integrable systems with spectral parameter on a Riemann surface, such as Calogero--Moser and…

Mathematical Physics · Physics 2020-05-11 Oleg K. Sheinman

Invertible neural networks (INNs) represent an important class of deep neural network architectures that have been widely used in several applications. The universal approximation properties of INNs have also been established recently.…

Numerical Analysis · Mathematics 2023-08-21 Bangti Jin , Zehui Zhou , Jun Zou

We prove an algebraic version of the Gauge-Invariant Uniqueness Theorem, a result which gives information about the injectivity of certain homomorphisms between ${\mathbb Z}$-graded algebras. As our main application of this theorem, we…

Rings and Algebras · Mathematics 2008-02-04 G. Abrams , P. N. Ánh , A. Louly , E. Pardo

This paper extends prior work on the connections between logics from finite model theory and propositional/algebraic proof systems. We show that if all non-isomorphic graphs in a given graph class can be distinguished in the logic…

Logic in Computer Science · Computer Science 2023-02-13 Benedikt Pago

We consider a hierarchy of graph invariants that naturally extends the spectral invariants defined by F\"urer (Lin. Alg. Appl. 2010) based on the angles formed by the set of standard basis vectors and their projections onto eigenspaces of…

Computational Complexity · Computer Science 2025-05-06 V. Arvind , Frank Fuhlbrück , Johannes Köbler , Oleg Verbitsky
‹ Prev 1 3 4 5 6 7 10 Next ›