Related papers: Dynamical characterization of combinatorially rich…
Considering any dense subsemigroup of the additive semigroup of positive real numbers and a filter associated with it as the domain of thought, various concepts of sets like sets that forces recurrence near zero, sets that contains broken…
Quasi-logarithmic combinatorial structures are a class of decomposable combinatorial structures which extend the logarithmic class considered by Arratia, Barbour and Tavar\'{e} (2003). In order to obtain asymptotic approximations to their…
Hindman's theorem and van der Waerden's theorem are two classical Ramsey theoretic results, the first one deals with finite configurations and the second one deals with infinite configurations. The Central Sets Theorem due to Furstenberg is…
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$…
There are several notions of size for semigroups that have natural analogues for partial semigroups. Among these are thick, syndetic, central, piecewise syndetic, IP, J, and the more recently introduced notion of combinatorially rich,…
We study completely syndetic (CS) sets in discrete groups - subsets that for every natural n admit finitely many left translates that jointly cover every n-tuple of group elements. While for finitely-generated groups, the non-virtually…
The sumset is one of the most basic and central objects in additive number theory. Many of the most important problems (such as Goldbach's conjecture and Fermat's Last theorem) can be formulated in terms of the sumset $S + S = \{x+y :…
In this article, we investigate the image and preimage of the important combinatorial sets such as central sets, $C$-sets, and $J_\delta$-sets which play an important role in the study of combinatorics under certain partial semigroup…
We characterize when the finite Cartesian product of central sets near idempotent is central near idempotent. Moreover, we provide a partial characterization for the infinite Cartesian product of the same. Then, we study the abundance of…
We prove a combination theorem for hyperbolic groups, in the case of groups acting on complexes displaying combinatorial features reminiscent of non-positive curvature. Such complexes include for instance weakly systolic complexes and…
We prove a central limit theorem for smooth linear statistics associated with zero divisors of standard Gaussian holomorphic sections in a sequence of holomorphic line bundles with Hermitian metrics of class $\mathscr{C}^{3}$ over a compact…
This paper introduces shape boundary regions in descriptive proximity forms of CW (Closure-finite Weak) spaces as a source of amiable fixed subsets as well as almost amiable fixed subsets of descriptive proximally continuous (dpc) maps. A…
There is a long history of studying Ramsey theory using the algebraic structure of the Stone-\v{C}ech compactification of discrete semigroup. It has been shown that various Ramsey theoretic structures are contained in different algebraic…
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…
This paper introduces new structural decompositions for almost symmetric numerical semigroups through the combinatorial lens of Young diagrams. To do that, we use the foundational correspondence between numerical sets and Young diagrams,…
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…
A $k-$quasiperfect dominating set ($k\ge 1$) of a graph $G$ is a vertex subset $S$ such that every vertex not in $S$ is adjacent to at least one and at most k vertices in $S$. The cardinality of a minimum k-quasiperfect dominating set 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…
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…
Arithmetic quasi-densities are a large family of real-valued set functions partially defined on the power set of $\mathbb{N}$, including the asymptotic density, the Banach density, the analytic density, etc. Let $B \subseteq \mathbb{N}$ be…