English
Related papers

Related papers: The power of the Binary Value Principle

200 papers

This is an expository paper aiming to introduce Zilber's Exponential Closedness conjecture to a general audience. Exponential Closedness predicts when (systems of) equations involving addition, multiplication, and exponentiation have…

Complex Variables · Mathematics 2024-10-21 Vahagn Aslanyan , Francesco Gallinaro

We study voting rules for participatory budgeting, where a group of voters collectively decides which projects should be funded using a common budget. We allow the projects to have arbitrary costs, and the voters to have arbitrary additive…

Computer Science and Game Theory · Computer Science 2022-10-18 Dominik Peters , Grzegorz Pierczyński , Piotr Skowron

Value Iteration is a widely used algorithm for solving Markov Decision Processes (MDPs). While previous studies have extensively analyzed its convergence properties, they primarily focus on convergence with respect to the infinity norm. In…

Machine Learning · Computer Science 2025-02-06 Arsenii Mustafin , Sebastien Colla , Alex Olshevsky , Ioannis Ch. Paschalidis

It is a common contention that it is an ``impossible mission'' to exactly determine the minimum sample size for the estimation of a binomial parameter with prescribed margin of error and confidence level. In this paper, we investigate such…

Statistics Theory · Mathematics 2007-08-02 Xinjia Chen

In this paper we are concerned with the maximum principle for quasi-linear backward stochastic partial differential equations (BSPDEs for short) of parabolic type. We first prove the existence and uniqueness of the weak solution to…

Probability · Mathematics 2011-03-08 Jinniao Qiu , Shanjian Tang

The implied volatility is a crucial element of any financial toolbox, since it is used for quoting and the hedging of options as well as for model calibration. In contrast to the Black-Scholes formula its inverse, the implied volatility, is…

Computational Finance · Quantitative Finance 2017-10-06 Kathrin Glau , Paul Herold , Dilip B. Madan , Christian Pötz

We develop a new method of proving vector-valued estimates in harmonic analysis, which we like to call "the helicoidal method". As a consequence of it, we are able to give affirmative answers to some questions that have been circulating for…

Classical Analysis and ODEs · Mathematics 2017-01-25 Cristina Benea , Camil Muscalu

A Pseudo-Boolean (PB) constraint is a linear inequality constraint over Boolean literals. One of the popular, efficient ideas used to solve PB-problems (a set of PB-constraints) is to translate them to SAT instances (encodings) via, for…

Data Structures and Algorithms · Computer Science 2023-05-09 Michał Karpiński , Marek Piotrów

Sixth-order boundary value problems (BVPs) arise in thin-film flows with a surface that has elastic bending resistance. We consider the case in which the elastic interface is clamped at the lateral walls of a closed trough and thus encloses…

Numerical Analysis · Mathematics 2025-12-02 N C Papanicolaou , I C Christov

By the use of the variational method with exponential trial functions the upper and lower bounds of energy are calculated for a number of non-relativistic three-body Coulomb and nuclear systems. The formulas for calculation of upper and…

Atomic Physics · Physics 2007-05-23 A. G. Donchev , N. N. Kolesnikov , V. I. Tarasov

Sum of Squares programming has been used extensively over the past decade for the stability analysis of nonlinear systems but several questions remain unanswered. In this paper, we show that exponential stability of a polynomial vector…

Classical Analysis and ODEs · Mathematics 2012-01-13 Matthew M. Peet , Antonis Papachristodoulou

We introduce a notion of subunit vector field for fully nonlinear degenerate elliptic equations. We prove that an interior maximum of a viscosity subsolution of such an equation propagates along the trajectories of subunit vector fields.…

Analysis of PDEs · Mathematics 2018-12-27 Martino Bardi , Alessandro Goffi

We prove a PCP theorem for the existential theory of the reals, showing that MAX-ETR-INV is $\exists\mathbb{R}$-hard to approximate to within some constant factor. The existential theory of the reals (ETR) is a decision problem asking if…

Computational Complexity · Computer Science 2026-05-25 Jack Stade

We study some systems of polynomials whose support lies in the convex hull of a circuit, giving a sharp upper bound for their numbers of real solutions. This upper bound is non-trivial in that it is smaller than either the Kouchnirenko or…

Algebraic Geometry · Mathematics 2010-03-29 Benoit Bertrand , Frederic Bihan , Frank Sottile

A well-known open problem in general relativity, dating back to 1972, has been to prove Price's law for an appropriate model of gravitational collapse. This law postulates inverse-power decay rates for the gravitational radiation flux on…

General Relativity and Quantum Cosmology · Physics 2015-06-25 Mihalis Dafermos , Igor Rodnianski

The research problem in this work is the relaxation of maximizing non-negative submodular plus modular with the entire real number domain as its value range over a family of down-closed sets. We seek a feasible point $\mathbf{x}^*$ in the…

Data Structures and Algorithms · Computer Science 2022-04-13 Xin Sun , Chenchen Wu , Dachuan Xu , Yang Zhou

In this paper we study the (Bichromatic) Maximum Inner Product Problem (Max-IP), in which we are given sets $A$ and $B$ of vectors, and the goal is to find $a \in A$ and $b \in B$ maximizing inner product $a \cdot b$. Max-IP is very basic…

Computational Complexity · Computer Science 2018-03-07 Lijie Chen

We study policy iteration for infinite-horizon Markov decision processes. It has recently been shown policy iteration style algorithms have exponential lower bounds in a two player game setting. We extend these lower bounds to Markov…

Data Structures and Algorithms · Computer Science 2010-03-18 John Fearnley

For any real numbers $B \ge 1$ and $\delta \in (0, 1)$ and function $f: [0, B] \rightarrow \mathbb{R}$, let $d_{B; \delta} (f) \in \mathbb{Z}_{> 0}$ denote the minimum degree of a polynomial $p(x)$ satisfying $\sup_{x \in [0, B]} \big| p(x)…

Computational Complexity · Computer Science 2022-05-13 Amol Aggarwal , Josh Alman

The problem of combining p-values is an old and fundamental one, and the classic assumption of independence is often violated or unverifiable in many applications. There are many well-known rules that can combine a set of arbitrarily…

Statistics Theory · Mathematics 2025-03-21 Matteo Gasparin , Ruodu Wang , Aaditya Ramdas
‹ Prev 1 4 5 6 7 8 10 Next ›