English
Related papers

Related papers: The power of the Binary Value Principle

200 papers

Value iteration is a fundamental algorithm for solving Markov Decision Processes (MDPs). It computes the maximal $n$-step payoff by iterating $n$ times a recurrence equation which is naturally associated to the MDP. At the same time, value…

Formal Languages and Automata Theory · Computer Science 2019-04-30 Nikhil Balaji , Stefan Kiefer , Petr Novotný , Guillermo A. Pérez , Mahsa Shirmohammadi

Conditional Equi-concentration of Types on I-projections (ICET) and Extended Gibbs Conditioning Principle (EGCP) provide an extension of Conditioned Weak Law of Large Numbers and of Gibbs Conditioning Principle to the case of non-unique…

Mathematical Physics · Physics 2009-11-10 Marian Grendar

Cyclotomic polynomials are basic objects in Number Theory. Their properties depend on the number of distinct primes that intervene in the factorization of their order, and the binary case is thus the first nontrivial case. This paper sees…

Number Theory · Mathematics 2024-11-07 Antonio Cafure , Eda Cesaratto

We study the complexity of proof systems augmenting resolution with inference rules that allow, given a formula $\Gamma$ in conjunctive normal form, deriving clauses that are not necessarily logically implied by $\Gamma$ but whose addition…

Logic in Computer Science · Computer Science 2023-05-02 Emre Yolcu , Marijn J. H. Heule

We deploy numerical semidefinite programming and conversion to exact rational inequalities to certify that for a positive semidefinite input polynomial or rational function, any representation as a fraction of sums-of-squares of polynomials…

Optimization and Control · Mathematics 2012-03-02 Feng Guo , Erich L. Kaltofen , Lihong Zhi

In many real-world planning tasks, agents must tackle uncertainty about the environment's state and variability in the outcomes induced by stochastic dynamics and rewards. Motivated by recent progress in world model approaches, where latent…

Artificial Intelligence · Computer Science 2026-05-07 Larry Preuett , Qiuyi Zhang , Muhammad Aurangzeb Ahmad

In statistics, experimental designs are methods for making efficient experiments. E-optimal designs are the multisets of experimental conditions which minimize the maximum axis of the confidence ellipsoid of estimators. The aim of this…

Statistics Theory · Mathematics 2013-03-20 Takuma Takeuchi , Hiroto Sekido

The BKK theorem states that the mixed volume of the Newton polytopes of a system of polynomial equations upper bounds the number of isolated torus solutions of the system. Homotopy continuation solvers make use of this fact to pick…

Algebraic Geometry · Mathematics 2025-09-18 Christopher Borger , Thomas Kahle , Andreas Kretschmer , Sebastian Sager , Jonas Schulze

We obtain asymptotic expansions for local probabilities of partial sums for uniformly bounded independent but not necessarily identically distributed integer-valued random variables. The expansions involve products of polynomials and…

Probability · Mathematics 2020-12-02 Dmitry Dolgopyat , Yeor Hafouta

For the p-system with large BV initial data, an assumption introduced in [3] by Bakhvalov guarantees the global existence of entropy weak solutions with uniformly bounded total variation. The present paper provides a partial converse to…

Analysis of PDEs · Mathematics 2015-02-10 Alberto Bressan , Geng Chen , Qingtian Zhang , Shengguo Zhu

The exponential local-global principle, or Skolem conjecture, says: Suppose that \(b\) is a positive integer, and that the sequence \((u_{n})_{n = -\infty}^{\infty}\) is such that every term is in \(\mathbb{Z}[1/b]\), the linear recurrence…

Number Theory · Mathematics 2025-02-03 Henry Robert Thackeray

In this article, we consider linear hyperbolic Initial and Boundary Value Problems (IBVP) in a rectangle (or possibly curvilinear polygonal domains) in both the constant and variable coefficients cases. We use semigroup method instead of…

Analysis of PDEs · Mathematics 2013-10-23 Aimin Huang , Roger Temam

Covering numbers are a powerful tool used in the development of approximation algorithms, randomized dimension reduction methods, smoothed complexity analysis, and others. In this paper we prove upper bounds on the covering number of…

Algebraic Geometry · Mathematics 2025-06-09 Yifan Zhang , Joe Kileel

Iterative deepening search is used in applications where the best cost bound for state-space search is unknown. The iterative deepening process is used to avoid overshooting the appropriate cost bound and doing too much work as a result.…

Artificial Intelligence · Computer Science 2019-06-10 Nathan Sturtevant , Malte Helmert

For a large class of orthogonal basis functions, there has been a recent identification of expansion methods for computing accurate, stable approximations of a quantity of interest. This paper presents, within the context of uncertainty…

Computation · Statistics 2018-06-13 Jerrad Hampton , Alireza Doostan

The aim of this work is to certify lower bounds for real-valued multivariate functions, defined by semialgebraic or transcendental expressions. The certificate must be, eventually, formally provable in a proof system such as Coq. The…

Symbolic Computation · Computer Science 2014-04-18 Xavier Allamigeon , Stéphane Gaubert , Victor Magron , Benjamin Werner

We derive new boundary conditions and implementation procedures for nonlinear initial boundary value problems (IBVPs) with non-zero boundary data that lead to bounded solutions. The new boundary procedure is applied to nonlinear IBVPs in…

Numerical Analysis · Mathematics 2024-12-31 Jan Nordström

In this paper, we prove a quantitative approximation result by orthonormal polynomials associated to an exponential weight of the form e -$\Phi$ , where $\Phi$ is an even polynomial with positive leading coefficient. This result is a…

Numerical Analysis · Mathematics 2024-12-19 Bastien Grosse

We extend Peng's maximum principle for semilinear stochastic partial differential equations (SPDEs) in one space-dimension with non-convex control domains and control-dependent diffusion coefficients to the case of general cost functionals…

Probability · Mathematics 2021-10-28 Wilhelm Stannat , Lukas Wessels

Sum rules for $B(M1,0^+_1\rightarrow1^+_i)$ strength are derived for even-even nuclei in the isospin-invariant forms of the IBM, IBM-3 and IBM-4, in the cases where the respective natural internal symmetries, isospin $U$(3) and $U(6)\supset…

Nuclear Theory · Physics 2009-10-28 P. Halse , P. Van Isacker , B. R. Barrett