English
Related papers

Related papers: Improved Nonnegativity Testing in the Bernstein Ba…

200 papers

We build a class of polynomial problems with not polynomial certificates. The parameter concerning which are defined efficiency of corresponding algorithms is the number $n$ of elements of the set has used at construction of combinatory…

General Mathematics · Mathematics 2013-02-22 B. S. Kochkarev

This paper considers the problem of testing whether there exists a solution satisfying certain non-negativity constraints to a linear system of equations. Importantly and in contrast to some prior work, we allow all parameters in the system…

A nonparametric model using a sequence of Bernstein polynomials is constructed to approximate arbitrary isotropic covariance functions valid in $\mathbb{R}^\infty$ and related approximation properties are investigated using the popular…

Methodology · Statistics 2026-04-27 Yiming Wang , Sujit K. Ghosh

In this paper we examine the potential of computer-assisted proof methods to be applied much more broadly than commonly recognized. More specifically, we contend that there are vast opportunities to derive useful mathematical results and…

Logic in Computer Science · Computer Science 2021-05-27 Jeffrey Uhlmann , Jie Wang

This paper proposes new nonparametric diagnostic tools to assess the asymptotic validity of different treatment effects estimators that rely on the correct specification of the propensity score. We derive a particular restriction relating…

Methodology · Statistics 2019-02-11 Pedro H. C. Sant'Anna , Xiaojun Song

This paper proposes a new class of nonparametric tests for the correct specification of models based on conditional moment restrictions, paying particular attention to generalized propensity score models. The test procedure is based on two…

Econometrics · Economics 2023-04-18 Pedro H. C. Sant'Anna , Xiaojun Song

We describe algebraic certificates of positivity for functions belonging to a finitely generated algebra of Borel measurable functions, with particular emphasis to algebras generated by semi-algebraic functions. In which case the standard…

Optimization and Control · Mathematics 2010-04-20 Jean-Bernard Lasserre , Mihai Putinar

A real symmetric n times n matrix is called copositive if the corresponding quadratic form is non-negative on the closed first orthant. If the matrix fails to be copositive there exists some non-negative certificate for which the quadratic…

Optimization and Control · Mathematics 2013-06-18 Timo Hirscher

We develop a novel test of the instrumental variable identifying assumptions for heterogeneous treatment effect models with conditioning covariates. We assume semiparametric dependence between potential outcomes and conditioning covariates.…

Econometrics · Economics 2023-09-19 Thomas Carr , Toru Kitagawa

The multivariate resultant is a fundamental tool of computational algebraic geometry. It can in particular be used to decide whether a system of n homogeneous equations in n variables is satisfiable (the resultant is a polynomial in the…

Computational Complexity · Computer Science 2012-10-05 Bruno Grenet , Pascal Koiran , Natacha Portier

We propose a unifying framework for generalising the Wasserstein-1 metric to a discrepancy measure between nonnegative measures of different mass. This generalization inherits the convexity and computational efficiency from the…

Optimization and Control · Mathematics 2018-03-13 Bernhard Schmitzer , Benedikt Wirth

In this article we present a Bernstein inequality for sums of random variables which are defined on a spatial lattice structure. The inequality can be used to derive concentration inequalities. It can be useful to obtain consistency…

Statistics Theory · Mathematics 2017-12-06 Eduardo Valenzuela-Domínguez , Johannes T. N. Krebs , Jürgen E. Franke

We consider the problem of complex root classification, i.e., finding the conditions on the coefficients of a univariate polynomial for all possible multiplicity structures on its complex roots. It is well known that such conditions can be…

Symbolic Computation · Computer Science 2024-09-11 Hoon Hong , Jing Yang

It is common in stability analysis to linearize a system and investigate the spectrum of the Jacobian matrix. This approach faces the challenge of determining the matrix spectrum when the coefficients depend on parameters or when the…

Dynamical Systems · Mathematics 2025-03-17 Ziyad AlSharawi , Jose S. Cánovas , Sadok Kallel

A foundational principle in the study of modules over standard graded polynomial rings is that geometric positivity conditions imply vanishing of Betti numbers. The main goal of this paper is to determine the extent to which this principle…

Commutative Algebra · Mathematics 2024-02-21 Michael K. Brown , Daniel Erman

An efficient randomized polynomial identity test for noncommutative polynomials given by noncommutative arithmetic circuits remains an open problem. The main bottleneck to applying known techniques is that a noncommutative circuit of size…

Computational Complexity · Computer Science 2016-11-23 Vikraman Arvind , Pushkar Joglekar , Partha Mukhopadhyay , S Raja

We collect here elementary properties of differentiation matrices for univariate polynomials expressed in various bases, including orthogonal polynomial bases and non-degree-graded bases such as Bernstein bases and Lagrange \& Hermite…

Numerical Analysis · Mathematics 2018-09-18 Amirhossein Amiraslani , Robert M. Corless , Madhusoodan Gunasingham

Goodness-of-fit tests based on the empirical Wasserstein distance are proposed for simple and composite null hypotheses involving general multivariate distributions. For group families, the procedure is to be implemented after preliminary…

Methodology · Statistics 2021-01-28 Marc Hallin , Gilles Mordant , Johan Segers

We increase the scope of previous work on change of basis between finite bases of polynomials by defining ascending and descending bases and introducing three techniques for defining them from known ones. The minimum degrees of polynomials…

Classical Analysis and ODEs · Mathematics 2022-03-22 D. A. Wolfram

The aim of this work is to certify lower bounds for real-valued multivariate functions, defined by semialgebraic or transcendental expressions. The certificate must be, eventually, formally provable in a proof system such as Coq. The…

Symbolic Computation · Computer Science 2014-04-18 Xavier Allamigeon , Stéphane Gaubert , Victor Magron , Benjamin Werner