English
Related papers

Related papers: Wang Algebra: From Theory to Practice

200 papers

Since the invention of space-time coding numerous algebraic methods have been applied in code design. In particular algebraic number theory and central simple algebras have been on the forefront of the research. In this paper we are turning…

Information Theory · Computer Science 2011-05-19 Roope Vehkalahti , Hsiao-feng Lu

Directed mixed graphs permit directed and bidirected edges between any two vertices. They were first considered in the path analysis developed by Sewall Wright and play an essential role in statistical modeling. We introduce a matrix…

Statistics Theory · Mathematics 2024-07-23 Qingyuan Zhao

We derive the quiver gauge theory on the world-volume of D3-branes transverse to an L(a,b,c) singularity by computing the endomorphism algebra of a tilting object first constructed by Van den Bergh. The quiver gauge theory can be concisely…

High Energy Physics - Theory · Physics 2011-03-18 Richard Eager

The purpose of this paper is to make the theory of vertex algebras trivial. We do this by setting up some categorical machinery so that vertex algebras are just ``singular commutative rings'' in a certain category. This makes it easy to…

Quantum Algebra · Mathematics 2007-05-23 Richard E. Borcherds

We study representation theory of the partially transposed permutation matrix algebra, a matrix representation of the diagrammatic walled Brauer algebra. This algebra plays a prominent role in mixed Schur-Weyl duality that appears in…

Quantum Physics · Physics 2023-10-04 Dmitry Grinko , Adam Burchardt , Maris Ozols

Let (W, S) be a Coxeter system. A W-graph is an encoding of a representation of the corresponding Iwahori-Hecke algebra. Especially important examples include the W-graph corresponding to the action of the Iwahori-Hecke algebra on the…

Combinatorics · Mathematics 2013-08-01 Michael Chmutov

This paper presents a novel methodology that transforms discrete-time quantum walks into a graph embedding technique, offering a fresh perspective on graph representation methods.Through mathematical manipulations, the approach of this…

Quantum Physics · Physics 2024-07-17 Boxuan Ai

This paper studies the eigenvalue distribution of the Watts-Strogatz random graph, which is known as the "small-world" random graph. The construction of the small-world random graph starts with a regular ring lattice of n vertices; each has…

Probability · Mathematics 2021-01-28 Poramate Nakkirt

We review some aspects of gauged WZW models. By choosing a nilpotent subgroup as gauge group, one is lead to three main applications: the construction of field theories with an extended conformal symmetry, the construction of the effective…

High Energy Physics - Theory · Physics 2007-05-23 A. Sevrin

A classification of the possible symmetric principal bundles with a compact gauge group, a compact symmetry group and a base manifold which is regularly foliated by the orbits of the symmetry group is derived. A generalization of Wang's…

General Relativity and Quantum Cosmology · Physics 2011-04-15 Othmar Brodbeck

This is a first of our papers devoted to "noncommutative topology and graph theory". Its origin is the paper math.QA/0002238 by I. Gelfand, V. Retakh, and R.L. Wilson where a new class of noncommutative algebras $Q_n$ was introduced. The…

Quantum Algebra · Mathematics 2007-05-23 Israel Gelfand , Sergei Gelfand , Vladimir Retakh

The theory of algebraic extensions of Banach algebras is well established, and there are many constructions which yield interesting extensions. In particular, Cole's method for extending uniform algebras by adding square roots of functions…

Functional Analysis · Mathematics 2019-12-19 S. Morley

Let $Y$ denote a $D$-class symmetric association scheme with $D \geq 3$, and suppose $Y$ is almost-bipartite P- and Q-polynomial. Let $x$ denote a vertex of $Y$ and let $T=T(x)$ denote the corresponding Terwilliger algebra. We prove that…

Combinatorics · Mathematics 2007-05-23 John S. Caughman , Mark S. MacLean , Paul M. Terwilliger

D. Wilson~\cite{[Wi]} in the 1990's described a simple and efficient algorithm based on loop-erased random walks to sample uniform spanning trees and more generally weighted trees or forests spanning a given graph. This algorithm provides a…

Probability · Mathematics 2018-08-29 L. Avena , F. Castell , A. Gaudilliere , C. Melot

Professor Chen Ning Yang has made seminal and influential contributions in many different areas in theoretical physics. This talk focuses on his contributions in statistical mechanics, a field in which Professor Yang has held a continual…

History and Philosophy of Physics · Physics 2015-05-20 F. Y. Wu

Deep learning-based approaches have been developed to solve challenging problems in wireless communications, leading to promising results. Early attempts adopted neural network architectures inherited from applications such as computer…

Information Theory · Computer Science 2022-11-07 Yifei Shen , Jun Zhang , S. H. Song , Khaled B. Letaief

Luo, Tian and Wu [Discrete Math. 345 (4) (2022) 112788] conjectured that for any tree $T$ with bipartition $(X,Y)$, every $k$-connected bipartite graph $G$ with minimum degree at least $k+w$, where $w=\max\{|X|,|Y|\}$, contains a tree…

Combinatorics · Mathematics 2024-12-24 Meng Ji

An LR-structure is a tetravalent vertex-transitive graph together with a special type of a decomposition of its edge-set into cycles. LR-structures were introduced in a paper by P. Poto\v{c}nik and S. Wilson, titled `Linking rings…

Combinatorics · Mathematics 2023-05-24 Marston Conder , Luke Morgan , Primož Potočnik

Terwilliger algebras are finite-dimensional semisimple algebras that were first introduced by Paul Terwilliger in 1992 in studies of association schemes and distance-regular graphs. The Terwilliger algebras of the conjugacy class…

Combinatorics · Mathematics 2024-11-14 Allen Herman , Roghayeh Maleki , Andriaherimanana Sarobidy Razafimahatratra

We propose a graph-based process calculus for modeling and reasoning about wireless networks with local broadcasts. Graphs are used at syntactical level to describe the topological structures of networks. This calculus is equipped with a…

Logic in Computer Science · Computer Science 2017-06-19 Shichao Liu , Ying Jiang