Related papers: The hit problem for the polynomial algebra of four…

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…

The motivic hit problem asks for a minimal set of generators of $H^{*,*}(BV_n;\mathbb{F}_2)$ as a module over the motivic Steenrod algebra. For the distinguished degrees $d=k+2d_1$ with $d_1=(n-1)(2^k-1)$, Kameko constructed a top layer…

The algebra S of symmetric invariants over the field with two elements is an unstable algebra over the Steenrod algebra A, and is isomorphic to the mod two cohomology of BO, the classifying space for vector bundles. We provide a minimal…

This paper is our second step towards developing a theory of testing monomials in multivariate polynomials. The central question is to ask whether a polynomial represented by an arithmetic circuit has some types of monomials in its…

The work in this paper is to initiate a theory of testing monomials in multivariate polynomials. The central question is to ask whether a polynomial represented by certain economically compact structure has a multilinear monomial in its…

The variety of principal minors of $n\times n$ symmetric matrices, denoted $Z_{n}$, is invariant under the action of a group $G\subset \GL(2^{n})$ isomorphic to $\G$. We describe an irreducible $G$-module of degree $4$ polynomials…

Write $P_k:= \mathbb F_2[x_1,x_2,\ldots ,x_k]$ for the polynomial algebra over the prime field $\mathbb F_2$ with two elements, in $k$ generators $x_1, x_2, \ldots , x_k$, each of degree 1. The polynomial algebra $P_k$ is considered as a…

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…

Binary polynomial optimization is equivalent to the problem of minimizing a linear function over the intersection of the multilinear set with a polyhedron. Many families of valid inequalities for the multilinear set are available in the…

We study the minimization of fixed-degree polynomials over the simplex. This problem is well-known to be NP-hard, as it contains the maximum stable set problem in graph theory as a special case. In this paper, we consider a rational…

We give a solution of the problem on trigonometric polynomials $f_n$ with the given leading harmonic $y\cos nt$ that deviate the least from zero in measure, more precisely, with respect to the functional $\mu(f_n)=mes\{t\in[0,2\pi]:…

In what follows, we pose two general conjectures about decompositions of homogeneous polynomials as sums of powers. The first one (suggested by G. Ottaviani) deals with the generic k-rank of complex-valued forms of any degree divisible by k…

The purpose of these notes is to provide an introduction to the Steenrod algebra in an algebraic manner avoiding any use of cohomology operations. The Steenrod algebra is presented as a subalgebra of the algebra of endomorphisms of a…

Let $P_k$ be the graded polynomial algebra $\mathbb F_2[x_1,x_2,\ldots ,x_k]$ over the prime field $\mathbb F_2$ with two elements and the degree of each variable $x_i$ being 1, and let $GL_k$ be the general linear group over $\mathbb F_2$…

Let $F(t,u)\equiv F(u)$ be a formal power series in $t$ with polynomial coefficients in $u$. Let $F\_1, ..., F\_k$ be $k$ formal power series in $t$, independent of $u$. Assume all these series are characterized by a polynomial equation $$…

We present precise bit and degree estimates for the optimal value of the polynomial optimization problem $f^*:=\text{inf}_{x\in \mathscr{X}}~f(x)$, where $\mathscr{X}$ is a semi-algebraic set satisfying some non-degeneracy conditions. Our…

We study the generic initial ideals (gin) of certain ideals that arise in modular invariant theory. For all cases an explicit generating set is known we calculate the generic initial ideal of the Hilbert ideal of a cyclic group of prime…

We study the growth of polynomials on semialgebraic sets. For this purpose we associate a graded algebra to the set, and address all kinds of questions about finite generation. We show that for a certain class of sets, the algebra is…

In this paper, we deal with the problem of uniqueness of minimal system of binomial generators of a semigroup ideal. Concretely, we give different necessary and/or sufficient conditions for uniqueness of such minimal system of generators.…

We show that any submodular minimization (SM) problem defined on a linear constraint set with constraints having up to two variables per inequality, are 2-approximable in polynomial time. If the constraints are monotone (the two variables…