Separating Variables in Bivariate Polynomial Ideals

Description

We present an algorithm which for any given ideal $I\subseteq\mathbb{K}[x,y]$ computes $I\cap(\mathbb{K}[x]+\mathbb{K}[y])$. Our motivation for looking at the problem came from enumerative combinatorics in the context of lattice walks: an elimination of this kind appears in Bousquet-Mélou’s proof of the algebraicity of the generating function of Gessel’s walks. The problem also arises when one wants to compute the intersection of two K-algebras. This is joint work with Manuel Kauers and Gleb Pogudin.

Period	02 Apr 2021
Event title	unbekannt/unknown
Event type	Other
Location	AustriaShow on map