English
Related papers

Related papers: Iterability for (transfinite) stacks

200 papers

Motivated by the string landscape, inflation may happen on a high dimensional complicated potential. We propose a new way to construct some high dimensional random potentials, and study inflation on top of that, for up to 50-dimensions in…

High Energy Physics - Theory · Physics 2015-05-27 Junyu Liu , Yi Wang , Siyi Zhou

This note studies the behavior of an index I_t which is assumed to be a tradable security, to satisfy the BSM model dI_t/I_t = \mu dt + \sigma dW_t, and to be efficient in the following sense: we do not expect a prespecified trading…

General Finance · Quantitative Finance 2011-09-13 Vladimir Vovk

A $\sigma$-ideal $\cal{I}$ on a set $X$ is supersaturated if for every family $\cal{F}$ of $\cal{I}$-positive sets with $|\cal{F}| < \mathrm{add}(\cal{I})$, there exists a countable set that meets every set in $\cal{F}$. We show that many…

Logic · Mathematics 2021-07-01 Ashutosh Kumar , Dilip Raghavan

Let $\mathcal{SN}$ be the $\sigma$-ideal of the strong measure zero sets of reals. We present general properties of forcing notions that allow to control of the additivity of $\mathcal{SN}$ after finite support iterations. This is applied…

Logic · Mathematics 2025-08-21 Jörg Brendle , Miguel A. Cardona , Diego A. Mejía

Higgs Inflation via a metastable Standard Model Higgs Potential is possible if the effective Planck mass in the Jordan frame increases after inflation ends. Here we consider the predictions of this model independently of the dynamics…

High Energy Physics - Phenomenology · Physics 2024-11-01 J. McDonald

This work establishes combinatorial bounds on the Castelnuovo-Mumford regularity of edge ideals for trees and their multi-whiskered variants. For a tree \( T \), we give bounds for the Castelnuovo-Mumford regularity of \( I(T) \) in terms…

Commutative Algebra · Mathematics 2025-10-14 Ahtsham Ul Haq , Muhammad Usman Rashid , Muhammad Ishaq

We are going to prove that if the theory of a structure $\mathcal M=\langle \mathbb{N}, \Sigma \rangle$ is decidable and the standard order $<$ on natural numbers $\mathbb{N}$ is definable in $\mathcal M$, then there is a nontrivial…

Logic · Mathematics 2022-11-30 Sergei Soprunov

We focus on the persistence principle over weak interpretability logic. Our object of study is the logic obtained by adding the persistence principle to weak interpretability logic from several perspectives. Firstly, we prove that this…

Logic · Mathematics 2023-10-03 Sohei Iwata , Taishi Kurahashi , Yuya Okawa

Termination property of functions is an important issue in computability theory. In this paper, we show that repeated iterations of a function can induce an order amongst the elements of its domain set. Hasse diagram of the poset, thus…

Logic in Computer Science · Computer Science 2017-08-17 Abhinav Aggarwal , Padam Kumar

We propose a generic termination proof method for rewriting under strategies, based on an explicit induction on the termination property. Rewriting trees on ground terms are modeled by proof trees, generated by alternatively applying…

Logic in Computer Science · Computer Science 2007-05-23 Isabelle Gnaedig , Helene Kirchner

We consider natural cardinal invariants hm_n and prove several duality theorems, saying roughly: if I is a suitably definable ideal and provably cov(I)>=hm_n, then non(I) is provably small. The proofs integrate the determinacy theory,…

Logic · Mathematics 2007-05-23 Saharon Shelah , Jindrich Zapletal

If T is an iteration tree on K and F is a countably certified extender that coheres with the final model of T, then F is on the extender sequence of the final model of T. Several applications of maximality are proved, including: o K…

Logic · Mathematics 2016-09-07 Ernest Schimmerling , John R. Steel

In this paper, we introduce and study the iterates of the following family of functions $\varphi_k$ defined on natural numbers which exhibits nice properties. $$\varphi_k(x)=\left\lbrace \begin{array}{ll} x+k, & \mbox{ if $x$ is prime;}\\…

Number Theory · Mathematics 2024-12-31 Angsuman Das

Anusic, Bruin, and Cinc have asked which hereditarily decomposable chainable continua (HDCC) have uncountably many mutually inequivalent planar embeddings. It was noted, as per the embedding technique of John C. Mayer with the…

General Topology · Mathematics 2022-03-16 Joseph S. Ozbolt

We consider weak solutions to the incompressible Euler equations. It is shown that energy conservation holds in any Onsager critical class in which smooth functions are dense. The argument is independent of the specific critical regularity…

Analysis of PDEs · Mathematics 2026-01-08 Luigi De Rosa , Marco Inversi , Matteo Nesi

Consider two free measure preserving group actions $\Gamma \actson (X, \mu), \Delta \actson (X, \mu)$, and a measure preserving action $\Delta \actson^a (Z, \nu)$ where $(X, \mu), (Z, \nu)$ are standard probability spaces. We show how to…

Group Theory · Mathematics 2008-03-12 Inessa Epstein

We show that higher Sacks forcing at a regular limit cardinal and club Miller forcing at an uncountable regular cardinal both add a diamond sequence. We answer the longstanding question, whether $\kappa = \kappa^{<\kappa} \geq\aleph_1$…

Logic · Mathematics 2025-04-14 Heike Mildenberger , Saharon Shelah

A simple \(P_\lambda\)-point on a regular cardinal \(\kappa\) is a uniform ultrafilter on \(\kappa\) with a mod-bounded decreasing generating sequence of length \(\lambda\). We prove that if there is a simple $P_\lambda$-point ultrafilter…

Logic · Mathematics 2025-12-10 Tom Benhamou , Gabriel Goldberg

We develop the theory of the forcing with trees and creatures for an inaccessible lambda continuing Ros{\l}anowski and Shelah math.LO/9807172, math.LO/9909115. To make a real use of these forcing notions (that is to iterate them without…

Logic · Mathematics 2013-01-03 Andrzej Rosłanowski , Saharon Shelah

In this paper the complexity of provability of polarized additive, multiplicative, and exponential formulas in the (initial) Cockett-Seely polarized game logic is discussed. The complexity is ultimately based on the complexity of finding a…

Category Theory · Mathematics 2007-05-23 J. R. B. Cockett , C. A. Pastro