Related papers: Improving SDP bounds for minimizing quadratic func…
This article derives lower bounds on the supremal (strict) p-negative type of finite metric spaces using purely elementary techniques. The bounds depend only on the cardinality and the (scaled) diameter of the underlying finite metric…
We describe an approach for finding upper bounds on an ODE dynamical system's maximal Lyapunov exponent among all trajectories in a specified set. A minimization problem is formulated whose infimum is equal to the maximal Lyapunov exponent,…
We prove an analogue of Sogge's local $L^p$ estimates for $L^p$ norms of restrictions of eigenfunctions to submanifolds, and use it to show that for quantum ergodic eigenfunctions one can get improvements of the results of…
We provide a sufficient condition for the existence of a positive solution to $-\Delta u+V(|x|) u=u^p$ in $B_1$, when p is large enough. Here $B_1$ is the unit ball of $R^n$, n greater or equal to 2, and we deal both with Neumann and…
This paper aims at solving one-dimensional backward stochastic differential equations (BSDEs) under weaker assumptions. We establish general existence, uniqueness, and comparison results for bounded solutions, $L^p (p>1)$ solutions and…
We consider a linear-quadratic optimization problem with pointwise bounds on the state for which the constraint is given by the Laplace-Beltrami equation (to have uniqueness we add an lower order term) on a two-dimensional surface . By…
A common optimization problem is the minimization of a symmetric positive definite quadratic form $< x,Tx >$ under linear constrains. The solution to this problem may be given using the Moore-Penrose inverse matrix. In this work we extend…
The proximal policy optimization (PPO) algorithm stands as one of the most prosperous methods in the field of reinforcement learning (RL). Despite its success, the theoretical understanding of PPO remains deficient. Specifically, it is…
The quadratic programming over one inequality quadratic constraint (QP1QC) is a very special case of quadratically constrained quadratic programming (QCQP) and attracted much attention since early 1990's. It is now understood that, under…
One method to determine whether or not a system of partial differential equations is consistent is to attempt to construct a solution using merely the "algebraic data" associated to the system. In technical terms, this translates to the…
We obtain improved regularity of homeomorphic solutions of the reduced Beltrami equation, as compared to the standard Beltrami equation. Such an improvement is not possible in terms of Holder or Sobolev regularity; instead, our results…
Recently, Gilmer proved the first constant lower bound for the union-closed sets conjecture via an information-theoretic argument. The heart of the argument is an entropic inequality involving the OR function of two i.i.d.\ binary vectors,…
We obtain bounds on fractional parts of binary forms of the shape $$\Psi(x,y)=\alpha_k x^k+\alpha_l x^ly^{k-l}+\alpha_{l-1}x^{l-1}y^{k-l+1}+\cdots+\alpha_0 y^k$$ with $\alpha_k,\alpha_l,\ldots,\alpha_0\in\mathbb{R}$ and $l\leq k-2.$ By…
We give explicit isoperimetric upper bounds for all Steklov eigenvalues of a compact orientable surface with boundary, in terms of the genus, the length of the boundary, and the number of boundary components. Our estimates generalize a…
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.…
We study the biharmonic Steklov eigenvalue problem on a compact Riemannian manifold $\Omega$ with smooth boundary. We give a computable, sharp lower bound of the first eigenvalue of this problem, which depends only on the dimension, a lower…
The stability number of a graph $G$, denoted as $\alpha(G)$, is the maximum size of an independent (stable) set in $G$. Semidefinite programming (SDP) methods, which originated from Lov\'asz's theta number and expanded through…
Let K be a non-archimedean field, and let f in K(z) be a rational function of degree d>1. If f has potentially good reduction, we give an upper bound, depending only on d, for the minimal degree of an extension L/K such that f is conjugate…
In this work a linearly constrained minimization of a positive semidefinite quadratic functional is examined. Our results are concerning infinite dimensional real Hilbert spaces, with a singular positive operator related to the functional,…
In this paper, we prove $L^p$ ($p > 1$) dimension free bounds for the centered Hardy-Littlewood maximal function on real or complex hyperbolic spaces.