Related papers: On the Peterson hit problem

Let $A$ denote the Steenrod algebra at the prime 2 and let $k = \mathbb Z_2.$ An open problem of homotopy theory is to determine a minimal set of $A$-generators for the polynomial ring $P_q = k[x_1, \ldots, x_q] = H^{*}(k^{q}, k)$ on $q$…

The purpose of this paper is to forge a direct link between the hit problem for the action of the Steenrod algebra A on the polynomial algebra P(n)=F_2[x_1,...,x_n], over the field F_2 of two elements, and semistandard Young tableaux as…

This paper investigates Singer's conjecture by examining the cohit module $\mathbb F_2\otimes_{\mathcal A}P^{\otimes h}$ for specific degrees and values of $h$. Utilizing hit problem techniques, we extend previous work by Mothebe et al. and…

Let $P_k$ be the graded polynomial algebra $\mathbb F_2[x_1,x_2,\ldots ,x_k]$, with the degree of each $x_i$ being 1, regarded as a module over the mod-2 Steenrod algebra $\mathcal A$, and let $GL_k$ be the general linear group over the…

We study the arithmetic complexity of hitting set generators, which are pseudorandom objects used for derandomization of the polynomial identity testing problem. We give new explicit constructions of hitting set generators whose outputs are…

The aim of this note is to use geometric methods to study the hit problem of Peterson for $H_*\mathbb{R} P^{\times k}$ as well as the symmetric hit problem of Janfada and Wood for $H_*BO(k)$. We continue by exploring the applications of the…

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$…

Finding inclusion-minimal "hitting sets" for a given collection of sets is a fundamental combinatorial problem with applications in domains as diverse as Boolean algebra, computational biology, and data mining. Much of the algorithmic…

In this short note, we use Robert Bruner's $\mathcal{A}(1)$-resolution of $P = \mathbb{F}_2[t]$ to shed light on the Hit Problem. In particular, the reduced syzygies $P_n$ of $P$ occur as direct summands of $\widetilde{P}^{\otimes n}$,…

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…

The purpose of this article is to give, for any commutative ring A, an explicit minimal set of generators for the ring of multisymmetric functions TS^d_A(A[x_1,...,x_r]) as an A-algebra. In characteristic zero, i.e. when A is an algebra…

A hitting-set generator (HSG) is a polynomial map $G:\mathbb{F}^k \to \mathbb{F}^n$ such that for all $n$-variate polynomials $C$ of small enough circuit size and degree, if $C$ is nonzero, then $C\circ G$ is nonzero. In this paper, we give…

The submodular partitioning problem asks to minimize, over all partitions $P$ of a ground set $V$, the sum of a given submodular function $f$ over the parts of $P$. The problem has seen considerable work in approximability, as it…

For a finite group $G$, the size of a minimum generating set of $G$ is denoted by $d(G)$. Given a finite group $G$ and an integer $k$, deciding if $d(G)\leq k$ is known as the minimum generating set (MIN-GEN) problem. A group $G$ of order…

Hitting Set is a classic problem in combinatorial optimization. Its input consists of a set system F over a finite universe U and an integer t; the question is whether there is a set of t elements that intersects every set in F. The Hitting…

A hitting set for a collection of sets is a set that has a non-empty intersection with each set in the collection; the hitting set problem is to find a hitting set of minimum cardinality. Motivated by instances of the hitting set problem…

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…

Let $\mathscr A$ denote the classical singly-graded Steenrod algebra over the binary field $\mathbb Z/2.$ We write $P_k:=\mathbb Z/2[t_1, t_2, \ldots, t_k]$ as the polynomial algebra on $k$ generators, each having a degree of one. Let…

We show that lower bounds on the border rank of matrix multiplication can be used to non-trivially derandomize polynomial identity testing for small algebraic circuits. Letting $\underline{R}(n)$ denote the border rank of $n \times n \times…

The $k$-cut problem asks, given a connected graph $G$ and a positive integer $k$, to find a minimum-weight set of edges whose removal splits $G$ into $k$ connected components. We give the first polynomial-time algorithm with approximation…