An improved chromosome sorting algorithm by permutation group-based inverted block-interchanges

Author(s):  
Afrida Tabassum ◽  
Wali Mohammad Abdullah ◽  
Najia Manjur ◽  
Rehennuma Islam ◽  
Ashfaque Ahmed ◽  
...  
2013 ◽  
Vol 50 (2) ◽  
pp. 258-265
Author(s):  
Pál Hegedűs

In this paper we analyse the natural permutation module of an affine permutation group. For this the regular module of an elementary Abelian p-group is described in detail. We consider the inequivalent permutation modules coming from nonconjugate complements. We prove their strong structural similarity well exceeding the fact that they have equal Brauer characters.


2017 ◽  
Vol 5 (12) ◽  
pp. 169-172
Author(s):  
Rina Damdoo ◽  
◽  
◽  
Kanak Kalyani

2019 ◽  
Author(s):  
Jatin Goel ◽  
Avnish Gupta ◽  
Nikhil Tripathi ◽  
Ravi Tomar ◽  
Tanupriya Choudhury

IEEE Micro ◽  
1995 ◽  
Vol 15 (3) ◽  
pp. 60-71 ◽  
Author(s):  
A. Louri ◽  
J.A. Hatch ◽  
Jongwhoa Na

2021 ◽  
pp. 1-40
Author(s):  
NICK GILL ◽  
BIANCA LODÀ ◽  
PABLO SPIGA

Abstract Let G be a permutation group on a set $\Omega $ of size t. We say that $\Lambda \subseteq \Omega $ is an independent set if its pointwise stabilizer is not equal to the pointwise stabilizer of any proper subset of $\Lambda $ . We define the height of G to be the maximum size of an independent set, and we denote this quantity $\textrm{H}(G)$ . In this paper, we study $\textrm{H}(G)$ for the case when G is primitive. Our main result asserts that either $\textrm{H}(G)< 9\log t$ or else G is in a particular well-studied family (the primitive large–base groups). An immediate corollary of this result is a characterization of primitive permutation groups with large relational complexity, the latter quantity being a statistic introduced by Cherlin in his study of the model theory of permutation groups. We also study $\textrm{I}(G)$ , the maximum length of an irredundant base of G, in which case we prove that if G is primitive, then either $\textrm{I}(G)<7\log t$ or else, again, G is in a particular family (which includes the primitive large–base groups as well as some others).


2020 ◽  
pp. 1-11
Author(s):  
Guo Yunfeng ◽  
Li Jing

In order to improve the effect of the teaching method evaluation model, based on the grid model, this paper constructs an artificial intelligence model based on the grid model. Moreover, this paper proposes a hexahedral grid structure simplification method based on weighted sorting, which comprehensively sorts the elimination order of candidate base complexes in the grid with three sets of sorting items of width, deformation and price improvement. At the same time, for the elimination order of basic complex strings, this paper also proposes a corresponding priority sorting algorithm. In addition, this paper proposes a smoothing regularization method based on the local parameterization method of the improved SLIM algorithm, which uses the regularized unit as the reference unit in the local mapping in the SLIM algorithm. Furthermore, this paper proposes an adaptive refinement method that maintains the uniformity of the grid and reduces the surface error, which can better slow down the occurrence of geometric constraints caused by insufficient number of elements in the process of grid simplification. Finally, this paper designs experiments to study the performance of the model. The research results show that the model constructed in this paper is effective.


2020 ◽  
Vol 23 (3) ◽  
pp. 393-397
Author(s):  
Wolfgang Knapp ◽  
Peter Schmid

AbstractLet G be a finite transitive permutation group of degree n, with point stabilizer {H\neq 1} and permutation character π. For every positive integer t, we consider the generalized character {\psi_{t}=\rho_{G}-t(\pi-1_{G})}, where {\rho_{G}} is the regular character of G and {1_{G}} the 1-character. We give necessary and sufficient conditions on t (and G) which guarantee that {\psi_{t}} is a character of G. A necessary condition is that {t\leq\min\{n-1,\lvert H\rvert\}}, and it turns out that {\psi_{t}} is a character of G for {t=n-1} resp. {t=\lvert H\rvert} precisely when G is 2-transitive resp. a Frobenius group.


Author(s):  
Haonan Tang ◽  
Shuqin Geng ◽  
Xiaohong Peng ◽  
Shuaiqi Yan ◽  
Yan Zhang ◽  
...  
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document