Related papers: Sparse Nullstellensatz, resultants and determinant…

We introduce a sequence of orthogonal polynomials whose associated moments are the Rayleigh-type sums, involving the zeros of the Bessel derivative $J_\nu'$ of order $\nu$. We also discuss the fundamental properties of those polynomials…

We modify the classical Paley-Wiener spaces $PW_x$ of entire functions of finite exponential type at most $x>0$, which are square integrable on the real line, via the additional condition of vanishing at finitely many complex points $z_1,…

We study a broad class of polynomial optimization problems whose constraints and objective functions exhibit sparsity patterns. We give two characterizations of the number of critical points to these problems, one as a mixed volume and one…

We consider the problem of finding a sparse multiple of a polynomial. Given f in F[x] of degree d over a field F, and a desired sparsity t, our goal is to determine if there exists a multiple h in F[x] of f such that h has at most t…

We study Poisson structures over singular varieties. In this purpose, we consider the Koszul complex associated to the equations of a complete intersection. This complex forms a differential graded algebra which is equivalent to the algebra…

Solving systems of polynomial equations is a central problem in nonlinear and computational algebra. Since Buchberger's algorithm for computing Gr\"obner bases in the 60s, there has been a lot of progress in this domain. Moreover, these…

Foundational material on complex Lie supergroups and their radial operators is presented. In particular, Berezin's recursion formula for describing the radial parts of fundamental operators in general linear and ortho-symplectic cases is…

We show that there exists a connection between two types of objects: some kind of resultantal varieties over C, from one side, and varieties of twists of the tensor powers of the Carlitz module such that the order of 0 of its L-functions at…

The main result of this note is a tracial Nullstellensatz for free noncommutative polynomials evaluated at tuples of matrices of all sizes: Suppose f_1,...,f_r,f are free polynomials, and tr(f) vanishes whenever all tr(f_j) vanish. Then…

We prove a general version of Bezout's form of the Nullstellensatz for arbitrary fields. The corresponding sufficient and necessary condition only involves the local existence of multi-valued roots for each of the polynomials belonging to…

We consider a fast approximation method for a solution of a certain stochastic non-local pseudodifferential equation. This equation defines a Mat\'ern class random field. The approximation method is based on the spectral compactness of the…

We prove an upper bound on the degree complexity of Putinar's Positivstellensatz. This bound is much worse than the one obtained previously for Schm\"udgen's Positivstellensatz but it depends on the same parameters. As a consequence, we get…

The behavior of the resolvent at low energies has implications for many kinds of asymptotics, including for the scattering matrix and phase, for the Dirichlet-to-Neumann map, and for wave evolution. In this paper we present a robust method,…

This paper reexamines univariate reduction from a toric geometric point of view. We begin by constructing a binomial variant of the $u$-resultant and then retailor the generalized characteristic polynomial to fully exploit sparsity in the…

As a contribution to quantitative set-theoretic inferencing, a translation is proposed of conjunctions of literals of the forms $x=y\setminus z$, $x \neq y\setminus z$, and $z =\{x\}$, where $x,y,z$ stand for variables ranging over the von…

In this paper, we propose two new deterministic interpolation algorithms for a sparse multivariate polynomial given as a standard black-box by introducing new Kronecker type substitutions. Let $f\in \RB[x_1,\dots,x_n]$ be a sparse black-box…

We prove a theorem on algebraic osculation and we apply our result to the Computer Algebra problem of polynomial factorization. We consider X a smooth completion of the complex plane and D an effective divisor supported on the boundary of…

We improve and simplify the result of the part 4 of "Counting curves and their projections" (Joachim von zur Gathen, Marek Karpinski, Igor Shparlinski) by showing that counting roots of a sparse polynomial over $\mathbb{F}_{2^n}$ is #P- and…

Pausinger recently investigated a special determinant involving prime numbers. In this short note we point out that this type of determinants was already known in linear algebra and its computation is unrelated to prime numbers.

We show how to construct sparse polynomial systems that have non-trivial lower bounds on their numbers of real solutions. These are unmixed systems associated to certain polytopes. For the order polytope of a poset P this lower bound is the…