Tarski Number and Configuration Equations

Subject Areas : Statistics

A.  Yousofzadeh ¹ (Department of Mathematics, Faculty of science, Islamic Azad University, Mobarakeh Branch, Mobarakeh, Isfahan, Iran)

Received: 2018-04-01 Accepted : 2019-07-06 Published : 2020-01-21

Keywords: تجزیه ی متناقض, جواب نرمال یک دستگاه, دستگاه بهنجار معادلات, میانگین پذیری,

Abstract :

The concept of configuration of groups which is defined in terms of finite partitions and finite strings of elements of the group is presented by Rosenblatt and Willis. To each set of configurations, a finite system of equations known as configuration equations, is associated. Rosenblatt and Willis proved that a discrete group G is amenable if and only if every possible instance of its configuration equations admits a normalized solution. In this paper we compare the existence of such solutions for different systems. We prove that if a system of configuration equations has no normalized solution, then every system related to a refinement of the initial partition, has no normalized solution, as well. The Tarski number of a non-amenable group is the smallest number of the pieces of its paradoxical decompositions. In the present paper we also provide a relation between the Tarski numbers of the subgroups of two configuration equivalent groups.

References:

[1] A. I. T. Paterson, Amenability, Mathematical servey Surveys and Monographs Vol. 29 (American Mathematical Society, Providence, RI, 1988).

 

[2] S. Wagon, The Banach-Tarski Paradox, Encyclopedia of Mathematics and its Applications, Vol. 24 (Cambridge University Press, Cambridge-New York, 1985).

 

[3]  T. G. Ceccherini-Silberstein, R. I. Grigorchuk and P. de la Harpe, Amenability and paradoxical decompositions for pseudogroups and for discrete metric spaces, Proceding of the  Steklov  Institute of Mathematics, 224 (1999) 57–97.

 

[4] M. Ershov, G. Golan and M. Sapir, The Tarski numbers of groups, Advances in Mathematics, 284 (2015) 21–53.

 

[5]   J. M. Rosenblatt and G. A. Willis, Weak convergence is not strong for amenable groups, Canadian Mathematical Bulletin, 44 (2) (2001) 231–241.

 

[6] A. Rejali and A. Yousofzadeh, Configuration of groups and paradoxical decompositions, Bulletin of the Belgian Mathematical Society, Simon Stevin, 18 (2011) 157–172.

 

[7] A. Yousofzadeh, A constructive way to compute the Tarski number of a group, Journal of Algebra and its Applications, 17, (1) (2018), 1850139 (28 pages).

 

[8] A. Yousofzadeh, A. Tavakoli and A. Rejali, On configuration graph and paradoxical decomposition, Journal of Algebra and its Applications, 13, (2) (2014), 1350086, (11pages).

 

[9]  A. Abdollahi, A. Rejali and G. A. Willis, Group properties characterized by configuration, Illinois Journal of Mathematics, 48 (3) (2004) 861–873

 

[10] A. Abdollahi, A. Rejali and A. Yousofzadeh, Configuration of nilpotent groups and isomorphism, Journal of Algebra and its Applications, 8 (3) (2009) 339–350.

 

[11] A. Tavakoli, A. Rejali, A. Yousofzadeh and A. Abdollahi, A note about configuration of a group, Matematika, 19 (1) (2001) 3-23.

 

[12]  A. Rejali and A. Yousofzadeh, Group Properties Characterized by Two-sided Configurations, Algebra Colloquium, 17 no. 4 (2010) 583–594.

 

[13] A. Rejali and M. Soleimani Malekan, Two-sided Configuration equivalence and Isomorphism. arXiv preprint arXiv:1512.03021 (2015).

 

[14] A. Rejali and M. Soleimani Malekan, Solubility of groups can be characterized by configuration, New York J. Math., 23 (2017), 1427-1445.

 

[15] A. Rejali and M. Soleimani Malekan, Strong Configuration Equivalence and Isomorphism. arXiv preprint arXiv:1510.07209 (2015).

 

[16] M. Sapir, Combinatorial Algebra: Syntax and Semantics (Springer International Publishing, Switzerland, 2014).