Related papers: Gaussian Generating functionals on easy quantum gr…
We present an algorithm for approximating linear categories of partitions (of sets). We report on concrete computer experiments based on this algorithm which we used to obtain first examples of so-called non-easy linear categories of…
We study glued tensor and free products of compact matrix quantum groups with cyclic groups -- so-called tensor and free complexifications. We characterize them by studying their representation categories and algebraic relations. In…
This paper is concerned with exponential moments of integral-of-quadratic functions of quantum processes with canonical commutation relations of position-momentum type. Such quadratic-exponential functionals (QEFs) arise as robust…
We construct new integral representations for transformations of the ordinary generating function for a sequence, $\langle f_n \rangle$, into the form of a generating function that enumerates the corresponding "square series" generating…
Geometric semigroup theory is the systematic investigation of finitely-generated semigroups using the topology and geometry of their associated automata. In this article we show how a number of easily-defined expansions on finite semigroups…
Given a square matrix with elements in the group-ring of a group, one can consider the sequence formed by the trace (in the sense of the group-ring) of its powers. We prove that the corresponding generating series is an algebraic…
We investigate the semigroup structure of bosonic Gaussian quantum channels. Particular focus lies on the sets of channels which are divisible, idempotent or Markovian (in the sense of either belonging to one-parameter semigroups or being…
The quantum Fourier transform (QFT) is the principal algorithmic tool underlying most efficient quantum algorithms. We present a generic framework for the construction of efficient quantum circuits for the QFT by ``quantizing'' the…
We compute the generating function of random planar quadrangulations with three marked vertices at prescribed pairwise distances. In the scaling limit of large quadrangulations, this discrete three-point function converges to a simple…
We examine, for $-1<q<1$, $q$-Gaussian processes, i.e. families of operators (non-commutative random variables) $X_t=a_t+a_t^*$ -- where the $a_t$ fulfill the $q$-commutation relations $a_sa_t^*-qa_t^*a_s=c(s,t)\cdot \id$ for some…
We analyze Fourier hyperfunction and hyperfunction semigroups with non-densely defined generators and their connections with local convoluted $C$-semigroups. Structural theorems and spectral characterizations give necessary and sufficient…
Near-Gaussian probability densities are common in many important physical applications. Here we develop an asymptotic expansion methodology for computing entropic functionals for such densities. The expansion proposed is a close relative of…
In this article we construct a generalized Gaussian process coming from Coxeter groups of type B. It is given by creation and annihilation operators on an $(\alpha,q)$-Fock space, which satisfy the commutation relation $$…
We discuss a method for computing the generating function for the multiplicity distribution in field theories with strong time dependent external sources. At leading order, the computation of the generating function reduces to finding a…
Set partitions closed under certain operations form a tensor category. They give rise to certain subgroups of the free orthogonal quantum group $O_n^+$, the so called easy quantum groups, introduced by Banica and Speicher in 2009. This…
We compute the representation theory of two families of noncrossing partition quantum groups connected to amalgamated free products and free wreath products. This illustrates the efficiency of the methods developed in our previous joint…
Starting from a Hopf algebra endowed with an action of a group G by Hopf automorphisms, we construct (by a twisted double method) a quasitriangular Hopf G-coalgebra. This method allows us to obtain non-trivial examples of quasitriangular…
A classification is given for factorizations of almost simple groups with at least one factor solvable, and it is then applied to characterize $s$-arc-transitive Cayley graphs of solvable groups, leading to a striking corollary: Except the…
In this article, we study connections between components of the Cayley graph $\mathrm{Cay}(G,A)$, where $A$ is an arbitrary subset of a group $G$, and cosets of the subgroup of $G$ generated by $A$. In particular, we show how to construct…
We generalize generating functions for hypergeometric orthogonal polynomials, namely Jacobi, Gegenbauer, Laguerre, and Wilson polynomials. These generalizations of generating functions are accomplished through series rearrangement using…