Related papers: Bounds for algorithms in differential algebra
Fewnomial theory began with explicit bounds -- solely in terms of the number of variables and monomial terms -- on the number of real roots of systems of polynomial equations. Here we take the next logical step of investigating the…
Rosenbrock's theorem on polynomial system matrices is a classical result in linear systems theory that relates the Smith-McMillan form of a rational matrix $G$ with the Smith forms of an irreducible polynomial system matrix $P$ giving rise…
This paper deals with the index reduction problem for the class of quasi-regular DAE systems. It is shown that any of these systems can be transformed to a generically equivalent first order DAE system consisting of a single purely…
The aim of this work is to reduce the complexity of the available algorithms for computing the generator sets of a semigroup ideal by using the Hermite normal form. In order to achieve it we introduce the concept of decomposable semigroup.…
We provide necessary and sufficient conditions for simplicial complexes whose determinantal facet ideals admit reduced Grobner bases under diagonal term orders. Building on and extending foundational results for binomial edge ideals and…
We introduce a novel method for bounding high-order multi-dimensional polynomials in finite element approximations. The method involves precomputing optimal piecewise-linear bounding boxes for polynomial basis functions, which can then be…
Let $I$ be a homogeneous ideal in $R=\mathbb K[x_0,\ldots,x_n]$, such that $R/I$ is an Artinian Gorenstein ring. A famous theorem of Macaulay says that in this instance $I$ is the ideal of polynomial differential operators with constant…
We design a Quasi-Polynomial time deterministic approximation algorithm for computing the integral of a multi-dimensional separable function, supported by some underlying hyper-graph structure, appropriately defined. Equivalently, our…
A fast algorithm (linear in the degrees of freedom) for the solution of linear variable-coefficient rational-order fractional integral and differential equations is described. The approach is related to the ultraspherical method for…
We present an algorithm to compute the primary decomposition of a submodule $\mathcal{N}$ of the free module $\Z[x_1, \ldots, x_n]^m$. For this purpose we use algorithms for primary decomposition of ideals in the polynomial ring over the…
A computably presented algebraic field $F$ has a \emph{splitting algorithm} if it is decidable which polynomials in $F[X]$ are irreducible there. We prove that such a field is computably categorical iff it is decidable which pairs of…
For a finite $\mathbb{Z}$-algebra $R$, i.e., for a $\mathbb{Z}$-algebra which is a finitely generated $\mathbb{Z}$-module, we assume that $R$ is explicitly given by a system of $\mathbb{Z}$-module generators $G$, its relation module ${\rm…
The extended L\"uroth's Theorem says that if the transcendence degree of $\KK(\mathsf{f}_1,\dots,\mathsf{f}_m)/\KK$ is 1 then there exists $f \in \KK(\underline{X})$ such that $\KK(\mathsf{f}_1,\dots,\mathsf{f}_m)$ is equal to $\KK(f)$. In…
By generalizing Frobenius' polynomial method to good partition algebra, we will develop new character theories for a finite group $G$. A uniform defining equations are derived for these kinds of character theories. The new character…
The set of common roots of a finite set $I$ (it is an ideal) of homogeneous polynomials is known as projective algebraic set $V$. In this article I show how to dualize such projective algebraic sets $V$ by elimination of variables from a…
The Ritt problem asks if there is an algorithm that tells whether one prime differential ideal is contained in another one if both are given by their characteristic sets. We give several equivalent formulations of this problem. In…
In the first part of this article, we consider a Groebner basis of the differential ideal {x_1^2} with respect to "the" weighted lexicographical monomial order and show that its computation is related with an identity involving the…
We consider the Weyl algebra A (=A_n(k)) and its Rees algebra B with respect to the Bernstein filtration. The homogenisation of a differential operator in A is an element in B. In this paper we establish the validity of the division theorem…
One of the main contributions which Volker Weispfenning made to mathematics is related to Groebner bases theory. In this paper we present an algorithm for computing all algebraic intermediate subfields in a separably generated unirational…
In this paper we present an algorithm to compute a Standard Basis for a fractional ideal $\mathcal{I}$ of the local ring $\mathcal{O}$ of an $n$-space algebroid curve with several branches. This allows us to determine the semimodule of…