Related papers: Central Sets Theorem along filters and some combin…
An aperiodic tile set was first constructed by R. Berger while proving the undecidability of the domino problem. It turned out that aperiodic tile sets appear in many topics ranging from logic (the Entscheidungsproblem) to physics…
Furstenberg, Glasscock, Bergelson, Beiglboeck have been studied abundance in arithmatic progression on various large sets like piecewise syndetic, central, thick, etc. but also there are so many sets in which abundance in progression is…
This paper explores the proof by J. Bourgain, H. Furstenberg, Y. Katznelson and D.S. Ornstein of their return times theorem [2] and lights a corner in it regarding the role of auto-correlation. As for pointwise convergence, this was already…
In 1970 R. Schmidt gave a structural classification for CA-groups. In this paper we consider a condition upon the intersection of element centralisers which turns out to be equivalent to the definition of a CA-group. We then weaken which…
The field of analytic combinatorics is dedicated to the creation of effective techniques to study the large-scale behaviour of combinatorial objects. Although classical results in analytic combinatorics are mainly concerned with univariate…
This paper enriches the list of known properties of congruence sequences starting from the universal relation and successively performing the operators lower $k$ and lower $t$. Two series of inverse semigroups, namely…
Motivated by an open problem from graph drawing, we study several partitioning problems for line and hyperplane arrangements. We prove a ham-sandwich cut theorem: given two sets of n lines in R^2, there is a line l such that in both line…
The Hales-Jewett theorem asserts that for every r and every k there exists n such that every r-colouring of the n-dimensional grid {1,...,k}^n contains a combinatorial line. This result is a generalization of van der Waerden's theorem, and…
Motivated by practical generalizations of the classic $k$-median and $k$-means objectives, such as clustering with size constraints, fair clustering, and Wasserstein barycenter, we introduce a meta-theorem for designing coresets for…
The theory of dynamical frames evolved from practical problems in dynamical sampling where the initial state of a vector needs to be recovered from the space-time samples of evolutions of the vector. This leads to the investigation of…
Suppose $\mathcal{E}$ is a normal subsystem of a saturated fusion system $\mathcal{F}$ over $S$. If $X\leq S$ is fully $\mathcal{F}$-normalized, then Aschbacher defined a normal subsystem $N_{\mathcal{E}}(X)$ of $N_{\mathcal{F}}(X)$. In…
Ultrafilters are a tool, originating in mathematical logic and general topology, that has steadily found more and more uses in multiple areas of mathematics, such as combinatorics, dynamics, and algebra, among others. The purpose of this…
The concepts of a conditional set, a conditional inclusion relation and a conditional Cartesian product are introduced. The resulting conditional set theory is sufficiently rich in order to construct a conditional topology, a conditional…
The notion of central stability was first formulated for sequences of representations of the symmetric groups by Putman. A categorical reformulation was subsequently given by Church, Ellenberg, Farb, and Nagpal using the notion of…
At the basis of much of computational chemistry is density functional theory, as initiated by the Hohenberg-Kohn theorem. The theorem states that, when nuclei are fixed, nuclear potentials are determined by $1$-electron densities. We recast…
Characterizations of ultrafilters belong to the smallest ideal of Stone-\v{C}ech compactification of a discrete semigroup are exhibited using syndetic sets, strongly central sets and very strongly central sets respectively. These lead to…
We present a general approach to establish the Central Limit Theorem with error bounds for sequential dynamical systems. The main tool we develop is the application to this setting of a projective metric on complex cones, following the…
In 1975 Szemer\'edi proved the long-standing conjecture of Erd\H{o}s and Tur\'an that any subset of $\bbZ$ having positive upper Banach density contains arbitrarily long arithmetic progressions. Szemer\'edi's proof was entirely…
A beautiful theorem of Zeckendorf states that every integer can be written uniquely as a sum of non-consecutive Fibonacci numbers $\{F_n\}_{n=1}^{\infty}$. Lekkerkerker proved that the average number of summands for integers in $[F_n,…
In analogy with the classical theory of filters, for finitely complete categories, we provide the concepts of filter, G-neighborhood (short for \Grothendieck-neighborhood") and cover-neighborhood of a point, with the aim of studying…