English
Related papers

Related papers: Exact & Numerical Tests of Generalised Root Identi…

200 papers

Let HN denote the problem of determining whether a system of multivariate polynomials with integer coefficients has a complex root. It has long been known that HN in P implies P=NP and, thanks to recent work of Koiran, it is now known that…

Number Theory · Mathematics 2007-05-23 J. Maurice Rojas

We investigate the horizontal distribution of zeros of the derivative of the Riemann zeta function and compare this to the radial distribution of zeros of the derivative of the characteristic polynomial of a random unitary matrix. Both…

Number Theory · Mathematics 2011-08-17 Eduardo Dueñez , David W. Farmer , Sara Froehlich , Chris Hughes , Francesco Mezzadri , Toan Phan

The main purpose of this paper is solve polynomial equations that are satisfied by (generalized) polynomials. More exactly, we deal with the following problem: let $\mathbb{F}$ be a field with $\mathrm{char}(\mathbb{F})=0$ and $P\in…

Commutative Algebra · Mathematics 2021-09-08 Eszter Gselmann

For every nonzero integer $m$ and every integer $n \ge 1$, the $n$\textsuperscript{th} harmonic number $H_n = 1 + \tfrac12 + \dots + \tfrac1n$ satisfies the identity \[ H_n \;=\; \frac{1}{m}\,\sum_{k=1}^{n} \frac{(-1)^{k+1}}{k}\, \binom{m…

Number Theory · Mathematics 2026-05-04 Tong Niu

A new version of the Graeffe algorithm for finding all the roots of univariate complex polynomials is proposed. It is obtained from the classical algorithm by a process analogous to renormalization of dynamical systems. This iteration is…

Numerical Analysis · Mathematics 2025-10-20 Gregorio Malajovich , Jorge P. Zubelli

We derive an integral expression $G(z)$ for the reciprocal gamma function, $1/\Gamma(z)=G(z)/\pi$, that is valid for all $z\in\mathbb{C}$, without the need for analytic continuation. The same integral avoids the singularities of the gamma…

Complex Variables · Mathematics 2026-03-05 Peter Reinhard Hansen , Chen Tong

Igusa's local zeta function $Z_{f,p}(s)$ is the generating function that counts the number of integral roots, $N_{k}(f)$, of $f(\mathbf x) \bmod p^k$, for all $k$. It is a famous result, in analytic number theory, that $Z_{f,p}$ is a…

Number Theory · Mathematics 2020-06-17 Ashish Dwivedi , Nitin Saxena

A generalization of Arnold's strange duality to invertible polynomials in three variables by the first author and A.Takahashi includes the following relation. For some invertible polynomials $f$ the Saito dual of the reduced monodromy zeta…

Algebraic Geometry · Mathematics 2010-09-09 Wolfgang Ebeling , Sabir M. Gusein-Zade

We study the behavior of $r$-fold zeta-functions of Euler-Zagier type with identical arguments $\zeta_r(s,s,\ldots,s)$ on the real line. Our basic tool is an "infinite'' version of Newton's classical identities. We carry out numerical…

Number Theory · Mathematics 2020-12-15 Kohji Matsumoto , Toshiki Matsusaka , Ilija Tanackov

We consider the problem of finding the isolated common roots of a set of polynomial functions defining a zero-dimensional ideal I in a ring R of polynomials over C. Normal form algorithms provide an algebraic approach to solve this problem.…

Algebraic Geometry · Mathematics 2018-12-10 Bernard Mourrain , Simon Telen , Marc Van Barel

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

There has been an avalanche of recent research on multiple zeta values. We propose dividing identities for multiple zeta values into structural and specific types. Structural identities are valid for any generalized multiple zeta function,…

Number Theory · Mathematics 2021-02-09 T. Wakhare , C. Vignat

Satisfiability Modulo the Theory of Nonlinear Real Arithmetic, SMT(NRA) for short, concerns the satisfiability of polynomial formulas, which are quantifier-free Boolean combinations of polynomial equations and inequalities with integer…

Logic in Computer Science · Computer Science 2023-03-22 Haokun Li , Bican Xia , Tianqi Zhao

Let $\Lambda\left(n\right)$ be the von Mangoldt function and $r_{G}\left(n\right) := \sum_{m_1 + m_2=n} \Lambda \left(m_1 \right) \Lambda\left(m_2 \right)$ be the counting function for the numbers that can be written as sum of two primes…

Number Theory · Mathematics 2018-02-20 Marco Cantarini

Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…

Symbolic Computation · Computer Science 2017-04-14 Victor Y. Pan , Liang Zhao

In this series of seven papers, predominantly by means of elementary analysis, we establish a number of identities related to the Riemann zeta function. Whilst this paper is mainly expository, some of the formulae reported in it are…

History and Overview · Mathematics 2008-02-17 Donal F. Connon

Let $(\mathbb{R}_{\alpha ,\beta ,\gamma }(z))_{m}(z)=z+\sum_{n=1}^{m}A_{n}z^{n+1}$ be the sequence of partial sums of the normalized Rabotnov functions $\mathbb{R}_{\alpha ,\beta ,\gamma }(z)=z+\sum_{n=1}^{\infty }A_{n}z^{n+1}$ where…

Complex Variables · Mathematics 2023-09-06 Basem Aref Frasin

We generalize the usual relationship between irreducible Zariski closed subsets of the affine space, their defining ideals, coordinate rings, and function fields, to a non-commutative setting, where "varieties" carry a PGL_n-action, regular…

Rings and Algebras · Mathematics 2009-07-10 Zinovy Reichstein , Nikolaus Vonessen

Using techniques of algebraic and analytic number theory, we resolve a question on monoid rings posed by Kulosman, et. al., under the assumption of the Generalized Riemann Hypothesis (GRH). Specifically, we show that under an appropriate…

Number Theory · Mathematics 2025-05-22 Ryan C. Daileda

We introduce the zeta number, natural halting probability and natural complexity of a Turing machine and we relate them to Chaitin's Omega number, halting probability, and program-size complexity. A classification of Turing machines…

Computational Complexity · Computer Science 2007-05-23 Cristian S. Calude , Michael A. Stay
‹ Prev 1 4 5 6 7 8 10 Next ›