Related papers: Zero counting for a class of univariate Pfaffian f…

We introduce a new algorithm denoted DSC2 to isolate the real roots of a univariate square-free polynomial f with integer coefficients. The algorithm iteratively subdivides an initial interval which is known to contain all real roots of f.…

Let f be a degree D univariate polynomial with real coefficients and exactly m monomial terms. We show that in the special case m=3 we can approximate within eps all the roots of f in the interval [0,R] using just O(log(D)log(Dlog(R/eps)))…

Analogous to the use of sums of squares of certain real-valued special functions to prove the reality of the zeros of the Bessel functions J_\alpha(z) when \alpha \ge -1, confluent hypergeometric functions {}_0F_1(c; z) when c > 0 or 0 > c…

In this paper we consider the distribution of the zeros of a real random Bargmann-Fock function of one or more variables. For these random functions we prove estimates for two types of families of events, both of which are large deviations…

This paper presents a new methodology to count the number of numerical semigroups of given genus or Frobenius number. We apply generating function tools to the bounded polyhedron that classifies the semigroups with given genus (or Frobenius…

Recently classes of conic and discrete conic functions were introduced. In this paper we use the term convic instead conic. The class of convic functions properly includes the classes of convex functions, strictly quasiconvex functions and…

In this paper we discuss a method to express the Prime counting function as a "sum" over Non-trivial zeros of Riemann Zeta function, using techniques from Analytic Number Theory, also we apply our results to the sum over primes of any…

In the paper, we investigate Poincare type inequalities for the functions having zero mean value on the whole boundary of a Lipschitz domain or on a measurable part of the boundary. We derive exact and easily computable constants for some…

This work provides a method(an algorithm) for solving the solvable unary algebraic equation $f(x)=0$ ($f(x)\in\mathbb{Q}[x]$) of arbitrary degree and obtaining the exact radical roots. This method requires that we know the Galois group as…

For a bridgeless graph $G$, its flow polynomial is defined to be the function $F(G,q)$ which counts the number of nonwhere-zero $\Gamma$-flows on an orientation of $G$ whenever $q$ is a positive integer and $\Gamma$ is an additive Abelian…

We introduce a new method that uses AAA approximation to reliably compute all the zeros of a holomorphic function in a specified search region in the complex plane. Specifically, the method is based on rational approximation of the…

The aim of this note is to estimate the tail of the distribution of the number of particles in an interval under determinantal and Pfaffian point processes. The main result of the note is that the square of the number of particles under the…

Inspired by the paper of Bonichon, Bousquet-M\'elou, Dorbec and Pennarun, we give a system of functional equations which characterise the ordinary generating function, $U(x),$ for the number of planar Eulerian orientations counted by edges.…

We propose an efficient algorithm to compute the real roots of a sparse polynomial $f\in\mathbb{R}[x]$ having $k$ non-zero real-valued coefficients. It is assumed that arbitrarily good approximations of the non-zero coefficients are given…

A recursive algorithm is constructed which finds all solutions to a class of Diophantine equations connected to the problem of determining ordered n-tuples of positive integers satisfying the property that their sum is equal to their…

We give a high precision polynomial-time approximation scheme for the supremum of any honest n-variate (n+2)-nomial with a constant term, allowing real exponents as well as real coefficients. Our complexity bounds count field operations and…

Let $\mathcal{S}$ denote the family of all functions that are analytic and univalent in the unit disk $\mathbb{D}:=\{z: |z|<1\}$ and satisfy $f(0)=f^{\prime}(0)-1=0$. In the present paper, we consider certain subclasses of univalent…

We give algorithms to compute isomorphism classes of ordinary abelian varieties defined over a finite field $\mathbb{F}_q$ whose characteristic polynomial (of Frobenius) is square-free and of abelian varieties defined over the prime field…

We consider a certain class of multiplicative functions $f: \mathbb N \rightarrow \mathbb C$. Let $F(s)= \sum_{n=1}^\infty f(n)n^{-s}$ be the associated Dirichlet series and $F_N(s)= \sum_{n\le N} f(n)n^{-s}$ be the truncated Dirichlet…

To cater to the needs of (Zero Knowledge) proofs for (mathematical) proofs, we describe a method to transform formal sentences in 2x2-matrices over multivariate polynomials with integer coefficients, such that usual proof-steps like…