Related papers: The power of the Binary Value Principle
Standard Markov decision process (MDP) and reinforcement learning algorithms optimize the policy with respect to the expected gain. We propose an algorithm which enables to optimize an alternative objective: the probability that the gain is…
The existence of a polynomial pivot rule for the simplex method for linear programming, policy iteration for Markov decision processes, and strategy improvement for parity games each are prominent open problems in their respective fields.…
A Turaev-Viro invariant is a state sum, i.e., a polynomial that can be read off from a special spine or a triangulation of a compact 3-manifold. If the polynomial is evaluated at the solution of a certain system of polynomial equations…
This note tries to show that a re-examination of a first course in analysis, using the more sophisticated tools and approaches obtained in later stages, can be a real fun for experts, advanced students, etc. We start by going to the…
We introduce a new family of refined Sobolev-Malliavin spaces that capture the integrability in time of the Malliavin derivative. We consider duality in these spaces and derive a Burkholder type inequality in a dual norm. The theory we…
The sum of square roots is as follows: Given $x_1,\dots,x_n \in \mathbb{Z}$ and $a_1,\dots,a_n \in \mathbb{N}$ decide whether $ E=\sum_{i=1}^n x_i \sqrt{a_i} \geq 0$. It is a prominent open problem (Problem 33 of the Open Problems Project),…
We obtain a strong invariance principle for nonconventional sums and applying this result we derive for them a version of the law of iterated logarithm, as well as an almost sure central limit theorem. Among motivations for such results are…
We develop an elementary method for proving the PBW theorem for associative algebras with an ascending filtration. The idea is roughly the following. At first, we deduce a proof of the PBW property for the {\it ascending} filtration (with…
We investigate expansions of Presburger arithmetic, i.e., the theory of the integers with addition and order, with additional structure related to exponentiation: either a function that takes a number to the power of $2$, or a predicate for…
Let $P_N(R)$ be the space of all real polynomials in $N$ variables with the usual inner product $<, >$ on it, given by integrating over the unit sphere. We start by deriving an explicit combinatorial formula for the bilinear form…
We propose a general method for optimization with semi-infinite constraints that involve a linear combination of functions, focusing on the case of the exponential function. Each function is lower and upper bounded on sub-intervals by…
A key property of an algebraic variety is whether it is absolutely irreducible, meaning that it remains irreducible over the algebraic closure of its defining field, and determining absolute irreducibility is important in algebraic geometry…
Polynomial inequality proving is fundamental to many mathematical disciplines and finds wide applications in diverse fields. Current traditional algebraic methods are based on searching for a polynomial positive definite representation over…
We investigate exponential sums over singular binary quartic forms, proving an explicit formula for the finite field Fourier transform of this set. Our formula shares much in common with analogous formulas proved previously for other vector…
Linear second order elliptic boundary value problems (BVP) on bounded Lipschitz domains are studied in the case of Gaussian white noise loads. Especially, Neumann and Robin BVPs are considered. The main obstacle for applying the usual…
The aim of this paper is to prove an uncertainty principle for the representation of a vector in two bases. Our result extends previously known qualitative uncertainty principles into quantitative estimates. We then show how to transfer…
Extreme-value copulas arise as the limiting dependence structure of component-wise maxima. Defined in terms of a functional parameter, they are one of the most widespread copula families due to their flexibility and ability to capture…
For model checking stochastic games (SGs), bounded value iteration (BVI) algorithms have gained attention as efficient approximate methods with rigorous precision guarantees. However, BVI may not terminate or converge when the target SG…
In this paper we consider the problem of binary hypothesis testing with finite memory systems. Let $X_1,X_2,\ldots$ be a sequence of independent identically distributed Bernoulli random variables, with expectation $p$ under $\mathcal{H}_0$…
Persuasion studies how an informed principal may influence the behavior of agents by the strategic provision of payoff-relevant information. We focus on the fundamental multi-receiver model by Arieli and Babichenko (2019), in which there…