Related papers: The "hit" problem of five variables in the generic…

In [1], whether a target binary string s can be represented from a boolean formula with operands chosen from a set of binary strings W was studied. In this paper, we first examine selecting a maximum subset X from W, so that for any string…

The homomorphism problem for relational structures is an abstract way of formulating constraint satisfaction problems (CSP) and various problems in database theory. The decision version of the homomorphism problem received a lot of…

We call a depth-4 formula C set-depth-4 if there exists a (unknown) partition (X_1,...,X_d) of the variable indices [n] that the top product layer respects, i.e. C(x) = \sum_{i=1}^k \prod_{j=1}^{d} f_{i,j}(x_{X_j}), where f_{i,j} is a…

Post-treatment variables often complicate causal inference. They appear in many scientific problems, including noncompliance, truncation by death, mediation, and surrogate endpoint evaluation. Principal stratification is a strategy to…

This paper considers the difficulty in the set-system approach to generalizing graph theory. These difficulties arise categorically as the category of set-system hypergraphs is shown not to be cartesian closed and lacks enough projective…

A fundamental graph problem is to recognize whether the vertex set of a graph $G$ can be bipartitioned into sets $A$ and $B$ such that $G[A]$ and $G[B]$ satisfy properties $\Pi_A$ and $\Pi_B$, respectively. This so-called…

We study efficient distributed algorithms for the fundamental problem of principal component analysis and leading eigenvector computation on the sphere, when the data are randomly distributed among a set of computational nodes. We propose a…

The ring of invariant polynomials ${\mathbb C}[V]^G$ over a given finite dimensional representation space $V$ of a complex reductive group $G$ is known, by a famous theorem of Hilbert, to be finitely generated. The general proof being…

In this article we consider the graph alignment problem from the perspective of high-dimensional statistics: we aim to estimate an unknown permutation $\pi^*$ from the observation of two correlated random adjacency matrices $A_1$, $A_2$. We…

A key obstacle in automated analytics and meta-learning is the inability to recognize when different datasets contain measurements of the same variable. Because provided attribute labels are often uninformative in practice, this task may be…

A fundamental tool of Differential Galois Theory is the assignment of an algebraic group to each finite-dimensional differential module over differential field in such a way that the category of differential modules it generates is…

Let $G$ be a $5$-group of maximal class and $\gamma_2(G) = [G, G]$ its derived group. Assume that the abelianization $G/\gamma_2(G)$ is of type $(5, 5)$ and the transfers $V_{H_1\to \gamma_2(G)}$ and $V_{H_2\to \gamma_2(G)}$ are trivial,…

For a subset $B$ of $\mathbb{R}$, denote by $\operatorname{U}(B)$ be the semiring of (univariate) polynomials in $\mathbb{R}[X]$ that are strictly positive on $B$. Let $\mathbb{N}[X]$ be the semiring of (univariate) polynomials with…

In [2], the authors prove Stillman's conjecture in all characteristics and all degrees by showing that, independent of the algebraically closed field $K$ or the number of variables, $n$ forms of degree at most $d$ in a polynomial ring $R$…

We study the complexity of the Hitting Set problem in set systems (hypergraphs) that avoid certain sub-structures. In particular, we characterize the classical and parameterized complexity of the problem when the Vapnik-Chervonenkis…

Learning and generalizing from limited examples, i,e, few-shot learning, is of core importance to many real-world vision applications. A principal way of achieving few-shot learning is to realize an embedding where samples from different…

We prove that if $A$ is a regular graded skew Clifford algebra and is a twist of a regular graded Clifford algebra $B$ by an automorphism, then the subalgebra of $A$ generated by a certain normalizing sequence of homogeneous degree-two…

The domination problem is a well-studied problem in graph theory. In this paper, we study two natural variants: the hop domination problem and the $2$-step domination problem. Let $G$ be a graph with vertex set $V$ and edge set $E$. For a…

Multiple Instance Learning (MIL) is a sub-domain of classification problems with positive and negative labels and a "bag" of inputs, where the label is positive if and only if a positive element is contained within the bag, and otherwise is…

Let $S=K[x_1,\ldots,x_n]$ be the polynomial ring over the field $K$, and let $I\subset S$ be a graded ideal. It is shown that the higher iterated Hilbert coefficients of the graded $S$-modules $\Tor_i^S(M,I^k)$ and $\Ext^i_S(M,I^k)$ are…