Related papers: A combinatorial study on product of filter large s…

We study a family of inhomogeneous Ising chain models along with an equivalent family of nearest neighbour particle systems. By the correspondence between the two families we prove identities of combinatorial significance relating to…

This paper introduces combinatorial representations, which generalise the notion of linear representations of matroids. We show that any family of subsets of the same cardinality has a combinatorial representation via matrices. We then…

We provide the set of filters (saturated submonoids) in a commutative monoid with a topology (like the spectrum of a ring) and study the resulting spaces.

We examine the following version of a classic combinatorial search problem introduced by R\'enyi: Given a finite set $X$ of $n$ elements we want to identify an unknown subset $Y \subset X$ of exactly $d$ elements by testing, by as few as…

Conceiving of premises as collected into sets or multisets, instead of sequences, may lead to triviality for classical and intuitionistic logic in general proof theory, where we investigate identity of deductions. Any two deductions with…

We propose a general conjecture on decompositions of finite simple groups as products of conjugates of an arbitrary subset. We prove this conjecture for bounded subsets of arbitrary finite simple groups, and for large subsets of groups of…

A collaborative filtering system recommends to users products that similar users like. Collaborative filtering systems influence purchase decisions, and hence have become targets of manipulation by unscrupulous vendors. We provide…

We carry on the investigation initiated in [15] : we describe new shuffle products coming from some special functions and group them, along with other products encountered in the literature, in a class of products, which we name…

Let $G$ be a finite abelian group and $A$ a subset of $G$. The spectrum of $A$ is the set of its large Fourier coefficients. Known combinatorial results on the structure of spectrum, such as Chang's theorem, become trivial in the regime…

Combinatorially Rich sets were introduced by Bergelson and Glasscock for commutative semigroup. Latter Hindman, Hosseini, Strauss and Tootkaboni extended the definition of Combinatorially Rich sets for arbitrary semigroup. Recently Goswami…

Combinatorics, like computer science, often has to deal with large objects of unspecified (or unusable) structure. One powerful way to deal with such an arbitrary object is to decompose it into more usable components. In particular, it has…

The Central Sets Theorem, a fundamental result in Ramsey theory, is a joint extension of both Hindman's theorem and van der Waerden's theorem. It was originally introduced by H. Furstenberg using methods from topological dynamics. Later,…

Let $R$ be a finite commutative local principal ring, and let $H(R)$ denote the corresponding quaternion ring. We show that an element of $H(R)$ is a product of idempotents if and only if it can be expressed as a product of two idempotents.…

Using the notions of Topological dynamics, H. Furstenberg defined central sets and proved the Central Sets Theorem. Later V. Bergelson and N. Hindman characterized central sets in terms of algebra of the Stone-\v{C}ech Compactification of…

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…

We obtain some new results on products of large and small sets in the Heisenberg group as well as in the affine group over the prime field. Also, we derive an application of these growth results to Freiman's isomorphism in nonabelian…

We consider certain matrix-products where successive matrices in the product belong alternately to a particular qualitative class or its transpose. The main theorems relate structural and spectral properties of these matrix-products to the…

The contour of a family of filters along a filter is a set-theoretic lower limit. Topologicity and regularity of convergences can be characterized with the aid of the contour operation. Contour inversion is studied, in particular, for…

A classic theorem in combinatorial design theory is Fisher's inequality, which states that a family $\mathcal F$ of subsets of $[n]$ with all pairwise intersections of size $\lambda$ can have at most $n$ non-empty sets. One may weaken the…

In this paper we present a simple approach to big Ramsey combinatorics of the Cantor set $2^\omega$. Using Infinite Dual Ramsey Theorem of Carlson and Simpson, we show that $2^\omega$, viewed as a topological space, has finite big Ramsey…