Related papers: Combinatorial Properties of the Raisonnier Filter
We introduce a one-parameter family of Borel regular measures on $\mathbb{R}^n$ that enhances Lebesgue measure by incorporating a scale-invariant penalty for codimension-1 boundary structures. Utilizing Carath\'eodory's outer measure…
This paper establishes the theoretical foundations for the asymptotic separability of Gaussian Mixture Models (GMMs) in high dimensions by extending the classical Feldman-H\'ajek theorem. We first prove that a countable mixture of Gaussian…
In this paper we define the combinatorial analogous of a pencil, and show its relationship with the concept of admissibility. Such an object is usefull to study the isomorphisms between fundamental groups of the complements of line…
List-decoding of Reed-Solomon (RS) codes beyond the so called Johnson radius has been one of the main open questions since the work of Guruswami and Sudan. It is now known by the work of Rudra and Wootters, using techniques from high…
Menger's basis property is a generalization of $\sigma$-compactness and admits an elegant combinatorial interpretation. We introduce a general combinatorial method to construct non $\sigma$-compact sets of reals with Menger's property.…
A Steinhaus set $S \subseteq \RR^d$ for a set $A \subseteq \RR^d$ is a set such that $S$ has exactly one point in common with $\tau A$, for every rigid motion $\tau$ of $\RR^d$. We show here that if $A$ is a finite set of at least two…
A function f:R -> R is approximately continuous iff it is continuous in the density topology, i.e., for any ordinary open set U the set E=f^{-1}(U) is measurable and has Lebesgue density one at each of its points. Denjoy proved that…
Here using some methods of combinatorial set theory, particularly the ones related to the construction of independent families of sets and some modified version of the notion of small sets originally introduced by Riecan, Riecan and…
An analogue of the Riemannian Geometry for an ultrametric Cantor set (C, d) is described using the tools of Noncommutative Geometry. Associated with (C, d) is a weighted rooted tree, its Michon tree. This tree allows to define a family of…
Accessible categories admit a purely category-theoretic replacement for cardinality: the internal size. Generalizing results and methods from arXiv:1708.06782, we examine set-theoretic problems related to internal sizes and prove several…
We study partition properties for uncountable regular cardinals that arise by restricting partition properties defining large cardinal notions to classes of simply definable colourings. We show that both large cardinal assumptions and…
We introduce a notion of density point and prove results analogous to Lebesgue's density theorem for various well-known ideals on Cantor space and Baire space. In fact, we isolate a class of ideals for which our results hold. In contrast to…
We investigate combinatorial properties of a kind of insets we defined in an earlier paper, interpreting them now in terms of restricted ternary words. This allows us to give new combinatorial interpretations of a number of known integer…
The concepts of closed unbounded (club) and stationary sets are generalised to $\gamma$-club and $\gamma$-stationary sets, which are closely related to stationary reflection. We use these notions to define generalisations of Jensen's…
In [1] the authors showed some basic properties of a pre-order that arose in combinatorial number theory, namely the finite embeddability between sets of natural numbers, and they presented its generalization to ultrafilters, which is…
Combinatorial discrepancy is a complexity measure of a collection of sets which quantifies how well the sets in the collection can be simultaneously balanced. More precisely, we are given an n-point set $P$, and a collection $\mathcal{F} =…
A filter lattice is a distributive lattice formed by all filters of a poset in the anti-inclusion order. We study the combinatorial properties of the Hasse diagrams of filter lattices of certain posets, so called Fibonacci-like cubes, in…
In 1998, Leclerc and Zelevinsky introduced the notion of weakly separated collections of subsets of the ordered $n$-element set $[n]$ (using this notion to give a combinatorial characterization for quasi-commuting minors of a quantum…
Grothendieck's theory of dessins provides a bridge between algebraic numbers and combinatorics. This paper adds a new concept, called 'bias', to the bridge. This produces: (i) from a biased plane tree the construction of a sequence of…
Cicho\'n's diagram lists twelve cardinal characteristics (and the provable inequalities between them) associated with the ideals of null sets, meager sets, countable sets, and $\sigma$-compact subsets of the irrationals. It is consistent…