Related papers: A computational approach to Drinfeld modules
In this paper, we prove explicit reciprocity laws for a class of formal Drinfeld modules having stable reduction of height one, in the spirit of those existing in characteristic zero (cf. the work of Wiles). We begin by defining the Kummer…
We introduce a class of group endomorphisms -- those of finite combinatorial rank -- exhibiting slow orbit growth. An associated Dirichlet series is used to obtain an exact orbit counting formula, and in the connected case this series is…
We extend the notion of Lie bialgebroids for more general bracket structures used in string and M theories. We formalize the notions of calculus and dual calculi on algebroids. We achieve this by reinterpreting the main results of the…
Represented spaces form the general setting for the study of computability derived from Turing machines. As such, they are the basic entities for endeavors such as computable analysis or computable measure theory. The theory of represented…
We classify the possible Scott complexities for models of Peano arithmetic. We construct models of particular complexities by first giving a complete Scott analysis of colored linear orderings and constructing models of Peano arithmetic…
The article presents a computationally effective algorithm for calculating the multiresolution discrete Fourier transform (MrDFT). The algorithm is based on the idea of reducing the computational complexity which was introduced by Wen and…
This paper compares different representations (in the sense of computable analysis) of a number of function spaces that are of interest in analysis. In particular subspace representations inherited from a larger function space are compared…
This paper presents an extension and an elaboration of the theory of differential similarity, which was originally proposed in arXiv:1401.2411 [cs.LG]. The goal is to develop an algorithm for clustering and coding that combines a geometric…
The past century has seen a steady increase in the need of estimating and predicting complex systems and making (possibly critical) decisions with limited information. Although computers have made possible the numerical evaluation of…
Drinfeld orbifold algebras are a type of deformation of skew group algebras generalizing graded Hecke algebras of interest in representation theory, algebraic combinatorics, and noncommutative geometry. In this article, we classify all…
These lecture notes are intended as an introduction to the theory of rational Dunkl operators and the associated special functions, with an emphasis on positivity and asymptotics. We start with an outline of the general concepts: Dunkl…
A Hopf algebra object in Loday and Pirashvili's category of linear maps entails an ordinary Hopf algebra and a Yetter-Drinfel'd module. We equip the latter with a structure of a braided Leibniz algebra. This provides a unified framework for…
Shape analysis and compuational anatomy both make use of sophisticated tools from infinite-dimensional differential manifolds and Riemannian geometry on spaces of functions. While comprehensive references for the mathematical foundations…
The Drinfeld double associated to the weak multiplier Hopf ($*$-) algebra pairing $\left\langle A, B\right\rangle$ is constructed. We show that the Drinfeld double is again a weak multiplier Hopf ($*$-) algebra. If $A$ and $B$ are algebraic…
Towers of algebraic function fields over finite fields play a fundamental role in arithmetic geometry and coding theory. Classical examples arising from modular and Drinfeld modular curves exhibit asymptotically good behavior. In this…
This is a companion article to my papers on Kazhdan-Lusztig polynomials and character formulae for the Lie superalgebras gl(m|n) (much revised!) and q(n). The goal is to develop the general theory of tilting modules for Lie superalgebras,…
Over fields of characteristic zero, we determine all absolutely irreducible Yetter-Drinfeld modules over groups that have prime dimension and yield a finite-dimensional Nichols algebra. To achieve our goal, we introduce orders of braided…
We investigate the complexity of isomorphism relations for classes of finitely generated and n-generated computably enumerable (c.e.) algebras, presented via c.e. presentations -- that is, as quotients of term algebras over decidable sets…
Beginning with the projectively invariant method for linear programming, interior point methods have led to powerful algorithms for many difficult computing problems, in combinatorial optimization, logic, number theory and non-convex…
The computation of the matrix exponential is a ubiquitous operation in numerical mathematics, and for a general, unstructured $n\times n$ matrix it can be computed in $\mathcal{O}(n^3)$ operations. An interesting problem arises if the input…