Related papers: Graph W*-Probability on the Free Group Factor L(F_…

Let $\mathcal{H}$ and $\mathcal{H}_0$ be Hilbert spaces and $\{A_n\}_n$ be a sequence of bounded linear operators from $\mathcal{H}$ to $\mathcal{H}_0$. The study frames for Hilbert spaces initiated the study of operators of the form…

We introduce pseudofinite W*-probability spaces. These are W*-probability spaces that are elementarily equivalent to Ocneanu ultraproducts of finite-dimensional von Neumann algebras equipped with arbitrary faithful normal states. We are…

For numerical semigroups with three generators, we study the asymptotic behavior of weighted factorization lengths, that is, linear functionals of the coefficients in the factorizations of semigroup elements. This work generalizes many…

We compute the fluctuation moments $\alpha_{m_1,\dots,m_r}$ of a Complex Wigner Matrix $X_N$ given by the limit $\lim_{N\rightarrow\infty}N^{r-2}k_r(Tr(X_N^{m_1}),\dots,Tr(X_N^{m_r}))$. We prove the limit exists and characterize the leading…

Let $G$ be the fundamental group of a graph of finitely generated virtually free groups with virtually cyclic edge groups. We shaw that $G$ is cohomologically good if $G$ is residually finite. If $G$ is LERF, we prove that G splits…

Consider an $n\times k$ matrix of i.i.d. Bernoulli random numbers with $p=1/2$. Dual RSK algorithm gives a bijection of this matrix to a pair of Young tableaux of conjugate shape, which is manifestation of skew Howe $GL_{n}\times…

Given a finitely generated subgroup $H$ of a free group $F$, we present an algorithm which computes $g_1,\ldots,g_m\in F$, such that the set of elements $g\in F$, for which there exists a non-trivial $H$-equation having $g$ as a solution,…

In this paper, we will construct the graph free product of noncommutative probability space. This is the attempt to explain and observe the combinatorial-object-depending probabilistic structure.

A factor $u$ of a word $w$ is a cover of $w$ if every position in $w$ lies within some occurrence of $u$ in $w$. A word $w$ covered by $u$ thus generalizes the idea of a repetition, that is, a word composed of exact concatenations of $u$.…

We study the asymptotic behavior of the free cumulants (in the sense of free probability theory of Voiculescu) of Jucys--Murphy elements--or equivalently--of the transition measure associated with a Young diagram. We express these cumulants…

We say that a nonselfadjoint operator algebra is partly free if it contains a free semigroup algebra. Motivation for such algebras occurs in the setting of what we call free semigroupoid algebras. These are the weak operator topology closed…

In the present work we review and refine some results about fixed points of semigroups of quantum channels. Noncommutative potential theory enables us to show that the set of fixed points of a recurrent semigroup is a W*-algebra; aside from…

For a simple connected graph $G$, the $Q$-generating function of the numbers $N_k$ of semi-edge walks of length $k$ in $G$ is defined by $W_Q(t)=\sum\nolimits_{k = 0}^\infty {N_k t^k }$. This paper reveals that the $Q$-generating function…

We follow the guiding line offered by canonical operators on the full Fock space, in order to identify what kind of cumulant functionals should be considered for the concept of bi-free independence introduced in the recent work of…

We provide a geometric model for the free $X$-generated $F$-restriction semigroup in the extended signature $(\cdot\,, ^+, ^m,\lambda)$, where the unary operation $^m$ maps an element $a$ to the maximum element $a^m$ of its $\sigma$-class,…

We discuss combinatorial algorithms for finding a maximum weight $f$-factor on an arbitrary multigraph, for given integral weights of magnitude at most $W$. For simple bipartite graphs the best-known time bound is $O(n^{2/3}\, m\, \log nW)$…

We consider the isomorphism problem for groups specified by their multiplication tables. Until recently, the best published bound for the worst-case was achieved by the n^(log_p n + O(1)) generator-enumeration algorithm. In previous work…

We introduce notation Q(1) * ... * Q(n) * L(F_r)$ for von Neumann algebra II_1 factors where $r$ is allowed to be negative. This notation is defined by rescalings of free products of II_1 factors, and is proved to be consistent with known…

In a previous paper of the first author a procedure was developed for counting the components of a graph through the knowledge of the components of its quotient graphs. We apply here that procedure to the proper power graph…

We present a polynomial-time algorithm that, given two independent sets in a claw-free graph $G$, decides whether one can be transformed into the other by a sequence of elementary steps. Each elementary step is to remove a vertex $v$ from…