اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدA short proof of a theorem of J.-E. Pin
263
0
0.0
(
0
)
تأليف
Michiel de Bondt
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We give a short proof of a theorem of J.-E. Pin (theorem 1.1 below), which can be found in his thesis.
قيم البحث
اقرأ أيضاً
Greenberg proved that every countable group $A$ is isomorphic to the automorphism group of a Riemann surface, which can be taken to be compact if $A$ is finite. We give a short and explicit algebraic proof of this for finitely generated groups $A$.
We outline a simple proof of Hulanickis theorem, that a locally compact group is amenable if and only if the left regular representation weakly contains all unitary representations. This combines some elements of the literature which have not appeared together, before.
Hanners theorem is a classical theorem in the theory of retracts and extensors in topological spaces, which states that a local ANE is an ANE. While Hanners original proof of the theorem is quite simple for separable spaces, it is rather involved for
the general case. We provide a proof which is not only short, but also elementary, relying only on well-known classical point-set topology.
We provide a direct proof of Agafonovs theorem which states that finite state selection preserves normality. We also extends this result to the more general setting of shifts of finite type by defining selections which are compatible the shift. A sli
ghtly more general statement is obtained as we show that any Markov measure is preserved by finite state compatible selection.
Recently Cristian S. Calude, Sanjay Jain, Bakhadyr Khoussainov, Wei Li and Frank Stephan proposed a quasi-polynomial time algorithm for parity games. This paper proposes a short proof of correctness of their algorithm.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
