Related papers: A Numerical Algorithm for Zero Counting. II: Dista…
In this work we study the condition number of the least square matrix corresponding to scale free networks. We compute a theoretical lower bound of the condition number which proves that they are ill conditioned. Also, we analyze several…
We bound the future loss when predicting any (computably) stochastic sequence online. Solomonoff finitely bounded the total deviation of his universal predictor M from the true distribution m by the algorithmic complexity of m. Here we…
We investigate and discuss when the inverse of a multivariate truncated moment matrix of a measure $\mu$ has zeros in some prescribed entries. We describe precisely which pattern of these zeroes corresponds to independence, namely, the…
For statistical modeling wherein the data regime is unfavorable in terms of dimensionality relative to the sample size, finding hidden sparsity in the ground truth can be critical in formulating an accurate statistical model. The so-called…
We study the qualitative and quantitative zero-reachability problem in probabilistic multi-counter systems. We identify the undecidable variants of the problems, and then we concentrate on the remaining two cases. In the first case, when we…
Let $A=A^*$ be a linear operator in a Hilbert space $H$. Assume that equation $Au=f \quad (1)$ is solvable, not necessarily uniquely, and $y$ is its minimal-norm solution. Assume that problem (1) is ill-posed. Let $f_\d$, $||f-f_d||\leq…
In recent years, much work has been devoted to a systematic study of polynomial identities certifying strict or non-strict positivity of a polynomial on a basic closed semialgebraic set. The interest in such identities originates not least…
Zero-free based algorithm is a major technique for deterministic approximate counting. In Barvinok's original framework[Bar17], by calculating truncated Taylor expansions, a quasi-polynomial time algorithm was given for estimating zero-free…
The problem of counting the number of models of a given Boolean formula has numerous applications, including computing the leakage of deterministic programs in Quantitative Information Flow. Model counting is a hard, #P-complete problem.…
We introduce the concept of weak average-case analysis as an attempt to achieve theoretical complexity results that are closer to practical experience than those resulting from traditional approaches. This concept is accepted in other areas…
Let p_N be a random degree N polynomial in one complex variable whose zeros are chosen independently from a fixed probability measure mu on the Riemann sphere S^2. This article proves that if we condition p_N to have a zero at some fixed…
This paper describes and analyzes a method for computing border bases of a zero-dimensional ideal $I$. The criterion used in the computation involves specific commutation polynomials and leads to an algorithm and an implementation extending…
We offer a natural and extensible measure-theoretic treatment of missingness at random. Within the standard missing data framework, we give a novel characterisation of the observed data as a stopping-set sigma algebra. We demonstrate that…
For any finite field $\mathbb{F}$ and any positive integer $n$ we count the number of monic polynomials of degree $n$ over $\mathbb{F}$ with nonzero constant coefficient and a self-reciprocal factor of any specified degree. An application…
In this paper, we examined the connection between quantum systems' indistinguishability and signed (or negative) probabilities. We do so by first introducing a measure-theoretic definition of signed probabilities inspired by research in…
Recently a systematic investigation of monoids of sequences of plus-minus weighted zero-sum sequences had been started, which is among others motivated by applications to monoids of norms of algebraic integers. In the current paper these…
A complex harmonic polynomial is the sum of a complex polynomial and a conjugated complex polynomial, of degrees $n$ and $m$ respectively. Li and Wei (2009) presented a formula for the expected number of zeros of a random harmonic…
The vanishing ideal is a set of polynomials that takes zero value on the given data points. Originally proposed in computer algebra, the vanishing ideal has been recently exploited for extracting the nonlinear structures of data in many…
In this paper we describe how to improve the performance of the symbolic-numeric method in (Li and Zhi,2009, 2011) for computing the multiplicity structure and refining approximate isolated singular solutions in the breadth one case. By…
We investigate the zeros of two one-parameter families of harmonic functions and describe how the number of zeros depends on the parameter. Our functions have the property that all zeros lie on certain rays in the complex plane and thus we…