Uncountably many 2-generated just-infinite branch pro-2 groups

The aim of this note is to prove that there are 2 non-isomorphic 2 generated just-infinite branch pro-2 groups.


Square reflection cryptanalysis of 5-round Feistel networks with permutations
Kara, Orhun (2013-09-01)
In this work, we introduce a new generic attack on 5-round Feistel networks whose round functions are random permutations, under the condition that the second and the fourth round keys are equal. The attack is a combination of the square attack technique with the reflection attack technique and exploits the unbalanced distribution of the fixed points of the inner rounds among all the keys. The data complexity of the attack is inverted right perpendicular4m/ninverted left perpendicular2(n/2) chosen plaintext...
Affine Equivalency and Nonlinearity Preserving Bijective Mappings over F-2
Sertkaya, Isa; Doğanaksoy, Ali; Uzunkol, Osmanbey; Kiraz, Mehmet Sabir (2014-09-28)
We first give a proof of an isomorphism between the group of affine equivalent maps and the automorphism group of Sylvester Hadamard matrices. Secondly, we prove the existence of new nonlinearity preserving bijective mappings without explicit construction. Continuing the study of the group of nonlinearity preserving bijective mappings acting on n-variable Boolean functions, we further give the exact number of those mappings for n <= 6. Moreover, we observe that it is more beneficial to study the automorphis...
Adaptive Control Algorithm for Linear Systems with Matched and Unmatched Uncertainties
Yayla, Metehan; Kutay, Ali Türker (2016-12-14)
In this paper, a new uncertainty identification method is introduced for both matched and unmatched uncertainties in an uncertain dynamical system. Online identifications of matched and unmatched uncertainties that can be linearly parameterized are ensured without requiring persistent excitation (PE) condition. Furthermore, constant weight matrices that parameterizes the unstructured uncertainties are guaranteed to stay bounded without PE. Findings are implemented on a hybrid adaptive control design, and gl...
Ercan, Gülin; Ogut, Elif (2014-01-01)
We prove that a finite solvable group G admitting a Frobenius group FH of automorphisms of coprime order with kernel F and complement H such that [G, F] = G and C-CG(F) (h) = 1 for all nonidentity elements h is an element of H, is of nilpotent length equal to the nilpotent length of the subgroup of fixed points of H.
Model-theory of vector-spaces over unspecified fields
Pierce, David (2009-06-01)
Vector spaces over unspecified fields can be axiomatized as one-sorted structures, namely, abelian groups with the relation of parallelism. Parallelism is binary linear dependence. When equipped with the n-ary relation of linear dependence for some positive integer n, a vector-space is existentially closed if and only if it is n-dimensional over an algebraically closed field. In the signature with an n-ary predicate for linear dependence for each positive integer n, the theory of infinite-dimensional vector...
Citation Formats
M. G. Benli, “Uncountably many 2-generated just-infinite branch pro-2 groups,” ALGEBRA & DISCRETE MATHEMATICS, pp. 8–18, 2015, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/53708.