Related papers: Gr\"obner Bases under Composition, Survey paper
In this paper, we consider the problem of formulating the subresultant polynomials for several univariate polynomials in Newton basis. It is required that the resulting subresultant polynomials be expressed in the same Newton basis as that…
It is known that for binary codes one can use Gr\"obner bases to obtain a subset of codewords of minimal support that can be used to determine the second generalized Hamming weight of the code. In this paper we establish conditions on a…
Let $R$ be a graded ring. We introduce a class of graded $R$-modules called Gr\"obner-coherent modules. Roughly, these are graded $R$-modules that are coherent as ungraded modules because they admit an adequate theory of Gr\"obner bases.…
The Gr\"obner basis technique for calculating Feynman diagrams proposed in [O.V. Tarasov, Acta Physica Polonica, v. B29 (1998) 2655] is applied to the two-loop propagator type integrals with arbitrary masses and momentum. We describe the…
In this paper we develop a Grobner bases theory for ideals of partial difference polynomials with constant or non-constant coefficients. In particular, we introduce a criterion providing the finiteness of such bases when a difference ideal…
Due to the increased complexity of software development projects more and more systems are described by models. The sheer size makes it impractical to describe these systems by a single model. Instead many models are developed that provide…
We present an efficient algorithm for computing the leading monomials of a minimal Groebner basis of a generic sequence of homogeneous polynomials. Our approach bypasses costly polynomial reductions by exploiting structural properties…
A new basis for the polynomial ring of infinitely many variables is constructed which consists of products of Schur functions and Q-functions. The transition matrix from the natural Schur function basis is investigated.
In 1965 Buchberger defined Gr\"obner bases and an algorithm to compute them. Despite a slow start, already in the eighties Gr\"obner bases had become the main device for symbolic computations involving polynomials as well as a theoretical…
D. Bayer and M. Stillman showed that Grobner bases can be used to compute the Castelnuovo-Mumford regularity, which is a measure for the vanishing of graded local cohomology modules. The aim of this paper is to show that the same method can…
We propose an algebraic framework generalizing several variants of Prony's method and explaining their relations. This includes Hankel and Toeplitz variants of Prony's method for the decomposition of multivariate exponential sums,…
In this paper, we define the Gr\"obner-Shirshov basis for a dialgebra. The Composition-Diamond lemma for dialgebras is given then. As results, we give Gr\"obner-Shirshov bases for the universal enveloping algebra of a Leibniz algebra, the…
We present basic properties of Gr\"obner bases of submodules of a free module of finite rank over a polynomial ring $R$ with coefficients in a graded truncated discrete valuations ring $A$. As an application, we give a criterion for a…
This is a chapter destined for the book "Handbook of the Tutte Polynomial". The chapter is a composite. The first part is a brief introduction to Orlik-Solomon algebras. The second part sketches the theory of evaluative functions on matroid…
We study the complexity of Gr\"obner bases computation, in particular in the generic situation where the variables are in simultaneous Noether position with respect to the system. We give a bound on the number of polynomials of degree $d$…
In this paper we study the structure of polynomials of degree three and four that have high bias or high Gowers norm, over arbitrary prime fields. In particular we obtain the following results. 1. We give a canonical representation for…
In this paper, we characterized the relationship between Groebner bases and u-bases: any minimal Groebner basis of the syzygy module for n univariate polynomials with respect to the term-over-position monomial order is its u-basis.…
The classical theorems relating integral binary quadratic forms and ideal classes of quadratic orders have been of tremendous importance in mathematics, and many authors have given extensions of these theorems to rings other than the…
We study existence and computability of finite bases for ideals of polynomials over infinitely many variables. In our setting, variables come from a countable logical structure A, and embeddings from A to A act on polynomials by renaming…
We obtain results describing the behavior of the action of rotation generators on polynomials over a commutative ring. We also explore harmonic polynomials in a purely algebraic setting.