Related papers: Richness of arithmetic progression in commutative …
Furstenberg and Glasner proved that for an arbitrary k in N, any piecewise syndetic set contains k term arithmetic progression and such collection is also piecewise syndetic in Z. They used algebraic structure of beta N. The above result…
Furstenberg and Glasner proved that for an arbitrary k in N, any piecewise syndetic set contains k length arithmetic progression and such collection is also piecewise syndetic in Z: They used algebraic structure of beta N. The above result…
Using the algebraic structure of the Stone-Cech compactification of the integers, Furstenberg and Glasner proved that for arbitrary k, every piecewise syndetic set contains a piecewise syndetic set of k-term arithmetic progressions. We…
H.Furstenberg and E.Glasner proved that for an arbitrary $k\in\mathbb{N}$, any piecewise syndetic set of integers contains a $k$-term arithmetic progression and the collection of such progressions is itself piecewise syndetic in…
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…
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…
Hindman conjectured that any finite partition of $\mathbb{N}$ has a monochromatic $\{x,y,x+y,xy\}$. Recently, Bowen proved the result for all 2-partition. In this paper, we extend Bowen's result to any semiring $(S,+,\cdot)$ such that $Ss$…
Beiglboeck, Bergelson and Fish proved that if subsets A,B of a countable discrete amenable group G have positive Banach densities a and b respectively, then the product set AB is piecewise syndetic, i.e. there exists k such that the union…
Jin proved that whenever $A$ and $B$ are sets of positive upper density in $\Z$, $A+B$ is piecewise syndetic. Jin's theorem was subsequently generalized by Jin and Keisler to a certain family of abelian groups, which in particular contains…
Additive combinatorics is built around the famous theorem by Szemer\'edi which asserts existence of arithmetic progressions of any length among the integers. There exist several different proofs of the theorem based on very different…
M. Beiglb\"ock, V. Bergelson, and A. Fish proved that if $G$ is a countable amenable group and $A$ and $B$ are subsets of $G$ with positive Banach density, then the product set $AB$ is piecewise syndetic. This means that there is a finite…
A common tool in the theory of numerical semigroups is to interpret a desired class of semigroups as the integer lattice points in a rational polyhedron in order to leverage computational and enumerative techniques from polyhedral geometry.…
Using dynamics, Furstenberg defined the concept of a central subset of positive integers and proved several powerful combinatorial properties of central sets. Later using the algebraic structure of the Stone-\v{C}ech compactification,…
In order to investigate multiplicative structures in additively large sets, Beiglb\"{o}ck et al. raised a significant open question as to whether or not every subset of the natural numbers with bounded gaps (syndetic set) contains…
We prove that if a Bessel sequence in a Hilbert space, that is indexed by a countably infinite group in an invariant manner, can be partitioned into finitely many Riesz basic sequences, then each of the sets in the partition can be chosen…
Let $H$ be a commutative semigroup with unit element such that every non-unit can be written as a finite product of irreducible elements (atoms). For every $k \in \mathbb N$, let $\mathscr U_k (H)$ denote the set of all $\ell \in \mathbb N$…
We obtain algebraic characterizations of relative notions of size in a discrete semigroup that generalize the usual combinatorial notions of syndetic, thick, and piecewise syndetic sets. "Filtered" syndetic and piecewise syndetic sets were…
H. Furstenberg introduced the notion of central sets in terms of topological dynamics and established the famous Central Sets Theorem. Later in [A new and stronger Central Sets Theorem, Fund. Math. 199 (2008), 155-175], D. De, N. Hindman,…
A famous theorem of Szemer\'edi asserts that any set of integers of positive upper density will contain arbitrarily long arithmetic progressions. In its full generality, we know of four types of arguments that can prove this theorem: the…
For every $k\in \mathbb{N}$, we produce a set of integers which is $k$-recurrent but not $(k+1)$-recurrent. This extends a result of Furstenberg who produced a 1-recurrent set which is not 2-recurrent. We discuss a similar result for…