Related papers: The Barwise-Schlipf Theorem
We discover an abstract structure behind several nonlinear dispersive equations (including the NLS, NLKG and GKdV equations with generic defocusing power-law nonlinearities) that is reminiscent of hyperbolic conservation laws. The…
We designed a completely automated Maple ($\geqslant 15$) worksheet for deriving Edgeworth and Cornish-Fisher expansions as well as the acceleration constant of the bootstrap bias-corrected and accelerated technique. It is valid for…
We derive the renormalized Schwinger-Dyson equations for the one- and two-point functions in the auxiliary field formulation of $\lambda \phi^4$ field theory to order 1/N in the 2PI-1/N expansion. We show that the renormalization of the…
Linear and semidefinite programming (LP, SDP), regularisation through basis pursuit (BP) and Lasso have seen great success in mathematics, statistics, data science, computer-assisted proofs and learning. The success of LP is traditionally…
The extensively cited work of Barzilai, J. (1997): Deriving weights from pairwise comparison matrices, published in Journal of the Operational Research Society, 48(12), 1226-1232., derives the geometric mean method from two simple axioms.…
In this paper, we study an extension of the CPE conjecture to manifolds $M$ which support a structure relating curvature to the geometry of a smooth map $\varphi : M \to N$. The resulting system, denoted by $(\varphi-\mathrm{CPE})$, is…
Every classical orthogonal polynomial system $p_n(x)$ satisfies a three-term recurrence relation of the type \[ p_{n+1}(x)=(A_nx+B_n)p_n(x)-C_np_{n-1}(x)~ (n=0,1,2,\ldots, p_{-1}\equiv 0), \] with $C_nA_nA_{n-1}>0$. Moreover, Favard's…
We establish sharp estimates for the convergence rate of the Kranosel'ski\v{\i}-Mann fixed point iteration in general normed spaces, and we use them to show that the asymptotic regularity bound recently proved in [11] (Israel Journal of…
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem is either contained in one out of six classes and can be solved in…
We consider linear inverse problems where the solution is assumed to have a sparse expansion on an arbitrary pre-assigned orthonormal basis. We prove that replacing the usual quadratic regularizing penalties by weighted l^p-penalties on the…
In 1979, B. Shiffman conjectured that if f is an algebraically nondegenerate holomorphic map of C into P^n and D_1,...,D_q are hypersurfaces in P^n in general position, then the sum of the defects is at most n+1. This conjecture was proved…
We consider implicit definability of the standard part {0,1,...} in nonstandard models of Peano arithmetic (PA), and we ask whether there is a model of PA in which the standard part is implicitly definable. In section 1, we define a certain…
In 1978 M\'etivier showed that a differential operator $P$ with analytic coefficients is elliptic if and only if the theorem of iterates holds for $P$ with respect to any non-analytic Gevrey class. In this paper we extend this theorem to…
This is a study of S. Kripke's notion of fulfilment. Motivated by Paris-Harrington statement, Kripke was looking for a proof of G\"odel's Incompleteness Theorem which was model-theoretic, natural (without self-reference), and easy.…
We have published several articles about generalizations and boundary-case exceptions to the Second Incompleteness Theorem during the last 25 years. The current paper will review some of our prior results and also introduce an `enriched'…
Let $\mathsf{KP}$ denote Kripke-Platek Set Theory and let $\mathsf{M}$ be the weak set theory obtained from $\mathsf{ZF}$ by removing the collection scheme, restricting separation to $\Delta_0$-formulae and adding an axiom asserting that…
Atserias and M\"uller (JACM, 2020) proved that for every unsatisfiable CNF formula $\varphi$, the formula $\operatorname{Ref}(\varphi)$, stating "$\varphi$ has small Resolution refutations", does not have subexponential-size Resolution…
Let $F$ be a $2$-regular graph of order $v$. The Oberwolfach problem $OP(F)$, posed in 1967 and still open, asks for a decomposition of $K_v$ into copies of $F$. In this paper we show that $OP(F)$ has a solution whenever $F$ has a…
According to the math tea argument, there must be real numbers that we cannot describe or define, because there are uncountably many real numbers, but only countably many definitions. And yet, the existence of pointwise-definable models of…
Motivated by Keisler's order, a far-reaching program of understanding basic model-theoretic structure through the lens of regular ultrapowers, we prove that for a class of regular filters $D$ on $I$, $|I| = \lambda > \aleph_0$, the fact…