Related papers: Traces on Infinite-Dimensional Brauer Algebras
In this paper we study the behaviour of modules over finite dimensional algebras whose endomorphism algebra is a division ring. We show that there are finitely many such modules in the module category of an algebra if and only if the length…
In 2017, Green and Schroll introduced a generalization of Brauer graph algebras which they call Brauer configuration algebras. In the present paper, we further generalize Brauer configuration algebras to fractional Brauer configuration…
We describe all possible coactions of finite groups (equivalently, all group gradings) on two-dimensional Artin-Schelter regular algebras. We give necessary and sufficient conditions for the associated Auslander map to be an isomorphism,…
The Erd\H{o}s, Gr\"unwald, and Weiszfeld theorem is a characterization of those infinite graphs which are Eulerian. That is, infinite graphs that admit infinite Eulerian paths. In this article we prove an effective version of the Erd\H{o}s,…
We describe two BQP-complete problems concerning properties of sparse graphs having a certain symmetry. The graphs are specified by efficiently computable functions which output the adjacent vertices for each vertex. Let i and j be two…
We find the asymptotic number of connected graphs with $k$ vertices and $k-1+l$ edges when $k,l$ approach infinity, reproving a result of Bender, Canfield and McKay. We use the {\em probabilistic method}, analyzing breadth-first search on…
Two infinite walks on the same finite graph are called compatible if it is possible to introduce delays into them in such a way that they never collide. Years ago, Peter Winkler asked the question: for which graphs are two independent walks…
This paper explains the periodicity of the Grover walk on finite graphs. We characterize the graphs to induce 2, 3, 4, 5-periodic Grover walk and obtain a necessary condition of the graphs to induce an odd-periodic Grover walk.
We present the implementation of an algorithm for graph isomorphism testing, based on ideas about number of walks (of sufficiently large length) between vertices. The algorithm is expanded for strongly regular graphs (SRG-s) by testing the…
A new approach to find all the transitive orientations for a comparability graph (finite or infinite) is presented. This approach is based on the link between the notion of ``strong'' partitive set and the forcing theory (notions of…
In finite graphs, finite-order tangles offer an abstract description of highly connected substructures. In infinite graphs, infinite-order tangles compactify the graphs in the same way the ends compactify connected locally finite graphs.…
The centralizer algebra of the action of the unitary group on the real tensor powers of its natural module, is described by means of a modification in the multiplication of the signed Brauer algebras. The relationships of this algebra with…
We analyse graphs in which each vertex is assigned random coordinates in a geometric space of arbitrary dimensionality and only edges between adjacent points are present. The critical connectivity is found numerically by examining the size…
We prove local convergence results for the uniformly random, labelled or unlabelled, graphs from subcritical families. As an example special case, we prove Benjamini-Schramm convergence for the uniform random unlabelled tree. We introduce a…
In operator algebra, the linearization trick is a technique that reduces the study of a non-commutative polynomial evaluated at elements of an algebra A to the study of a polynomial of degree one, evaluated on the enlarged algebra A x M r…
We define a range of new coarse geometric invariants based on various graph-theoretic measures of complexity for finite graphs, including: treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these…
We geometrically describe the relation induced on a set of graphs by isomorphism of their associated graph C*-algebras as the smallest equivalence relation generated by five types of moves. The graphs studied have finitely many vertices and…
We review and introduce several approaches to the study of centralizer algebras of the infinite symmetric group $S_\infty$. Our study is led by the double commutant relationships between finite symmetric groups and partition algebras; each…
We deal with the algebraicity of an iterated Puiseux series in several variables in terms of the properties of its coefficients. Our aim is to generalize to several variables the results from [HM15]. We show that the algebraicity of such a…
We compute the Brauer group of the moduli stack of elliptic curves over the integers, localizations of the integers, finite fields of odd characteristic, and algebraically closed fields of characteristic not $2$. The methods involved…