Related papers: Sets in Prikry and Magidor Generic Extensions

We establish and fully characterize the multidimensional extension of the Stronger Central Sets Theorem. Additionally, we develop a polynomial generalization of this result. Our approach utilizes tools from the Algebra of the Stone-\v{C}ech…

Here we continue to list the differential operators invariant with respect to the 15 exceptional simple Lie superalgebras of polynomial vector fields. A part of the list (for operators acting on tensors with finite dimensional fibers) was…

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…

This article discusses a combinatorial extension of tropical intersection theory to spaces given by glueing quotients of partially open convex polyhedral cones by finitely many automorphisms. This extension is done in terms of linear…

We investigate fundamental properties of adjoint functors to the precomposition functor in the category of strict polynomial functors.

The technique of symmetric extensions is derived from forcing and it is one of the most important tools for studying models without the Axiom of Choice. Despite being incredibly successful since the 1960s, our understanding of the technique…

Using field-theoretical methods and exploiting conformal invariance, we study Casimir forces at tricritical points exerted by long-range fluctuations of the order-parameter field. Special attention is paid to the situation where the…

To work more accurately with elements of the semigroup of the Stone Cech compactification of the discrete semigroup of natural numbers N under multiplication. We divided these elements into ultrafilters which are on finite levels and…

In the paper we develop the method of higher energies. New upper bounds for the additive energies of convex sets, sets A with small |AA| and |A(A+1)| are obtained. We prove new structural results, including higher sumsets, and develop the…

Given a countable transitive model of set theory and a partial order contained in it, there is a natural countable Borel equivalence relation on generic filters over the model; two are equivalent if they yield the same generic extension. We…

We establish upper and lower bounds on the dimension of the space spanned by the symmetric powers of the natural character of generalised symmetric groups. We adapt the methods of Savitt and Stanley from their paper `A note on the symmetric…

This paper investigates conditions under which canonical cofinal maps of the following three types exist: continuous, generated by finitary end-extension preserving maps, and generated by finitary maps. The main theorems prove that every…

We continue investigating the structure of externally definable sets in NIP theories and preservation of NIP after expanding by new predicates. Most importantly: types over finite sets are uniformly definable; over a model, a family of…

Kan extensions provide a natural general framework for a variety of combinatorial problems. We have developed rewriting procedures for Kan extensions (over the category of sets) and this enables one program to address a wide range of…

Continuing the investigations by the author \cite{SchnurrWM} and Glasner and Weiss \cite{GlasnerWeiss} on generic properties of extensions, we give a sufficient condition for the strongly mixing extensions of a fixed transformation to be of…

We construct a plethora of Anosov-Katok diffeomorphisms with non-ergodic generic measures and various other mixing and topological properties. We also construct an explicit collection of the set containing the generic points of the system…

We prove some iteration theorems for a certain class of $\kappa^+$-cc forcing posets.

The purpose of this paper is to investigate forcing as a tool to construct universal models. In particular, we look at theories of initial segments of the universe and show that any model of a sufficiently rich fragment of those theories…

Strong external difference family (SEDF) and its generalizations GSEDF, BGSEDF in a finite abelian group $G$ are combinatorial designs raised by Paterson and Stinson [7] in 2016 and have applications in communication theory to construct…

In late 90's G.Takeuti and Y.Yasumoto gave forcing constructions for bounded arithmetic. We will reformulate their constructions using two-sort bounded arithmetic and prove the followings. 1. Generic extensions are related with P=NP…