English
Related papers

Related papers: Fine structure from normal iterability

200 papers

We review Migdal's Theory of Finite Fermi Systems and its application to the structure of nuclei. The theory is an extension of Landau's Theory of Interacting Fermi Systems. In the first part the basic formulas are derived within the many…

Nuclear Theory · Physics 2009-11-11 Frank Gruemmer , Josef Speth

Let $f:X\to X$ be a non-isomorphic (i.e., $\text{deg } f>1$) surjective endomorphism of a smooth projective threefold $X$. We prove that any birational minimal model program becomes $f$-equivariant after iteration, provided that $f$ is…

Algebraic Geometry · Mathematics 2023-09-14 Sheng Meng , De-Qi Zhang

Large algebraic structures are found inside the space of sequences of continuous functions on a compact interval having the property that, the series defined by each sequence converges absolutely and uniformly on the interval but the series…

Functional Analysis · Mathematics 2020-05-29 M. Carmen Calderón-Moreno , Pablo J. Gerlach-Mena , José A. Prado-Bassas

This is a survey article on trees, with a modest number of proofs to give a flavor of the way these topologies can be efficiently handled. Trees are defined in set-theorist fashion as partially ordered sets in which the elements below each…

General Topology · Mathematics 2007-05-23 Peter J. Nyikos

It is shown the construction of a module structure [2] with universe over a set of a particular kind of mathematical proofs, the base ring of this module will be built on a maximal consistent extension of a set of propositions, this…

Logic · Mathematics 2013-07-25 Kevin Davila Castellar , Ismael Gutierrez Garcia

We extend the classical Mercer theorem to reproducing kernel Hilbert spaces whose elements are functions from a measurable space $X$into $\mathbb C^n$. Given a finite measure $\mu$ on $X$, we represent the reproducing kernel $K$ as…

Functional Analysis · Mathematics 2011-10-19 Ernesto De Vito , Veronica Umanita` , Silvia Villa

We present a condition for towers of fiber bundles which implies that the fundamental group of the total space has a nilpotent subgroup of finite index whose torsion is contained in its center. Moreover, the index of the subgroup can be…

Algebraic Topology · Mathematics 2018-10-04 Vitali Kapovitch , Anton Petrunin , Wilderich Tuschmann

Assuming the existence of a strong cardinal and a measurable cardinal above it, we construct a model of $ZFC$ in which for every singular cardinal $\delta$, $\delta$ is strong limit, $2^\delta=\delta^{+3}$ and the tree property at…

Logic · Mathematics 2018-05-22 Mohammad Golshani

The first main result is a topological rigidity theorem for complete immersed hypersurfaces of spherical space forms which extends similar results due to do Carmo/Warner, Wang/Xia and Longa/Ripoll. Under certain sharp conditions on the…

Geometric Topology · Mathematics 2020-01-17 Pedro Zühlke

A statistical structure $(g, T)$ on a smooth manifold $M$ induced by $(\tilde M, \tilde g, \tilde T)$ is said to be {\em robust} if there exists an open neighborhood of $(g,T)$ in the fine $C^{\infty}$-topology consisting of statistical…

Statistics Theory · Mathematics 2021-10-13 Andrea Loi , Stefano Matta

We investigate a generalization of the {\L}o\'s-Tarski preservation theorem via the semantic notion of \emph{preservation under substructures modulo $k$-sized cores}. It was shown earlier that over arbitrary structures, this semantic notion…

Logic in Computer Science · Computer Science 2014-01-24 Abhisekh Sankaran , Bharat Adsul , Supratik Chakraborty

We study Boolean functions of an arbitrary number of input variables that can be realized by simple iterative constructions based on constant-size primitives. This restricted type of construction needs little global coordination or control…

Neural and Evolutionary Computing · Computer Science 2016-06-16 Christos Papadimitrou , Samantha Petti , Santosh Vempala

Let $\phi$ be a psh function on a bounded pseudoconvex open set $\Omega \subset \C^n$, and let ${\cal I}(\phi)$ be the associated multiplier ideal sheaf. Motivated by resolution of singularities issues, we establish an effective version of…

Complex Variables · Mathematics 2007-05-23 Dan Popovici

We prove that various classical tree forcings -- for instance Sacks forcing, Mathias forcing, Laver forcing, Miller forcing and Silver forcing -- preserve the statement that every real has a sharp and hence analytic determinacy. We then…

Logic · Mathematics 2021-03-19 Fabiana Castiblanco , Philipp Schlicht

We show that many countable support iterations of proper forcings preserve Souslin trees. We establish sufficient conditions in terms of games and we draw connections to other preservation properties. We present a proof of preservation…

Logic · Mathematics 2013-09-03 Heike Mildenberger , Saharon Shelah

Let R be a commutative Noetherian ring, I and J ideals of R and M a finitely generated R-module. Let F be a covariant R-linear functor from the category of finitely generated R-modules to itself. We first show that if F is coherent, then…

Commutative Algebra · Mathematics 2015-07-31 Tony Se

We introduce more properties of forcing notions which imply that their lambda-support iterations are lambda-proper, where lambda is an inaccessible cardinal. This paper is a direct continuation of section A.2 of math.LO/0210205. As an…

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

Our focus in this paper is in effective computation of the core core(I) of an ideal I which is defined to be the intersection of all minimal reductions of I. The first main result is a closed formula for the graded core(m) of the maximal…

Commutative Algebra · Mathematics 2007-05-23 Craig Huneke , Ngo Viet Trung

We develop a unified framework for iterated symmetric extensions with countable support and, more generally, with $<\kappa$-support. Set-length iterations are treated uniformly, and when the iteration template is first-order definable over…

Logic · Mathematics 2026-01-26 Frank Gilson

Ill-founded (or non-wellfounded) proof systems have emerged as a natural framework for inductive and coinductive reasoning. In such systems, soundness relies on global correctness criteria, such as the progressivity condition. Ensuring that…

Logic in Computer Science · Computer Science 2026-02-16 Gianluca Curzi , Graham E. Leigh
‹ Prev 1 8 9 10 Next ›