Abstract
A central tool in the study of ergodic random walks on finite groups is the Upper Bound Lemma of Diaconis and Shahshahani. The Upper Bound Lemma uses Fourier analysis on the group to generate upper bounds for the distance to random and thus can be used to determine convergence rates for ergodic walks. The Fourier analysis of quantum groups is remarkably similar to that of classical groups. This allows for a generalisation of the Upper Bound Lemma to an Upper Bound Lemma for finite quantum groups. The Upper Bound Lemma is used to study the convergence of ergodic random walks on the dual group \(\widehat{S_n}\) as well as on the truly quantum groups of Sekine.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction
Let \(\sigma _1,\sigma _2,\dots ,\sigma _k\) be a sequence of shuffles of a deck of cards. If the deck starts in some known order, the order of the deck after these k shuffles is given by
Suppose the shuffles are random variables independently and identically distributed as \(\sigma _i\sim \nu \in M_p(S_{52})\), the set of probability distributions on \(S_{52}\), then \(\Sigma _k\sim \nu ^{\star k}\) where \(\nu ^{\star k}\) is defined inductively as
If \(\nu \) is not concentrated on a subgroup, nor a coset of a normal subgroup of \(S_{52}\), then as \(k\rightarrow \infty \), \(\nu ^{\star k}\rightarrow \pi _{S_{52}}\), the uniform or random distribution on \(S_{52}\).
This generalises to arbitrary finite groups. Given independent and identically distributed \(s_i\sim \nu \in M_p(G)\), not concentrated on a subgroup, nor a coset of a normal subgroup, as \(k\rightarrow \infty \):
the random distribution on G. In this case the random walk is said to be ergodic.
In the previous statement, convergence is with respect to the total variation distance:
The inspiration for this work, which is the subject of the author’s Ph.D. thesis [10], is the following result of Diaconis and Shahshahani [4]:
Theorem
(Upper Bound Lemma) Let \(\nu \) be a probability on a finite group G and \(k\in \mathbb {N}\). Then
The sum is over non-trivial irreducible representations and \(\widehat{\nu }(\alpha )\) is the Fourier transform of\(\nu \)at the representation\(\rho ^\alpha \)
As an application, Diaconis and Shahshahani show that \(k_n=\frac{1}{2}\,n\ln n\) random transpositions are necessary and sufficient to ‘mix up’ a deck of n cards. This result comprises two elements: an upper bound at \(k_n+c\,n\) derived using the Upper Bound Lemma, as well as a lower bound at \(k_n-c\,n\) derived using a carefully selected test set. A phenomenon occurs in this example that as \(n\rightarrow \infty \), the lower bound for \(k_n-c\,n\) tends to one for large c, and the upper bound for \(k_n+c\,n\) approaches zero for large c. Note that \(\frac{2cn}{k_n}\rightarrow 0\) so that as \(n\rightarrow \infty \), the convergence from far from random to close to random is abrupt. This behaviour, called the cut-off phenomenon, occurs in a number of examples of random walks on finite groups. Saloff-Coste [15] is an excellent survey that includes more ideas even than the excellent monograph of Diaconis [3]. The author’s MSc thesis [11] also comprises a leisurely introduction to the subject.
Finite quantum groups are a noncommutative or ‘quantum’ generalisation of finite groups, and the central result of this work is that the Diaconis–Shahshahani Upper Bound Lemma also holds for finite quantum groups.
Considered as a research programme, quantum probability is concerned with generalising, where possible, objects in the study of classical probability to quantum objects in the study of quantum probability theory. It is under this programme that this work lies: the study of random walks on finite groups uses classical probability theory—a study of random walks on quantum groups should be the corresponding area of study in quantum probability.
Therefore, this work is concerned with a generalisation of a generalisation of card shuffling: generalising, where possible, the ideas and results of Diaconis and Shahshahani to the case of finite quantum groups. While the central object of card shuffling—the set of shuffles—is generalised to that of a set of elements of a group, the generalisation to quantum groups moves away from a ‘set of points’ interpretation.
However, in the study of random walks on finite quantum groups at least, the quantum theory generalises so nicely from the classical setup that it can be fruitful to refer to the virtual object that is a quantum group as if it really exists. At the very least this approach gives a most pleasing notation for quantum objects. At its very best it can inspire the noncommutative geometer to make good choices in terms of definitions, etc.
One of the most exciting and potentially lucrative aspects of quantum probability, or rather more specifically quantum group theory, is that theorems about finite groups may in fact be true for quantum groups also. For example, the classical finite Peter–Weyl Theorem concerning the matrix elements of representations of classical groups is exactly the same as the finite Peter–Weyl Theorem 3.3 for finite quantum groups in the sense that replacing in the classical statement ‘finite group’ with ‘finite quantum group’ yields the quantum statement. What this really means is that the classical finite Peter–Weyl Theorem is actually just a special case of the quantum finite Peter–Weyl Theorem.
This is rather comforting on the conceptional level—these quantum objects behave so much like their ‘set of points’ classical counterparts—but in this study it is on the pragmatic level of proving results about these quantum objects that this principle really comes to the fore. On the one hand, some theorems concerning the theory of finite groups are just corollaries to results about quantum groups. On this other, pragmatic, hand, there is a translation principle: any proof of a classical group theorem, written without regard to any of the points in the ‘set of points’, may be directly translatable into a proof of the corresponding quantum group theorem.
For example, the Haar state, h, can allow classical ‘sum over points’ arguments and statements about the algebra of functions on a finite classical group to be translated:
Representation Theory and ‘sum over points’ arguments, therefore, are translatable and it is precisely these ideas that play a central role in the representation-theoretic approach of Diaconis and Shahshahani to analysing the rate of convergence of random walks on finite groups [4]. Once the quantum versions of the various objects and maps used by Diaconis and Shahshahani are established, it is largely straightforward to derive and prove the quantum Diaconis–Shahshahani Upper Bound Lemma.
The restriction to finite quantum groups is for two reasons. Firstly the classical work that this work is building upon is the Diaconis–Shahshahani Theory approach to random walks on finite groups. Secondly, the approach to finding the quantum versions of classical objects in this work—extolled in Sect. 1.1—requires the isomorphism \(\mathbb {C}(X\times Y)\cong \mathbb {C}X\otimes \mathbb {C}Y\) for sets X and Y, and this holds only when X and Y are finite.
However, the classical Diaconis–Shahshahani Theory has been extended to possibly-infinite compact groups by Rosenthal [14]. Freslon [7, 8] has also extended this work on finite quantum groups, developed during the author’s Ph.D. studies, to the far more technically-involved case of compact quantum groups, where the algebras are no longer necessarily finite dimensional. Freslon presents many interesting examples of random walks on compact quantum groups—with the cut-off phenomenon—and also addresses, particularly in [7], a number of concerns not answered or addressed in the author’s Ph.D. thesis. As there is a generalisation of the classical finite symmetric group that is infinite dimensional for \(n\ge 4\), it would be remiss not to point out that the restriction to finite quantum groups is more than a little unnatural, and also brushes many technical difficulties under the carpet.
Therefore this work should be considered a first, pioneering, attempt at a quantum generalisation of the work of Diaconis and Shahshahani, with Freslon’s papers a far more accomplished and reaching generalisation.
The paper is organised as follows. In Sect. 1, category theory language is used to motivate the definition of a finite quantum group. Results concerning the dual of a finite quantum group that are used in the sequel are presented at this point. Finally the definition of a random walk on a finite quantum group is given. In Sect. 2, the total variation distance, used for measuring the ‘distance to random’ of a random walk, is introduced. The central result is contained in Sect. 3; this leans so heavily on the work of Van Daele, that the author calls it by Diaconis–Van Daele Theory. In Sect. 4, two applications of the Upper Bound Lemma are presented: to a random walk on the dual of \(S_n\); and to a random walk on the truly quantum groups of Sekine. In neither example is the cut-off phenomenon exhibited, and in the case of the random walk on the quantum groups of Sekine it is shown the cut-off phenomenon does not occur.
2 Preliminaries
2.1 Finite Quantum Groups
The following approach to introducing finite quantum groups is a brief summary of the approach outlined in detail in Sect. 2.2 of [10].
A finite classical group G is an object in the category of finite sets, and the group multiplication \(G\times G\rightarrow G\), inclusion of the unit, and inverse \(G\rightarrow G\), are morphisms in this category. The three group axioms are given by three commutative diagrams.
Let \(\mathbb {C}G\) be the complex vector space with basis elements \(\{\delta ^s:s\in G\}\). The map \(G\mapsto \mathbb {C}G\) is a covariant functor, the \(\mathbb {C}\) functor, from the category of finite sets to the category of finite dimensional complex vector spaces. The image of the group multiplication is a multiplication, \(\nabla : \mathbb {C}G\otimes \mathbb {C}G\rightarrow \mathbb {C}G\) given by \(\nabla (\delta ^s\otimes \delta ^t)=\delta ^{st}\). The presence of the tensor product comes via the isomorphism \(\mathbb {C}(G\times G)\cong \mathbb {C}G\otimes \mathbb {C}G\) which does not hold if G is infinite. This gives \(\mathbb {C}G\) the structure of a complex associative algebra called the group algebra of G. The image of the three commutative diagrams (which comprise the group axioms) under the functor \(\mathbb {C}\) give relations that hold in \(\mathbb {C}G\), and if \(\displaystyle \varphi =\sum _{t\in G}\alpha _t\delta ^t\), then the involution
gives the group algebra the structure of a *-algebra.
Now apply the contravariant dual endofunctor to the group algebra. The dual endofunctor maps a finite dimensional complex vector space U to its dual \(U^*\), and a morphism \(T:U\rightarrow V\) to a morphism \(V^*\rightarrow U^*\) given by \(f\mapsto f\circ T\). The dual of the group algebra is the algebra of functions on G, F(G), with dual basis \(\{\delta _s:s\in G\}\) such that \(\delta _s(\delta ^t)=\delta _{s,t}\), and involution \(f^*(\delta ^s)=\overline{f(\delta ^s)}\). The composition of the \(\mathbb {C}\) functor and the dual endofunctor gives a functor \(G\mapsto F(G)\) and the images of the group multiplication, inverse, and inclusion of the unit, under this functor composition give structure maps on F(G). These structure maps are called the comultiplication, an algebra homomorphism \(\Delta :F(G)\rightarrow F(G)\otimes F(G)\), \(\delta _s\mapsto \mathbb {1}_{m^{-1}(s)}\equiv \sum _{t\in G}\delta _{st^{-1}}\otimes \delta _t\) (for finite G); the counit, \(\varepsilon : F(G)\rightarrow \mathbb {C}\), \(\delta _{s}\mapsto \delta _{s,e}\); and the antipode, \(S:F(G)\rightarrow F(G)\), \(\delta _s\mapsto \delta _{s^{-1}}\). The associativity, inverse, and identity group axiom commutative diagrams, under this functor, give coassociativity, the counital property, and the antipodal property:
Here \(M:F(G)\otimes F(G)\rightarrow F(G)\) is pointwise multiplication and \(\eta _{F(G)}\) is the inclusion of the unit, \(\mathbb {1}_G\). With the fact that \(f^*f=0\) if and only if \(f=0\), F(G) can be given the structure of a finite dimensional \(\mathrm {C}^*\)-algebra. It is a unital commutative algebra and the group axioms are encoded by these relations. Note furthermore that \(\Delta \) satisfies \(\Delta (f^*)=\Delta (f)^*\), where the involution in \(F(G)\otimes F(G)\) is given by \((f\otimes g)^*=f^*\otimes g^*\).
A finite dimensional \(\mathrm {C}^*\)-algebra A with a *-homomorphism \(\Delta :A\rightarrow A\otimes A\), and maps \(\varepsilon :A\rightarrow \mathbb {C}\), and \(S:A\rightarrow A\), that satisfies the above relations, but is not necessarily commutative is thus considered the algebra of functions on a finite quantum group. Such an algebra is called a \(\mathrm {C}^*\)-Hopf algebra.
Definition 1.1
An algebra of functions on a finite quantum group, is a unital \(\mathrm {C}^*\)-Hopf algebra A; that is a \(\mathrm {C}^*\)-algebra A with a *-homomorphism \(\Delta \), a counit \(\varepsilon \), and an antipode S, satisfying the relations (1).
Denote an algebra of functions on a finite quantum group by \(A=:F(G)\) and refer to G as a finite quantum group, with unit denoted by \(\mathbb {1}_{G}\), and note that S is an involution (not necessarily true for infinite G, see remark to Theorem 2.2, [21]). Timmermann presents in Chapter 1 of his book [18] further properties of Hopf algebras, for example the fact that the counit is a *-homomorphism (used in the sequel). The simplest noncommutative example of an algebra of functions on a finite quantum group is \(\mathbb {C}S_3\), where \(S_3\) is the classical symmetric group on three elements, where the comultiplication is given by \(\Delta _{\mathbb {C}S_3}(\delta ^\sigma )=\delta ^\sigma \otimes \delta ^\sigma \), and is the dual of the pointwise multiplication in \(F(S_3)\). Where \(\tau \) is the flip map \(a\otimes b\mapsto b\otimes a\), this comultiplication has the property that \(\tau \circ \Delta _{\mathbb {C}S_3}=\Delta _{\mathbb {C}S_3}\). Algebras of functions on finite quantum groups, F(C), whose comultiplications have this property, \(\tau \circ \Delta =\Delta \), are said to be cocommutative, and are of the form \(F(C)=\mathbb {C}G\) for G a classical finite group. Similarly a commutative algebra of functions on a finite quantum group is the algebra of functions on some classical finite group (can be inferred from Theorem 3.3, [19]).
For the remainder of this work, unless explicitly stated otherwise, G is a quantum group, and assumed finite. There are well established notions of compact and locally compact quantum groups. See, for example, Timmermann [18] for more.
2.2 The Dual of a Quantum Group
Where \(\pi \) is the random/uniform distribution on a classical group G, consider the functional on F(G):
This is a normalised, positive functional, invariant in the sense that for each \(s\in G\),
This normalised, invariant, positive functional is called a Haar state, it is unique, and is denoted by \(\int _G\) (earlier h was used).
A finite quantum group also has a unique Haar state [21, Theorem 1.3], denoted by \(\int _G\). Invariance of the Haar state is given by (2) and furthermore it is tracial: \(\int _Gab=\int _Gba\) [21, Theorem 2.2].
Consider the space, \(\widehat{A}\), of linear functionals on \(A:=F(G)\) of the form
As F(G) is finite dimensional, the continuous and algebraic duals coincide. Furthermore, the Haar state is faithful and so
defines an inner product making F(G) a Hilbert space. Via the Riesz Representation Theorem for Hilbert spaces, for every element \(\varphi \in F(G)'\), there exists a density \(a_{\varphi }^*\in F(G)\) such that:
so that \(F(G)'=\widehat{A}\). This space can be given the structure of an algebra of functions on a finite quantum group by employing the contravariant dual functor to F(G) and its structure maps. The dual functor maps the object F(G) to \(\widehat{A}\); the comultiplication \(\Delta :F(G)\rightarrow F(G)\otimes F(G)\) to an associative multiplication \(\nabla :\widehat{A}\otimes \widehat{A}\rightarrow \widehat{A}\); and the multiplication \(M:F(G)\otimes F(G)\rightarrow F(G)\) to a comultiplication \(\widehat{\Delta }: \widehat{A}\rightarrow \widehat{A}\otimes \widehat{A}\) (see [10], Section 2.5 for more). The *-involution on \(\widehat{A}\) is given by:
The finite quantum group formed in this way is called the dual of the quantum group G, and is denoted by \(\widehat{G}\). An invariant, positive functional on \(F(\widehat{G})\) is given by \(\widehat{h}(\varphi )=\varepsilon (a_{\varphi })\). It is not normalised and so not the Haar state of \(F(\widehat{G})\). In the case of a classical group G, \(F(\widehat{G})=\mathbb {C}G\).
The analogue of a probability distribution on a classical group is a state on the algebra of functions on a quantum group, that is a positive functional of norm one. Denote the states on F(G) by \(M_p(G)\) and note that \(M_p(G)\) is a subset of \(F(\widehat{G})\). A density \(a_\nu \) defines a state \(\nu \in M_p(G)\) if and only if \(a_\nu \) is positive and \(\int _G a_\nu =1\). There are Convolution and Plancherel Theorems for \(F(\widehat{G})\) that will be used to prove the Upper Bound Lemma. The Convolution Theorem is well presented by Bhowmick et al. [2, Sect. 1.1], which heavily cites Van Daele [20,21,22,23]; while the Plancherel Theorem is well presented by Timmermann [18, Sect. 2.3], which also cites Van Daele [21].
The convolution product on F(G) is given by:
There is a Convolution Theorem relating this convolution to a convolution in \(F(\widehat{G})\):
This is the natural multiplication on \(F(\widehat{G})\), and therefore briefly write \(\varphi _1\varphi _2\) for \(\varphi _1\star \varphi _2\).
Within the proof of Proposition 3.11 of [22], Van Daele proves the following identity:
This identity can be used to prove the following (see Sect. 1.1 of [2]):
Theorem 1.2
(Van Daele’s Convolution Theorem) For \(\varphi _1,\varphi _2\in F(\widehat{G})\)
Timmerman [18, Lemma 2.3.8] presents a proof of the following lemma.
Lemma 1.3
Let \(\varphi _1,\,\varphi _2\in F(\widehat{G})\). Then
Theorem 1.4
(Plancherel Theorem) Let G be a quantum group and \(\varphi \in F(\widehat{G})\). Then
Proof
Applying the previous lemma to the left-hand side:
where the traciality of \(\int _G\) was used \(\bullet \)\(\square \)
2.3 Random Walks on Finite Quantum Groups
Early work on quantum stochastic processes by various authors led to random walks on duals of compact groups (particularly Biane, see [5] for references), and other examples, but Franz and Gohm [5] defined with clarity a random walk on a finite quantum group. Given a random walk on a finite classical group G, by applying the functor composition referenced in Sect. 1.1 to the random variables \(\xi _k:G^{k}\rightarrow G\), random variables on the level of F(G), \(j_k:F(G)\rightarrow \bigotimes _{k\text { copies}}F(G)\) can be defined by:
and the generalisation to random walks on finite quantum groups can be made in this way. It is also possible to generalise from classical to quantum random walks using stochastic operators, and also F(G) analogues of the random variables \(s_i\) (denoted by \(k_i\) by Franz and Gohm and \(z_i\) by the author in [10]).
In Sect. 3.2 of [10], this generalisation of Franz and Gohm from random walks on finite classical groups to random walks on finite quantum groups is explored in detail, and concludes with Franz and Gohm’s assertion that a random walk on a finite quantum group G driven by a state \(\nu \in M_p(G)\) is essentially the same thing as the semigroup of convolution powers, \(\{\nu ^{\star k}\}\), defined inductively through
Indeed, Amaury Freslon defines a random walk on a (compact) quantum group simply as a state on C(G), and proceeds to study the semigroup of convolution powers without mentioning the random variables \(j_k\) nor \(z_i\), only mentioning the stochastic operator \(P_\nu =(\nu \otimes I_{F(G)})\circ \Delta \) for analytical reasons (see [7, Sect. 4.2]).
3 Total Variation Distance
In the classical case, the distance between \(\nu \) and \(\mu \in M_p(G)\) is given by the total variation distance:
Given a subset \(S\subset G\), the indicator function on S, \(\mathbb {1}_{S}=\sum _{s\in S}\delta _s\), is a projection, and all projections in F(G) are formed in this way, and so there is a one-to-one correspondence between projections in F(G) and subsets of G. Using this correspondence, this definition can be extended to quantum groups:
The Haar state is a normal, faithful trace, therefore non-commutative \(\mathcal {L}^p\) machinery [13] can be used to put p-norms on F(G):
Set the infinity norm equal to the operator norm.
Proposition 2.1
Let G be a quantum group and \(\nu ,\,\mu \in M_p(G)\):
Proof
Standard non-commutative \(\mathcal {L}^p\) machinery from [13] shows that:
Embed the algebra of functions F(G) into a matrix algebra. As everything is in finite dimensions, the supremum on the right is actually a maximum. Suppose that the two states \(\nu \) and \(\mu \) are given by density matrices: \(\nu ={\text {Tr}}(\rho _{\nu }\cdot )\) and \(\mu ={\text {Tr}}(\rho _{\mu }\cdot )\), and \(\theta :=\rho _{\nu }-\rho _{\mu }\) so that
Using the \(M_n(\mathbb {C})\) inequality (\(\Vert A\Vert _1= {\text {Tr}}(|A|)\), \(|A|:=\sqrt{A^*A}\)), \(|{\text {Tr}}(AB)|\le \Vert A\Vert _1\Vert B\Vert _\infty ,\)
Note that \(\theta \) is self-adjoint so that there exists a polar decomposition \(\theta =U|\theta |\) such that U is self-adjoint. Consider \(\phi =U\), the phase of \(\theta \), so that \(U\theta =|\theta |\), and so
that is equality is achieved at the self-adjoint unitary U:
Consider \(q=\frac{\mathbb {1}_G+U}{2}\). The self-adjointness of U gives \(q=q^*\), and the fact U is also a unitary implies that U is an involution. This implies that \(q=q^2\) and so q is a projection. The projection distance satisfies
Now suppose the projection distance is attained at p and consider the infinity-norm-one element \(\phi =2p-\mathbb {1}_G \in F(G)\):
\(\square \)
This proof takes advantage of the finite dimensionality of F(G). Amaury Freslon [7, Lemma 2.6] states and proves a similar result for \(\left\| \nu -\int _G\right\| \) which holds for not-necessarily finite-dimensional compact quantum groups whenever \(\nu \) is a state on \(\mathcal {L}^{\infty }(G)\) that has an \(\mathcal {L}^1(G)\)-density \(a_\nu \), which is not always the case in infinite dimensions.
The total variation distance defined using projections has three properties that suggest it is a suitable generalisation of the classical variation distance.
Firstly, in the case of a classical group, G, the one-to-one correspondence between projections and subsets, and between probability measures on G and states on F(G), means that there is agreement in the classical case. Furthermore, there is a one-to-one correspondence between representations of a classical group G and corepresentations of F(G) and this implies that estimates of the distance to random are the same whether the classical or quantum Upper Bound Lemmas are used.
The Upper Bound Lemma is a formula for a two norm, and thus requires a Cauchy–Schwarz inequality to relate back to the total variation distance. Such an inequality for total variation distance is provided for by non-commutative \(\mathcal {L}^p\) machinery (see [13]):
applied to
The final equality here is the Plancherel Theorem 1.4.
Finally, to establish lower bounds, the total variation distance has a presentation(s) as a supremum:
4 Diaconis–Van Daele Theory
4.1 Corepresentation Theory
Definition 3.1
A corepresentation of the algebra of functions on a quantum group G on a complex vector space V is a linear map \(\kappa :V\rightarrow V\otimes F(G)\) that satisfies:
The dimension of a corepresentation \(\kappa \) is given by the dimension of the vector space V. If V is finite dimensional, with basis \(\{e_i\}_{i=1,\dots ,\dim V}\), the matrix elements of\(\kappa \) are the \((\dim V)^2\) elements of F(G) given by
If V is equipped with a Hermitian inner product, \(\langle ,\rangle _V\), define for \(v,w\in V\), and \(a,b\in F(G)\)
A corepresentation \(\kappa \) on such a vector space is said to be unitary if \(\langle \kappa (v),\kappa (w)\rangle _{F(G)}=\langle v,w\rangle _V\cdot \mathbb {1}_G\).
Let \(\kappa \) be a corepresentation on a vector space V. Denote by \(\overline{V}\) the conjugate vector space of V and by \(v\mapsto \overline{v}\) the canonical conjugate-linear isomorphism. Since \(\Delta \) and \(\varepsilon \) are \(*\)-homomorphisms, the map
is a corepresentation again, called the conjugate of \(\kappa \).
As there is a one-to-one correspondence between representations of a classical group G and corepresentations of (commutative) F(G), treating a quantum group G as an object, via an abuse of notation, corepresentations \(\kappa \) of a (noncommutative) F(G) on V will be referred to as representations of (quantum) G on V.
Denoting the map \(a_\varphi \mapsto \varphi \) by \(\mathcal {F}\), so that \(\mathcal {F}(a_\varphi )=\varphi \), for each \(a_\varphi \in F(G)\) define the map \(\widehat{a_\varphi }\in L(\overline{V})\):
Proposition 3.2
For \(a_{\varphi _1},\,a_{\varphi _2}\in F(G)\) and \(\kappa \) a representation of G on V
Furthermore, if \(\kappa \) is unitary then
Note the first involution is in \(F(\widehat{G})\) and the second is in \(L(\overline{V})\).
Proof
The proposition is that the map \(F(\widehat{G})\rightarrow L(\overline{V})\), \(\varphi \mapsto \widehat{a_\varphi }(\kappa )\) is a \(*\)-homomorphism. See Timmermann for a proof (Proposition 3.1.7 ii. and v., [18]) \(\bullet \)\(\square \)
The following result is presented by Timmermann [18, Proposition 3.29 and Theorem 3.2.12], but is due to Woronowicz [25]
Theorem 3.3
(Finite Quantum Peter–Weyl Theorem) Let \(\mathcal {I}={\text {Irr}}(G)\) be an index set for a family of pairwise-inequivalent irreducible unitary representations of G. If \(d_{\alpha }\) is the dimension of the vector space on which \(\rho ^\alpha \) acts (\(\alpha \in \mathcal {I}\)),
the set of matrix elements of a family of pairwise-inequivalent irreducible unitary representations of G, is an orthogonal basis of F(G) with respect to the inner product
such that \(\langle \rho _{ij}^\alpha ,\rho _{ij}^\alpha \rangle =1/d_{\alpha }\qquad \bullet \)
4.2 Fourier Transform
The following definition is similar to that of Simeng Wang ((2.5), [24]) save for a choice of left-right. As remarked upon by Simeng Wang, his definition is similar to earlier definitions of Kahng and also Caspers save for the presence of the conjugate representation \(\overline{\kappa }_\alpha \) rather than \(\kappa _{\alpha }\) itself. As Wang explains, the conjugate representation is used to be compatible with standard definitions in classical analysis on compact groups and hence most welcome for this work.
Definition 3.4
(The Fourier Transform) Let G be a quantum group with representation notation as before. Then the Fourier transform is a map:
defined for each \(\alpha \in {\text {Irr}}(G)\):
Each \(\widehat{a_\varphi }(\alpha )\) is called the Fourier transform of \(a_\varphi \) at the representation \(\kappa _\alpha \). For \(\varphi \in F(\widehat{G})\):
so \(\widehat{\varphi }\) is identified with \(\widehat{a_\varphi }\).
The maps \(\{\widehat{a_\varphi }(\alpha )\,:\,\alpha \in {\text {Irr}}(G)\}\) play a key role in the sequel.
Theorem 3.5
(Diaconis–Van Daele Inversion Theorem) Let \(\varepsilon \) be the counit of a quantum group G and \(\varphi \in F(\widehat{G})\). Then
where the sum is over the irreducible unitary representations of G.
Proof
Both sides are linear in \(a_\varphi \) so it suffices to check \(a_{\varphi }=\rho _{kl}^{\beta }\) for \(\beta \in \text {Irr}(G)\). The left-hand side reads
To calculate the right-hand-side, calculate for a given representation the trace of \(\widehat{\rho _{kl}^\beta }\left( \alpha \right) \). Let \(\overline{e_j}\in \overline{V_\alpha }\) and calculate
This is zero unless \(\alpha \equiv \beta \). If \(\alpha \equiv \beta \) then
Multiply this by \(d_\beta \) to get \(\delta _{k,l}\)\(\bullet \)\(\square \)
Theorem 3.6
(Diaconis–Van Daele Convolution Theorem) For a representation \(\kappa _\alpha \) of G and \(a_{\varphi _1},\,a_{\varphi _2}\in F(G)\)
Proof
Recalling the identifications \(\widehat{a_\varphi }(\alpha )=:\widehat{\mathcal {F}(a_\varphi )}(\alpha )=\widehat{\varphi }(\alpha )\), and that
The second equality uses Van Daele’s Convolution Theorem 1.2 and final equality is Proposition 3.2\(\bullet \)\(\square \)
Lemma 3.7
Where the sum is over unitary irreducible representations,
Proof
The proof uses the convolution theorem of Van Daele and the definition of \(\widehat{h}\) to find
Now use the Diaconis–Van Daele Inversion Theorem 3.5 and the Diaconis–Van Daele Convolution Theorem 3.2
\(\square \)
Proposition 3.8
Suppose that \(\nu \in M_p(G)\). If \(\kappa _\tau \) is the trivial representation, \(\lambda \mapsto \lambda \otimes \mathbb {1}_{G}\), then \(\widehat{a_\nu }\left( \tau \right) =I_{\overline{\mathbb {C}}}\).
Proof
A calculation:
\(\square \)
Proposition 3.9
Suppose that \(\kappa _{\alpha }\) is a non-trivial and irreducible unitary representation, then \(\widehat{\mathbb {1}_{G}}\left( \alpha \right) =0\).
Proof
Another calculation:
Note that \(\mathbb {1}_{G}\) is the matrix element of the trivial representation and \(\alpha \) is not equivalent to the trivial representation. Therefore, by the orthogonality relation \(\widehat{\mathbb {1}_{G}}\left( \alpha \right) =0\)\(\bullet \)\(\square \)
4.3 The Upper Bound Lemma
At this point, to mirror the classical notation, use \(\pi \) for \(\int _G\). Recall, from Sect. 2, that
Lemma 3.10
(Diaconis–Shahshahani Upper Bound Lemma) Let \(\nu \in M_p(G)\). Then
where the sum is over all non-trivial irreducible unitary representations.
Proof
Noting that \(a_\pi =\mathbb {1}_G\) write
Now using Lemma 3.7 and (4), this is equal to
Now note that
If \(\alpha =\tau \), the trivial representation, then this yields zero as both terms are the identity on \(\overline{\mathbb {C}}\). If \(\alpha \) is non-trivial, then \(\widehat{\mathbb {1}_{G}}\left( \alpha \right) =0\) and thus (using the notation \(\widehat{a_\nu }(\alpha )=\widehat{\nu }(\alpha )\)):
Apply Proposition 3.2k times \(\bullet \)\(\square \)
Note this is exactly the same as the classical Diaconis–Shahshahani Upper Bound Lemma.
4.4 Lower Bounds
Lemma 3.11
(Lower Bound Lemma) Suppose that \(\nu \in M_p(G)\) and \(\rho \) the matrix element of a non-trivial one dimensional representation. Then
Proof
Starting with (3), note that the argument from Proposition 3.9 shows that \(\rho \) has zero expectation under the random distribution. Note also that \(\rho \) is unitary (Proposition 3.1.7 v., [18]), thus norm one and thus a suitable test function.
Note that for a one dimensional representation, by Proposition 3.2:
\(\square \)
5 Examples
5.1 Random Walks on Dual Groups
Consider the dual quantum group, \(\widehat{G}\), of a not-necessarily abelian group, G, given by \(F(\widehat{G}):=\mathbb {C}G\). States on \(F(\widehat{G})\) are given by positive definite functions \(u\in F(G)=\mathbb {C}\widehat{G}\) (see Bekka, de la Harpe and Valette [1, Proposition C.4.2]). Furthermore, there is a correspondence between positive definite functions and unitary representations on G together with a vector. In particular, for each positive definite function u there exists a unitary representation \(\rho :G\rightarrow {\text {GL}}(V)\) and a vector \(\xi \in V\) such that
and for each unitary representation and vector (5) defines a positive definite function on G. For u to be a state it is required that \(u(e)=1\) and so \(\langle \xi ,\xi \rangle =1\); i.e. \(\xi \) is a unit vector. Therefore probabilities on \(\widehat{G}\) can be chosen by selecting a given representation and unit vector.
Since \(\Delta (\delta ^s)=\delta ^s\otimes \delta ^s\), it follows that \(\kappa _s(\lambda )=\lambda \otimes \delta ^s\) defines a (co)representation (with \(\tau =\kappa _e\)), and thus all irreducible representations of \(\widehat{S_n}\) are of this form by counting. This makes the application of the upper bound lemma straightforward. Let \(u\in M_p(\widehat{G})\) so that \(\widehat{u}(\kappa _s)=\overline{u(s)}\) and so
Therefore the upper bound lemma yields:
5.1.1 A Walk on \(\widehat{S_n}\)
Consider the quantum group \(\widehat{S_n}\) (given by \(F(\widehat{S_n}):=\mathbb {C} S_n\)) with a state \(u\in M_p(\widehat{S_n})\) given by the permutation representation on \(\mathbb {C}^n\) given by \(\pi (\sigma )(e_i)=e_{\sigma (i)}\) together with the unit vector \(\xi \) with components
This vector is such that the \(\alpha _i\) are in geometric progression with common ratio \(\displaystyle \frac{1}{\sqrt{n}}\). For large n, this vector is approximately given by:
Following this through
To establish the upper bound some elementary inequalities will be used.
Lemma 4.1
The following hold for \(n\ge 5\):
Proof
For (6), note that \(k>n^2\ln (n)/2\) and thus \(\displaystyle \left( \frac{4}{n}\right) ^k(n-1)\le n\left( \frac{4}{n}\right) ^{n^2\ln (n)/2}=:h(n)\). Note that \(h(5)<1\) and
while (7) is trivial. Note that \(A_n\rightarrow 1\) and
for \(n\ge 3\), and so the convergence is monotonic. Also \(g(n)\rightarrow 1\) and
for \(n\ge 3\)\(\bullet \)\(\square \)
5.1.2 Upper Bounds
For\(k=\alpha \,n^{n-1}\ln (n)/2+c\,n^{n-2}\), \(\alpha >1\), \(c>0\), andnlarge
whereAcan be chosen to be any\(A<1\)fornsufficiently large.
Proof
Note that
Therefore, using the Upper Bound Lemma,
Define for \(a_i=1/\sqrt{n^i}\)
An inversion for\(\sigma \) is an ordered pair (j, k) with \(j,k\in \{1,\dots ,n\}\) with \(j<k\) and \(\sigma (j)>\sigma (k)\). All non-identity permutations have at least one inversion.
Taking the approach of Steele [17, P. 79], for any inversion for \(\sigma \), (j, k), define a new permutation by
Steele shows that
That is, multiplying by \((j\quad k)\), whenever (j, k) is an inversion for \(\sigma \), in this fashion, increases the number of fixed points, reduces the number of inversions (for \(\tau _1\)), and increases S. This can be done iteratively until \(\tau _r=e\). If the maximising \(\sigma \in S_{n}/\{e\}\) were not a transposition, then it would be the product of at least two transpositions. Take one of the transpositions \((j\quad k)\): note that (j, k) is certainly an inversion for \((j\quad k)\). By the referenced calculation, \(\tau _i:=(j\quad k)\sigma \) has \(S(\tau _i)\ge S(\sigma )\). Therefore, no matter what the starting permutation \(\sigma \), \(\displaystyle \tau _{r-1}\) is a transposition and therefore to maximise S on \(S_n\backslash \{e\}\) one just maximises over transpositions.
The one-step differences between the \(a_i\) are decreasing in i and so the smallest one-step difference is between \(a_{n-1}\) and \(a_n\). Let \((j\quad k)\) be a transposition with \(j<k\). Note that
so that S is maximised at \((n-1\quad n)\).
Partition \(S_n\backslash \{e\}\) into \(F_1\) and \(F_1^C\) where \(F_1\) is the set of permutations with \(\sigma (1)=1\). On \(F_1\),
Now consider the maximum of S on \(F_1^C\). From Steele’s argument [17], it is known that strictly increasing the number of fixed points (by multiplying by suitably chosen transpositions), increases S. Also, if written in the disjoint cycle notation, elements of \(F_1^C\) must contain a cycle of the form \((1\quad i_2 \quad \dots \quad i_N)\). By multiplying by suitably chosen transpositions, any disjoint cycle not containing 1 may be factored out whilst increasing S. Then write
so that the maximum of S on \(F_1^C\) occurs at an element of the form
All transpositions \((1\quad i_k)\) give \((1,i_k)\) an inversions for \((1\quad i_k)\), therefore can be removed—all the time increasing S—until one gets a transposition of the form \((1\quad i)\). The maximum must occur at such a transposition. Note that
Therefore \(S(1\quad i)\le S(1\quad 2)\) and for any \(\sigma \in F_1^C\):
For \(n\ge 4\), \(f_1\le 2f_0/\sqrt{n}\) as
Therefore the Upper Bound Lemma yields:
It is shown in the author’s Ph.D. thesis [10, p. 93] that this yields:
Using (6), and \((1-x)\le \exp (-x)\), a rewriting yields:
By (7) the second exponential is less than one. Writing \(k=\alpha \,n^{n-1}\ln (n)/2+c\,n^{n-2}\) and rewriting again
Note that for \(\alpha >1\) and n sufficiently large by (9)
and the result follows \(\bullet \)\(\square \)
If there were an effective lower bound for the total variation distance for \(k=n^{n-1}\ln (n)/2-c\,n^{n-2}\), and if such a bound approached one for large c, then the cut-off phenomenon would be exhibited for this random walk. Unfortunately no such result is at hand, but the following gives a partial result, showing that the random walk is still far from random for small multiples of \(n^{n-2}\). The following will be used.
Lemma 4.2
The following hold for, respectively, \(0<x<1/2\) and \(n\ge 2\):
Proof
The bound (11) is [10, Lemma 5.5.1] with \(n=1\). Note that \(B_n\rightarrow 1\), \(B_2>1\), and note
\(\square \)
5.1.3 Lower Bounds
For\(k=\alpha \,n^{n-2}\), \(\alpha >0\), andnlarge
whereBcan be chosen to be any\(B>1\)for sufficiently largen.
Proof
Using the Lower Bound Lemma 3.11 with the matrix element \(\delta ^{(n-1\quad n)}\), using a calculation from the Ph.D. thesis [10, p. 95], together with (11),
\(\square \)
5.2 A Family of Walks on the Sekine Quantum Groups
5.2.1 Sekine Quantum Groups
Sekine [16] introduced a family a finite quantum groups of order \(2n^2\) that are neither commutative nor cocommutative.
The following follows the presentation of Franz and Skalski [6] rather than of Sekine. Let \(n\ge 3\) be fixed and \(\zeta _n=e^{2\pi i/n}\) and
with addition modulo n.
Consider \(n^2\) one-dimensional spaces \(\mathbb {C} e_{(i,j)}\) spanned by elements indexed by \(\mathbb {Z}_n\times \mathbb {Z}_n\), \(\{e_{(i,j)}:i,j\in \mathbb {Z}_n\}\). Together with a copy of \(M_n(\mathbb {C})\), spanned by elements \(E_{ij}\) indexed by \(\{(i,j)\,:\,i,j=1,\dots , n,\, 0\equiv n\}\), a direct sum of these \(n^2+1\) spaces, the \(2n^2\) dimensional space
can be given the structure of the algebra of functions on a finite quantum group denoted by \(Y_n\) (so that \(A_n=F(Y_n)\)). On the one dimensional elements the comultiplication is given by, for \(i,\,j\in \mathbb {Z}_n\):
On the matrix elements in the \(M_n(\mathbb {C})\) factor:
The antipode is given by \(S(e_{(i,j)})=e_{(-i,-j)}\) on the one dimensional factors and the transpose for the \(M_n(\mathbb {C})\) factor. Sekine does not give the counit but by noting that \(u_{(0,0)}=I_{n}\) (where \(U\in M_n(M_n(\mathbb {C}))\) is defined in Sekine’s original paper), it can be seen that the coefficient of the \(e_{(0,0)}\) one-dimensional factor satisfies the counital property. The Haar state \(\int _{Y_n}\in M_p(Y_n)\) is given by:
Although Sekine restricts the construction to \(n\ge 3\), for \(n=1\) and \(n=2\) the construction still satisfies the conditions of Kac and Paljutkin [9] and so are algebras of functions of quantum groups. Sekine does not clarify but the construction for \(n=2\) does not give the celebrated Kac–Paljutkin quantum group of order eight and indeed \(Y_2\) is commonly mistaken for the Kac–Paljutkin quantum group in the literature. In fact, \(Y_2\) is the dual group \(\widehat{D_4}\) while \(Y_1\) is the classical group \(\mathbb {Z}_2\) [10].
To use the quantum Diaconis–Shahshahani Upper Bound Lemma, the representation theory of the quantum group must be well understood. The representation theory of the Sekine quantum groups changes according to the parity of the parameter n and the below restricts to n odd.
5.2.2 Representation Theory for n Odd
For n odd there are 2n one dimensional representations and \(\left( {\begin{array}{c}n\\ 2\end{array}}\right) \) two dimensional representations. Consider the convolution algebra . Sekine gives 2n minimal one-dimensional central projections, \(\left( {\begin{array}{c}n\\ 2\end{array}}\right) \) minimal two-dimensional central projections, and matrix units in the two-dimensional subspaces. Sébastian Palcoux (private communication, March 2016) suggests a connection between projections and matrix units in the convolution algebra and the comultiplication in the algebra of functions. Palcoux’s approach uses slightly different Fourier transforms and convolutions—and the language of planar algebras (see [12])—therefore his results could not be used directly. However it was possible to show that the one-dimensional central projections in were the matrix elements of the one dimensional representations, while the two-dimensional central projections were, up to a factor of two, the matrix elements of the irreducible two-dimensional representations (see the appendix to [10] for the brute-force verification). As far as the author knows this was not explicitly stated in the existing literature.
Let \(\ell \in \{0,1,\dots ,n-1\}\). Then
are the 2n matrix elements of the one dimensional representations so that
Note that \(\rho _0^+=\mathbb {1}_{Y_n}\) is the matrix element of the trivial representation.
Now let \(u\in \{0,1,\dots ,n-1\}\) and \(v\in \{1,2,\dots ,(n-1)/2\}\). Each pair gives a two dimensional representation \(\kappa ^{u,v}:\mathbb {C}^2\rightarrow \mathbb {C}^2\otimes F(Y_n)\) with matrix elements:
5.2.3 States on the Sekine Quantum Groups
Consider the basis of \(F(\widehat{Y_n})\) dual to \(\{e_{(i,j)}\,:\,i,j\in \mathbb {Z}_n\}\cup \{E_{i,j}\,:\,i,j=1,2,\dots ,n\}\) given by
Let \(\mu \in F(\widehat{Y_n})\):
Franz and Skalski [6] show that \(\mu \in M_p(Y_n)\) if and only if
-
\(x_{(i,j)}\ge 0\) for all \(i,j\in \mathbb {Z}_n\),
-
the matrix \(A=(a_{pq})\) is positive,
-
\({\text {Tr}}(\mu ):=\sum _{i,j\in \mathbb {Z}_n}x_{(i,j)}+\sum _{p=1}^n a_{ pp}=1\).
5.2.4 A Random Walk
Where n is odd, and \(J_n=\sum _{p,q=1}^n E^{p,q}\in M_n(\mathbb {C})\) the matrix of all ones, consider the state
Note that \(\nu \) is not supported on a commutative subalgebra and so the associated random walk is not a classical Markov chain. The Diaconis–Shahshahani Upper Bound Lemma gives:
Proposition 4.3
For \(k=\alpha \, n^2\), with \(\alpha >1/20\) and \(n\ge 3\)
with \(c_n\rightarrow 1\) as \(n\rightarrow \infty \).
Therefore, as Fig. 1 shows, the cut-off phenomenon does not occur.
Proof
For the Upper Bound, consider first the one-dimensional representations \(\kappa _\ell ^\pm \) (except the trivial representation \(\kappa _0^+\)).
Note that the \(\kappa _\ell ^+\) will dominate to such an extent that very trivial bounds may be used on the other terms.
The contribution to (15) from the \(\kappa _\ell ^+\) is given by
Using the symmetry of \(\cos ^2(x)\) about \(x=\pi /2\), \(\cos x\le e^{-x^2/2}\) on \([0,\pi /2]\) [3, Theorem 2, p. 26], and employing the following inequality:
A similar sum occurs in the analysis of the classical walk on \(\mathbb {Z}_n\). See p.26 of Diaconis [3] to see how such sums are handled (details teased out in Sect. 3.4 [11]):
for \(\alpha \ge 1/20\)\(\square \)
With the dominant term identified, the other terms can be bound crudely. In particular,
Note that \(\widehat{\nu }(\kappa ^{u,v})\) is real and diagonal:
Using the trivial \(|\cos (x)+\cos (y)|\le 2\) bound,
Putting these bounds together gives the result with
Consider the Lower Bound Lemma 3.11 with \(\rho _{1}^+\):
Consider \(h(x)=\ln \left( \dfrac{1}{2} (\cos ^2x+1)\,e^{x^2/2}\right) \). Note \(h(0)=h'(0)=h''(0)=0\) but
for \(x\in (0,\pi )\). Therefore \(\dfrac{1}{2} (\cos ^2x+1)\ge e^{-x^2/2}\) and
References
Bekka, B., de la Harpe, P., Valette, A.: Kazhdans Property (\(T\)), New Mathematical Monographs, vol. 11. Cambridge University Press, Cambridge (2008)
Bhowmick, J., Skalski, A., Sołtan, P.M.: Quantum group of automorphisms of a finite quantum group. J. Algebra 423, 514–537 (2015)
Diaconis, P.: Group Representations in Probability and Statistics. IMS, Hayward (1988)
Diaconis, P., Shahshahani, M.: Generating a random permutation with random transpositions. Z. Wahrscheinlichkeitstheorie Verw. Gebiete 57, 159–179 (1981)
Franz, U., Gohm, R.: Random Walks on Finite Quantum Groups, Quantum Independent Increment Processes II. Lecture Notes in Mathematics, pp. 1–32. Springer, Berlin (2006)
Franz, U., Skalski, A.: On idempotent states on quantum groups. J. Algebra 322(5), 1774–1802 (2009)
Freslon, A.: Cut-off phenomenon for random walks on free orthogonal free groups, to appear in Probab. Theory Relat. Fields (2018)
Freslon, A.: Quantum reflections, random walks and cut-off (2018). arXiv:1802.09402
Kac, G.I., Paljutkin, V.G.: Finite group rings. Trudy Moskov. Mat. Obšč. 15, 224–261 (1966). Translated in Trans. Moscow Math. Soc. (1967), 251–284, 1996
McCarthy, J.P.: Random walks on finite quantum groups: Diaconis–Shahshahani theory for quantum groups. PhD thesis (2017). arXiv:1709.09357
McCarthy, J.P.: The cut-off phenomenon in random walks on finite groups. MSc thesis (2010). arXiv:1504.05387
Palcoux, S.: Ore’s theorem for cyclic subfactor planar algebras and beyond. Pac. J. Math. 292–1, 203–221 (2018)
Pisier, G.: Non-commutative \(\cal{L}^p\)-spaces. In: Johnson, W.B., Lindenstrauss, J. (eds.) Handbook of the Geometry of Banach Spaces, vol. 2, pp. 1459–1517. North Holland, Amsterdam (2003)
Rosenthal, J.S.: Random rotation: characters and random walks on \(SO(N)\). Ann. Probab. 22(1), 398–423 (1997)
Saloff-Coste, L.: Random Walks on Finite Groups (Probability on Discrete Structures), pp. 263–346. Springer, Berlin (2004)
Sekine, Y.: An example of finite-dimensional Kac algebras of Kac–Paljutkin type. Proc. Am. Math. Soc. 124(4), 1139–1147 (1996)
Steele, J.M.: The Cauchy–Schwarz Master Class: An Introduction to the Art of Mathematical Inequalities. Cambridge University Press, New York (2004)
Timmermann, T.: An invitation to quantum groups and duality. Eur. Math. Soc. (2008)
Vainermann, L.I., Kac, G.I.: Nonunimodular ring groups and Hopf–von Neumann algebras. Dokl. Akad. Nauk SSSR 211, 194–225; English transl. Math. USSR Sb. 23 (1974), 170–181 (1973)
Van Daele, A.: Multiplier Hopf algebras. Trans. Am. Math. Soc. 342(2), 917–932 (1994)
Van Daele, A.: The Haar measure on finite quantum groups. Proc. Am. Math. Soc. 125(12), 3489–3500 (1997)
Van Daele, A.: An algebraic framework for group duality. Adv. Math. 140(2), 323–366 (1998)
Van Daele, A.: The Fourier transform for group duality (2007). Arxiv preprint, arXiv:math/0609502
Wang, S.: \(L_p\)-improving convolution operators on finite quantum groups. Indiana Univ. Math. J. 65(5), 1609–1637 (2016)
Woronowicz, S.L.: Compact matrix pseudogroups. Commun. Math. Phys. 111, 613–665 (1987)
Acknowledgements
I would like to thank Adam Skalski; Example 4.2 was developed during a visit to Adam at the Institute of Mathematics of the Polish Academy of Sciences (IMPAN), Warsaw, Poland. This trip was financially supported by IMPAN and also Cork Institute of Technology. I would like to thank Uwe Franz for assisting with Proposition 2.1. I would like to thank Amaury Freslon for encouragement and helpful comments; in particular for help in greatly improving the presentation of the bounds for the random walk on \(\widehat{S_n}\). The rest of the paper was developed during the author’s Ph.D. study at University College Cork, under the supervision of Stephen Wills.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Hans G. Feichtinger.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
McCarthy, J.P. Diaconis–Shahshahani Upper Bound Lemma for Finite Quantum Groups. J Fourier Anal Appl 25, 2463–2491 (2019). https://doi.org/10.1007/s00041-019-09670-4
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00041-019-09670-4