Related papers: A generating problem for subfactors

In order to enumerate the fake projective planes, as announced in~\cite{CS}, we found explicit generators and a presentation for each maximal arithmetic subgroup $\bar\Gamma$ of~$PU(2,1)$ for which the (appropriately normalized) covolume…

We determine spectral measures for some nimrep graphs arising in subfactor theory, particularly those associated with SU(3) modular invariants and subgroups of SU(3). Our methods also give an alternative approach to deriving the results of…

We consider a two-fold problem: on the one hand, the classification of a family of solution-generating techniques in (modified) supergravity and, on the other hand, the classification of a family of canonical transformations of…

In this paper we give a complete classification of minimal generating systems in a very general class of Fuchsian groups G. This class includes for example any G which has at least seven non-conjugate cyclic subgroups of order greater than…

We study an abstract setting for cutting planes for integer programming called the infinite group problem. In this abstraction, cutting planes are computed via cut generating function that act on the simplex tableau. In this function space,…

We give a presentation by generators and relations of the group of 3-qubit Clifford+CS operators. The proof roughly consists of two parts: (1) applying the Reidemeister-Schreier theorem recursively to an earlier result of ours; and (2) the…

For $R_1,R_2,R_3,\dots$ a family of non isomorphic rings (or algebras) having each only 2 idempotents ($1$ and $0$), we classify up to isomorphism the rings (or algebras) obtained by taking products of powers of the different $R_i$. We show…

A detailed study of certain apspects of some 2+1 dimensional field theories is presented with special emphasis on the role of Wigner's little group for massless particles in generating gauge transformations. The planar models considered…

A general simplicity problem in category theory is proposed. A particular example, the simplest choice of generators of an algebra is specified and illustrated by an example.

For a nonorientable surface, the twist subgroup is an index 2 subgroup of the mapping class group. It is generated by Dehn twists about two-sided simple closed curves. In this paper, we study involution generators of the twist subgroup. We…

We study the structure of the inverse limit of the graded algebras of local unitary invariant polynomials using its Hilbert series. For k subsystems, we conjecture that the inverse limit is a free algebra and the number of algebraically…

Originally motivated by algebraic invariant theory, we present an algorithm to enumerate integer vectors modulo the action of a permutation group. This problem generalizes the generation of unlabeled graph up to an isomorphism. In this…

Tree tensor network descriptions of critical quantum spin chains are empirically known to reproduce correlation functions matching CFT predictions in the continuum limit. It is natural to seek a more complete correspondence, additionally…

We introduce a class of subproduct systems of finite dimensional Hilbert spaces whose fibers are defined by the Jones-Wenzl projections in Temperley-Lieb algebras. The quantum symmetries of a subclass of these systems are the free…

We suggest a classification scheme for subfactorizable fusion bialgebras, particularly for exchange relation planar algebras. This scheme begins by transforming infinite diagrammatic consistency equations of exchange relations into a finite…

We give an efficient algorithm to randomly generate finitely generated subgroups of a given size, in a finite rank free group. Here, the size of a subgroup is the number of vertices of its representation by a reduced graph such as can be…

Composing with the inclusion $\mathsf{Set}\to\mathsf{Cat} $, a graph $G$ internal to $\mathsf{Set} $ becomes a graph of discrete categories, the coinserter of which is the category freely generated by $G$. Introducing a suitable definition…

Let $G\cong \mathbb Z/m_1\mathbb Z\times\ldots\times \mathbb Z/m_r\mathbb Z$ be a finite abelian group with $m_1\mid\ldots\mid m_r=\exp(G)$. The $n$-term subsums version of Kneser's Theorem, obtained either via the DeVos-Goddyn-Mohar…

Extracting structured subgraphs inside large graphs - often known as the planted subgraph problem - is a fundamental question that arises in a range of application domains. This problem is NP-hard in general, and as a result, significant…

This paper presents a novel proof that for any convex cone, the size of conically independent generators is at most twice that of minimum cardinality generators. While this result is known for linear spaces, we extend it to general cones…