English
Related papers

Related papers: A numerical algorithm for zero counting II: Random…

200 papers

The concept of $\e$-randomizing quantum channels has been introduced by Hayden, Leung, Shor and Winter in connection with approximately encrypting quantum states. They proved using a discretization argument that sets of roughly $d \log d$…

Quantum Physics · Physics 2008-02-29 Guillaume Aubrun

A new number system, the set of the non-Dedekindian numbers, is introduced and characterized axiomatically. It is then proved that any hypercontinous hyperreal number system is strictly included in the set of the Non-Dedekindian Numbers.…

General Mathematics · Mathematics 2007-05-23 Gavriel Segre

In [5] the authors suggested a new algorithm for the numerical approximation of a BSDE by merging the cubature method with the first order discretization developed by [3] and [16]. Though the algorithm presented in [5] compared…

Probability · Mathematics 2010-12-30 Dan Crisan , Konstantinos Manolarakis

In a previous paper, an implementable algorithm was introduced to compute discrete solutions of sweeping processes (i.e. specific first order differential inclusions). The convergence of this numerical scheme was proved thanks to…

Numerical Analysis · Mathematics 2014-03-31 Frederic Bernicot , Juliette Venel

The contents of this paper has been incorporated into math.CO/0308288.

Combinatorics · Mathematics 2007-05-23 L. M. Pretorius , K. J. Swanepoel

Recent exact analytical results developed for the random number generators with taps are reported. These results are applicable to a wide class of algorithms, including random walks, cluster algorithms, Ising models. Practical…

High Energy Physics - Lattice · Physics 2009-11-07 Lev N. Shchur

We present an average case analysis of two variants of dual-pivot quicksort, one with a non-algorithmic comparison-optimal partitioning strategy, the other with a closely related algorithmic strategy. For both we calculate the expected…

This note describes an algorithm for enumerating all the elements in a finite set based on uniformly random sampling from the set. This algorithm can be used for enumeration by fair sampling with quantum annealing. Our algorithm is based on…

Quantum Physics · Physics 2021-04-06 Yuta Mizuno , Tamiki Komatsuzaki

In the paper, the authors discover an integral representation, some inequalities, and complete monotonicity of Bernoulli numbers of the second kind.

Classical Analysis and ODEs · Mathematics 2015-05-26 Feng Qi , Xiao-Jing Zhang

Using methods from the statistical mechanics of disordered systems we analyze the properties of bimatrix games with random payoffs in the limit where the number of pure strategies of each player tends to infinity. We analytically calculate…

Disordered Systems and Neural Networks · Physics 2009-10-31 Johannes Berg

This is a comment on a recent publication claiming to have found a ``quantum optimization'' algorithm which outperforms known algorithms for minimizing some ``cost function''. Unfortunately, this algorithm is no better than choosing a state…

Quantum Physics · Physics 2022-02-04 Christof Zalka , Todd A. Brun

This is a typeset version of Alan Turing's declassified Second World War paper \textit{Paper on Statistics of Repetitions}. See the companion paper, \textit{The Applications of Probability to Cryptography}, also available from arXiv at…

History and Overview · Mathematics 2015-05-27 Ian Taylor

In this paper, a new method of detection of election fraud is proposed. This method is based on the calculation of the ratio of two standard normal random variables; estimation of parameters of obtained sample and comparison of these…

Methodology · Statistics 2022-09-20 Ivan H. Krykun

The goal of this introductory survey is to present the major developments of algorithmic randomness with an eye toward its historical development. While two highly comprehensive books and one thorough survey article have been written on the…

Logic · Mathematics 2020-04-07 Johanna N. Y. Franklin , Christopher P. Porter

This paper introduces the notion of probabilistic zero bounds for random polynomials. It presents new results regarding the probabilistic bounds of random polynomials whose coefficients are independently and identically distributed as…

Complex Variables · Mathematics 2026-05-27 Sajad A. Sheikh , Mohammad Ibrahim Mir

Two new approaches to numerical QFT are presented.

High Energy Physics - Lattice · Physics 2009-11-07 G. S. Guralnik , J. Doll , R. Easther , P. Emirdag , D. D. Ferrante , S. Hahn , D. Petrov , D. Sabo

The present book is the first publication in English considered the modern problems of control theory and analysis connected with a concept of system zeros. The previous book by Ye.M. Smagina (1990) had been written in Russian and it is…

Dynamical Systems · Mathematics 2007-05-23 Ye. M. Smagina

This paper has been withdrawn by the author, due an error in claim 1.

Discrete Mathematics · Computer Science 2011-11-10 Omar Kettani

Here are exhibited some additional results about the continuous binomial coefficients as introduced by L. Cano and R. Diaz in [1].

Number Theory · Mathematics 2018-01-03 T. Wakhare , C. Vignat

The aim of this paper is to present an elementary computable theory of random variables, based on the approach to probability via valuations. The theory is based on a type of lower-measurable sets, which are controlled limits of open sets,…

Logic in Computer Science · Computer Science 2021-01-05 Pieter Collins