Related papers: Resolutions for unit groups of orders
A method to construct in explicit form the generators of the simple roots of an arbitrary finite-dimensional representation of a quantum or standard semisimple algebra is found. The method is based on general results from the global theory…
We construct a minimal free resolution of the semigroup ring k[C] in terms of minimal resolutions of k[A] and k[B] when <C> is a numerical semigroup obtained by gluing two numerical semigroups <A> and <B>. Using our explicit construction,…
We concisely summarize a method of finding all rational solutions to an inhomogeneous rational ODE system of arbitrary order (but solvable for its highest order terms) by converting it into a finite dimensional linear algebra problem. This…
The Lie algbera of a compact semisimple Lie group G is determined by the degrees of the irreducible representations of G. However, two different groups can have the same representation degrees.
We describe an algorithm, meant to be very general, to compute a presentation of the group of units of an order in a (semi)simple algebra over Q. Our method is based on a generalisation of Vorono\"i's algorithm for computing perfect forms,…
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…
A fast algorithm (linear in the degrees of freedom) for the solution of linear variable-coefficient rational-order fractional integral and differential equations is described. The approach is related to the ultraspherical method for…
Forman's Discrete Morse theory is studied from an algebraic viewpoint. Analogous to independent work of Emil Skoeldberg we show that this theory can be extended to chain complexes of free modules over a ring. We provide three applications…
Based on the general strategy described by Borel and Serre and the Voronoi algorithm for computing unit groups of orders we present an algorithm for finding presentations of $S$-unit groups of orders. The algorithm is then used for some…
A finite group $G$ is called uniformly semi-rational if there exists an integer $r$ such that the generators of every cyclic sugroup $\langle x \rangle$ of $G$ lie in at most two conjugacy classes, namely $x^G$ or $(x^r)^G$. In this paper,…
We present an explicit basis for orders of arbitrary level N>1 in definite rational quaternion algebras. These orders have applications to computations of spaces of elliptic and quaternionic modular forms.
A free resolution of free partially commutative monoids is constructed and with its help the homological dimension of these monoids is calculated.
Under reasonable assumptions, a group action on a module extends to the minimal free resolutions of the module. Explicit descriptions of these actions can lead to a better understanding of free resolutions by providing, for example,…
Let g be a semisimple Lie algebra over the real numbers. We describe an explicit combinatorial construction of the real Weyl group of g with respect to a given Cartan subalgebra. An efficient computation of this Weyl group is important for…
In this paper we give a polynomial-time quantum algorithm for computing orders of solvable groups. Several other problems, such as testing membership in solvable groups, testing equality of subgroups in a given solvable group, and testing…
We describe a solving semi-decision method based on examination of the rational structures of the generalized integrating factors of first-order ODEs. We propose a conjecture that for some family of equations of the type…
With each semigroup one can associate a partial algebra, called the biordered set, which captures important algebraic and geometric features of the structure of idempotents of that semigroup. For a biordered set $\mathcal{E}$, one can…
We find a finite free resolution of the counit of the free unitary quantum groups of van Daele and Wang and, more generally, Bichon's universal cosovereign Hopf algebras with a generic parameter matrix. This allows us to compute Hochschild…
This paper is the first in a sequence on the structure of sets of solutions to systems of equations over a free semigroup. To describe the structure, we present a Makanin-Razborov diagram that encodes the set of solutions to such system of…
Call a monomial ideal M "generic" if no variable appears with the same nonzero exponent in two distinct monomial generators. Using a convex polytope first studied by Scarf, we obtain a minimal free resolution of M. Any monomial ideal M can…