Related papers: Groebner basis in Boolean rings is not polynomial-…

Positively graded algebras are fairly natural objects which are arduous to be studied. In this article we query quotients of non-standard graded polynomial rings with combinatorial and commutative algebra methods.

Consider a semi-algebraic set A in R^d constructed from the sets which are determined by inequalities p_i(x)>0, p_i(x)\ge 0, or p_i(x)=0 for a given list of polynomials p_1,...,p_m. We prove several statements that fit into the following…

Let $\mathbf{A}$ be a finite nilpotent algebra in a congruence modular variety with finitely many fundamental operations. If $\mathbf{A}$ is of prime power order, then it is known that there is a polynomial $p$ such that for every $n \in…

In this article, we disprove a conjecture of F. Alarc\'on and D. Anderson and give a complete classification of the prime ideals in the one variable polynomial semiring with coefficients in Boolean semifield. We group the prime ideals of…

This text consists of five relatively systematic notes on Gr\"obner bases and free resolutions of modules over solvable polynomial algebras.

We consider a space of complex polynomials of degree $n\ge 3$ with $n-1$ distinguished periodic orbits. We prove that the multipliers of these periodic orbits considered as algebraic functions on that space, are algebraically independent…

We study multivariate polynomials over `structured' grids. We begin by proposing an interpretation as to what it means for a finite subset of a field to be structured; we do so by means of a numerical parameter, the nullity. We then extend…

In this paper we introduce a new and large family of configurations whose toric ideals possess quadratic Groebner bases. As an application, a generalization of algebras of Segre-Veronese type will be studied.

This short note is the generalization of Faugere F4-algorithm for polynomial rings with coefficients in Euclidean rings. This algorithm computes successively a Groebner basis replacing the reduction of one single s-polynomial in…

Given a finite set of closed rational points of affine space over a field, we give a Gr\"obner basis for the lexicographic ordering of the ideal of polynomials which vanish at all given points. Our method is an alternative to the…

In this paper we consider systems of partial (multidimensional) linear difference equations. Specifically, such systems arise in scientific computing under discretization of linear partial differential equations and in computational high…

Let $R$ be a polynomial ring over a field. We prove an upper bound for the multiplicity of $R/I$ when $I$ is a homogeneous ideal of the form $I=J+(F)$, where $J$ is a Cohen-Macaulay ideal and $F\notin J$. The bound is given in terms of two…

In these notes we investigate the rings of real polynomials in four variables, which are invariant under the action of the reflectiongroups [3,4,3] and [3,3,5]. It is well known that they are rationally generated in degree 2,6,8,12 and…

Satisfiability of Boolean circuits is among the most known and important problems in theoretical computer science. This problem is NP-complete in general but becomes polynomial time when restricted either to monotone gates or linear gates.…

We have developed a patch implementing multivariate polynomials seen as a multi-base algebra. The patch is to be released into the software Sage and can already be found within the Sage-Combinat distribution. One can use our patch to define…

A new efficient algorithm is proposed for factoring polynomials over an algebraic extension field. The extension field is defined by a polynomial ring modulo a maximal ideal. If the maximal ideal is given by its Groebner basis, no extra…

In this paper we consider finite-dimensional constrained Hamiltonian systems of polynomial type. In order to compute the complete set of constraints and separate them into the first and second classes we apply the modern algorithmic methods…

In string-bit models, string is described as a polymer of point-like constituents. We attempt to use string-bit ideas to investigate how the size of string is affected by string interactions in a non-perturbative context. Lacking adequate…

We extend and generalize the results of Scheiderer (2006) on the representation of polynomials nonnegative on two-dimensional basic closed semialgebraic sets. Our extension covers some situations where the defining polynomials do not…

The image of a linear space under inversion of some coordinates is an affine variety whose structure is governed by an underlying hyperplane arrangement. In this paper, we generalize work by Proudfoot and Speyer to show that circuit…