Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Introduction to compact (matrix) quantum groups and Banica–Speicher (easy) quantum groups
M Weber - Proceedings-Mathematical Sciences, 2017 - Springer
This is a transcript of a series of eight lectures, 90 min each, held at IMSc Chennai, India
from 5–24 January 2015. We give basic definitions, properties and examples of compact …
from 5–24 January 2015. We give basic definitions, properties and examples of compact …
Topological generation and matrix models for quantum reflection groups
We prove that the von Neumann algebras of quantum permutation groups and quantum
reflection groups have the Connes embedding property. We do this by establishing several …
reflection groups have the Connes embedding property. We do this by establishing several …
Quantum permutation matrices
M Weber - Multivariable Operator Theory: The Jörg Eschmeier …, 2023 - Springer
Quantum permutations arise in many aspects of modern “quantum mathematics”. However,
the aim of this article is to detach these objects from their context and to give a friendly …
the aim of this article is to detach these objects from their context and to give a friendly …
Modeling questions for quantum permutations
Given a quantum permutation group G⊂ SN+, with orbits having the same size K, we
construct a universal matrix model π: C (G)→ MK (C (X)), having the property that the images …
construct a universal matrix model π: C (G)→ MK (C (X)), having the property that the images …
[BUKU][B] Introduction to quantum groups
T Banica - 2023 - books.google.com
This book introduces the reader to quantum groups, focusing on the simplest ones, namely
the closed subgroups of the free unitary group. Although such quantum groups are quite …
the closed subgroups of the free unitary group. Although such quantum groups are quite …
Sinkhorn algorithm for quantum permutation groups
We introduce a Sinkhorn-type algorithm for producing quantum permutation matrices
encoding symmetries of graphs. Our algorithm generates square matrices whose entries are …
encoding symmetries of graphs. Our algorithm generates square matrices whose entries are …
A Concrete Model for the Quantum Permutation Group on 4 Points
Abstract In 2019, Jung–Weber gave an example of a concrete magic unitary M, which
defines a C*-algebraic model of the quantum permutation group S 4+. We show with the …
defines a C*-algebraic model of the quantum permutation group S 4+. We show with the …
Tracing the orbitals of the quantum permutation group
JP McCarthy - Archiv der Mathematik, 2023 - Springer
Using a suitably noncommutative flat matrix model, it is shown that the quantum permutation
group has free orbitals: that is, a monomial in the generators of the algebra of functions can …
group has free orbitals: that is, a monomial in the generators of the algebra of functions can …
Graphs and their symmetries
T Banica - arxiv preprint arxiv:2406.03664, 2024 - arxiv.org
This is an introduction to graph theory, from a geometric viewpoint. A finite graph $ X $ is
described by its adjacency matrix $ d\in M_N (0, 1) $, which can be thought of as a kind of …
described by its adjacency matrix $ d\in M_N (0, 1) $, which can be thought of as a kind of …
[PDF][PDF] Complex Hadamard matrices and applications
T Banica - 2021 - hal.science
A complex Hadamard matrix is a square matrix H∈ MN (C) whose entries are on the unit
circle,| Hij|= 1, and whose rows and pairwise orthogonal. The main example is the Fourier …
circle,| Hij|= 1, and whose rows and pairwise orthogonal. The main example is the Fourier …