Search results for "permuta"
showing 10 items of 171 documents
Tetravalent single-chain avidin: from subunits to protein domains via circularly permuted avidins
2005
scAvd (single-chain avidin, where two dcAvd are joined in a single polypeptide chain), having four biotin-binding domains, was constructed by fusion of topologically modified avidin units. scAvd showed similar biotin binding and thermal stability properties as chicken avidin. The DNA construct encoding scAvd contains four circularly permuted avidin domains, plus short linkers connecting the four domains into a single polypeptide chain. In contrast with wild-type avidin, which contains four identical avidin monomers, scAvd enables each one of the four avidin domains to be independently modified by protein engineering. Therefore the scAvd scaffold can be used to construct spatially and stoich…
Avoiding patterns in irreducible permutations
2016
We explore the classical pattern avoidance question in the case of irreducible permutations, <i>i.e.</i>, those in which there is no index $i$ such that $\sigma (i+1) - \sigma (i)=1$. The problem is addressed completely in the case of avoiding one or two patterns of length three, and several well known sequences are encountered in the process, such as Catalan, Motzkin, Fibonacci, Tribonacci, Padovan and Binary numbers. Also, we present constructive bijections between the set of Motzkin paths of length $n-1$ and the sets of irreducible permutations of length $n$ (respectively fixed point free irreducible involutions of length $2n$) avoiding a pattern $\alpha$ for $\alpha \in \{13…
Permutable subnormal subgroups of finite groups
2009
The aim of this paper is to prove certain characterization theorems for groups in which permutability is a transitive relation, the so called PT -groups. In particular, it is shown that the finite solvable PT -groups, the finite solvable groups in which every subnormal subgroup of defect two is permutable, the finite solvable groups in which every normal subgroup is permutable sensitive, and the finite solvable groups in which conjugatepermutability and permutability coincide are all one and the same class. This follows from our main result which says that the finite modular p-groups, p a prime, are those p-groups in which every subnormal subgroup of defect two is permutable or, equivalentl…
Dentoskeletal effects of class II malocclusion treatment with the modified Twin Block appliance
2019
Background The purpose of this study was to prospectively assess the dentoskeletal effect of a modified Twin Block appliance for treatment of class II malocclusions. Material and Methods Lateral cephalograms of 25 Class II malocclusion patients were compared to evaluate skeletal, dentoalveolar and soft tissue changes pre- and post-treatment with a modified Twin Block appliance. A total of 33 angular and linear variables were used for analysis. The differences were calculated at the start and end of treatment. The paired T test was performed to compare the cephalometric measurements before and after treatment. Results Compared the pre- and post- treatment measurements, there was a significan…
Z-permutable subgroups of finite groups
2016
Let Z be a complete set of Sylow subgroups of a finite group G, that is, a set composed of a Sylow p-subgroup of G for each p dividing the order of G. A subgroup H of G is called Z-permutable if H permutes with all members of Z. The main goal of this paper is to study the embedding of the Z-permutable subgroups and the influence of Z-permutability on the group structure.
Sylow permutable subnormal subgroups of finite groups II
2001
[EN] In this paper a local version of Agrawal's theorem about the structure of finite groups in which Sylow permutability is transitive is given. The result is used to obtain new characterisations of this class of finite groups.
Las matemáticas del cubo de Rubik
2013
[ES] En este artículo mostramos cómo podemos utilizar el cubo de Rubik para presentar algunos conceptos básicos de la teoría de grupos y cómo podemos usar esta para resolver el cubo de Rubik.
Two Simple Constructive algorithms for the Distributed Assembly Permutation Flowshop Scheduling Problem
2014
Nowadays, it is necessary to improve the management of complex supply chains which are often composed of multi-plant facilities. This paper proposes a Distributed Assembly Permutation Flowshop Scheduling Problem (DAPFSP). This problem is a generalization of the Distributed Permutation Flowshop Scheduling Problem (DPFSP) presented by Naderi and Ruiz (Comput Oper Res, 37(4):754–768, 2010). The first stage of the DAPFSP is composed of f identical production factories. Each center is a flowshop that produces jobs that have to be assembled into final products in a second assembly stage. The objective is to minimize the makespan. Two simple constructive algorithms are proposed to solve the proble…
Transmission of Genetic Properties in Permutation Problems: Study of Lehmer Code and Inversion Table Encoding
2021
Solution encoding describes the way decision variables are represented. In the case of permutation problems, the classical encoding should ensure that there are no duplicates. During crossover operations, repairs may be carried out to correct or avoid repetitions. The use of indirect encoding aims to define bijections between the classical permutation and a different representation of the decision variables. These encodings are not sensitive to duplicates. However, they lead to a loss of genetic properties during crossbreeding. This paper proposes a study of the impact of this loss both in the space of decision variables and in that of fitness values. We consider two indirect encoding: the …
Scatter Search vs. Genetic Algorithms
2005
The purpose of this work is to compare the performance of a scatter search (SS) implementation and an implementation of a genetic algorithm (GA) in the context of searching for optimal solutions to permutation problems. Scatter search and genetic algorithms are members of the evolutionary computation family. That is, they are both based on maintaining a population of solutions for the purpose of generating new trial solutions. Our computational experiments with four well-known permutation problems reveal that in general a GA with local search outperforms one without it. Using the same problem instances, we observed that our specific scatter search implementation found solutions of a higher …