English
Related papers

Related papers: Traces on Infinite-Dimensional Brauer Algebras

200 papers

The quantization problem for the trace-bracket algebra, derived from double Poisson brackets, is discussed. We obtain a generalization of the boundary YBE (or so-called ABCD-algebra) for the quantization of quadratic trace-brackets. A…

Mathematical Physics · Physics 2016-01-15 Jean Avan , Eric Ragoucy , Vladimir Rubtsov

We give a characterisation of the idempotents of the partition monoid, and use this to enumerate the idempotents in the finite partition, Brauer and partial Brauer monoids, giving several formulae and recursions for the number of…

The study of very large graphs is a prominent theme in modern-day mathematics. In this paper we develop a rigorous foundation for studying the space of finite labelled graphs and their limits. These limiting objects are naturally countable…

Combinatorics · Mathematics 2021-05-27 Apoorva Khare , Bala Rajaratnam

We give a survey on the theory of representation-finite and certain minimal representation-infinite algebras.The main goals are the existence of multiplicative bases and of coverings with good properties. Both are attained via…

Representation Theory · Mathematics 2013-02-06 Klaus Bongartz

In this paper we define infinite-dimensional algebra and its representation, whose basis is naturally identified with semi-infinite configurations of the square ladder model. We also extrapolate the ideas for the cyclic 3-leg triangular…

Combinatorics · Mathematics 2022-06-14 Valerii Sopin

We study the behaviour of a sequence of biased random walks X(i), i>=0 on a sequence of random graphs, where the initial graph is Zd and otherwise the graph for the i-th walk is the trace of the (i - 1)-st walk. The sequence of bias vectors…

Probability · Mathematics 2019-10-23 David Croydon , Mark Holmes

The Aldous--Broder algorithm provides a way of sampling a uniformly random spanning tree for finite connected graphs using simple random walk. Namely, start a simple random walk on a connected graph and stop at the cover time. The tree…

Probability · Mathematics 2021-03-29 Yiping Hu , Russell Lyons , Pengfei Tang

We consider non-zero endomorphisms of the Dales and Davie algebras of infinitely differentiable functions on intervals in the real line. We discuss necessary and sufficient conditions for a selfmap of the interval to induce a compact…

Functional Analysis · Mathematics 2007-05-23 J. F. Feinstein , H. Kamowitz

Pure infiniteness (in sense of E.Kirchberg and M.R{\o}rdam) is considered for C*-algebras arising from singly generated dynamical systems. In particular, Cuntz-Krieger algebras and their generalizations, i.e., graph-algebras and O_A of an…

Operator Algebras · Mathematics 2007-05-23 Jacob v. B. Hjelmborg

Bijections between invariants associated to indecomposable projective modules over some suitable Brauer configuration algebras and invariants associated to solutions of the Kronecker problem and the four subspace problem are used to…

The genus gen(D) of a finite-dimensional central division algebra D over a field F is defined as the collection of classes [D'] in the Brauer group Br(F), where D' is a central division F-algebra having the same maximal subfields as D. For…

Rings and Algebras · Mathematics 2014-07-21 Sergey V. Tikhonov

Characterizing derived equivalences between algebras via combinatorial structures has recently become a popular topic. In this paper, we study admissible fractional Brauer graph algebras, a new subclass of self-injective special biserial…

Representation Theory · Mathematics 2026-04-09 Bohan Xing

$M$-Lipschitz mappings of graphs (or equivalently graph-indexed random walks) are a generalization of standard random walk on $\mathbb{Z}$. For $M \in \N$, an \emph{$M$-Lipschitz mapping} of a connected rooted graph $G = (V,E)$ is a mapping…

Combinatorics · Mathematics 2018-04-26 Jan Bok

We study the space of traces associated with arbitrary full free products of unital, separable $C^*$-algebras. We show that, unless certain basic obstructions (which we fully characterize) occur, the space of traces always results in the…

Operator Algebras · Mathematics 2024-12-19 Adrian Ioana , Pieter Spaas , Itamar Vigdorovich

Random walk on changing graphs is considered. For sequences of finite graphs increasing monotonically towards a limiting infinite graph, we establish transition probability upper bounds. It yields sufficient transience criteria for simple…

Probability · Mathematics 2018-10-09 Ruojun Huang

This article continues the investigation of the tracial geometry of classifiable $\mathrm{C}^*$-algebras that have real rank zero and stable rank one. Using the language of optimal transport, we describe several situations in which the…

Operator Algebras · Mathematics 2023-05-08 Bhishan Jacelon

The number of walks from one vertex to another in a finite graph can be counted by the adjacency matrix. In this paper, we prove two theorems that connect the graph Laplacian with two types of walks in a graph. By defining two types of…

Combinatorics · Mathematics 2017-07-13 Chengzheng Yu

We statistically compare the relationships between frequencies of digits in continued fraction expansions of typical rational points in the unit interval and higher dimensional generalisations. This takes the form of a Large Deviation and…

Dynamical Systems · Mathematics 2025-07-16 Valérie Berthé , Stephen Cantrell , Jungwon Lee , Mark Pollicott

The main purpose of this thesis is to study the interplay between geometric properties of infinite graphs and analytic and probabilistic objects such as transition operators, harmonic functions and random walks on these graphs. For a…

Probability · Mathematics 2010-12-14 Ecaterina Sava

Given a von Neumann algebra $M$ with a faithful normal finite trace, we introduce the so called finite tracial algebra $M_f$ as the intersection of $L_p$-spaces $L_p(M, \mu)$ over all $p \geq 1$ and over all faithful normal finite traces…

Operator Algebras · Mathematics 2009-08-11 Sh. A. Ayupov , R. Z. Abdullaev , K. K. Kudaybergenov