Related papers: The "hit" problem of five variables in the generic…
General factors are a generalization of matchings. Given a graph $G$ with a set $\pi(v)$ of feasible degrees, called a degree constraint, for each vertex $v$ of $G$, the general factor problem is to find a (spanning) subgraph $F$ of $G$…
Recently two interesting conjectures about the string S-matrix on AdS_5 x S^5 have been made. First, assuming the existence of a Hopf algebra symmetry Janik derived a functional equation for the dressing factor of the quantum string Bethe…
We study several natural instances of the geometric hitting set problem for input consisting of sets of line segments (and rays, lines) having a small number of distinct slopes. These problems model path monitoring (e.g., on road networks)…
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 complexity of computing the solutions of a system of multivariate polynomial equations by means of Groebner bases computations is upper bounded by a function of the solving degree. In this paper, we discuss how to rigorously estimate…
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…
High-dimensional planted problems, such as finding a hidden dense subgraph within a random graph, often exhibit a gap between statistical and computational feasibility. While recovering the hidden structure may be statistically possible, it…
Let $R=k[x_1,..., x_n]$ be a polynomial ring over a field $k$ of characteristic $p>0,$ let $\m=(x_1,..., x_n)$ be the maximal ideal generated by the variables, let $^*E$ be the naturally graded injective hull of $R/\m$ and let $^*E(n)$ be…
In the area of symbolic-numerical computation within computer algebra, an interesting question is how "close" a random input is to the "critical" ones, like the singular matrices in linear algebra or the polynomials with multiple roots for…
The Singer transfer provides an interesting connection between modular representation theory and the cohomology of the Steenrod algebra. We discuss a version of `Quillen stratification' theorem for the Singer transfer and its consequences.
G. Walker and R. Wood proved that in degree $2^n-1-n$, the space of indecomposable elements of $\Bbb F_2[x_1,\ldots,x_n]$, considered as a module over the mod 2 Steenrod algebra, is isomorphic to the Steinberg representation of $GL_n(\Bbb…
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…
Given a generic semidefinite program, specified by matrices with rational entries, each coordinate of its optimal solution is an algebraic number. We study the degree of the minimal polynomials of these algebraic numbers. Geometrically,…
This paper studies the form and complexity of inference in graphical models using the abstraction offered by algebraic structures. In particular, we broadly formalize inference problems in graphical models by viewing them as a sequence of…
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…
Given a grading by an abelian group G on a semisimple Lie algebra L over an algebraically closed field of characteristic 0, we classify up to isomorphism the simple objects in the category of finite-dimensional G-graded L-modules. The…
We study the computational limits of the following general hypothesis testing problem. Let H=H_n be an \emph{arbitrary} undirected graph on n vertices. We study the detection task between a ``null'' Erd\H{o}s-R\'{e}nyi random graph G(n,p)…
We consider a problem of data integration. Consider determining which genes affect a disease. The genes, which we call predictor objects, can be measured in different experiments on the same individual. We address the question of finding…
Pre-trained vision-language models have inspired much research on few-shot learning. However, with only a few training images, there exist two crucial problems: (1) the visual feature distributions are easily distracted by class-irrelevant…
Solving a polynomial system, or computing an associated Gr\"obner basis, has been a fundamental task in computational algebra. However, it is also known for its notorious doubly exponential time complexity in the number of variables in the…