English
Related papers

Related papers: Giant and illusionary giant Goodstein principles

200 papers

We consider Bergman spaces and variations of them in one or several complex variables. For some domains we show that in these spaces the generic function is totally unbounded and hence non - extendable. We also show that the generic…

Complex Variables · Mathematics 2017-04-10 T. Hatziafratis , K. Kioulafa , V. Nestoridis

The large $N$ expansion of giant graviton correlators is considered. Giant gravitons are described using operators with a bare dimension of order $N$. In this case the usual $1/N$ expansion is not applicable and there are contributions to…

High Energy Physics - Theory · Physics 2019-03-27 Robert de Mello Koch , Eunice Gandote , Jia-Hui Huang

In this article, we discuss some geometric infinitely divisible (gid) random variables using the Laplace exponents which are Bernstein functions and study their properties. The distributional properties and limiting behavior of the…

Statistics Theory · Mathematics 2023-09-07 Monika Singh Dhull , Arun Kumar

It is a well-known empirical phenomenon that natural axiomatic theories are pre-well-ordered by consistency strength. Without a precise mathematical definition of "natural," it is unclear how to study this phenomenon mathematically. We will…

Logic · Mathematics 2026-03-04 James Walsh

Using the concepts of Hyperbolic Classification of Natural Numbers, Essential Regions and Goldbach Conjecture Function we prove that the existence of a proof of the Goldbach Conjecture in First-Order Arithmetic would imply the existence of…

General Mathematics · Mathematics 2007-11-08 Fernando Revilla

We provide counterexamples showing that uniform laws of large numbers do not hold for subdifferentials under natural assumptions. Our constructions are univariate random Lipschitz functions and bivariate random convex functions with two…

Optimization and Control · Mathematics 2026-03-17 Lai Tian , Johannes O. Royset

Starting with two supercompact cardinals we produce a generic extension of the universe in which a principle that we call ${\rm GM}^+(\omega_3,\omega_1)$ holds. This principle implies ${\rm ISP}(\omega_2)$ and ${\rm ISP}(\omega_3)$, and…

Logic · Mathematics 2019-05-21 Rahman Mohammadpour , Boban Velickovic

We establish strong invariance principles for sums of stationary and ergodic processes with nearly optimal bounds. Applications to linear and some nonlinear processes are discussed. Strong laws of large numbers and laws of the iterated…

Probability · Mathematics 2011-11-10 Wei Biao Wu

The Ackermann function is a famous total recursive binary function on the natural numbers. It is the archetypal example of such a function that is not primitive recursive, in the sense of classical recursion theory. However, and in seeming…

Logic in Computer Science · Computer Science 2016-02-17 Baltasar Trancón y Widemann

The proof, but not the statement, of Proposition 18.2 contained an error which is repaired in this version. See Remark 18.3 in this version. No other changes. We extend Greenberg's original construction to arbitrary (in particular,…

Number Theory · Mathematics 2022-02-22 Alessandra Bertapelle , Cristian D. Gonzalez-Aviles

Asymptotic expansions are derived for associated Legendre functions of degree $\nu$ and order $\mu$, where one or the other of the parameters is large. The expansions are uniformly valid for unbounded real and complex values of the argument…

Classical Analysis and ODEs · Mathematics 2025-07-04 T. M. Dunster

Gotzmann's Persistence states that the growth of an arbitrary ideal can be controlled by comparing it to the growth of the lexicographic ideal. This is used, for instance, in finding equations which cut out the Hilbert scheme (of subschemes…

Commutative Algebra · Mathematics 2007-10-02 Morgan Sherman

The Wendland functions are a class of compactly supported radial basis functions with a user-specified smoothness parameter. We prove that with a linear change of variables, both the original and the "missing" Wendland functions converge…

Numerical Analysis · Mathematics 2013-04-15 A. Chernih , I. H. Sloan , R. S. Womersley

We show that the weakest versions of Foreman's minimal generic hugeness axioms cannot hold simultaneously on adjacent cardinals. Moreover, conventional forcing techniques cannot produce a model of one of these axioms.

Logic · Mathematics 2023-03-27 Monroe Eskew

In a previous paper, the authors with Ann Nelson proposed that the UV and IR applicability of effective quantum field theories should be constrained by requiring that strong gravitational effects are nowhere encountered in a theory's domain…

High Energy Physics - Phenomenology · Physics 2021-03-09 Andrew G. Cohen , David B. Kaplan

We present a coherent collection of finite mathematical theorems some of which can only be proved by going well beyond the usual axioms for mathematics. The proofs of these theorems illustrate in clear terms how one uses the well studied…

Logic · Mathematics 2016-09-07 Harvey M. Friedman

Literature considers under the name \emph{unimaginable numbers} any positive integer going beyond any physical application, with this being more of a vague description of what we are talking about rather than an actual mathematical…

Logic in Computer Science · Computer Science 2019-03-13 Antonino Leonardis , Gianfranco D'Atri , Fabio Caldarola

We study properties of $\mathcal{A}$-harmonic and $\mathcal{A}$-superharmonic functions involving an operator having generalized Orlicz-growth embracing besides Orlicz case also natural ranges of variable exponent and double-phase cases. In…

Analysis of PDEs · Mathematics 2020-06-26 Iwona Chlebicka , Anna Zatorska-Goldstein

We reevaluate the claim that predicative reasoning (given the natural numbers) is limited by the Feferman-Schutte ordinal Gamma_0. First we comprehensively criticize the arguments that have been offered in support of this position. Then we…

Logic · Mathematics 2009-05-11 Nik Weaver

The iterated Johnson bound is the best known upper bound on a size of an error-correcting code in the Grassmannian $\mathcal{G}_q(n,k)$. The iterated Sch\"{o}nheim bound is the best known lower bound on the size of a covering code in…

Discrete Mathematics · Computer Science 2011-11-14 Simon R. Blackburn , Tuvi Etzion