scholarly journals On the number of connected components of the ramification locus of a morphism of Berkovich curves

2018 ◽  
Vol 372 (3-4) ◽  
pp. 1575-1595
Author(s):  
Velibor Bojković ◽  
Jérôme Poineau

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


2020 ◽  
pp. 1-23
Author(s):  
MICHELE BOLOGNESI ◽  
NÉSTOR FERNÁNDEZ VARGAS

Abstract Let C be a hyperelliptic curve of genus $g \geq 3$ . In this paper, we give a new geometric description of the theta map for moduli spaces of rank 2 semistable vector bundles on C with trivial determinant. In order to do this, we describe a fibration of (a birational model of) the moduli space, whose fibers are GIT quotients $(\mathbb {P}^1)^{2g}//\text {PGL(2)}$ . Then, we identify the restriction of the theta map to these GIT quotients with some explicit degree 2 osculating projection. As a corollary of this construction, we obtain a birational inclusion of a fibration in Kummer $(g-1)$ -varieties over $\mathbb {P}^g$ inside the ramification locus of the theta map.


2021 ◽  
Vol 20 (1) ◽  
Author(s):  
Adam Glos ◽  
Nikolajs Nahimovs ◽  
Konstantin Balakirev ◽  
Kamil Khadiev

2006 ◽  
Vol 17 (03) ◽  
pp. 677-701 ◽  
Author(s):  
YUNG H. TSIN

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.


Author(s):  
NICOLAS F. BEIKE ◽  
RACHEL CARLETON ◽  
DAVID G. COSTANZO ◽  
COLIN HEATH ◽  
MARK L. LEWIS ◽  
...  

Abstract Morgan and Parker proved that if G is a group with ${\textbf{Z}(G)} = 1$ , then the connected components of the commuting graph of G have diameter at most $10$ . Parker proved that if, in addition, G is solvable, then the commuting graph of G is disconnected if and only if G is a Frobenius group or a $2$ -Frobenius group, and if the commuting graph of G is connected, then its diameter is at most $8$ . We prove that the hypothesis $Z (G) = 1$ in these results can be replaced with $G' \cap {\textbf{Z}(G)} = 1$ . We also prove that if G is solvable and $G/{\textbf{Z}(G)}$ is either a Frobenius group or a $2$ -Frobenius group, then the commuting graph of G is disconnected.


2015 ◽  
Vol 27 (10) ◽  
pp. 2658-2671 ◽  
Author(s):  
Min-Soo Kim ◽  
Sangyeon Lee ◽  
Wook-Shin Han ◽  
Himchan Park ◽  
Jeong-Hoon Lee

Sign in / Sign up

Export Citation Format

Share Document