Related papers: On weakly tight families

This paper investigates the differentiability of weak limits of bi-Sobolev homeomorphisms. Given $p>n-1$, consider a sequence of homeomorphisms $f_k$ with positive Jacobians $J_{f_k} >0$ almost everywhere and $\sup_k(\|f_{k}\|_{W^{1,n-1}} +…

We show that if all collections of infinite subsets of $\N$ have the Ramsey property, then there are no infinite maximal almost disjoint (mad) families. This solves a long-standing problem going back to Mathias \cite{mathias}. The proof…

We establish the weak convergence of the intensity of a nearly-unstable Hawkes process with heavy-tailed kernel. Our result is used to derive a scaling limit for a financial market model where orders to buy or sell an asset arrive according…

We present a new strictification method for type-theoretic structures that are only weakly stable under substitution. Given weakly stable structures over some model of type theory, we construct equivalent strictly stable structures by…

We give a new proof that there are arbitrarily large indecomposable abelian groups; moreover, the groups constructed are absolutely indecomposable, that is, they remain indecomposable in any generic extension. However, any absolutely rigid…

We study the weak disjointness of hypercyclic operators to advance the classifications of hypercyclic operators. We establish an analogue of the Weiss-Akin-Glasner Theorem from topological dynamics within the framework of linear dynamics,…

We prove collective versions of semi-duality theorems for sets of almost (limitedly, order) L-weakly compact operators.

We argue that weak containment is an appropriate notion of amenability for inverse semigroups. Given an inverse semigroup $S$ and a homomorphism $\phi$ of $S$ onto a group $G$, we show, under an assumption on $\ker(\phi)$, that $S$ has weak…

One of the major results of [N. Robertson and P. D. Seymour. Graph minors. XIII. The disjoint paths problem. J. Combin. Theory Ser. B, 63(1):65--110, 1995], also known as the weak structure theorem, revealed the local structure of graphs…

We prove that if there exists a simplified $(\omega_1,2)$-morass, then there is a ccc forcing which adds an $\omega_3$-chain in P($\omega_1$) mod finite and a ccc forcing which adds a family of $\omega_3$-many strongly almost disjoint…

This work extends the idea of matched pairs presented by Majid in \cite{Majid} and Takeuchi in \cite{Takeuchi} for the context of weak bialgebras and weak Hopf algebras. We introduce, also inspired by partial matched pairs…

In the aftermath of the Robertson--Seymour Graph Minor Theorem, Thomas conjectured that the countable graphs are well-quasi-ordered under the minor relation. We prove that this conjecture, when restricted to graphs with no infinite paths…

We investigate the algebra of repeated integrals of semimartingales. We prove that a minimal family of semimartingales generates a quasi-shuffle algebra. In essence, to fulfill the minimality criterion, first, the family must be a minimal…

We solve a case of the Abelian Exponential-Algebraic Closedness Conjecture, a conjecture due to Bays and Kirby, building on work of Zilber, which predicts sufficient conditions for systems of equations involving algebraic operations and the…

We develop a theory of \emph{sharp measure zero} sets that parallels Borel's \emph{strong measure zero}, and prove a theorem analogous to Galvin-Myscielski-Solovay Theorem, namely that a set of reals has sharp measure zero if and only if it…

Cummings, Foreman, and Magidor proved that Jensen's square principle is non-compact at $\aleph_\omega$, meaning that it is consistent that $\square_{\aleph_n}$ holds for all $n<\omega$ while $\square_{\aleph_\omega}$ fails. We investigate…

We investigate families of graphs and graphons (graph limits) that are defined by a finite number of prescribed subgraph densities. Our main focus is the case when the family contains only one element, i.e., a unique structure is forced by…

A long-standing conjecture of Podewski states that every minimal field is algebraically closed. It was proved by Wagner for fields of positive characteristic, but it remains wide open in the zero-characteristic case. We reduce Podewski's…

For a field $\mathbb{F}$ and integers $d, k$ and $\ell$, a set $A \subseteq \mathbb{F}^d$ is called $(k,\ell)$-nearly orthogonal if all vectors in $A$ are non-self-orthogonal and every $k+1$ vectors in $A$ contain $\ell + 1$ pairwise…

Chv\'{a}tal's conjecture in extremal combinatorics asserts that for any decreasing family $\mathcal{F}$ of subsets of a finite set $S$, there is a largest intersecting subfamily of $\mathcal{F}$ consisting of all members of $\mathcal{F}$…