Related papers: The Complex Langevin method: When can it be truste…
We discuss the method recently proposed by S. Chubanov for the linear feasibility problem. We present new, concise proofs and interpretations of some of his results. We then show how our proofs can be used to find strongly polynomial time…
First we recall the notion of conxity and log-convexity for real-valued. Then we generalize the trick used by Artin in his famous paper on the Gamma function to find log-convex solutions to the functional equations f(x+1)=g(x)f(x). This…
The promise of AI is huge. AI systems have already achieved good enough performance to be in our streets and in our homes. However, they can be brittle and unfair. For society to reap the benefits of AI systems, society needs to be able to…
In this paper, we propose a numerical method for verifying the positiveness of solutions to semilinear elliptic equations. We provide a sufficient condition for a solution to an elliptic equation to be positive in the domain of the…
This report answers queries about extending the blinding index approach to a situation with measurements at multiple time points. The key question is how to test if there is progressive unblinding. A related question is how to apportion…
Motivated by questions in cryptography, we look for diophantine equations that are hard to solve but for which determining the number of solutions is easy.
We apply constant imaginary offsets to the path integral for a reduction of the sign problem in the Hubbard model. These simple transformations enhance the quality of results from HMC calculations without compromising the speed of the…
We show that time complexity analysis of higher-order functional programs can be effectively reduced to an arguably simpler (although computationally equivalent) verification problem, namely checking first-order inequalities for validity.…
In this note, we consider the construction of a one-dimensional stable Langevin type process confined in the upper half-plane and submitted to reflective-diffusive boundary conditions whenever the particle position hits 0. We show that two…
Mathematical proofs should be paired with formal proofs, whenever feasible.
Lample and Charton (2019) describe a system that uses deep learning technology to compute symbolic, indefinite integrals, and to find symbolic solutions to first- and second-order ordinary differential equations, when the solutions are…
Systems designed with measurement and attestation in mind are often layered, with the lower layers measuring the layers above them. Attestations of such systems, which we call layered attestations, must bundle together the results of a…
We explain the algebra needed to make sense of the log signature of a path, with plenty of examples. We show how the log signature can be calculated numerically, and explain some software tools which demonstrate it.
This paper deals with the algorithmic aspects of solving feasibility problems of semidefinite programming (SDP), aka linear matrix inequalities (LMI). Since in some SDP instances all feasible solutions have irrational entries, numerical…
In this article we address the problem of automatic answer checking in interactive learning systems that support mathematical notation. This problem consists of the problem of establishing identities in formal mathematical systems and hence…
The Levin conjecture was proposed by Levin in 1962 which conjectures the solvability of any group equation with coefficients in a torsion free group. The Levin conjecture is recently shown to hold for group equations of length seven by…
We consider a generalized version of the sign uncertainty principle for the Fourier transform, first proposed by Bourgain, Clozel and Kahane in 2010 and revisited by Cohn and Gon\c{c}alves in 2019. In our setup, the signs of a function and…
A diagrammatic logical calculus for the syllogistic reasoning is introduced and discussed. We prove that a syllogism is valid if and only if it is provable in the calculus.
Levin's conjecture has been established to hold true for group equations of length up to seven. Recently, it is shown that Levin's conjecture is also true (modulo exceptional cases) for some group equations of length eight and nine. In this…
A class of discrete equations is considered from three perspectives corresponding to three measures of the complexity of solutions: the (hyper-) order of meromorphic solutions in the sense of Nevanlinna, the degree growth of iterates over a…