English
Related papers

Related papers: Abstract Corrected Iterations

200 papers

We prove the following theorem: For a partially ordered set Q such that every countable subset has a strict upper bound, there is a forcing notion satisfying ccc such that, in the forcing model, there is a basis of the null ideal of the…

Logic · Mathematics 2007-05-23 Maxim R. Burke , Masaru Kada

Let GCH hold and let $j:V\longrightarrow M$ be a definable elementary embedding such that $crit(j)=\kappa$, $^{\kappa}M\subseteq M$ and $\kappa^{++}=\kappa_{M}^{++}$. H. Woodin proved that there is a cofinality preserving generic extension…

Logic · Mathematics 2017-06-27 Yoav Ben Shalom

Given a compact interval $I \subseteq \mathbb{R}$, and a function $f$ that is a product of a nonzero polynomial with a Gaussian, it will be shown that the translates $\{ f(\cdot - \lambda) : \lambda \in \Lambda \}$ are complete in $C(I)$ if…

Classical Analysis and ODEs · Mathematics 2024-10-02 Lukas Liehr

We consider linear iterated function systems (IFS) with a constant contraction ratio in the plane for which the "overlap set" $\Ok$ is finite, and which are "invertible" on the attractor $A$, the sense that there is a continuous surjection…

Dynamical Systems · Mathematics 2011-07-20 Kemal Ilgar Eroğlu , Steffen Rohde , Boris Solomyak

In this paper, we present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified,…

Combinatorics · Mathematics 2025-12-05 Kei Beauduin

This paper describes a computational, declarative approach to prosodic morphology that uses inviolable constraints to denote small finite candidate sets which are filtered by a restrictive incremental optimization mechanism. The new…

Computation and Language · Computer Science 2007-05-23 Markus Walther

We present new convergence estimates for the iterated penalty method applied to structure-preserving discretizations of linear generalized saddle point systems. The method may be viewed as an Uzawa iteration on an augmented Lagrangian…

Numerical Analysis · Mathematics 2026-05-27 Patrick E. Farrell , Michael Neilan , Charles Parker , L. Ridgway Scott

We define a variant of realizability where realizers are pairs of a term and a substitution. This variant allows us to prove the normalization of a simply-typed call-by-need $$\lambda$-$calculus with control due to Ariola et al. Indeed, in…

Logic in Computer Science · Computer Science 2018-03-05 Étienne Miquey , Hugo Herbelin

In this paper, we consider the following problem involving fractional Laplacian operator: \begin{equation}\label{eq:0.1} (-\Delta)^{\alpha} u= |u|^{2^*_\alpha-2-\varepsilon}u + \lambda u\,\, {\rm in}\,\, \Omega,\quad u=0 \,\, {\rm on}\, \,…

Analysis of PDEs · Mathematics 2015-03-04 Shusen Yan , Jianfu Yang , Xiaohui Yu

Suppose $\kappa$ is a singular strong limit cardinal of countable cofinality and let $\langle \kappa_{n}: n<\omega \rangle$ be an incrasing sequence of regular cardinals cofinal in $\kappa$. We show that if $cf(2^\kappa)= \kappa^+$, then…

Logic · Mathematics 2021-07-12 Mohammad Golshani , Rahman Mohammadpour

The present paper has three themes. First, we continue the investigations started in Judah, Roslanowski and Shelah \math.LO/9310224 and Roslanowski and Shelah math.LO/9807172, math.LO/9703222, and we investigate the method of norms on…

Logic · Mathematics 2013-01-04 Andrzej Roslanowski , Saharon Shelah

In this paper we obtain a new set of metamorphoses of the oscillating Q-system by using the Euler's integral. We split the final state of mentioned metamorphoses into three distinct parts: the signal, the noise and finally appropriate error…

Classical Analysis and ODEs · Mathematics 2015-10-02 Jan Moser

Broadbent and G\"oller (FSTTCS 2012) proved the undecidability of bisimulation equivalence for processes generated by epsilon-free second-order pushdown automata. We add a few remarks concerning the used proof technique, called Defender's…

Logic in Computer Science · Computer Science 2013-03-05 Petr Jančar , Jiří Srba

In this work we study the following fractional critical problem $$ (P_{\lambda})=\left\{\begin{array}{ll} (-\Delta)^s u=\lambda u^{q} + u^{2^*_{s}-1}, \quad u{>}0 & \mbox{in} \Omega\\ u=0 & \mbox{in} \RR^n\setminus \Omega\,,…

Analysis of PDEs · Mathematics 2013-06-14 B. Barrios , E. Colorado , R. Servadei , F. Soria

We use forcing over admissible sets to show that, for every ordinal $\alpha$ in a club $C\subset\omega_1$, there are copies of $\alpha$ such that the isomorphism between them is not computable in the join of the complete $\Pi^1_1$ set…

Logic · Mathematics 2024-08-21 Noah Schweber

The $\lambda$-superposition calculus is a successful approach to proving higher-order formulas. However, some parts of the calculus are extremely explosive, notably due to the higher-order unifier enumeration and the functional…

Logic in Computer Science · Computer Science 2025-10-22 Alexander Bentkamp , Jasmin Blanchette , Matthias Hetzenberger , Uwe Waldmann

In this paper, a fault-tolerant approach to mitigate transient and permanent faults of arithmetic and logic operations of embedded processors called FT-EALU is proposed. In this method, each operation is replicated in time and the derived…

Hardware Architecture · Computer Science 2022-04-05 Athena Abdi , Sina Shahoveisi

Numerical solutions for flows in partially saturated porous media pose challenges related to the non-linearity and elliptic-parabolic degeneracy of the governing Richards' equation. Iterative methods are therefore required to manage the…

Numerical Analysis · Mathematics 2024-02-02 Nicolae Suciu , Florin A. Radu , Jakob S. Stokke , Emil Cătinaş , Andra Malina

Given a Woodin cardinal $\delta$, I show that if $F$ is any Easton function with $F"\delta\subseteq\delta$ and $\GCH$ holds, then there is a cofinality-preserving forcing extension in which $2^\gamma= F(\gamma)$ for each regular cardinal…

Logic · Mathematics 2012-09-07 Brent Cody

In semidefinite programming (SDP), unlike in linear programming, Farkas' lemma may fail to prove infeasibility. Here we obtain an exact, short certificate of infeasibility in SDP by an elementary approach: we reformulate any semidefinite…

Optimization and Control · Mathematics 2015-04-06 Minghui Liu , Gabor Pataki
‹ Prev 1 4 5 6 7 8 10 Next ›