Related papers: Grobner fan for analytic D-modules with parameters
In this article we present two new algorithms to compute the Groebner basis of an ideal that is invariant under certain permutations of the ring variables and which are both implemented in SINGULAR (cf. [DGPS12]). The first and major…
The two- and all-terminal reliabilities of the Brecht-Colbourn ladder and the generalized fan have been calculated exactly for arbitrary size as well as arbitrary individual edge and node reliabilities, using transfer matrices of dimension…
We overview numerous algorithms in computational $D$-module theory together with the theoretical background as well as the implementation in the computer algebra system \textsc{Singular}. We discuss new approaches to the computation of…
We show that given an ideal I generated by regular functions f_1,...,f_r on the smooth complex variety X, the Bernstein-Sato polynomial of I is equal to the reduced Bernstein-Sato polynomial of the function g=\sum_{i=1}^rf_iy_i on the…
For a given monomial ideal $J \subset k[x_1, \ldots, x_n]$ and a given monomial order $\prec$, the moduli functor of all reduced Gr\"obner bases with respect to $\prec$ whose initial ideal is $J$ is determined. In some cases, such a functor…
The category of (abstract) fans is to the category of monoids what the category of schemes is to the category of rings: a fan is obtained by gluing spectra of monoids along open embeddings. Here we study the basic algebraic geometry of…
We increase the scope of previous work on change of basis between finite bases of polynomials by defining ascending and descending bases and introducing three techniques for defining them from known ones. The minimum degrees of polynomials…
In this paper we present an algorithm for computing Groebner bases of linear ideals in a difference polynomial ring over a ground difference field. The input difference polynomials generating the ideal are also assumed to be linear. The…
Partition of unities appear in many places in analysis. Typically they are generated by compactly supported functions with a certain regularity. In this paper we consider partition of unities obtained as integer-translates of entire…
For a particular experimental design, there is interest in finding which polynomial models can be identified in the usual regression set up. The algebraic methods based on Groebner bases provide a systematic way of doing this. The algebraic…
We generalize valuations on polyhedral cones to valuations on fans. For fans induced by hyperplane arrangements, we show a correspondence between rotation-invariant valuations and deletion-restriction invariants. In particular, we define a…
Factor analysis refers to a statistical model in which observed variables are conditionally independent given fewer hidden variables, known as factors, and all the random variables follow a multivariate normal distribution. The parameter…
We define an indicial polynomial of a $D$-module along an arbitrary subvariety as a generalization of both the classical indicial polynomial for a single linear differential equation and the Bernstein-Sato polynomial of a variety defined by…
Given a parametric polynomial ideal I, the algorithm DISPGB, introduced by the author in 2002, builds up a binary tree describing a dichotomic discussion of the different reduced Groebner bases depending on the values of the parameters,…
Generalized sampling consists in the recovery of a function $f$, from the samples of the responses of a collection of linear shift-invariant systems to the input $f$. The reconstructed function is typically a member of a finitely generated…
In the field of algebraic systems biology, the number of minimal polynomial models constructed using discretized data from an underlying system is related to the number of distinct reduced Gr\"obner bases for the ideal of the data points.…
This paper is a detailed description of an algorithm based on a generalized Buchberger algorithm for constructing Groebner-type bases associated with polynomials of shift operators. The algorithm is used for calculating Feynman integrals…
We prove new parameterization theorems for sets definable in the structure $\mathbb{R}_{an}$ (i.e. for globally subanalytic sets) which are uniform for definable families of such sets. We treat both $C^r$-parameterization and (mild)…
In this short note I give an alternative proof of a generalization of the result in math.AC/0407464. Namely I show that for most regular rings R, the localization R[1/f] at an element f of R is generated as a module over the ring of…
We present two algorithms determining all the complete and simplicial fans admitting a fixed non-degenerate set of vectors $V$ as generators of their 1-skeleton. The interplay of the two algorithms allows us to discerning if the associated…