相关论文: Interpolation in Valiant's theory
Immanants are polynomial functions of n by n matrices attached to irreducible characters of the symmetric group S_n, or equivalently to Young diagrams of size n. Immanants include determinants and permanents as extreme cases. Valiant proved…
This work provides a complete characterization of the solutions of a linear interpolation problem for vector polynomials. The interpolation problem consists in finding n scalar polynomials such that an equation involving a linear…
We study the computational complexity of fundamental problems over the $p$-adic numbers ${\mathbb Q}_p$ and the $p$-adic integers ${\mathbb Z}_p$. Gu\'epin, Haase, and Worrell proved that checking satisfiability of systems of linear…
It is known that every function with a finite support over a given field can be interpolated by means of the Lagrangian polynomial. The question is if a similar interpolation is possible if one considers a unitary ring or a Boolean algebra…
It is already shown that a Boolean function for a NP-complete problem can be computed by a polynomial-sized circuit if its variables have enough number of automorphisms. Looking at this previous study from the different perspective gives us…
Let $p$ be a prime. Given a polynomial in $\F_{p^m}[x]$ of degree $d$ over the finite field $\F_{p^m}$, one can view it as a map from $\F_{p^m}$ to $\F_{p^m}$, and examine the image of this map, also known as the value set. In this paper,…
In recent years many efforts have been devoted to finding bidiagonal factorizations of nonsingular totally positive matrices, since their accurate computation allows to numerically solve several important algebraic problems with great…
We develop a theory of formal multivariate polynomials over commutative rings by treating them as ring terms. Our main result is that two ring terms are s-equivalent (when expanded they yield the same standard polynomial) iff they are…
It is well known, that if polynomial with rational coefficients of degree $n$ takes integer values in points $0,1,...,n$ then it takes integer values in all integer points. Are there sets of $n+1$ points with the same property in other…
We present an algorithm to solve a system of diagonal polynomial equations over finite fields when the number of variables is greater than some fixed polynomial of the number of equations whose degree depends only on the degree of the…
We prove super-polynomial lower bounds on the size of propositional proof systems operating with constant-depth algebraic circuits over fields of zero characteristic. Specifically, we show that the subset-sum variant…
Feasible interpolation is a general technique for proving proof complexity lower bounds. The monotone version of the technique converts, in its basic variant, lower bounds for monotone Boolean circuits separating two NP-sets to proof…
It is undecidable in general whether a given finitely presented group is word hyperbolic. We use the concept of pregroups, introduced by Stallings, to define a new class of van Kampen diagrams, which represent groups as quotients of…
We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions and on interpolation, which has received little attention in…
We study here several variants of the covariates fine balance problem where we generalize some of these problems and introduce a number of others. We present here a comprehensive complexity study of the covariates problems providing…
The maximum volume principle is investigated as a means to solve the following problem: Given a set of arbitrary interpolation nodes, how to choose a set of polynomial basis functions for which the Lagrange interpolation problem is…
This is a survey on propositional proof complexity aimed at introducing the basics of the field with a particular focus on a method known as feasible interpolation. This method is used to construct "hard theorems" for several proof systems…
We reconsider the theory of Lagrange interpolation polynomials with multiple interpolation points and apply it to linear algebra. For instance, $A$ be a linear operator satisfying a degree $n$ polynomial equation $P(A)=0$. One can see that…
We say that a circuit $C$ over a field $F$ functionally computes an $n$-variate polynomial $P$ if for every $x \in \{0,1\}^n$ we have that $C(x) = P(x)$. This is in contrast to syntactically computing $P$, when $C \equiv P$ as formal…
We study an operation in matroid theory that allows one to transition a given matroid into another with more bases via relaxing a \emph{stressed subset}. This framework provides a new combinatorial characterization of the class of split…