ترغب بنشر مسار تعليمي؟ اضغط هنا

D-sets in Arbitrary Semigroup

117   0   0.0 ( 0 )
 نشر من قبل Sourav Kanti Patra
 تاريخ النشر 2019
  مجال البحث
والبحث باللغة English




اسأل ChatGPT حول البحث

We define the notion of $D$-set in an arbitrary semigroup, and with some mild restrictions we establish its dynamical and combinatorial characterizations. Assuming a weak form of cancellation in semigroups we have shown that the Cartesian product of finitely many $D$-sets is a $D$-set. A similar partial result has been proved for Cartesian product of infinitely many $D$-sets. Finally, in a commutative semigroup we deduce that $D$-sets (with respect to a F{o}lner net) are $C$-sets.



قيم البحث

اقرأ أيضاً

136 - A. Blokh , L. Oversteegen 2008
Let $P$ be a polynomial of degree $d$ with a Cremer point $p$ and no repelling or parabolic periodic bi-accessible points. We show that there are two types of such Julia sets $J_P$. The emph{red dwarf} $J_P$ are nowhere connected im kleinen and such that the intersection of all impressions of external angles is a continuum containing $p$ and the orbits of all critical images. The emph{solar} $J_P$ are such that every angle with dense orbit has a degenerate impression disjoint from other impressions and $J_P$ is connected im kleinen at its landing point. We study bi-accessible points and locally connected models of $J_P$ and show that such sets $J_P$ appear through polynomial-like maps for generic polynomials with Cremer points.
168 - Nandor Sieben 2007
A subset $U$ of a set $S$ with a binary operation is called {it avoidable} if $S$ can be partitioned into two subsets $A$ and $B$ such that no element of $U$ can be written as a product of two distinct elements of $A$ or as the product of two distinc t elements of $B$. The avoidable sets of the bicyclic inverse semigroup are classified.
In this paper, we study product-free subsets of the free semigroup over a finite alphabet $A$. We prove that the maximum density of a product-free subset of the free semigroup over $A$, with respect to the natural measure that assigns a weight of $|A |^{-n}$ to each word of length $n$, is precisely $1/2$.
73 - Alfredo Costa 2018
A major motivation for the development of semigroup theory was, and still is, its applications to the study of formal languages. Therefore, it is not surprising that the correspondence $mathcal Xmapsto B(mathcal X)$, associating to each symbolic dyna mical system $mathcal X$ the formal language $B(mathcal X)$ of its blocks, entails a connection between symbolic dynamics and semigroup theory. In this article we survey some developments on this connection, since when it was noticed in an article by Almeida, published in the CIM bulletin, in 2003.
This paper studies the notion of W-measurable sensitivity in the context of semigroup actions. W-measurable sensitivity is a measurable generalization of sensitive dependence on initial conditions. In 2012, Grigoriev et. al. proved a classification r esult of conservative ergodic dynamical systems that states all are either W-measurably sensitive or act by isometries with respect to some metric and have refined structure. We generalize this result to a class of semigroup actions. Furthermore, a counterexample is provided that shows W-measurable sensitivity is not preserved under factors. We also consider the restriction of W-measurably sensitive semigroup actions to sub-semigroups and show that the restriction remains W-measurably sensitive when the sub-semigroup is large enough (e.g. when the sub-semigroups are syndetic or thick).
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا