Related papers: Creature forcing and five cardinal characteristics…
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…
Given a continuous function $f:X\to\mathbb{R}$ and a cover $\mathcal{I}$ of its image by intervals, the Mapper is the nerve of a refinement of the pullback cover $f^{-1}(\mathcal{I})$. Despite its success in applications, little is known…
We study upper and lower estimates as well as the asymptotic behavior of the sharp constant $C=C_n(U,V)$ in the doubling-type condition at the origin \[ \frac{1}{|V|}\int_{V}f(x)\,dx\le C\,\frac{1}{|U|}\int_{U}f(x)\,dx, \] where $U,V\subset…
We study direct product representations of algebras in varieties. We collect several conditions expressing that these representations are "definable" in a first-order-logic sense, among them the concept of Definable Factor Congruences…
We provide a general preservation theorem for preserving selective independent families along countable support iterations. The theorem gives a general framework for a number of results in the literature concerning models in which the…
Algorithmic graph theory has thoroughly analyzed how, given a network describing constraints between various nodes, groups can be formed among these so that the resulting configuration optimizes a \emph{global} metric. In contrast, for…
We characterize charmenability among arithmetic groups and deduce dichotomy statements pertaining normal subgroups, characters, dynamics, representations and associated operator algebras. We do this by studying the stationary dynamics on…
For an increasing sequence $(T_n)$ of one-parameter semigroups of sub Markovian kernel operators over a Polish space, we study the limit semigroup and prove sufficient conditions for it to be strongly Feller. In particular, we show that the…
We characterize stability of graph C*-algebras by giving five conditions equivalent to their stability. We also show that if G is a graph with no sources, then C*(G) is stable if and only if each vertex in G can be reached by an infinite…
In the recent paper [2], it was proved that the closure of the planar diffeomorphisms in the Sobolev norm consists of the functions which are non-crossing (NC), i.e., the functions which can be uniformly approximated by continuous…
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…
In this work we prove that an entire function $f(z)$ has only negative zeros if and only if its order is strictly less $1$, its root sequence is real-part dominating and there exists an nonnegative integer $m$ the real function…
We study methods to obtain the consistency of forcing axioms, and particularly higher forcing axioms. We first force over a model with a supercompact cardinal $\theta>\kappa$ to get the consistency of the forcing axiom for $\kappa$-strongly…
We study the dynamics of active nematic films on a substrate driven by active flows with or without the incompressible constraint.Through simulations and theoretical analysis, we show that arch patterns are stable in the compressible case,…
Associated to a nonzero homomorphism $\varphi$ of a Banach algebra $A$, we regard special functionals, say $m_\varphi$, on certain subspaces of $A^\ast$ which provide equivalent statements to the existence of a bounded right approximate…
Coexistence of competing species is, due to unavoidable fluctuations, always transient. In this Letter, we investigate the ultimate survival probabilities characterizing different species in cyclic competition. We show that they often obey…
In [5], Hjorth proved that for every countable ordinal $\alpha$, there exists a complete $\mathcal{L}_{\omega_1,\omega}$-sentence $\phi_\alpha$ that has models of all cardinalities less than or equal to $\aleph_\alpha$, but no models of…
Computational models of collective behavior in birds has allowed us to infer interaction rules directly from experimental data. Using a generic form of these rules we explore the collective behavior and emergent dynamics of a simulated…
Our main theorem is about iterated forcing for making the continuum larger than aleph_2. We present a generalization of math.LO/0303294 which is dealing with oracles for random, etc., replacing aleph_1, aleph_2 by lambda,lambda^+ (starting…
We study the intermediate extension of the character sheaves on an adjoint group to the semi-stable locus of its wonderful compactification. We show that the intermediate extension can be described by a direct image construction. As a…