相关论文: Notes on the quantum tetrahedron

We develop an equivariant theory of graphs with respect to quantum symmetries and present a detailed exposition of various examples. We portray unitary tensor categories as a unifying framework encompassing all finite classical simple…

A Steinhaus matrix is a binary square matrix of size $n$ which is symmetric, with diagonal of zeros, and whose upper-triangular coefficients satisfy $a_{i,j}=a_{i-1,j-1}+a_{i-1,j}$ for all $2\leq i<j\leq n$. Steinhaus matrices are…

The Temperley-Lieb algebra \tln(\beta) can be defined as the set of rectangular diagrams with n points on each of their vertical sides, with all points joined pairwise by non-intersecting strings. The multiplication is then the…

This paper explores a particular statistical model on 6-valent graphs with special properties which turns out to be invariant with respect to certain Roseman moves if the graph is the singular point graph of a diagram of a 2-knot. The…

Modular operads are a special type of operad: in fact, they bear the same relationship to operads that graphs do to trees (i.e. simply connected graphs). One of the basic examples of a modular operad is the collection of…

Circulant graphs are an important class of interconnection networks in parallel and distributed computing. Integral circulant graphs play an important role in modeling quantum spin networks supporting the perfect state transfer as well. The…

We describe two constructions of (very) dense graphs which are edge disjoint unions of large {\em induced} matchings. The first construction exhibits graphs on $N$ vertices with ${N \choose 2}-o(N^2)$ edges, which can be decomposed into…

In this paper, we use normal surface theory to study Dehn filling on a knot-manifold. First, it is shown that there is a finite computable set of slopes on the boundary of a knot-manifold that bound normal and almost normal surfaces in a…

The problem of counting tilings of a plane region using specified tiles can often be recast as the problem of counting (perfect) matchings of some subgraph of an Aztec diamond graph A_n, or more generally calculating the sum of the weights…

E-graphs are a data structure for equational reasoning and optimization over ground terms. One of the benefits of e-graph rewriting is that it can declaratively handle useful but difficult to orient identities like associativity and…

For modular Lie superalgebras, new notions are introduced: Divided power homology and divided power cohomology. For illustration, we give presentations (in terms of analogs of Chevalley generators) of finite dimensional Lie (super)algebras…

Let $C^*(E)$ be the graph $C^*$-algebra associated to a graph E and let J be a gauge invariant ideal in $C^*(E)$. We compute the cyclic six-term exact sequence in $K$-theory of the associated extension in terms of the adjacency matrix…

The homology of Kontsevich's commutative graph complex parameterizes finite type invariants of odd dimensional manifolds. This {\it graph homology} is also the twisted homology of Outer Space modulo its boundary, so gives a nice point of…

Motivated by a construction in the theory of cluster algebras (Fomin and Zelevinsky), one associates to each acyclic directed graph a family of sequences of natural integers, one for each vertex; this construction is called a {\em frieze};…

We show how the modular symmetries that have been found to be consistent with most available scaling data from quantum Hall systems, derive from a rigid family of algebraic curves of the elliptic type. The complicated special functions…

In this thesis we develop a full characterization of abelian quantum statistics on graphs. We explain how the number of anyon phases is related to connectivity. For 2-connected graphs the independence of quantum statistics with respect to…

Let $\Sigma$ be a finite type surface, and $G$ a complex algebraic simple Lie group with Lie algebra $\mathfrak{g}$. The quantum moduli algebra of $(\Sigma,G)$ is a quantization of the ring of functions of $X_G(\Sigma)$, the variety of…

We make connections of a counting problem of Eulerian cycles for undirected graphs to homological spectral graph theory, and formulate explicitly a trace formula that identifies the number of Eulerian circuits on an Eulerian graph with the…

We start with the consideration of fusion rules of anyonic particles evolving on a 2D surface and the a hypergroup comes with it to construct entangled quantum Markov chains. The fusion rules induce an association scheme with Krein…

Starting from basic identities of the group E8, we perform progressive reductions, namely decompositions with respect to the maximal and symmetric embeddings of E7xSU(2) and then of E6xU(1). This procedure provides a systematic approach to…