English
Related papers

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

200 papers

In this paper, we give an overview of the various general methods in computing the zeta function of an algebraic variety defined over a finite field, with an emphasis on computing the reduction modulo $p^m$ of the zeta function of a…

Number Theory · Mathematics 2007-05-23 Daqing Wan

Let $(\mathcal{C}, \otimes)$ be a monoidal dg-category. We construct a complex controlling the deformation of the monoidal structure on $\mathcal{C}$ together with the deformation of the underlying dg-category itself. We show that in the…

Algebraic Geometry · Mathematics 2026-04-08 Slava Pimenov , Angel Toledo

The cylindrical algebraic decomposition (CAD) is the only complete method used in practice for solving problems like quantifier elimination or SMT solving related to real algebra, despite its doubly exponential complexity. Recent…

We develop a practical method for computing local zeta functions of groups, algebras, and modules in fortunate cases. Using our method, we obtain a complete classification of generic local representation zeta functions associated with…

Group Theory · Mathematics 2016-02-03 Tobias Rossmann

We continue study of some algebraic varieties (called resultantal varieties) started in a paper of A. Grishkov, D. Logachev "Resultantal varieties related to zeroes of L-functions of Carlitz modules". These varieties are related with the…

Algebraic Geometry · Mathematics 2021-12-14 Aleksandr Grishkov , Dmitry Logachev , Aleksey Zobnin

This paper investigates some issues arising in categorical models of reversible logic and computation. Our claim is that the structural (coherence) isomorphisms of these categorical models, although generally overlooked, have decidedly…

Category Theory · Mathematics 2013-04-29 Peter Hines

We prove that the existence of finite combinatorial objects such as affine planes, mutually orthogonal Latin squares, and resolvable balanced incomplete block designs can be reformulated as the existence of certain algorithmic reductions…

Combinatorics · Mathematics 2026-04-21 Damir D. Dzhafarov , Jun le Goh

In an important paper, Zagier proved that certain half-integral weight modular forms are generating functions for traces of polynomials in the $j$-function. It turns out that Zagier's work makes it possible to algorithmically compute…

Number Theory · Mathematics 2019-10-16 Lea Beneish , Hannah Larson

We apply numerical optimization and linear algebra algorithms for classical computers to the problem of automatically synthesizing algorithms for quantum computers. Using our framework, we apply several common techniques from these…

Numerical Analysis · Mathematics 2025-09-16 Yuxin Huang , Benjamin E. Grossman-Ponemon , David A. B. Hyde

We introduce the notion of Bernstein-Sato polynomial of an arbitrary variety (which is not necessarily reduced nor irreducible), using the theory of V-filtrations of M. Kashiwara and B. Malgrange. We prove that the decreasing filtration by…

Algebraic Geometry · Mathematics 2007-05-23 Nero Budur , Mircea Mustata , Morihiko Saito

Continuing pioneering work of Christophe Doche and Laurent Habsieger from 2004, we develop computer algebra algorithms, implemented in Maple, for finding the (necessarily rational) generating function for any integral of products, and in…

Combinatorics · Mathematics 2016-06-08 Shalosh B. Ekhad , Doron Zeilberger

In this note, we extend modular techniques for computing Gr\"obner bases from the commutative setting to the vast class of noncommutative $G$-algebras. As in the commutative case, an effective verification test is only known to us in the…

Rings and Algebras · Mathematics 2017-04-11 Wolfram Decker , Christian Eder , Viktor Levandovskyy , Sharwan K. Tiwari

A new type of combinations of Bernstein operators is given in [1]. Here, we introduce another one, which can be used to approximate the functions with singularities. The direct and inverse results of the weighted approximation of this new…

Functional Analysis · Mathematics 2011-06-28 Wen-ming Lu , Lin Zhang

Constructing complex computation from simpler building blocks is a defining problem of computer science. In algebraic automata theory, we represent computing devices as semigroups. Accordingly, we use mathematical tools like products and…

Group Theory · Mathematics 2025-05-06 Attila Egri-Nagy , Chrystopher L. Nehaniv

Recently, Bruinier and Ono found an algebraic formula for the partition function in terms of traces of singular moduli of a certain non-holomorphic modular function. In this paper we prove that the rational polynomial having these singuar…

Number Theory · Mathematics 2020-07-02 Michael H. Mertens , Larry Rolen

Several algebro-geometric properties of commutative rings of partial differential operators as well as several geometric constructions are investigated. In particular, we show how to associate a geometric data by a commutative ring of…

Algebraic Geometry · Mathematics 2018-01-31 Herbert Kurke , Denis Osipov , Alexander Zheglov

Let X be an algebraic curve. We study the problem of parametrizing geometric data over X, which is only generically defined. E.g., parametrizing generically defined (aka rational) maps from X to a fixed target scheme Y. There are three…

Representation Theory · Mathematics 2012-04-17 Jonathan Barlev

Anderson t-modules are analogs of abelian varieties in positive characteristic. Associated to such a t-module, there are its t-motive and its dual t-motive. When dealing with these objects, several questions occur which one would like to…

Number Theory · Mathematics 2026-01-23 Andreas Maurischat

Let $f$ be a real polynomial of $x = (x_1,\dots,x_n)$ and $\varphi$ be a locally integrable function of $x$ which satisfies a holonomic system of linear differential equations. We study the distribution $f_+^\lambda\varphi$ with a…

Complex Variables · Mathematics 2016-04-05 Toshinori Oaku

We define certain higher-dimensional Dedekind sums that generalize the classical Dedekind-Rademacher sums, and show how to compute them effectively using a generalization of the continued-fraction algorithm. We present two applications.…

Number Theory · Mathematics 2007-05-23 Paul E. Gunnells , Robert Sczech