Related papers: Combinatorial Properties of the Raisonnier Filter

We show that some of the most prominent large cardinal notions can be characterized through the validity of certain combinatorial principles at $\omega_2$ in forcing extensions by the pure side condition forcing introduced by Neeman. The…

In order to have a multiresolution analysis, the scaling function must be refinable. That is, it must be the linear combination of 2-dilation, $\mathbb{Z}$-translates of itself. Refinable functions used in connection with wavelets are…

We prove that it is consistent (relative to a Mahlo cardinal) that all projective sets of reals are Lebesgue measurable, but there is a $\Delta^1_3$ set without the Baire property. The complexity of the set which provides a counterexample…

In this paper, we investigate the poset $\mathbf{OF}(X)$ of free open filters on a given space $X$. In particular, we characterize spaces for which $\mathbf{OF}(X)$ is a lattice. For each $n\in\mathbb{N}$ we construct a scattered space $X$…

The fundamental result of Li, Long, and Srinivasan on approximations of set systems has become a key tool across several communities such as learning theory, algorithms, computational geometry, combinatorics and data analysis. The goal of…

A combinatorial design is a family of sets that are almost disjoint, which is applied in pseudo random number generations and randomness extractions. The parameter, $\rho$, quantifying the overlap between the sets within the family, is…

We study Deligne's conjecture on the monodromy weight filtration on the nearby cycles in the mixed characteristic case, and reduce it to the nondegeneracy of certain pairings in the semistable case. We also prove a related conjecture of…

Let $G$ be a multiplicative group, let $A,B \subseteq G$ be finite and nonempty, and define the product set $AB = {ab \mid $a \in A$ and $b \in B$}$. Two fundamental problems in combinatorial number theory are to find lower bounds on…

We consider functions of natural numbers which allow a combinatorial interpretation as density functions (speed) of classes of relational structures, s uch as Fibonacci numbers, Bell numbers, Catalan numbers and the like. Many of these…

The Minkowski content of a compact set is a fine measure of its geometric scaling. For Lebesgue null sets it measures the decay of the Lebesgue measure of epsilon neighbourhoods of the set. It is well known that self-similar sets,…

Let $X$ be a real Banach space and let $Y \subseteq X^*$ be a linear subspace having the Orlicz-Thomas property, that is, for each $\sigma$-algebra $\Sigma$ and for each map $\nu:\Sigma\to X$, the countable additivity of the composition…

We remark a variant of the existence part of the fundamental theorem of calculus, which, together with the Lebesgue differentiation theorem, constitute a new proof that every Riemann-integrable function on a compact interval having limit…

We begin by introducing schemes of binoids, invertible $\mathcal{O}_M$-sets and cohomology of sheaves of abelian groups defined on schemes of binoids. We define the so-called punctured combinatorial \v{C}ech-Picard complex, whose first…

Let R be a commutative ring with unity, M be an unitary R-module and {\Gamma} be a simple graph. This research article is an interplay of combinatorial and algebraic properties of M . We show a combinatorial object completely determines an…

We present new, exceptionally efficient proofs of Poisson--Dirichlet limit theorems for the scaled sizes of irreducible components of random elements in the classic combinatorial contexts of arbitrary assemblies, multisets, and selections,…

Using a dictionary translating a variety of classical and modern covering properties into combinatorial properties of continuous images, we get a simple way to understand the interrelations between these properties in ZFC and in the realm…

The Deligne-Simpson problem in the multiplicative version is formulated like this: {\em give necessary and sufficient conditions for the choice of the conjugacy classes $C_j\in SL(n,{\bf C})$ so that there exist irreducible $(p+1)$-tuples…

We prove a general large sieve statement in the context of random walks on subgraphs of a given graph. This can be seen as a generalization of previously known results where one performs a random walk on a group enjoying a strong spectral…

In this paper we start a detailed study of a new notion of rectifiability in Carnot groups: we say that a Radon measure is $\mathscr{P}_h$-rectifiable, for $h\in\mathbb N$, if it has positive $h$-lower density and finite $h$-upper density…

This is a follow up to a paper by the author where the disjointness relation for (the graphs of) definable functions from ${^\omega \omega}$ to ${^\omega \omega}$ is analyzed. In that paper, for each $a \in {^\omega \omega}$ we defined a…