Related papers: Computational Modular Character Theory
To understand large, connected systems, we cannot only zoom into the details. We also need to see the large-scale features from afar. One way to take a step back and get the whole picture is to model the systems as a network. However, many…
We employ the recently developed hybrid and mmgroup computational models for groups to calculate the character table of $N(\rm{2B}^5) \cong 2^{5+10+20}.( \rm{S}_3 \times \rm{L}_5 {2} )$, a maximal subgroup of the Monster sporadic simple…
In this short note, we discuss the basic approach to computational modeling of dynamical systems. If a dynamical system contains multiple time scales, ranging from very fast to slow, computational solution of the dynamical system can be…
This paper studies the canonical Chow quotient of a smooth projective variety by a reductive algebraic group. The main purpose is to give some topological interpretations and characterization of Chow quotient which have the advantage to be…
We describe an algorithm for determining the algebraic subgroup of GL(n,C) that is defined as the closure of the group generated by a finite number of elements of GL(n,C). The algorithm avoids the use of Groebner bases and can be used on…
Model predictive control (MPC) is one of the most successful modern control methods. It relies on repeatedly solving a finite-horizon optimal control problem and applying the beginning piece of the optimal input. In this paper, we develop a…
By exploiting relationships between the values taken by ordinary characters of symmetric groups we prove two theorems in the modular representation theory of the symmetric group. 1. The decomposition matrices of symmetric groups in odd…
The aim of this paper is to survey some aspects of mapping class groups with focus on their finite dimensional representations arising in topological quantum field theory.
This thesis develops the translation between category theory and computational linguistics as a foundation for natural language processing. The three chapters deal with syntax, semantics and pragmatics. First, string diagrams provide a…
We examine some variants of computation with closed timelike curves (CTCs), where various restrictions are imposed on the memory of the computer, and the information carrying capacity and range of the CTC. We give full characterizations of…
Error-correcting codes and related combinatorial constructs play an important role in several recent (and old) results in computational complexity theory. In this paper we survey results on locally-testable and locally-decodable…
Using the character expansion method, we generalize several well-known integrals over the unitary group to the case where general complex matrices appear in the integrand. These integrals are of interest in the theory of random matrices and…
CFTs are naturally defined on Riemann surfaces. The rational ones can be solved using methods from algebraic geometry. One particular feature is the covariance of the partition function under the mapping class group. In genus $g=1$, this…
In this paper, we give a simple and geometric, but formal, description of an open subset of the character variety of surface groups into $\mathrm{SL}_n(\mathbb{C})$. The main ingredient is a modified version of the WKB method, which we call…
The multiplicative and additive compounds of a matrix play an important role in several fields of mathematics including geometry, multi-linear algebra, combinatorics, and the analysis of nonlinear time-varying dynamical systems. There is a…
The class of uniformly computable real functions with respect to a small subrecursive class of operators computes the elementary functions of calculus, restricted to compact subsets of their domains. The class of conditionally computable…
This paper studies the expressive and computational power of discrete Ordinary Differential Equations (ODEs), a.k.a. (Ordinary) Difference Equations. It presents a new framework using these equations as a central tool for computation and…
We utilize group-theoretical methods to develop a matrix representation of differential operators that act on tensors of any rank. In particular, we concentrate on the matrix formulation of the curl operator. A self-adjoint matrix of the…
Using factorizable Hopf algebras, we construct modular invariant partition functions of charge conjugation, or Cardy, type as characters of coends in categories that share essential features with the ones appearing in logarithmic CFT. The…
Logarithmic conformal field theories are based on vertex algebras with non-semisimple representation categories. While examples of such theories have been known for more than 25 years, some crucial aspects of local logarithmic CFTs have…