Related papers: Definable discrete sets with large continuum
We show, assuming weak large cardinals, that in the context of games played in a proper class of moves, clopen determinacy is strictly weaker than open determinacy. The proof amounts to an analysis of a certain level of $L$ that exists…
Complex moment sequences are exactly those which admit positive definite extensions on the integer lattice points of the upper diagonal half-plane. Here we prove that the aforesaid extension is unique provided the complex moment sequence is…
We consider sequences of finitely generated discrete subgroups Gamma_i=rho_i(Gamma) of a rank 1 Lie group G, where the representations rho_i are not necessarily faithful. We show that, for algebraically convergent sequences (Gamma_i),…
We extend existing results on locally nilpotent differential polynomial rings to skew extensions of rings. We prove that if $\mathscr{G}=\{\sigma_t\}_{t\in T}$ is a locally finite family of automorphisms of an algebra $R$,…
We consider strong expansions of the theory of ordered abelian groups. We show that the assumption of strength has a multitude of desirable consequences for the structure of definable sets in such theories, in particular as relates to…
We give an elementary proof of the known fact that every probability measure, defined on an arbitrary $\sigma$-field on a countable sample space $\Omega$, may in fact be extended to a probability measure on the power set of $\Omega$. This…
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…
In \cite{J}, Theorem 4.2, Jockusch proves that for any computable k-coloring of pairs of integers, there is an infinite $\Pi^0_2$ homogeneous set. The proof uses a countable collection of $\Pi^0_2$ sets as potential infinite homogeneous…
The Pila-Wilkie theorem states that if a set $X\subseteq \mathbb R^n$ is definable in an o-minimal structure $\mathcal R$ and contains `many' rational points, then it contains an infinite semialgebraic set. In this paper, we extend this…
Sabok showed that the set of codes for $G_\delta$ Ramsey positive subsets of $[\omega]^\omega$ is $\mathbf{\Sigma}^1_2$-complete. We extend this result by providing sufficient conditions for the set of codes for $G_\delta$ Ramsey positive…
We prove that the generic maximal independent family obtained by iteratively forcing with the Mathias forcing relative to diagonalization filters is densely maximal. Moreover, by choosing the filters with some care one can ensure the family…
The Frankl conjecture, also known as the union-closed sets conjecture, states that in any finite non-empty union-closed family, there exists an element in at least half of the sets. From an optimization point of view, one could instead…
We investigate the size of fixed point sets of automorphisms of bounded domains in $\mathbb{C}^n$. In one complex variable, a nontrivial automorphism has at most two fixed points, but in higher dimensions fixed point sets need not be…
We prove the $l^2$ Decoupling Conjecture for compact hypersurfaces with positive definite second fundamental form and also for the cone. This has a wide range of important consequences. One of them is the validity of the Discrete…
The closure of a discrete exponential family is described by a finite set of equations corresponding to the circuits of an underlying oriented matroid. These equations are similar to the equations used in algebraic statistics, although they…
We derive integrable discrete systems which are contiguity relations of two equations in the Painlev\'e-Gambier classification depending on some parameter. These studies extend earlier work where the contiguity relations for the six…
This is a contribution to the classification problem for dp-minimal expansions of $(\mathbb{Z},+)$. Let $S$ be a dense cyclic group order on $(\mathbb{Z},+)$. We use results on "dense pairs" to construct uncountably many dp-minimal…
The rigid relation principle, introduced in this article, asserts that every set admits a rigid binary relation. This follows from the axiom of choice, because well-orders are rigid, but we prove that it is neither equivalent to the axiom…
Let k be a definable L-cardinal. Then there is a set of reals X, class-generic over L, such that L(X) and L have the same cardinals, X has size k in L(X) and some pi-1-2 formula defines X in all set-generic extensions of L(X). Two…
Inspired by very ampleness of Zariski Geometries, we introduce and study the notion of a very ample family of plane curves in any strongly minimal set, and the corresponding notion of a very ample strongly minimal set (characterized by the…