در این مقاله ابتدا انتهای گراف‌‌های موضعا متناهی را به عنوان رده هم‌ارزی مسیرهای نامتناهی در گراف معرفی می‌کنیم. سپس انتهای گروه‌های متناهی تولید شده را بازگو می‌کنیم که با استفاده از گراف کیلی تعریف می‌شود. ثابت شده است ...

In this talk, we introduce the ends of graphs, and then the ends of groups, which are the ends of

Cayley graphs of groups. It is proven that the number of ends of group G, e(G) does not depend on the

Cayley ...

In this talk, we study the relation between topological complexity and the structure of fundamental groups of spaces. The topological complexity denoted by TC is the number of rules needed for robotic motions in any space X.

In this talk, we intend to answer whether the direct product and direct sum
of abelian groups are isomorphic or not. We show that the direct product
and direct sum of an infinite family of algebraically compact ...

In this paper we investigate some behaviours of Hawaiian groups of pointed spaces with respect to

their base points. It is known that Hawaiian groups are not independent to the choice of the points in

general. ...

In this talk we intend to determine the structure of the n_dimensional Hawaiian group of the m_dimensional Hawaiian earring space, where m,n>=1. Also, we show that similar to homotopy functors preserve product, and ...

Topological data analysis in an approach to use topological techniques for analysis of datasets. Persistent homology is one of the main tools of topological data analysis used for reducing the dimension and
complexity ...

Persistent homology is a concept in topological data analysis used to reduce the dimensionality and
complexity of the data sets, and also to determine topological features and delete noises. In this talk,
unfolding ...