Related papers: Computing bases of modular forms using the graded …

Let $R=\oplus_{\Gamma\in\Gamma}R_{\gamma}$ be a $\Gamma$-graded $K$-algebra over a field $K$, where $\Gamma$ is a totally ordered semigroup, and let $I$ be an ideal of $R$. Considering the $\Gamma$-grading filtration $FR$ of $R$ and the…

Let $H^{\pm}_{2k} (N^3)$ denote the set of modular newforms of cubic level $N^3$, weight $2 k$, and root number $\pm 1$. For $N > 1$ squarefree and $k>1$, we use an analytic method to establish neat and explicit formulas for the difference…

Hashimoto and Ueda determined the weights of generators of the graded ring of modular forms on the Cayley half-space of degree two. In this paper we describe explicit generators. We show that the graded ring can be generated by Eisenstein…

We present basic properties of Gr\"obner bases of submodules of a free module of finite rank over a polynomial ring $R$ with coefficients in a graded truncated discrete valuations ring $A$. As an application, we give a criterion for a…

In this paper we study special bases of certain spaces of half-integral weight weakly holomorphic modular forms. We establish a criterion for the integrality of Fourier coefficients of such bases. By using recursive relations between Hecke…

The main objective of this paper is to connect the theory of $Gr\"obner$ bases to concepts of homological algebra. $Gr\"obner$ bases, an important tool in algebraic system and in linear algebra help us to understand the structure of an…

In this paper, we describe an algorithm for computing algebraic modular forms on compact inner forms of $\mathrm{GSp}_4$ over totally real number fields. By analogues of the Jacquet-Langlands correspondence for $\mathrm{GL}_2$, this…

We describe a simple algorithm for computing the canonical basis of any finite-dimensional $U_{q}(sp_{2n})$-module.

Classical results on the classification of reflections in an arithmetic subgroup $\Gamma$ imply that if the graded algebra of modular forms $M_*(\Gamma)$ is freely generated, then $\Gamma$ must be an arithmetic subgroup of either the…

The all Rota-Baxter algebra structures on the polynomial algebra $R={\bf k}[x]$ are well known. We study the finite dimensional modules of polynomial Rota-Baxter algebras $(\bfk[x],P)$ or $(x {\bf k} [x],P)$ of weight nonzero since some…

In this work we will study the universal labeling algebra A(Gamma), a related algebra B(Gamma), and their behavior as invariants of layered graphs. We will introduce the notion of an upper vertex-like basis, which allows us to recover…

We discover a non-trivial relation between the mock modular generating functions of the level $1$ and level $N$ Hurwitz class numbers. This relation yields a holomorphic modular form of weight $\frac{3}{2}$ and level $4N$, where $N > 1$ is…

Gr{\"o}bner bases is one the most powerful tools in algorithmic non-linear algebra. Their computation is an intrinsically hard problem with a complexity at least single exponential in the number of variables. However, in most of the cases,…

The computation of triangular decompositions are based on two fundamental operations: polynomial GCDs modulo regular chains and regularity test modulo saturated ideals. We propose new algorithms for these core operations relying on modular…

Our recent extension of Arnold's classification includes all singularities of corank up to two equivalent to a germ with a non-degenerate Newton boundary, thus broadening the classification's scope significantly by a class which is…

We consider logarithmic vector fields parametrized by finite collections of weighted hyperplanes. For a finite collection of weighted hyperplanes in a two-dimensional vector space, it is known that the set of such vector fields is a free…

We reduce the problem of computing the rank and a nullspace basis of a univariate polynomial matrix to polynomial matrix multiplication. For an input n x n matrix of degree d over a field K we give a rank and nullspace algorithm using about…

Mutually Unbiased Bases (MUBs) constitute a fundamental geometric structure in quantum theory, known for providing an optimal measurement scheme for quantum state tomography. In prime and prime-power dimensions, analytical constructions of…

For a prime $p$, the OM algorithm finds the $p$-adic factorization of an irreducible polynomial $f\in\mathbb{Z}[x]$ in polynomial time. This may be applied to construct $p$-integral bases in the number field $K$ defined by $f$. In this…

In this paper, we characterized the relationship between Groebner bases and u-bases: any minimal Groebner basis of the syzygy module for n univariate polynomials with respect to the term-over-position monomial order is its u-basis.…