Solution in the Case of an Arbitrary Group

Author(s):  
Guy Fayolle ◽  
Roudolf Iasnogorodski ◽  
Vadim Malyshev
Keyword(s):  
2022 ◽  
Vol 275 (1352) ◽  
Author(s):  
Bernhard Mühlherr ◽  
Richard Weiss ◽  
Holger Petersson

We introduce the notion of a Tits polygon, a generalization of the notion of a Moufang polygon, and show that Tits polygons arise in a natural way from certain configurations of parabolic subgroups in an arbitrary spherical buildings satisfying the Moufang condition. We establish numerous basic properties of Tits polygons and characterize a large class of Tits hexagons in terms of Jordan algebras. We apply this classification to give a “rank  2 2 ” presentation for the group of F F -rational points of an arbitrary exceptional simple group of F F -rank at least  4 4 and to determine defining relations for the group of F F -rational points of an an arbitrary group of F F -rank  1 1 and absolute type D 4 D_4 , E 6 E_6 , E 7 E_7 or E 8 E_8 associated to the unique vertex of the Dynkin diagram that is not orthogonal to the highest root. All of these results are over a field of arbitrary characteristic.


2008 ◽  
Vol 8 (3&4) ◽  
pp. 345-358
Author(s):  
M. Hayashi ◽  
A. Kawachi ◽  
H. Kobayashi

One of the central issues in the hidden subgroup problem is to bound the sample complexity, i.e., the number of identical samples of coset states sufficient and necessary to solve the problem. In this paper, we present general bounds for the sample complexity of the identification and decision versions of the hidden subgroup problem. As a consequence of the bounds, we show that the sample complexity for both of the decision and identification versions is $\Theta(\log|\HH|/\log p)$ for a candidate set $\HH$ of hidden subgroups in the case \REVISE{where the candidate nontrivial subgroups} have the same prime order $p$, which implies that the decision version is at least as hard as the identification version in this case. In particular, it does so for the important \REVISE{cases} such as the dihedral and the symmetric hidden subgroup problems. Moreover, the upper bound of the identification is attained \REVISE{by a variant of the pretty good measurement}. \REVISE{This implies that the concept of the pretty good measurement is quite useful for identification of hidden subgroups over an arbitrary group with optimal sample complexity}.


2018 ◽  
Vol 68 (6) ◽  
pp. 1447-1464 ◽  
Author(s):  
T. M. G. Ahsanullah ◽  
Gunther Jäger

Abstract We introduce a notion of a probabilistic convergence transformation group, and present various natural examples including quotient probabilistic convergence transformation group. In doing so, we construct a probabilistic convergence structure on the group of homeomorphisms and look into a probabilistic convergence group that arises from probabilistic uniform convergence structure on function spaces. Given a probabilistic convergence space, and an arbitrary group, we construct a probabilistic convergence transformation group. Introducing a notion of a probabilistic metric convergence transformation group on a probabilistic metric space, we obtain in a natural way a probabilistic convergence transformation group.


1999 ◽  
pp. 93-127
Author(s):  
Guy Fayolle ◽  
Roudolf Iasnogorodski ◽  
Vadim Malyshev
Keyword(s):  

2000 ◽  
Vol 43 (1) ◽  
pp. 60-62 ◽  
Author(s):  
Daniel R. Farkas ◽  
Peter A. Linnell

AbstractLet G be an arbitrary group and let U be a subgroup of the normalized units in ℤG. We show that if U contains G as a subgroup of finite index, then U = G. This result can be used to give an alternative proof of a recent result of Marciniak and Sehgal on units in the integral group ring of a crystallographic group.


2019 ◽  
Vol 19 (09) ◽  
pp. 2050165 ◽  
Author(s):  
Patrik Nystedt ◽  
Johan Öinert

Given a directed graph [Formula: see text] and an associative unital ring [Formula: see text] one may define the Leavitt path algebra with coefficients in [Formula: see text], denoted by [Formula: see text]. For an arbitrary group [Formula: see text], [Formula: see text] can be viewed as a [Formula: see text]-graded ring. In this paper, we show that [Formula: see text] is always nearly epsilon-strongly [Formula: see text]-graded. We also show that if [Formula: see text] is finite, then [Formula: see text] is epsilon-strongly [Formula: see text]-graded. We present a new proof of Hazrat’s characterization of strongly [Formula: see text]-graded Leavitt path algebras, when [Formula: see text] is finite. Moreover, if [Formula: see text] is row-finite and has no source, then we show that [Formula: see text] is strongly [Formula: see text]-graded if and only if [Formula: see text] has no sink. We also use a result concerning Frobenius epsilon-strongly [Formula: see text]-graded rings, where [Formula: see text] is finite, to obtain criteria which ensure that [Formula: see text] is Frobenius over its identity component.


2014 ◽  
Vol 13 (07) ◽  
pp. 1450044 ◽  
Author(s):  
Harish Chandra ◽  
Meena Sahai

Let K be a field of characteristic p > 0 and let G be an arbitrary group. In this paper, we classify group algebras KG which are strongly Lie nilpotent of index at most 8. We also show that for k ≤ 6, KG is strongly Lie nilpotent of index k if and only if it is Lie nilpotent of index k.


2012 ◽  
Vol 52 (No. 3) ◽  
pp. 133-137
Author(s):  
P. Michálek ◽  
P. Rymešová ◽  
L. Müllerová ◽  
H. Chamoutová ◽  
K. Chamoutová

The European integration process is very important and it has been paid attention to for the last 15 years. The abstract deals with the negotiation field and position in the structure of the current expanded EU. For better orientation in this equivocal situation, a modern cartography method of relationship in the arbitrary group called dynamic sociometry was used. The method is based on classical sociometry Morena and furthermore it uses the instrument of fuzzy set, typology and structural analysis. The output of this method is a sociomap. The map holds information on the relative closeness or the distance of individual elements, their configuration but also some quality information. The graphic chart is similar to a topographic map. In our case, the sociomap was created from the data of foreign business among the member countries. The following analysis of the sociomap we detected and described characteristic features of the analysed group. It consists of formal and informal links in the group, the role and the position of each member within the group, the structure and relations in the group. In the concrete, we attained data to answer the questions about the present climate in interrelationships in the EU, which means the relationships among the members as the whole entities but also the relationships separately among members themselves. The position analysis of the Czech Republic in the system of the created sociomaps was considered as very important. According to the allocation of the Czech Republic in sociomaps, we easily defined the position of the state, the closest partners for negotiation, and also the possible problem relations which might complicate the negotiation in the EU. From the resultant sociomaps, we also tried to determine the sociometric star, i.e. the leader of the European Community. We anticipated that it would be rather an aggregation of several states than an individual state. The contribution focuses on the negotiation field and position in the structure of the current expanded EU. The sociomap created using foreign business data of member states gives the bases for answering questions about present climate in interrelationships in the EU which means the relationships between the members as whole entities but also the relationships separately between the members themselves.


2008 ◽  
Vol 51 (1) ◽  
pp. 73-153 ◽  
Author(s):  
Ben Green ◽  
Terence Tao

AbstractThere has been much recent progress in the study of arithmetic progressions in various sets, such as dense subsets of the integers or of the primes. One key tool in these developments has been the sequence of Gowers uniformity norms $U^d(G)$, $d=1,2,3,\dots$, on a finite additive group $G$; in particular, to detect arithmetic progressions of length $k$ in $G$ it is important to know under what circumstances the $U^{k-1}(G)$ norm can be large.The $U^1(G)$ norm is trivial, and the $U^2(G)$ norm can be easily described in terms of the Fourier transform. In this paper we systematically study the $U^3(G)$ norm, defined for any function $f:G\to\mathbb{C}$ on a finite additive group $G$ by the formula\begin{multline*} \qquad\|f\|_{U^3(G)}:=|G|^{-4}\sum_{x,a,b,c\in G}(f(x)\overline{f(x+a)f(x+b)f(x+c)}f(x+a+b) \\ \times f(x+b+c)f(x+c+a)\overline{f(x+a+b+c)})^{1/8}.\qquad \end{multline*}We give an inverse theorem for the $U^3(G)$ norm on an arbitrary group $G$. In the finite-field case $G=\mathbb{F}_5^n$ we show that a bounded function $f:G\to\mathbb{C}$ has large $U^3(G)$ norm if and only if it has a large inner product with a function $e(\phi)$, where $e(x):=\mathrm{e}^{2\pi\ri x}$ and $\phi:\mathbb{F}_5^n\to\mathbb{R}/\mathbb{Z}$ is a quadratic phase function. In a general $G$ the statement is more complicated: the phase $\phi$ is quadratic only locally on a Bohr neighbourhood in $G$.As an application we extend Gowers's proof of Szemerédi's theorem for progressions of length four to arbitrary abelian $G$. More precisely, writing $r_4(G)$ for the size of the largest $A\subseteq G$ which does not contain a progression of length four, we prove that$$ r_4(G)\ll|G|(\log\log|G|)^{-c}, $$where $c$ is an absolute constant.We also discuss links between our ideas and recent results of Host, Kra and Ziegler in ergodic theory.In future papers we will apply variants of our inverse theorems to obtain an asymptotic for the number of quadruples $p_1\ltp_2\ltp_3\ltp_4\leq N$ of primes in arithmetic progression, and to obtain significantly stronger bounds for $r_4(G)$.


Sign in / Sign up

Export Citation Format

Share Document