Maximum Order of Planar Digraphs

Author(s):  
Rinovia Simanjuntak ◽  
Mirka Miller
Keyword(s):  
2020 ◽  
Vol 23 (5) ◽  
pp. 801-829
Author(s):  
Mark Pengitore

AbstractThe function {\mathrm{F}_{G}(n)} gives the maximum order of a finite group needed to distinguish a nontrivial element of G from the identity with a surjective group morphism as one varies over nontrivial elements of word length at most n. In previous work [M. Pengitore, Effective separability of finitely generated nilpotent groups, New York J. Math. 24 2018, 83–145], the author claimed a characterization for {\mathrm{F}_{N}(n)} when N is a finitely generated nilpotent group. However, a counterexample to the above claim was communicated to the author, and consequently, the statement of the asymptotic characterization of {\mathrm{F}_{N}(n)} is incorrect. In this article, we introduce new tools to provide lower asymptotic bounds for {\mathrm{F}_{N}(n)} when N is a finitely generated nilpotent group. Moreover, we introduce a class of finitely generated nilpotent groups for which the upper bound of the above article can be improved. Finally, we construct a class of finitely generated nilpotent groups N for which the asymptotic behavior of {\mathrm{F}_{N}(n)} can be fully characterized.


2017 ◽  
Vol 160 ◽  
pp. 31-41 ◽  
Author(s):  
Nil Kamal Hazra ◽  
Mithu Rani Kuiti ◽  
Maxim Finkelstein ◽  
Asok K. Nanda

2017 ◽  
pp. 269-278
Author(s):  
Mirk A Miller ◽  
Ivan Friš
Keyword(s):  

2020 ◽  
Author(s):  
◽  
Shiying Li

Although Zernike and pseudo-Zernike moments have some advanced properties, the computation process is generally very time-consuming, which has limited their practical applications. To improve the computational efficiency of Zernike and pseudo-Zernike moments, in this research, we have explored the use of GPU to accelerate moments computation, and proposed a GPUaccelerated algorithm. The newly developed algorithm is implemented in Python and CUDA C++ with optimizations based on symmetric properties and k × k sub-region scheme. The experimental results are encouraging and have shown that our GPU-accelerated algorithm is able to compute Zernike moments up to order 700 for an image sized at 512 × 512 in 1.7 seconds and compute pseudo-Zernike moments in 3.1 seconds. We have also verified the accuracy of our GPU algorithm by performing image reconstructions from the higher orders of Zernike and pseudo-Zernike moments. For an image sized at 512 × 512, with the maximum order of 700 and k = 11, the PSNR (Peak Signal to Noise Ratio) values of its reconstructed versions from Zernike and pseudo-Zernike moments are 44.52 and 46.29 separately. We have performed image reconstructions from partial sets of Zernike and pseudo-Zernike moments with various order n and different repetition m. Experimental results of both Zernike and pseudo-Zernike moments show that the images reconstructed from the moments of lower and higher orders preserve the principle contents and details of the original image respectively, while moments of positive and negative m result in identical images. Lastly, we have proposed a set of feature vectors based on pseudo-Zernike moments for Chinese character recognition. Three different feature vectors are composed of different parts of four selected lower pseudo-Zernike moments. Experiments on a set of 6,762 Chinese characters show that this method performs well to recognize similar-shaped Chinese characters.


2017 ◽  
Vol 26 (06) ◽  
pp. 1742005
Author(s):  
Chao Wang ◽  
Shicheng Wang ◽  
Yimu Zhang

We determine the maximum order of cyclic group actions on the pair [Formula: see text] among all embeddings of closed surface [Formula: see text] into the 3-dimensional torus [Formula: see text] in the orientable category.


1977 ◽  
Vol 23 (3) ◽  
pp. 354-359 ◽  
Author(s):  
Frank Harary ◽  
Derbiau Hsu ◽  
Zevi Miller

AbstractThe bichromaticity β(B) of a bipartite graph B has been defined as the maximum order of a complete bipartite graph onto which B is homomorphic. This number was previously determined for trees and even cycles. It is now shown that for a lattice-graph Pm × Pm the cartesian product of two paths, the bichromaticity is 2 + {mn/2}.


1967 ◽  
Vol 10 (4) ◽  
pp. 503-505 ◽  
Author(s):  
John D. Dixon

To each tournament Tn with n nodes n there corresponds the automorphism group G(Tn) consisting n of all dominance preserving permutations of the set of nodes. In a recent paper [3], Myron Goldberg and J. W. Moon consider the maximum order g(n) which the group of a tournament with n nodes may have. Among other results they prove that12


Sign in / Sign up

Export Citation Format

Share Document