Related papers: Force recurrence near zero
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…
In this paper, we introduce notions of $J$-set near zero and $C$-set near zero for a dense subsemigroup of $((0,+\infty),+)$ and obtain some results for them. Also we derive the Central Sets Theorem near zero.
The set of indices that correspond to the positive entries of a sequence of numbers is called its positivity set. In this paper, we study the density of the positivity set of a given linear recurrence sequence, that is the question of how…
Irredundance has been studied in the context of dominating sets, via the concept of private neighbor. Here irredundance of zero forcing sets is introduced via the concept of a private fort and the upper and lower zero forcing irrdedundance…
In [arXiv:1904.12333], we introduced the concept of escaping set in general setting for a topological space and extended the notion of limit set and escaping set for the general semigroup generated by continuous self maps. In this paper we…
A subset of the positive integers is dynamically central syndetic if it contains the times that a point returns to a neighborhood of itself in a minimal topological dynamical system. These sets are part of the highly-influential link…
We study the localization along a filter of several dynamical notions. This generalizes and extends similar localizations that have been considered in the literature, e.g. near 0 and near an idempotent. Definitions and basic properties of…
Motivated by situations in which the removal of a zero (a.k.a., an absorbing element) from a semigroup yields a subsemigroup with another zero, sets of quasi-zeros (a.k.a., quasi-absorbing elements) are introduced as well as primitive…
We introduce and analyze the following general concept of recurrence. Let $G$ be a group and let $X$ be a G-space with the action $G\times X\longrightarrow X$, $(g,x)\longmapsto gx$. For a family $\mathfrak{F}$ of subset of $X$ and $A\in…
In this paper we introduce the notion of m-irreducibility that extends the standard concept of irreducibility of a numerical semigroup when the multiplicity is fixed. We analyze the structure of the set of m-irreducible numerical…
Two types of recurrence sets are introduced for inverse semigroup partial actions in topological spaces. We explore their connections with similar notions for related types of imperfect symmetries (prefix inverse semigroup expansions,…
A numerical semigroup is an additive subsemigroup of the natural numbers that contains zero and has finite complement. A numerical semigroup is irreducible if it cannot be written as an intersection of numerical semigroups properly…
We present and study new definitions of universal and programmable universal unary functions and consider a new simplicity criterion: almost decidability of the halting set. A set of positive integers S is almost decidable if there exists a…
Recently we have shown that the equivalence classes of metrics on the double of a metric space $X$ form an inverse semigroup. Here we define an inverse subsemigroup related to a family of isometric subspaces of $X$, which is more…
In this short note, we are interested in discussing characteristics of finite generating sets for $\mathcal{F}$, the set of all semiflows with non negative coefficients of a Petri Net. By systematically positioning these results over semi…
I survey an array of topics in set theory in the context of a novel class of forcing notions: subcomplete forcing. Subcompleteness was originally defined by Ronald Jensen. I have attempted to make the subject somewhat more approachable to…
In this paper, we consider a question of sum-keeping about a multiplicative subsemigroup and its generator subsets in a semiring, and develop some elementary (collapse) process of the sum-keeping retraction through subsets until one minimal…
We study qualitative properties of the set of recurrent points of finitely generated free semigroups of measurable maps. In the case of a single generator the classical Poincare recurrence theorem shows that these properties are closely…
In this paper, we consider inverse limits of $[0,1]$ using upper semicontinuous set-valued functions. We aim to expand on a previous paper exploring the relationship between the existence periodic points of a continuous function to the…
Delorme suggested that the set of all complete intersection numerical semigroups can be computed recursively. We have implemented this algorithm, and particularized it to several subfamilies of this class of numerical semigroups: free and…