Related papers: Constructive $D$-module Theory with \textsc{Singul…

We introduce formulas for the logarithms of Drinfeld modules using a framework recently developed by the second author. We write the logarithm function as the evaluation under a motivic map of a product of rigid analytic trivializations of…

We generalize the Gr\"obner basis method for free D-modules to the case of several term orderings induced by a partition of the set of basic variables. Using this generalized Gr\"obner basis technique we prove the existence and give a…

We extend Berthelot's theory of arithmetic D-modules to a class of morphisms that are not necessarily of finite type. As an application we give a new construction of the category of convergent isocrystals on a separated scheme of finite…

In this paper, we present a new algorithm and an experimental implementation for factoring elements in the polynomial n'th Weyl algebra, the polynomial n'th shift algebra, and ZZ^n-graded polynomials in the n'th q-Weyl algebra. The most…

Given $p$ polynomials of $n$ variables over a field $k$ of characteristic 0 and a point $a \in k^n$, we propose an algorithm computing the local Bernstein-Sato ideal at $a$. Moreover with the same algorithm we compute a constructible…

Studying the set of exact solutions of a system of polynomial equations largely depends on a single iterative algorithm, known as Buchberger's algorithm. Optimized versions of this algorithm are crucial for many computer algebra systems…

Differentially-algebraic (D-algebraic) functions are solutions of polynomial equations in the function, its derivatives, and the independent variables. We revisit closure properties of these functions by providing constructive proofs. We…

We present a variant of the Peskine--Szpiro Acyclicity Lemma, and hence a way to certify exactness of a complex of finite modules over a large class of (possibly) noncommutative rings. Specifically, over the class of Auslander regular…

We propose new algorithms for computing triangular decompositions of polynomial systems incrementally. With respect to previous works, our improvements are based on a {\em weakened} notion of a polynomial GCD modulo a regular chain, which…

For a homogeneous polynomial of $n$ variables, we present a new method to compute the roots of Bernstein-Sato polynomial supported at the origin, assuming that general hyperplane sections of the associated projective hypersurface have at…

This paper investigates the existence and properties of a Bernstein-Sato functional equation in nonregular settings. In particular, we construct $D$-modules in which such formal equations can be studied. The existence of the Bernstein-Sato…

A number of models of linear logic are based on or closely related to linear algebra, in the sense that morphisms are "matrices" over appropriate coefficient sets. Examples include models based on coherence spaces, finiteness spaces and…

We describe and prove correctness of two practical algorithms for finding indecomposable summands of finitely generated modules over a finitely generated k-algebra R. The first algorithm applies in the (multi)graded case, which enables the…

For a rank 1 local system on the complement of a reduced divisor on a complex manifold $X$, its cohomology is calculated by the twisted meromorphic de Rham complex. Assuming the divisor is everywhere positively weighted homogeneous, we…

For a smooth algebraic variety $X$, we study the category of finitely generated modules over the ring of function of $X$ that has a compatible action of the Lie algebra $\mathcal{V}$ of polynomials vector fields on $X$. We show that the…

We introduce and survey results on two families of zeta functions connected to the multiplicative and additive theories of integer partitions. In the case of the multiplicative theory, we provide specialization formulas and results on the…

Let $p$ be a prime number, $V$ a discrete valuation ring of unequal caracteristics $(0,p)$, $G$ a smooth affine algebraic group over $Spec \,V$. Using partial divided powers techniques of Berthelot, we construct arithmetic distribution…

Various specifiable combinatorial structures, with d extensive parameters, can be exactly sampled both by the recursive method, with linear arithmetic complexity if a heavy preprocessing is performed, or by the Boltzmann method, with…

We present novel algorithms to factor polynomials over a finite field $\F_q$ of odd characteristic using rank $2$ Drinfeld modules with complex multiplication. The main idea is to compute a lift of the Hasse invariant (modulo the polynomial…

We present a practical and powerful new framework for both unconstrained and constrained submodular function optimization based on discrete semidifferentials (sub- and super-differentials). The resulting algorithms, which repeatedly compute…