Related papers: On the Peterson hit problem

We introduce the class of principal symmetric ideals, which are ideals generated by the orbit of a single polynomial under the action of the symmetric group. Fixing the degree of the generating polynomial, this class of ideals is…

We give an arithmetic criterion which is sufficient to imply the discreteness of various two-generator subgroups of $PSL(2,{\bold C})$. We then examine certain two-generator groups which arise as extremals in various geometric problems in…

In this paper, we investigate the computational complexity of the knapsack problem and subset sum problem for the following tropical algebraic structures. We consider the semigroup of square matrices of size $k \times k$ with non-negative…

We show that if we can design poly($s$)-time hitting-sets for $\Sigma\wedge^a\Sigma\Pi^{O(\log s)}$ circuits of size $s$, where $a=\omega(1)$ is arbitrarily small and the number of variables, or arity $n$, is $O(\log s)$, then we can…

We show that the existence of algebraic forms of quantum, exactly-solvable, completely-integrable $A-B-C-D$ and $G_2, F_4, E_{6,7,8}$ Olshanetsky-Perelomov Hamiltonians allow to develop the {\it algebraic} perturbation theory, where…

The problem of finding an optimal vertex cover in a graph is a classic NP-complete problem, and is a special case of the hitting set question. On the other hand, the hitting set problem, when asked in the context of induced geometric…

A (k, g) graph is a graph with regular degree k and girth g. The cage problem refers to finding the smallest (k, g) graph. The (3, 14) cage problem is known to be unresolved. In 2002, Exoo found a (3, 14) record graph with order 384. The…

We give a general method for proving quantum lower bounds for problems with small range. Namely, we show that, for any symmetric problem defined on functions $f:\{1, ..., N\}\to\{1, ..., M\}$, its polynomial degree is the same for all…

We study modules over the commutative ring spectrum $H\mathbb F_2\wedge H\mathbb F_2$, whose coefficient groups are quotients of the dual Steenrod algebra by collections of the Milnor generators. We show that very few of these quotients…

Given a set $P$ of $n$ points in the plane and a collection of disks centered at these points, the disk graph $G(P)$ has vertex set $P$, with an edge between two vertices if their corresponding disks intersect. We study the dominating set…

A minor is principal means it is defined by the same row and column indices. Let $X$ be a square generic matrix, $K[X]$ the polynomial ring in entries of $X$, over an algebraically closed field, $K$. For fixed $t\leq n$, let $\mathfrak P_t$…

We prove that the art gallery problem is equivalent under polynomial time reductions to deciding whether a system of polynomial equations over the real numbers has a solution. The art gallery problem is a classical problem in computational…

We compute three first steps of a minimal projective resolution for the trivial module over U_{F_2}(sl^+_3).

In the paper "The Steenrod algebra and its dual", J.Milnor determined the structure of the dual Steenrod algebra which is a graded commutative Hopf algebra of finite type. We consider the affine group scheme $G_p$ represented by the dual…

We determine the endomorphism algebra of a projective generator in a subgeneric restricted block of the critical level category O over an affine Kac-Moody algebra.

Let $F$ be a field and let $E$ be an \'etale algebra over $F$, that is, a finite product of finite separable field extensions $E = F_1 \times \dots \times F_r$. The classical primitive element theorem asserts that if $r = 1$, then $E$ is…

The background of this paper is the following: search of the minimal systems of generators for this class of group which still was not founded also problem of representation for this class of group, exploration of systems of generators for…

Let $f_{1}, \ldots, f_{k}$ be polynomials defining an algebraic set in affine $n$-space over a finite field. Suppose $k>n$. We prove that there exists a system of polynomials $g_{1}, \ldots, g_{n}$, each being a linear combination with…

The min-rank of a graph was introduced by Haemers (1978) to bound the Shannon capacity of a graph. This parameter of a graph has recently gained much more attention from the research community after the work of Bar-Yossef et al. (2006). In…

In this paper we study the complexity of constructing a hitting set for the closure of VP, the class of polynomials that can be infinitesimally approximated by polynomials that are computed by polynomial sized algebraic circuits, over the…