Related papers: Computational Modular Character Theory
The aim of this paper is to present an elementary computable theory of probability, random variables and stochastic processes. The probability theory is baed on existing approaches using valuations and lower integrals. Various approaches to…
In this paper, by using the theory of circulant matrices we study some matrices over finite fields which involve the quadratic character and trinomial coefficients.
The emerging field of Nominal Computation Theory is concerned with the theory of Nominal Sets and its applications to Computer Science. We investigate here the impact of nominal sets on the definition of Cellular Automata and on their…
Studies of modular linear differential equations (MLDE) for the classification of rational CFT characters have been limited to the case where the coefficient functions (in monic form) have no poles, or poles at special points of moduli…
A compact set has computable type if any homeomorphic copy of the set which is semicomputable is actually computable. Miller proved that finite-dimensional spheres have computable type, Iljazovi\'c and other authors established the property…
We describe algorithms to represent and compute groups of Hecke characters. We make use of an id{\`e}lic point of view and obtain the whole family of such characters, including transcendental ones. We also show how to isolate the algebraic…
In this paper, a construction of Shoda pairs using character triples is given for a large class of monomial groups including abelian-by-supersolvable and subnormally monomial groups. The computation of primitive central idempotents and the…
This paper develops the fundamentals of modular representation theory for finite monoids, introducing the decomposition matrix and exploring its connection to Brauer characters. We define modular characteristic and explain how the…
A major part of computability theory focuses on the analysis of a few structures of central importance. As a tool, the method of coding with first-order formulas has been applied with great success. For instance, in the c.e. Turing degrees,…
Identifying and understanding modular organizations is centrally important in the study of complex systems. Several approaches to this problem have been advanced, many framed in information-theoretic terms. Our treatment starts from the…
Rational chiral conformal field theories are organized according to their genus, which consists of a modular tensor category $\mathcal{C}$ and a central charge $c$. A long-term goal is to classify unitary rational conformal field theories…
We develop the theory of adequate moduli spaces in characteristic $p$ (and mixed characteristic) characterizing quotients by geometrically reductive group schemes.
We show the details of certain computations that are used in the paper "Verification of the conjugacy classes and ordinary character table of the Monster".
The modular representation theory of finite groups has its origins in the work of Richard Brauer. In this survey article we first discuss the work being done on some outstanding conjectures in the theory. We then describe work done in the…
We find finite, reasonably small, generator sets of the coordinate rings of G-character varieties of finitely generated groups for all classical groups G. This result together with the method of Grobner basis gives an algorithm for…
Continuous first-order logic is used to apply model-theoretic analysis to analytic structures (e.g. Hilbert spaces, Banach spaces, probability spaces, etc.). Classical computable model theory is used to examine the algorithmic structure of…
We present a uniform methodology for computing with finitely generated matrix groups over any infinite field. As one application, we completely solve the problem of deciding finiteness in this class of groups. We also present an algorithm…
The paper considers computable Folner sequences in computably enumerable amenable groups. We extend some basic results of M. Cavaleri on existence of such sequences to the case of groups where finite generation is not assumed. We also…
We present an understandable, efficient, and streamlined proof of the Holonomy Decomposition for finite transformation semigroups and automata. This constructive proof closely follows the existing computational implementation. Its novelty…
In this paper we compute the K-theory (algebraic and topological) and entire periodic cyclic homology for compact quantum groups, define Chern characters between them and show that the Chern characters in both topological and algebraic…