Related papers: A Computational Approach to Classifying Low Rank M…
Given an associative, not necessarily commutative, ring R with identity, a formal matrix calculus is introduced and developed for pairs of matrices over R. This calculus subsumes the theory of homogeneous systems of linear equations with…
We prove that the symmetric monoidal category of mixed motives generated by an abelian variety (more generally, an abelian scheme) can be described as a certain module category. More precisely, we describe it as the category of…
A graded-division algebra is an algebra graded by a group such that all nonzero homogeneous elements are invertible. This includes division algebras equipped with an arbitrary group grading (including the trivial grading). We show that a…
The abelian sandpile models feature a finite abelian group G generated by the operators corresponding to particle addition at various sites. We study the canonical decomposition of G as a product of cyclic groups G = Z_{d_1} X Z_{d_2} X…
A differential module is a module equipped with a square-zero endomorphism. This structure underpins complexes of modules over rings, as well as differential graded modules over graded rings. We establish lower bounds on the class--a…
Plavnik, Schopieray, Yu, and Zhang have drawn attention to those (automatically premodular) fusion subcategories of modular fusion categories which are submodules for the Galois action on the ambient category. In particular, they showed…
We show that if A is an abelian category satisfying certain mild conditions, then one can introduce the concept of a moduli space of (semi)stable objects which has the structure of a projective algebraic variety. This idea is applied to…
The main object of this paper is the minus class groups associated to CM-fields as Galois modules. In a previous article of the authors, we introduced a notion of equivalence for modules and determined the equivalence classes of the minus…
Finitely generated Z-modules have canonical decompositions. When such modules are given in a finitely presented form there is a classical algorithm for computing a canonical decomposition. This is the algorithm for computing the Smith…
This is the second in a series math.AG/0312190, math.AG/0410267, math.AG/0410268 on configurations in an abelian category A. Given a finite partially ordered set (I,<), an (I,<)-configuration (\sigma,\iota,\pi) is a finite collection of…
Modern large scale datasets are often plagued with missing entries. For tabular data with missing values, a flurry of imputation algorithms solve for a complete matrix which minimizes some penalized reconstruction error. However, almost…
Let $\Lambda$ be a basic finite dimensional algebra over an algebraically closed field, presented as a path algebra modulo relations; further, assume that $\Lambda$ is graded by lengths of paths. The paper addresses the classifiability, via…
We study the classification of submodules of module categories over monoidal categories, extending ideas of Coulembier on the classification of tensor ideals in monoidal categories. We develop a framework that applies to module categories…
We show how the output of the algorithm to compute modular Galois representations described in our previous article can be certified. We have used this process to compute certified tables of such Galois representations obtained thanks to an…
The class of locally compact near abelian groups is introduced and investigated as a class of metabelian groups formalizing and applying the concept of scalar multiplication. The structure of locally compact near abelian groups and its…
We prove in this paper that the genus zero data of a modular functor determines the modular functor. We do this by establishing that the S-matrix in genus one with one point labeled arbitrarily can be expressed in terms of the genus zero…
We present a novel algebraic combinatorial view on low-rank matrix completion based on studying relations between a few entries with tools from algebraic geometry and matroid theory. The intrinsic locality of the approach allows for the…
We describe a class of matrices whose determinants are trivial to compute. A nice example of such a matrix is given by considering the symmetric matrix with entries {i+j choose i} (mod 2) in {0,1}, 0 <= i,j < n the binomial coefficients…
We propose an explicit and practical algorithm for computing Galois conjugates and irreducible polynomials for special values of modular functions evaluated at CM points associated with imaginary quadratic orders. Our approach builds upon…
For each of the groups PSL2(F25), PSL2(F32), PSL2(F49), PGL2(F25), and PGL2(F27), we display the first explicitly known polynomials over Q having that group as Galois group. Each polynomial is related to a Galois representation associated…