Related papers: A matrix criterion and algorithmic approach for th…

Let $\mathcal P_{n}:=H^{*}((\mathbb{R}P^{\infty})^{n}) \cong \mathbb F_2[x_{1},x_{2},\ldots,x_{n}]$ be the polynomial algebra over the prime field of two elements, $\mathbb F_2.$ We investigate the Peterson hit problem for the polynomial…

Let $P_{k}=H^{*}((\mathbb{R}P^{\infty})^{k})$ be the modulo-$2$ cohomology algebra of the direct product of $k$ copies of infinite dimensional real projective spaces $\mathbb{R}P^{\infty}$. Then, $P_{k}$ is isomorphic to the graded…

We study the hit problem, set up by F. Peterson, of finding a minimal set of generators for the polynomial algebra $P_k := \mathbb F_2[x_1,x_2,...,x_k]$ as a module over the mod-2 Steenrod algebra, $\mathcal{A}$. In this paper, we study a…

Let $P_k$ be the graded polynomial algebra $\mathbb F_2[x_1,x_2,\ldots ,x_k]$ with the degree of each generator $x_i$ being 1, where $\mathbb F_2$ denote the prime field with two elements. The hit problem of Frank Peterson asks for a…

Let us consider the prime field of two elements, $\mathbb F_2\equiv \mathbb Z_2.$ It is well-known that the classical "hit problem" for a module over the mod 2 Steenrod algebra $\mathscr A$ is an interesting and important open problem of…

Let $P_s:= \mathbb F_2[x_1,x_2,\ldots ,x_s]$ be the graded polynomial algebra over the prime field of two elements, $\mathbb F_2$, in $s$ variables $x_1, x_2, \ldots , x_s$, each of degree one. This algebra is considered as a graded module…

Let $P_k:= \mathbb F_2[x_1,x_2,\ldots,x_k]$ be the polynomial algebra over the prime field of two elements, $\mathbb F_2$, in $k$ variables $x_1, x_2, \ldots, x_k$, each of degree 1. We are interested in the Peterson hit problem of finding…

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…

Denote by $P_k$ the graded polynomial algebra $\mathbb F_2[x_1,x_2,\ldots ,x_k]$ over the prime field of two elements, $\mathbb F_2$, with the degree of each $x_i$ being 1. We study the Peterson hit problem of determining a minimal set of…

Geometric hitting set problems, in which we seek a smallest set of points that collectively hit a given set of ranges, are ubiquitous in computational geometry. Most often, the set is discrete and is given explicitly. We propose new…

Let $P_k$ be the graded polynomial algebra $\mathbb F_2[x_1,x_2,\ldots ,x_k]$ over the prime field of two elements, $\mathbb F_2$, with the degree of each $x_i$ being 1. We study the hit problem, set up by Frank Peterson, of finding a…

The idea of this review article is to discuss in a unified way the orthogonality of all positive definite polynomial solutions of the $q$-hypergeometric difference equation on the $q$-linear lattice by means of a qualitative analysis of the…

Let $P_n$ be the graded polynomial algebra $\mathbb F_2[x_1,x_2,\ldots ,x_n]$ with the degree of each generator $x_i$ being 1, where $\mathbb F_2$ denote the prime field of two elements. The Peterson hit problem is to find a minimal…

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_k$ be the polynomial algebra $\mathbb F_2[x_1,x_2,\ldots ,x_k]$ over the field $\mathbb F_2$ with two elements, in $k$ variables $x_1, x_2, \ldots , x_k$, each variable of degree 1. Denote by $GL_k$ the general linear group over…

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…

We consider the following problem: Given a rational matrix $A \in \setQ^{m \times n}$ and a rational polyhedron $Q \subseteq\setR^{m+p}$, decide if for all vectors $b \in \setR^m$, for which there exists an integral $z \in \setZ^p$ such…

We are given a set $P$ of $n$ points in the plane, and a sequence of axis-aligned squares that arrive in an online fashion. The online hitting set problem consists of maintaining, by adding new points if necessary, a set $H\subseteq P$ that…

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

We revisit the classical problem of determining the largest copy of a simple polygon $P$ that can be placed into a simple polygon $Q$. Despite significant effort, known algorithms require high polynomial running times. (Barequet and…