Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Uncountably many 2-generated just-infinite branch pro-2 groups
Date
2015-01-01
Author
Benli, Mustafa Gökhan
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
231
views
0
downloads
Cite This
The aim of this note is to prove that there are 2 non-isomorphic 2 generated just-infinite branch pro-2 groups.
URI
https://hdl.handle.net/11511/53708
Journal
ALGEBRA & DISCRETE MATHEMATICS
Collections
Department of Mathematics, Article
Suggestions
OpenMETU
Core
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...
Descriptive complexity of subsets of the space of finitely generated groups
Benli, Mustafa Gökhan; Kaya, Burak (2022-12-01)
© 2022 Elsevier GmbHIn this paper, we determine the descriptive complexity of subsets of the Polish space of marked groups defined by various group theoretic properties. In particular, using Grigorchuk groups, we establish that the sets of solvable groups, groups of exponential growth and groups with decidable word problem are Σ20-complete and that the sets of periodic groups and groups of intermediate growth are Π20-complete. We also provide bounds for the descriptive complexity of simplicity, amenability,...
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...
Equivariant Picard groups of the moduli spaces of some finite Abelian covers of the Riemann sphere
Ozan, Yıldıray (2023-03-01)
In this note, following Kordek's work we will compute the equivariant Picard groups of the moduli spaces of Riemann surfaces with certain finite abelian symmetries.
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
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.