Related papers: Central Sets Theorem along filters and some combin…

Spielberg's construction of C*-algebras from left cancellative small categories is a common generalization for most C*-algebras one would consider to come from ``combinatorial data,'' including graph and $k$-graph C*-algebras, Li's…

We give a short and uniform proof of a special case of Tits' Centre Conjecture using a theorem of J-P. Serre and a result from our earlier work. We consider fixed point subcomplexes $X^H$ of the building $X = X(G)$ of a connected reductive…

A Central Limit Theorem is proved for linear random fields when sums are taken over finite disjoint union of rectangles. The approach does not rely upon the use of Beveridge Nelson decomposition and the conditions needed are similar to…

The centerpoint theorem is a well-known and widely used result in discrete geometry. It states that for any point set $P$ of $n$ points in $\mathbb{R}^d$, there is a point $c$, not necessarily from $P$, such that each halfspace containing…

The notion of abundance of certain type of configuration in certain large sets was first proved by Furstenberg and Glazner in 1998. After that many author investigate abundance of different types of configurations in different types of…

James' submodule theorem is a fundamental result in the representation theory of the symmetric groups and the finite general linear groups. In this note we consider a version of that theorem for a general finite group with a split…

Algorithmic meta-theorems are general algorithmic results applying to a whole range of problems, rather than just to a single problem alone. They often have a "logical" and a "structural" component, that is they are results of the form:…

In this paper, a decomposition theorem for (covariant) unitary group representations on Kaplansky-Hilbert modules over Stone algebras is established, which generalizes the well-known Hilbert space case (where it coincides with the…

Set theory is widely believed to provide a secure foundation for deductive mathematics, but current set theories do not quite do this. The mainstream essentially uses na\"\i ve set theory. After Russell's paradox showed this to be…

In [1] M. Baker and S. Norine developed a theory of divisors and linear systems on graphs, and proved a Riemann-Roch Theorem for these objects (conceived as integer-valued functions on the vertices). In [2] and [3] the authors generalized…

A famous result of Hausdorff states that a sphere with countably many points removed can be partitioned into three pieces A,B,C such that A is congruent to B (i.e., there is an isometry of the sphere which sends A to B), B is congruent to…

Miller's 1937 splitting theorem was proved for pairs of cardinals $(\n,\rho)$ in which $n$ is finite and $\rho$ is infinite. An extension of Miller's theorem is proved here in ZFC for pairs of cardinals $(\nu,\rho)$ in which $\nu$ is…

Within Bishop Set Theory, a reconstruction of Bishop's theory of sets, we study the so-called completely separated sets, that is sets equipped with a positive notion of an inequality, induced by a given set of real-valued functions. We…

Furstenberg and Glasner proved that for an arbitrary k in N, any piecewise syndetic set contains k term arithmetic progressions and such collection is also piecewise syndetic in Z: They used algebraic structure of beta N. The above result…

Suppose $l,m$ are natural numbers with $l\le m$, and $\mathbb{F}$ a field of characteristic $p$, and let $\mathcal{C}_{l,m}^{\mathbb{F}}$ denote the centraliser of the group algebra $\mathbb{F}S_l$ inside $\mathbb{F}S_m$. Ellers and Murray…

Let S be a semigroup and let T be a subsemigroup of S. Then T acts on S by left- and by right multiplication. This gives rise to a partition of the complement of T in S, and to each equivalence class of this partition we naturally associate…

Consider a well-shuffled deck of cards of $n$ different types where each type occurs $m$ times. In a complete feedback game, a player is asked to guess the top card from the deck. After each guess, the top card is revealed to the player and…

We develop a new toolbox for the analysis of the global behavior of stochastic discrete particle systems. We introduce and study the notion of the Schur generating function of a random discrete configuration. Our main result provides a…

For any set $A$ of natural numbers with positive upper Banach density and any $k\geq 1$, we show the existence of an infinite set $B\subset{\mathbb N}$ and a shift $t\geq0$ such that $A-t$ contains all sums of $m$ distinct elements from $B$…

A set of reals $X$ is $\mathfrak{b}$-concentrated if it has cardinality at least $\mathfrak{b}$ and it contains a countable set $D\subseteq X$ such that each closed subset of $X$ disjoint with $D$ has size smaller than $\mathfrak{b}$. We…