Related papers: A Numerical Algorithm for Zero Counting. III: Rand…

An $n$-cap in $k$-dimensional projective space is a set of $n$ points so that no three lie on a line. In this note, we provide an algorithm to count the number of $n$-caps in $\mathbb{P}^3(\mathbb{F}_q)$, which follows from our recent paper…

An improved characteristic set algorithm for solving Boolean polynomial systems is proposed. This algorithm is based on the idea of converting all the polynomials into monic ones by zero decomposition, and using additions to obtain…

A restricted path integral method is proposed to simulate a type of quantum system or Hamiltonian called a sum of controlled few-fermions on a classical computer using Monte Carlo without a numerical sign problem. Then a universality is…

Qualitative and infinitesimal probability schemes are consistent with the axioms of probability theory, but avoid the need for precise numerical probabilities. Using qualitative probabilities could substantially reduce the effort for…

We prove that there are infinitely many integers $n$ such that the total number of prime factors of $(n+h_{1})(n+h_{2})...(n+h_{\kappa})$ is at most $(1/2)\kappa\log\kappa+O(\kappa)$, provided $\kappa$ is sufficiently large.

Efficient characteristic set methods for computing solutions of polynomial equation systems in a finite field are proposed. The concept of proper triangular sets is introduced and an explicit formula for the number of solutions of a proper…

We prove that for any regular kappa and mu > kappa below the first fix point (lambda = aleph_lambda) above kappa, there is a graph with chromatic number > kappa, and mu^kappa nodes but every subgraph of cardinality < mu has chromatic number…

Relying on the classical second moment formula of Rogers we give an effective asymptotic formula for the number of integer vectors $v$ in a ball of radius $t$, with value $Q(v)$ in a shrinking interval of size $t^{-\kappa}$, that is valid…

We report an ongoing work on clustering algorithms for complex roots of a univariate polynomial $p$ of degree $d$ with real or complex coefficients. As in their previous best subdivision algorithms our root-finders are robust even for…

A wide variety of problems in combinatorics and discrete optimization depend on counting the set $S$ of integer points in a polytope, or in some more general object constructed via discrete geometry and first-order logic. We take a tour…

The pooled data problem asks to identify the unknown labels of a set of items from condensed measurements. More precisely, given $n$ items, assume that each item has a label in $\cbc{0,1,\ldots, d}$, encoded via the ground-truth $\SIGMA$.…

We consider the problem of Gaussian approximation for the $\kappa$th coordinate of a sum of high-dimensional random vectors. Such a problem has been studied previously for $\kappa=1$ (i.e., maxima). However, in many applications, a general…

In this note, we provide convergence results for the proximal point algorithm and a splitting variant thereof in the setting of CAT$(\kappa)$ spaces with $\kappa > 0$ using a recent definition for the resolvent of a convex, lower…

We study the number of real zeros of trigonometric polynomials in a period and the number of zeros of self-reciprocal algebraic polynomials on the unit circle under the assumption that their coefficients are in a fixed finite set of real…

Let $F \in \mathbf{Z}[\boldsymbol{x}]$ be a diagonal, non-singular quadratic form in $4$ variables. Let $\lambda(n)$ be the normalised Fourier coefficients of a holomorphic Hecke form of full level. We give an upper bound for the problem of…

We characterize the breaking of analyticity with respect to the replica number which occurs in random energy models via the complex zeros of the moment of the partition function. We perturbatively evaluate the zeros in the vicinity of the…

In the high-dimensional data setting, the sample covariance matrix is singular. In order to get a numerically stable and positive definite modification of the sample covariance matrix in the high-dimensional data setting, in this paper we…

If the coefficients of polynomials are selected by some random process, the zeros of the resulting polynomials are in some sense random. In this paper the author rephrases the above in more precise language, and calculates the joint…

We give the first deterministic fully polynomial-time approximation scheme (FPTAS) for computing the partition function of a two-state spin system on an arbitrary graph, when the parameters of the system satisfy the uniqueness condition on…

Random numbers play a crucial role in science and industry. Many numerical methods require the use of random numbers, in particular the Monte Carlo method. Therefore it is of paramount importance to have efficient random number generators.…