Related papers: The OIGroebnerBases Package for Macaulay2

We develop the theory of Gr\"obner bases for ideals in a polynomial ring with countably infinite variables over a field. As an application we reconstruct some of the one-one correspondences among various sets of partitions by using division…

Let E be a number field and G be a finite group. Let A be any O_E-order of full rank in the group algebra E[G] and X be a (left) A-lattice. In a previous article, we gave a necessary and sufficient condition for X to be free of given rank d…

In this paper we present an algorithm for computing all algebraic intermediate subfields in a separably generated unirational field extension (which in particular includes the zero characteristic case). One of the main tools is Groebner…

We describe how Groebner bases can be used to solve the reduction problem for Feynman integrals, i.e. to construct an algorithm that provides the possibility to express a Feynman integral of a given family as a linear combination of some…

We give an $O(N\cdot \log N\cdot 2^{O(\log^*N)})$ algorithm for multiplying two $N$-bit integers that improves the $O(N\cdot \log N\cdot \log\log N)$ algorithm by Sch\"{o}nhage-Strassen. Both these algorithms use modular arithmetic.…

This paper describes a Buchberger-style algorithm to compute a Groebner basis of a polynomial ideal, allowing for a selection strategy based on "signatures". We explain how three recent algorithms can be viewed as different strategies for…

In this paper, we suggest a new efficient algorithm in order to compute S-polynomial reduction rapidly in the known algorithm for computing Grobner bases, and compare the complexity with others.

The R package multgee implements the local odds ratios generalized estimating equations (GEE) approach proposed by Touloumis et al. (2013), a GEE approach for correlated multinomial responses that circumvents theoretical and practical…

Let $R:= K[x_1,\ldots,x_{n}]$ be a polynomial ring over an infinite field $K$, and let $I \subset R$ be a homogeneous ideal with respect to a weight vector $\omega = (\omega_1,\ldots,\omega_n) \in (\mathbb{Z}^+)^n$ such that $\dim(R/I) =…

We introduce the package MacaulayPosets written for the computational algebra system Macaulay2. This package utilized the poset data type introduced in the Posets package and offers functionality for studying the Macaulay property for…

We introduce a new division formula on projective space which provides explicit solutions to various polynomial division problems with sharp degree estimates. We consider simple examples as the classical Macaulay theorem as well as a quite…

In this paper, we introduce (almost) skew 2-nomial algebras and look for a one-sided or two-sided Gr\"obner basis theory for such algebras at a modest level. That is, we establish the existence of a skew multiplicative $K$-basis for every…

This is an English translation of the author's Ph.D. thesis, accumulating his results on a construction of Cohen-Macaulay modules over a polynomial ring that appeared in the study of Cauchy-Fueter equations. This construction is generalized…

We describe the package "IncidenceCorrespondenceCohomology" for the computer algebra system Macaulay2. The main feature concerns the computation of characters and dimensions for the cohomology groups of line bundles on the incidence…

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 C# package is presented that allows a user for an input quantum circuit to generate a set of multivariate polynomials over the finite field Z_2 whose total number of solutions in Z_2 determines the output of the quantum computation…

Multiobjective discrete programming is a well-known family of optimization problems with a large spectrum of applications. The linear case has been tackled by many authors during the last years. However, the polynomial case has not been…

We give a description of a new Macaulay2 package called SimplicialPosets. This package provides functions for working with simplicial posets and calculating their generalized Stanley-Reisner ideals. For practical purposes, we also introduce…

The package \texttt{NumericalCertification} implements methods for certifying numerical approximations of solutions for a given system of polynomial equations. For certifying regular solutions, the package implements Smale's $\alpha$-theory…

We generalize signature Gr\"obner bases, previously studied in the free algebra over a field or polynomial rings over a ring, to ideals in the mixed algebra $R[x_1,...,x_k]\langle y_1,\dots,y_n \rangle$ where $R$ is a principal ideal…