ML p(r)ior | A Factorization Algorithm for G-Algebras and Applications

A Factorization Algorithm for G-Algebras and Applications

2016-01-31
1602.00296 | math.RA
It has been recently discovered by Bell, Heinle and Levandovskyy that a large class of algebras, including the ubiquitous $G$-algebras, are finite factorization domains (FFD for short). Utilizing this result, we contribute an algorithm to find all distinct factorizations of a given element $f \in \mathcal{G}$, where $\mathcal{G}$ is any $G$-algebra, with minor assumptions on the underlying field. Moreover, the property of being an FFD, in combination with the factorization algorithm, enables us to propose an analogous description of the factorized Gr\"obner basis algorithm for $G$-algebras. This algorithm is useful for various applications, e.g. in analysis of solution spaces of systems of linear partial functional equations with polynomial coefficients, coming from $\mathcal{G}$. Additionally, it is possible to include inequality constraints for ideals in the input.
PDF

Highlights - Most important sentences from the article

Login to like/save this paper, take notes and configure your recommendations

Related Articles

2018-11-20

We propose a probabilistic Las Vegas variant of Brill-Noether's algorithm for computing a basis of t… show more
PDF

Highlights - Most important sentences from the article

2019-05-12

Following recent work by van der Hoeven and Lecerf (ISSAC 2017), we discuss the complexity of linear… show more
PDF

Highlights - Most important sentences from the article

2017-10-23
1710.08350 | cs.LO

We consider reasoning and minimization in systems of polynomial ordinary differential equations (ode… show more
PDF

Highlights - Most important sentences from the article

2019-04-05
1904.04072 | math.AG

Given an ideal $I$ and a polynomial $f$ the {Ideal Membership Problem} is to test if $f\in I$. This … show more
PDF

Highlights - Most important sentences from the article

2018-03-21

The subalgebra membership problem is the problem of deciding if a given element belongs to an algebr… show more
PDF

Highlights - Most important sentences from the article

2018-05-21
1805.08186 | cs.DM

In 2010, A. Shpilka and I. Volkovich established a prominent result on the equivalence of polynomial… show more
PDF

Highlights - Most important sentences from the article

2018-10-22
1810.09056 | cs.SC

A notion of gcd chain has been introduced by the author at ISSAC 2017 for two univariate monic polyn… show more
PDF

Highlights - Most important sentences from the article

2017-08-11
1708.03495 | cs.DS

We consider two basic algorithmic problems concerning tuples of (skew-)symmetric matrices. The first… show more
PDF

Highlights - Most important sentences from the article

2018-10-12
1810.05620 | cs.SC

We develop a probabilistic algorithm for computing elimination ideals of likelihood equations, which… show more
PDF

Highlights - Most important sentences from the article

2018-10-25
1810.11068 | math.NT

We present a probabilistic Las Vegas algorithm for computing the local zeta function of a genus-$g$ … show more
PDF

Highlights - Most important sentences from the article

2018-08-20

In this paper we study the problem of deterministic factorization of sparse polynomials. We show tha… show more
PDF

Highlights - Most important sentences from the article

2019-03-29

Effective methods are introduced for testing zero-dimensionality of varieties at a point. The motiva… show more
PDF

Highlights - Most important sentences from the article

2018-09-28

We investigate the application of syzygies for efficiently computing (finite) Pommaret bases. For th… show more
PDF

Highlights - Most important sentences from the article

2017-12-06
1712.02329 | cs.SC

In this paper we briefly discuss \Rings --- an efficient lightweight library for commutative algebra… show more
PDF

Highlights - Most important sentences from the article

2018-03-21

We consider the problem of finding the isolated common roots of a set of polynomial functions defini… show more
PDF

Highlights - Most important sentences from the article

2019-02-01

Gr{\"o}bner bases is one the most powerful tools in algorithmic non-linear algebra. Their computatio… show more
PDF

Highlights - Most important sentences from the article

2019-01-18
1901.06254 | math.NA

We give two algebro-geometric inspired approaches to fast algorithms for Fourier transforms in algeb… show more
PDF