Related papers: Central sets and substitutive dynamical systems
We investigate the relationship between the dynamical properties of minimal topological dynamical systems and the multiplicative combinatorial properties of return time sets arising from those systems. In particular, we prove that for a…
We develop categorical foundations of discrete dynamical systems, aimed at understanding how the structure of the system affects its dynamics. The key technical innovation is the notion of a cycle set, which provides a formal language in…
We introduce notions of combinatorial blowups, building sets, and nested sets for arbitrary meet-semilattices. This gives a common abstract framework for the incidence combinatorics occurring in the context of De Concini-Procesi models of…
Fixed point theorems are one of the many tools used to prove existence and uniqueness of differential equations. When the data involved contains products of distributions, some of these tools may not be useful. Thus rises the necessity to…
We propose a functorial framework for persistent homology based on finite topological spaces and their associated posets. Starting from a finite metric space, we associate a filtration of finite topologies whose structure maps are…
Molodstov[10] introduced soft set theory as a new mathematical approach for solving problems having uncertainties. Many researchers worked on the findings of structures of soft set theory and applied to many problems having uncertainties.…
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 Union Closed Sets Conjecture states that in every finite, nontrivial set family closed under taking unions there is an element contained in at least half of all the sets of the family. We investigate two new directions with respect to…
We propose a new simple construction of an aperiodic tile set based on self-referential (fixed point) argument. People often say about some discovery that it appeared "ahead of time", meaning that it could be fully understood only in the…
It is known that there are many notions of largeness in a semigroup that own rich combinatorial properties. In this paper, we focus on partition and almost disjoint properties of these notions. One of the most remarkable results with…
The Mishchenko-Fomenko conjecture says that for each real or complex finite-dimensional Lie algebra $\goth g$ there exists a complete set of commuting polynomials on its dual space $\goth g^*$. In terms of the theory of integrable…
A finite set of integers $A$ tiles the integers by translations if $\mathbb{Z}$ can be covered by pairwise disjoint translated copies of $A$. Restricting attention to one tiling period, we have $A\oplus B=\mathbb{Z}_M$ for some…
A system of nested dichotomies is a method of decomposing a multi-class problem into a collection of binary problems. Such a system recursively splits the set of classes into two subsets, and trains a binary classifier to distinguish…
The notion of soft sets is introduced as a general mathematical tool for dealing with uncertainty. In this paper, we consider the concepts of soft compactness, countably soft compactness and obtain some results. We study some soft…
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…
Combinatorial algorithms are widely used for decision-making and knowledge discovery, and it is important to ensure that their output remains stable even when subjected to small perturbations in the input. Failure to do so can lead to…
The periodic tiling conjecture (PTC) asserts, for a finitely generated Abelian group $G$ and a finite subset $F$ of $G$, that if there is a set $A$ that solves the tiling equation $\mathbb{1}_F * \mathbb{1}_A = 1$, there is also a periodic…
The problem of selecting a small, yet high quality subset of patterns from a larger collection of itemsets has recently attracted lot of research. Here we discuss an approach to this problem using the notion of decomposable families of…
We set up a geometrical theory for the study of the dynamics of reducible Pisot substitutions. It is based on certain Rauzy fractals generated by duals of higher dimensional extensions of substitutions. We obtain under certain hypotheses…
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…