Related papers: An algorithm for computing the multigraded Hilbert…

Let S = k[x_1,...,x_n] be a Z^r-graded ring with deg (x_i) = a_i \in Z^r for each i and suppose that M is a finitely generated Z^r-graded S-module. In this paper we describe how to find finite subsets of Z^r containing the multidegrees of…

In this paper, we present several algorithms for dealing with graded components of Laurent polynomial rings. To be more precise, let $S$ be the Laurent polynomial ring $k[x_1,...,x_{r},x_{r+1}^{\pm 1},..., x_n^{\pm 1}]$, $k$ algebraicaly…

In a previous article (a joint work with J. Manoharmayum) the modularity of a large class of rigid Calabi-Yau threefolds was established. To make that result more explicit, we recall (and re-prove) a result of Serre giving a bound for the…

The multigraded Hilbert scheme parametrizes all homogeneous ideals in a polynomial ring graded by an abelian group with a fixed Hilbert function. We prove that any multigraded Hilbert scheme is smooth and irreducible when the polynomial…

Renewed interest in mixed-precision algorithms has emerged due to growing data capacity and bandwidth concerns, as well as the advancement of GPUs, which enable significant speedup for low precision arithmetic. In light of this, we propose…

In this paper, we propose an incremental algorithm for computing cylindrical algebraic decompositions. The algorithm consists of two parts: computing a complex cylindrical tree and refining this complex tree into a cylindrical tree in real…

In many problems in machine learning and operations research, we need to optimize a function whose input is a random variable or a probability density function, i.e. to solve optimization problems in an infinite dimensional space. On the…

Let $\mathbb{K}$ be a field, and let $S=\mathbb{K}[X_1, ..., X_n]$ be the polynomial ring. Let $I$ be a monomial ideal of $S$ with up to 5 generators. In this paper, we present a computational experiment which allows us to prove that…

Let S=K[x_1,x_2,...,x_n] be a polynomial ring in n variables over a field K. Stanley's conjecture holds for the modules I and S/I, when I is a critical monomial ideal. We calculate the Stanley depth of S/I when I is a canonical critical…

Estimating hyperparameters has been a long-standing problem in machine learning. We consider the case where the task at hand is modeled as the solution to an optimization problem. Here the exact gradient with respect to the hyperparameters…

In this paper we continue the description of the possibilities to use numerical simulations for mathematically rigorous computer assisted analysis of integrability of dynamical systems. We sketch some of the algebraic methods of studying…

In this paper, we suggest a new efficient algorithm in order to compute S-polynomial reduction rapidly in the known algorithm for computing Grobner bases, and compare the complexity with others.

Let F. be a any free resolution of a Z^n-graded submodule of a free module over the polynomial ring K[x_1, ..., x_n]. We show that for a suitable term order on F., the initial module of the p'th syzygy module Z_p is generated by terms…

Let $K$ be a field, $R=K[X_1, ..., X_n]$ be the polynomial ring and $J \subsetneq I$ two monomial ideals in $R$. In this paper we show that $\mathrm{sdepth}\ {I/J} - \mathrm{depth}\ {I/J} = \mathrm{sdepth}\ {I^p/J^p}-\mathrm{depth}\…

In previous work, the first author developed an algorithm for the computation of Hilbert modular forms. In this paper, we extend this to all totally real number fields of even degree and nontrivial class group. Using the algorithm over…

In this work, we develop a fully implicit Hybrid High-Order algorithm for the Cahn-Hilliard problem in mixed form. The space discretization hinges on local reconstruction operators from hybrid polynomial unknowns at elements and faces. The…

Discretizing Helmholtz problems via finite elements yields linear systems whose efficient solution remains a major challenge for classical computation. In this paper, we investigate how variational quantum algorithms could address this…

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…

We present short and elementary proofs of two theorems of Huckaba and Marley, while generalizing them at the same time to the case of a module. The theorems concern a characterization of the depth of the associated graded ring of a…

An accurate method to compute enclosures of Abelian integrals is developed. This allows for an accurate description of the phase portraits of planar polynomial systems that are perturbations of Hamiltonian systems. As an example, it is…