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

The paper describes the algebraic structure of the graded algebra of differentially homogeneous polynomials of fixed finite order. We show that it is a finitely generated algebra, and we exhibit a minimal set of generators. Along the way,…

Let $f(X)$ be a nonconstant polynomial over $\mathbb{F}_{q}$, with a nonzero constant term. The order of $f(X)$ is a classical notion in the theory of polynomials over finite fields, and recently the definition of freeness of binomials of…

We completely determine the minimal polynomial of an arbitrary simple highest weight module $L(\lambda)$ over a complex classical Lie algebra $\mathfrak{g}\subseteq\mathfrak{gl}_N$ relative to its defining module $\pi=\mathbb{C}^{N}$. These…

Let $p$ be an odd prime number. We study the problem of determining the module structure over the mod $p$ Steenrod algebra $\mathcal A(p)$ of the Dickson algebra $D_n$ consisting of all modular invariants of general linear group…

This paper develops our previous works concerning the classical Peterson hit problem for the polynomial algebra on five variables over the mod--2 Steenrod algebra $\mathscr A$ in a generic family of degrees, together with applications to…

Let $V_n$ be the ${\rm SL}_2$-module of binary forms of degree $n$ and let $V = V_1 \oplus V_3 \oplus V_4$. We show that the minimum number of generators of the algebra $R = \mathbb{C}[V]^{{\rm SL}_2}$ of polynomial functions on $V$…

Unstable modules over the Steenrod algebra with only the top $k$ operations are introduced in the language of ringoids. We prove the category of such modules has homological dimension at most $k$. A pratical method, which generalizes the…

A monic polynomial $f(x)\in {\mathbb Z}[x]$ of degree $N$ is called monogenic if $f(x)$ is irreducible over ${\mathbb Q}$ and $\{1,\theta,\theta^2,\ldots ,\theta^{N-1}\}$ is a basis for the ring of integers of ${\mathbb Q}(\theta)$, where…

Elementary symmetric polynomials $S_n^k$ are used as a benchmark for the bounded-depth arithmetic circuit model of computation. In this work we prove that $S_n^k$ modulo composite numbers $m=p_1p_2$ can be computed with much fewer…

We extend the Ax-Katz theorem for a single polynomial from finite fields to the rings Z_m with m composite. This extension not only yields the analogous result, but gives significantly higher divisibility bounds. We conjecture what computer…

In this paper, we determine minimal generating sets for several well-known monoids of matrices over semirings. In particular, we find minimal generating sets for the monoids consisting of: all $n\times n$ boolean matrices when $n\leq 8$;…

Let $\mathcal{A}$ be the group algebra $\mathbf{k}[S_n]$ of the $n$-th symmetric group $S_n$ over a commutative ring $\mathbf{k}$. For any two subsets $A$ and $B$ of $[n]$, we define the elements \[ \nabla_{B,A}:=\sum_{\substack{w\in…

Suppose L is any finite algebraic extension of either the ordinary rational numbers or the p-adic rational numbers. Also let g_1,...,g_k be polynomials in n variables, with coefficients in L, such that the total number of monomial terms…

Given a $d \times n$ integer matrix $A$, the main result is an elementary, simple-to-state algorithm that finds the largest $A$-graded ideal contained in any ideal $I$ in a polynomial ring $\Bbbk[x_1,\ldots,x_n]$. The special case where $A$…

For a fixed $k$, this study considers $k$-partition minimization of submodular system $(V, f)$ with a finite set $V$ and symmetric submodular function $f: 2^{V} \mapsto \mathbb{R}$. Our algorithm uses the Queyranne's (1998) algorithm for…

For an odd prime $p$, we say a polynomial $f\in \mathbb F_p[X]$ computes square roots if $f(a)^2=a$ for all nonzero, perfect squares $a\in \mathbb F_p$. When $p\equiv 3 \mod 4$, it is easy to see that $f(X)=X^{\frac{p+1}{4}}$ is the…

An output-polynomial algorithm for the listing of minimal dominating sets in graphs is a challenging open problem and is known to be equivalent to the well-known Transversal problem which asks for an output-polynomial algorithm for listing…

We study the $k$-resultant modulus set problem in the $d$-dimensional vector space $\mathbb F_q^d$ over the finite field $\mathbb F_q$ with $q$ elements. Given $E\subset \mathbb F_q^d$ and an integer $k\ge 2$, the $k$-resultant modulus set,…

Using elementary graded automorphisms of polytopal algebras (essentially the coordinate rings of projective toric varieties) polyhedral versions of the group of elementary matrices and the Steinberg and Milnor groups are defined. They…

It is a long-standing open problem whether the minimal dominating sets of a graph can be enumerated in output-polynomial time. In this paper we investigate this problem in graph classes defined by forbidding an induced subgraph. In…