Related papers: A combinatorial study on product of filter large s…
In \cite[Proposition 8.21 Page-169]{F} Using the methods of topological dynamics, H. Furstenberg introduced the notion of central set and proved the famous Central Sets Theorem. Later, in \cite{DHS}, D. De, H. Hindman and D. Struss…
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…
Ultrafilters are very useful and versatile objects with applications throughout mathematics: in topology, analysis, combinarotics, model theory, and even theory of social choice. Proofs based on ultrafilters tend to be shorter and more…
We consider products of sets of reals with a combinatorial structure based on scales parameterized by filters. This kind of sets were intensively investigated in products of spaces with combinatorial covering properties as Hurewicz,…
We use the combinatorial properties of central sets to prove a result about the existence of exponential monochromatic patterns, in the style of Hindman's Finite Sums Theorem. More precisely, we prove that for every finite coloring of the…
A combinatorial characterization of measurable filters on a countable set is found. We apply it to the problem of measurability of the intersection of nonmeasurable filters.
The study of symmetric structures is a new trend in Ramsey theory. Recently in [7], Di Nasso initiated a systematic study of symmetrization of classical Ramsey theoretical results, and proved a symmetric version of several Ramsey theoretic…
H. Furstenberg introduced the notion of central set in terms of topological dynamics and established the central set theorem. The essence of central set theorem is that it is the simultaneous extension of van der Waerden's theorem and…
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…
Superfilters are generalized ultrafilters, which capture the underlying concept in Ramsey theoretic theorems such as van der Waerden's Theorem. We establish several properties of superfilters, which generalize both Ramsey's Theorem and its…
We say that a fusion system is the composition product of two subsystems if every morphism can be factored as a morphism in one fusion system followed by a morphism in the other. We establish a relationship between the characteristic…
We prove that if S is a commutative semigroup with well founded universal semilattice or a solvable inverse semigroup with well founded semilattice of idempotents, then every strongly productive ultrafilter on S is idempotent. Moreover we…
In this paper, we enumerate the pairs of permutations that are long cycles and whose product has a given cycle-type. Our main result is a simple relation concerning the desired numbers for a few related cycle-types. The relation refines a…
A major theme in arithmetic combinatorics is proving multiple recurrence results on semigroups (such as Szemer\'edi's theorem) and this can often be done using methods of ergodic Ramsey theory. What usually lies at the heart of such proofs…
We introduce the definability strength of combinatorial principles. In terms of definability strength, a combinatorial principle is strong if solving a corresponding combinatorial problem could help in simplifying the definition of a…
Assuming the Generalized Continuum Hypothesis, this paper answers the question: when is the tensor product of two ultrafilters equal to their Cartesian product? It is necessary and sufficient that their Cartesian product is an ultrafilter;…
We investigate the structure of finite sets $A \subseteq \Z$ where $|A+A|$ is large. We present a combinatorial construction that serves as a counterexample to natural conjectures in the pursuit of an "anti-Freiman" theory in additive…
Orthogonal array and a large set of orthogonal arrays are important research objects in combinatorial design theory, and they are widely applied to statistics, computer science, coding theory and cryptography. In this paper, some new series…
The most powerful formulation of the Central Sets Theorem in an arbitrary semigroup was proved in the work of De, Hindman, and Strauss. The sets which satisfy the conclusion of the above Central Sets Theorem are called $C$-sets. The…
Large sets of combinatorial designs has always been a fascinating topic in design theory. These designs form a partition of the whole space into combinatorial designs with the same parameters. In particular, a large set of block designs,…