Related papers: Computational Modular Character Theory
Class field theory furnishes an intrinsic description of the abelian extensions of a number field that is in many cases not of an immediate algorithmic nature. We outline the algorithms available for the explicit computation of such…
This chapter provides an introduction to computational linguistics methods, with focus on their applications to the practice and study of translation. It covers computational models, methods and tools for collection, storage, indexing and…
Matrix Graph Grammars (MGG) is a novel approach to the study of graph dynamics ([15]). In the present contribution we look at MGG as a formal grammar and as a model of computation, which is a necessary step in the more ambitious program of…
We describe the construction of vector valued modular forms transforming under a given congruence representation of the modular group SL(2,Z) in terms of theta series. We apply this general setup to obtain closed and easily computable…
The present text surveys some relevant situations and results where basic Module Theory interacts with computational aspects of operator algebras. We tried to keep a balance between constructive and algebraic aspects.
We give a combinatorial description of shape theory using finite topological $T_0$-spaces (finite partially ordered sets). This description may lead to a sort of computational shape theory. Then we introduce the notion of core for inverse…
We classify finite groups with a small average number of zeros in the character table.
Computations in the cohomology of finite groups.
We present an exposition of our ongoing project in a new area of applicable mathematics: practical computation with finitely generated linear groups over infinite fields. Methodology and algorithms available for practical computation in…
In this letter we present some new results on modular theory and its application in quantum field theory. In doing this we develop some new proposals how to generalize concepts of geometrical action. Therefore the spirit of this letter is…
Computability theory is traditionally conceived as the theoretical basis of informatics. Nevertheless, numerous proposals transcend computability theory, in particular by emphasizing interaction of modules, or components, parts,…
We study primary submodules and primary decompositions from a differential and computational point of view. Our main theoretical contribution is a general structure theory and a representation theorem for primary submodules of an arbitrary…
In this introductory review, we give an overview of the computational chemistry methods commonly used in the field of metal-organic frameworks (MOFs), to describe or predict the structures themselves and characterize their various…
The notion of 'presentation', as used in combinatorial group theory, is applied to coded character sets(CCSs) - sets which facilitate the interchange of messages in a digital computer network(DCN) . By grouping each element of the set into…
We develop the rudiments of a finite-dimensional representation theory of groups over idempotent semifields by considering linear actions on tropical linear spaces. This can be considered a tropical representation theory, a characteristic…
Monoidal computer is a categorical model of intensional computation, where many different programs correspond to the same input-output behavior. The upshot of yet another model of computation is that a categorical formalism should provide a…
In this note, we consider models in $\mathbb C^2$. The purpose of this note is twofold. We first show a characterization of models in $\mathbb C^2$ by their noncompact automorphism groups. Then we give an explicit description for…
A supercharacter theory for a finite group $G$ is a set of superclasses each of which is a union of conjugacy classes together with a set of sums of irreducible characters called supercharacters that together satisfy certain compatibility…
Computing modular coincidences can show whether a given substitution system, which is supported on a point lattice in R^d, consists of model sets or not. We prove the computatibility of this problem and determine an upper bound for the…
In this document the author proves that several problems in data-driven numerical approximation of dynamical systems in $\mathbb{C}^n$, can be reduced to the computation of a family of constrained matrix representations of elements of the…