scholarly journals On the degenerate pin groups

Filomat ◽  
2020 ◽  
Vol 34 (6) ◽  
pp. 2017-2027
Author(s):  
Şekerci Aydın ◽  
Çöken Ceylan
Keyword(s):  
Orthogonal Group ◽  
Double Covering ◽  
Connected Components ◽  
Direct Products ◽  
Disjoint Sets

We define a double covering homomorphism between a degenerate pin group and a degenerate orthogonal group which are given as semi-direct products. We also show that both of them are decomposed into four disjoint sets consisting of connected components. Then, using the components of pseudo-orthogonal group, we investigate the components of degenerate pin group and degenerate orthogonal group.

The partitioning of an orthogonal group in six variables

1958 ◽  
Vol 247 (1251) ◽  
pp. 539-549 ◽  
Keyword(s):  
Orthogonal Group ◽  
Ambient Space ◽  
Essential Information ◽  
Five Dimensions ◽  
Disjoint Sets ◽  
Index 2 ◽  
Group Of Projectivities

An orthogonal group of projectivities in six variables is partitioned into 31 disjoint sets; 17 of these constitute a subgroup, of index 2 and order 3265920, isomorphic to a group already known in great detail in another representation. The ambient space is finite, of five dimensions; its points fall into three batches of 126, 126, 112, these last composing the quadric invariant under the group. Each projectivity permutes the points of each batch. The cyclic decompositions of all these permutations are listed in two tables, as also are the numbers of projectivities in the various sets of the par­titioning, together with any spaces composed of points that are invariant. The prime purpose is to demonstrate with what rapidity and uniformity much of the work is done once the results for an analogous group with one variable fewer are on record; indeed 14 of the 17 sets mentioned above fall out in this way. There are numerous allusions to two earlier papers wherein essential information is assembled.

The algorithm of the color signal recognition at landing an unmanned aerial vehicle on an aircraft carrier in autonomous mode

2020 ◽  
pp. 78
Keyword(s):  
Unmanned Aerial Vehicle ◽  
Treatment Method ◽  
Recognition Algorithm ◽  
Connected Components ◽  
Preliminary Treatment ◽  
Signal Recognition ◽  
Aircraft Carrier ◽  
Halftone Image ◽  
Glide Path ◽  
Aerial Vehicle

The movement along the glide path of an unmanned aerial vehicle during landing on an aircraft carrier is investigated. The implementation of this task is realized in the conditions of radio silence of the aircraft carrier. The algorithm for treatment information from an optical landing system installed on an aircraft carrier is developed. The algorithm of the color signal recognition assumes the usage of the image frame preliminary treatment method via a downsample function, that performs the decimation process, the HSV model, the Otsu’s method for calculating the binarization threshold for a halftone image, and the method of separating the connected Two-Pass components. Keywords unmanned aerial vehicle; aircraft carrier; approach; glide path; optical landing system; color signal recognition algorithm; decimation; connected components; halftone image binarization

Double cover K3 surfaces of Hirzebruch surfaces

2021 ◽  
Vol 21 (2) ◽  
pp. 221-225
Author(s):  
Taro Hayashi
Keyword(s):  
Rational Surface ◽  
K3 Surfaces ◽  
Double Cover ◽  
Double Covering ◽  
Smooth Surfaces ◽  
Branch Locus ◽  
Hirzebruch Surfaces ◽  
Double Covers

Abstract General K3 surfaces obtained as double covers of the n-th Hirzebruch surfaces with n = 0, 1, 4 are not double covers of other smooth surfaces. We give a criterion for such a K3 surface to be a double covering of another smooth rational surface based on the branch locus of double covers and fibre spaces of Hirzebruch surfaces.

scholarly journals Upperbounds on the probability of finding marked connected components using quantum walks

2021 ◽  
Vol 20 (1) ◽  
Author(s):  
Adam Glos ◽  
Nikolajs Nahimovs ◽  
Konstantin Balakirev ◽  
Kamil Khadiev
Keyword(s):  
Quantum Walks ◽  
Connected Components

AN EFFICIENT DISTRIBUTED ALGORITHM FOR 3-EDGE-CONNECTIVITY

2006 ◽  
Vol 17 (03) ◽  
pp. 677-701 ◽  
Author(s):  
YUNG H. TSIN
Keyword(s):  
Distributed Algorithm ◽  
Computer Network ◽  
Connected Components ◽  
Message Complexity ◽  
Edge Connectivity ◽  
Worst Case ◽  
Dense Networks

A distributed algorithm for finding the cut-edges and the 3-edge-connected components of an asynchronous computer network is presented. For a network with n nodes and m links, the algorithm has worst-case [Formula: see text] time and O(m + nhT) message complexity, where hT < n. The algorithm is message optimal when [Formula: see text] which includes dense networks (i.e. m ∈ Θ(n2)). The previously best known distributed algorithm has a worst-case O(n3) time and message complexity.

Sign in / Sign up

Export Citation Format

Share Document