Related papers: Canonical forms for free {\kappa}-semigroups
A general overview of the existing difference ring theory for symbolic summation is given. Special emphasis is put on the user interface: the translation and back translation of the corresponding representations within the term algebra and…
In the original version of this paper, we assume a theory $T$ that the logic $\mathbb L_{\kappa, \aleph_{0}}$ is categorical in a cardinal $\lambda > \kappa$, and $\kappa$ is a measurable cardinal. There we prove that the class of model of…
For any quantum group of finite ADE type, we prove a new formula for the standard bilinear form evaluated at monomials. Combining this with ideas from the Lusztig-Shoji algorithm, we obtain a new algorithm that computes the canonical basis.…
The covariant canonical formalism is a covariant extension of the traditional canonical formalism of fields. In contrast to the traditional canonical theory, it has a remarkable feature that canonical equations of gauge theories or gravity…
Canonical models are of central importance in modal logic, in particular as they witness strong completeness and hence compactness. While the canonical model construction is well understood for Kripke semantics, non-normal modal logics…
The canonical polynomial is an important output of the multivariable topological Poincar\'e series associated with a normal surface singularity. It can be considered as a multivariable polynomial generalization of the Seiberg--Witten…
We consider a constructive modification of quantum-mechanical formalism. Replacement of a general unitary group by unitary representations of finite groups makes it possible to reproduce quantum formalism without loss of its empirical…
We introduce $\omega$-catoids as generalisations of (strict) $\omega$-categories and in particular the higher path categories generated by computads or polygraphs in higher-dimensional rewriting. We also introduce $\omega$-quantales that…
We provide a geometric model for the free $X$-generated $F$-restriction semigroup in the extended signature $(\cdot\,, ^+, ^m,\lambda)$, where the unary operation $^m$ maps an element $a$ to the maximum element $a^m$ of its $\sigma$-class,…
We describe how Computational Group Theory provides tools for manipulating tensors in explicit index notation. In special, we present an algorithm that puts tensors with free indices obeying permutation symmetries into the canonical form.…
In this paper we develop a formalism for working with twisted realizations of vertex and conformal algebras. As an example, we study realizations of conformal algebras by twisted formal power series. The main application of our technique is…
Flum and Grohe define a parameter (parameterization) as a function $\kappa$ which maps words over a given alphabet to natural numbers. They require such functions to be polynomial-time computable. We show how this technical restriction can…
The Eilenberg correspondence relates varieties of regular languages to pseudovarieties of finite monoids. Various modifications of this correspondence have been found with more general classes of regular languages on one hand and classes of…
In this thesis we use quasiorders on words to offer a new perspective on two well-studied problems from Formal Language Theory: deciding language inclusion and manipulating the finite automata representations of regular languages. First, we…
We refine a method for finding a canonical form for symmetry operators of arbitrary order for the Schroedinger eigenvalue equation on any 2D Riemannian manifold, real or complex, that admits a separation of variables in some orthogonal…
We introduce the notions of $\mathbb{K}$-framings, based $\mathbb{K}$-framings and relative $\mathbb{K}$-framings of a compact connected oriented surface $\Sigma$ for any commutative ring $\mathbb{K}$ with unit, and a map which maps a based…
We give an algebraic characterization of the syntax and semantics of a class of languages with variable binding. We introduce a notion of 2-signature: such a signature specifies not only the terms of a language, but also reduction rules on…
We study general methods to build forking-like notions in the framework of tame abstract elementary classes (AECs) with amalgamation. We show that whenever such classes are categorical in a high-enough cardinal, they admit a good frame: a…
Canonical transformations using the idea of quantum generating functions are applied to construct a quantum Hamilton-Jacobi theory, based on the analogy with the classical case. An operator and a c-number forms of the time-dependent quantum…
Implicit computational complexity, which aims at characterizing complexity classes by machine-independent means, has traditionally been based, on the one hand, on programs and deductive formalisms for free algebras, and on the other hand on…