Related papers: A non-PSLQ route to BBP-type formulas
In this Letter, we strengthen and extend the connection between simulation and estimation to exploit simulation routines that do not exactly compute the probability of experimental data, known as the likelihood function. Rather, we provide…
Derivative-matching approximations are constructed as power series built from functions. The method assumes the knowledge of special values of the Bell polynomials of the second kind, for which we refer to the literature. The presented…
In the paper, the author finds an explicit formula for computing Bernoulli numbers of the second kind in terms of Stirling numbers of the first kind.
We construct some non-arithmetic ball quotients as branched covers of a quotient of an Abelian surface by a finite group, and compare them with lattices that previously appear in the literature. This gives an alternative construction, which…
The distribution of a given sequence in the set of all sequences with n ones and m = M - n zeros are found by relating the problem to the partitions of a natural number in m natural summands, taking into account the order. The formulas…
A new, model dependent way of uncovering some of the values of the underlying GMSB parameters is proposed. This method is faster than the existing procedures and once enough luminosity is available, can be used to check the consistency of…
Methods of solving big Boolean equations can be broadly classified as algebraic, tabular, numerical and map methods. The most prominent among these classes are the algebraic and map methods. This paper surveys and compares these two types…
Given a computable probability measure P over natural numbers or infinite binary sequences, there is no computable, randomized method that can produce an arbitrarily large sample such that none of its members are outliers of P.
Variational quantum computing schemes train a loss function by sending an initial state through a parametrized quantum circuit, and measuring the expectation value of some operator. Despite their promise, the trainability of these…
We establish a determinant formula for the bilinear form associated with the elliptic hypergeometric integrals of type $BC_n$ by studying the structure of $q$-difference equations to be satisfied by them. The determinant formula is proved…
We propose a method to identify all the nodes that are relevant to compute all the conditional probability distributions for a given set of nodes. Our method is simple, effcient, consistent, and does not require learning a Bayesian network…
This article presents a novel method for causal discovery with generalized structural equation models suited for analyzing diverse types of outcomes, including discrete, continuous, and mixed data. Causal discovery often faces challenges…
Change-of-variables (CoV) formulas allow to reduce complicated probability densities to simpler ones by a learned transformation with tractable Jacobian determinant. They are thus powerful tools for maximum-likelihood learning, Bayesian…
We describe a simulation method for a quantum spin model of a generic, general purpose quantum computer. The use of this quantum computer simulator is illustrated through several implementations of Grover's database search algorithm. Some…
The role of uncertainty in data management has become more prominent than ever before, especially because of the growing importance of machine learning-driven applications that produce large uncertain databases. A well-known approach to…
We consider the complexities of substitutive sequences over a binary alphabet. By studying various types of special words, we show that, knowing some initial values, its complexity can be completely formulated via a recurrence formula…
We survey recent developments in the study of probabilistic complexity classes. While the evidence seems to support the conjecture that probabilism can be deterministically simulated with relatively low overhead, i.e., that $P=BPP$, it also…
We construct boundary quantum group generators which, through linear intertwining relations, determine nondiagonal solutions of the boundary Yang-Baxter equation for the cases A^1_{n-1} and A^2_2.
A major benefit of graphical models is that most knowledge is captured in the model structure. Many models, however, produce inference problems with a lot of symmetries not reflected in the graphical structure and hence not exploitable by…
We use formal matrices whose entries we view as vector variables taking unit vectors values in one-qubit Hilbert spaces of a multiqubit quantum system. We construct many unextendible product bases (UPBs) of new sizes in such systems and…