Log in

Relevant bibliographies by topics / Permutable

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers
Reports

Academic literature on the topic 'Permutable'

Author: Grafiati

Published: 4 June 2021

Last updated: 4 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Permutable.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Permutable"

1

Hussain, Muhammad Tanveer, Chenchen Cao та Li Zhang. "On Nearly σ-Embedded Subgroups of Finite Groups". Algebra Colloquium 26, № 04 (2019): 677–88. http://dx.doi.org/10.1142/s100538671900049x.

Full text

Abstract:

Let G be a finite group, σ={σi|i∈I} be some partition of the set of all primes and σ(G)={σi|σi∩π(G)≠∅}. We say that a subgroup H of G is nearly σ-embedded in G if there exists a σ-permutable subgroup T of G such that HT is a σ-permutable subgroup of G and H∩T≤HσeG, where HσeG is the subgroup of H generated by all those subgroups of H which are σ-permutably embedded in G. In this paper, we study the structure of G under the condition that some given subgroups of G are nearly σ-embedded in G. Some known results are generalized.

APA, Harvard, Vancouver, ISO, and other styles

2

Coonce, H. B. "Permutable functions." Aequationes Mathematicae 52, no. 1 (1996): 201–14. http://dx.doi.org/10.1007/bf01818340.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Razzaghmaneshi, Behnam. "Supersoluble Groups and Its Products." Journal of Engineering and Applied Sciences Technology 2, no. 2 (2020): 1–3. http://dx.doi.org/10.47363/jeast/2020(2)108.

Full text

Abstract:

Two subgroups A and B of a group G are called permutable if every subgroup X of A is permutable with every subgroup Y of B, i.e., XYis a subgroup of G. In this case, if G=AB we say that G is the permutable product of the subgroups A and B. In this paper we check the permutable product of supersoluble subgroups. And the end, we obtain sufficient conditions for permutable products of finite supersoluble groups to be supersoluble.

APA, Harvard, Vancouver, ISO, and other styles

4

Gorbatova, Yuliya V. "On permutable strongly 2-maximal and strongly 3-maximal subgroups." Russian Universities Reports. Mathematics, no. 134 (2021): 121–29. http://dx.doi.org/10.20310/2686-9667-2021-26-134-121-129.

Full text

Abstract:

We describe the structure of finite solvable non-nilpotent groups in which every two strongly n-maximal subgroups are permutable (n = 2; 3). In particular, it is shown for a solvable non-nilpotent group G that any two strongly 2-maximal subgroups are permutable if and only if G is a Schmidt group with Abelian Sylow subgroups. We also prove the equivalence of the structure of non-nilpotent solvable groups with permutable 3-maximal subgroups and with permutable strongly 3-maximal subgroups. The last result allows us to classify all finite solvable groups with permutable strongly 3-maximal subgro

APA, Harvard, Vancouver, ISO, and other styles

5

Kearnes, K. A. "Congruence Permutable and Congruence 3-Permutable Locally Finite Varieties." Journal of Algebra 156, no. 1 (1993): 36–49. http://dx.doi.org/10.1006/jabr.1993.1061.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Hijazi, Rola A. "Mutually Permutable Products of Finite Groups." ISRN Algebra 2011 (September 7, 2011): 1–4. http://dx.doi.org/10.5402/2011/867082.

Full text

Abstract:

Let G be a finite group and G1, G2 are two subgroups of G. We say that G1 and G2 are mutually permutable if G1 is permutable with every subgroup of G2 and G2 is permutable with every subgroup of G1. We prove that if is the product of three supersolvable subgroups G1, G2, and G3, where Gi and Gj are mutually permutable for all i and j with and the Sylow subgroups of G are abelian, then G is supersolvable. As a corollary of this result, we also prove that if G possesses three supersolvable subgroups whose indices are pairwise relatively prime, and Gi and Gj are mutually permutable for all i and

APA, Harvard, Vancouver, ISO, and other styles

7

Fang, Jie, and Zhongju Sun. "The Permutable Congruences of bpO-Algebras." Algebra Colloquium 20, no. 02 (2013): 261–68. http://dx.doi.org/10.1142/s1005386713000230.

Full text

Abstract:

An algebra A is said to be congruence permutable if any two congruences on it are permutable. This property has been investigated in several classes of algebras, for example, de Morgan algebras, p-algebras and MS-algebras, etc. In this paper, we characterize the permutable congruences on a finite Ockham algebra with balanced pseudocomplementation via the Priestley duality.

APA, Harvard, Vancouver, ISO, and other styles

8

Menon, Prashanth, Amadou Ngom, Lin Ma, Todd C. Mowry, and Andrew Pavlo. "Permutable compiled queries." Proceedings of the VLDB Endowment 14, no. 2 (2020): 101–13. http://dx.doi.org/10.14778/3425879.3425882.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Ehrenfeucht, A., T. Harju, and G. Rozenberg. "Permutable transformation semigroups." Semigroup Forum 47, no. 1 (1993): 123–25. http://dx.doi.org/10.1007/bf02573748.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Foguel, Tuval. "Conjugate-Permutable Subgroups." Journal of Algebra 191, no. 1 (1997): 235–39. http://dx.doi.org/10.1006/jabr.1996.6924.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Permutable"

1

Lundqvist, Anders. "Cyclically permutable codes." Doctoral thesis, Linköpings universitet, Datatransmission, 1997. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-123299.

Full text

Abstract:

A cyclically permutable code is a set of codewords having the property that no codeword is a cyclic shift of another codeword. We study the problem of constructing cyclically permutable codes of large size and low correlation. Cyclically permutable codes are used in code-division multiple-access systems realized by e.g. direct-sequence modulation or frequency-hopping. Advantages of code-division multiple-access to conventional access methods, such as timedivision and frequency-division, include greater flexibility, better robustness and that no synchronization among the transmitters is needed.

APA, Harvard, Vancouver, ISO, and other styles

2

Chifman, Julia. "DIRECT PRODUCTS AND THE INTERSECTION MAP OF CERTAIN CLASSES OF FINITE GROUPS." UKnowledge, 2009. http://uknowledge.uky.edu/gradschool_diss/839.

Full text

Abstract:

The main goal of this work is to examine classes of finite groups in which normality, permutability and Sylow-permutability are transitive relations. These classes of groups are called T , PT and PST , respectively. The main focus is on direct products of T , PT and PST groups and the behavior of a collection of cyclic normal, permutable and Sylow-permutable subgroups under the intersection map. In general, a direct product of finitely many groups from one of these classes does not belong to the same class, unless the orders of the direct factors are relatively prime. Examples suggest that for

APA, Harvard, Vancouver, ISO, and other styles

3

Wong, Raphael C. "Wireless cyclically permutable code based EMG system for assistive devices." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape11/PQDD_0007/MQ45614.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

So, Hon Chung. "The Julia sets of certain classes of permutable entire functions /." View abstract or full-text, 2007. http://library.ust.hk/cgi/db/thesis.pl?MATH%202007%20SO.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Betin, Cansu. "Barely Transitive Groups." Phd thesis, METU, 2007. http://etd.lib.metu.edu.tr/upload/3/12608605/index.pdf.

Full text

Abstract:

A group G is called a barely transitive group if it acts transitively and faithfully on an infinite set and every orbit of every proper subgroup is finite. A subgroup H of a group G is called a permutable subgroup, if H commutes with every subgroup of G. We showed that if an infinitely generated barely transitive group G has a permutable point stabilizer, then G is locally finite. We proved that if a barely transitive group G has an abelian point stabilizer H, then G is isomorphic to one of the followings: (i) G is a metabelian locally finite p-group, (ii) G is a finitely generated quasi-finit

APA, Harvard, Vancouver, ISO, and other styles

6

Davidson, Colin. "Reductions and Triangularizations of Sets of Matrices." Thesis, University of Waterloo, 2006. http://hdl.handle.net/10012/2918.

Full text

Abstract:

Families of operators that are triangularizable must necessarily satisfy a number of spectral mapping properties. These necessary conditions are often sufficient as well. This thesis investigates such properties in finite dimensional and infinite dimensional Banach spaces. In addition, we investigate whether approximate spectral mapping conditions (being "close" in some sense) is similarly a sufficient condition.

APA, Harvard, Vancouver, ISO, and other styles

7

Yahouni, Zakaria. "Le meilleur des cas pour l’ordonnancement de groupes : Un nouvel indicateur proactif-réactif pour l’ordonnancement sous incertitudes." Thesis, Ecole centrale de Nantes, 2017. http://www.theses.fr/2017ECDN0010/document.

Full text

Abstract:

Cette thèse représente une étude d'un nouvel indicateur d'aide à la décision pour le problème d'ordonnancement d'ateliers de production sous présence d'incertitudes. Les contributions apportées dans ce travail se situent dans le contexte des groupes d'opérations permutables. Cette approche consiste à proposer une solution d'ordonnancement flexible caractérisant un ensemble fini non-énuméré d'ordonnancements. Un opérateur est ensuite censé sélectionner l'ordonnancement qui répond le mieux aux perturbations survenues dans l'atelier. Nous nous intéressons plus particulièrement à cette phase de sé

APA, Harvard, Vancouver, ISO, and other styles

8

Kaufmann, Sacchetto Lucas. "Dynamique holomorphe, théorie du pluripotentiel et applications." Thesis, Paris 6, 2016. http://www.theses.fr/2016PA066155/document.

Full text

Abstract:

Cette thèse est consacrée à l'étude de quelques problèmes en dynamique holomorphe discrete et continue à l'aide de la Théorie du Pluripotentiel. Le premier problème présenté concerne la description des paires d'endomorphismes holomorphes permutables du plan projectif complexe qui ne partagent pas une itérée. Nous nous intéressons au cas où les degrés des deux applications coïncident après un certain nombre d'itérations. Nous montrons que telles applications sont des exemples de Lattès ou bien des relèvements des exemples de Lattès unidimensionnels. Combiné avec un théorème de T.-C. Dinh et N.

APA, Harvard, Vancouver, ISO, and other styles

9

Bayer, Tomáš. "Návrh hardwarového šifrovacího modulu." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2009. http://www.nusl.cz/ntk/nusl-218076.

Full text

Abstract:

This diploma’s thesis discourses the cryptographic systems and ciphers, whose function, usage and practical implementation are analysed. In the first chapter basic cryptographic terms, symmetric and asymetric cryptographic algorithms and are mentioned. Also usage and reliability are analysed. Following chapters mention substitution, transposition, block and stream ciphers, which are elementary for most cryptographic algorithms. There are also mentioned the modes, which the ciphers work in. In the fourth chapter are described the principles of some chosen cryptographic algorithms. The objective

APA, Harvard, Vancouver, ISO, and other styles

10

Gao, Bing-Fong, and 高斌峰. "Construction of Cyclically Permutable Codes from Cyclic Codes." Thesis, 2018. http://ndltd.ncl.edu.tw/handle/7d8w9u.

Full text

Abstract:

碩士<br>國立中興大學<br>電機工程學系所<br>106<br>This thesis mainly discusses how to construct a Cyclically Permutable Code(CPC) quickly from a Cyclic Code. The CPC is a codeword with a full cyclic order. The construction mainly uses Galois Field Fourier Transform (GFFT) and the characteristics of Cyclic Codes to construct CPC. So we will use two characteristics, conjugate and translation. Through the conjugate and translation properties we can construct tables to make it easier for us to analyze. This thesis will use examples to illustrate how to quickly construct CPC from Cyclic Codes where n is prime and

APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Permutable"

1

Wong, Raphael C. Wireless cyclically permutable code based EMG system for assistive devices. National Library of Canada, 1999.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

Cuypers, Hans. Geometries and permutation groups of small rank =: Meetkunden en permutatie groepen van lage rang. [s.n.], 1989.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Permutable"

1

Nagy, Attila. "n (2)-permutable semigroups." In Special Classes of Semigroups. Springer US, 2001. http://dx.doi.org/10.1007/978-1-4757-3316-7_16.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Michel, FranÇois, Pierre Azéma, and FranÇois Vernadat. "Permutable agents in process algebras." In Tools and Algorithms for the Construction and Analysis of Systems. Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-61042-1_45.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Gillibert, Pierre, and Friedrich Wehrung. "Congruence-Permutable, Congruence-Preserving Extensions of Lattices." In Lecture Notes in Mathematics. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-21774-6_5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Guo, Wenbin. "Groups With Given Systems of X-Permutable Subgroups." In Structure Theory for Canonical Classes of Finite Groups. Springer Berlin Heidelberg, 2015. http://dx.doi.org/10.1007/978-3-662-45747-4_2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Wang, Yuefei. "Fatou Sets of Permutable Functions Satisfying Functional Equations." In Proceedings of the Second ISAAC Congress. Springer US, 2000. http://dx.doi.org/10.1007/978-1-4613-0271-1_13.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Vasilescu, F. H. "Joint Spectral Properties for Pairs of Permutable Selfadjoint Transformations." In Linear Operators in Function Spaces. Birkhäuser Basel, 1990. http://dx.doi.org/10.1007/978-3-0348-7250-8_24.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Artigues, Christian, Jean-Charles Billaut, Azzedine Cheref, Nasser Mebarki, and Zakaria Yahouni. "Robust Machine Scheduling Based on Group of Permutable Jobs." In Robustness Analysis in Decision Aiding, Optimization, and Analytics. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-33121-8_9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Xia, Shutao, and Fangwei Fu. "Nonperiodic cyclic equivalence classes of cyclic codes and algebraic constructions of cyclically permutable codes." In Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/3-540-63163-1_27.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Arkin, Esther M., Refael Hassin, Shlomi Rubinstein, and Maxim Sviridenko. "Approximations for Maximum Transportation Problem with Permutable Supply Vector and Other Capacitated Star Packing Problems." In Algorithm Theory — SWAT 2002. Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45471-3_29.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

"Chapter 2. Groups whose subnormal subgroups are normal, permutable, or Sylow-permutable." In de Gruyter Expositions in Mathematics. DE GRUYTER, 2010. http://dx.doi.org/10.1515/9783110220612.52.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Permutable"

1

da Rocha, V. C., and J. S. Lemos-Neto. "New cyclically permutable codes." In 2011 IEEE Information Theory Workshop (ITW). IEEE, 2011. http://dx.doi.org/10.1109/itw.2011.6089586.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Moreno, Oscar, and Jose Ortiz-Ubarri. "Group permutable constant weight codes." In 2010 IEEE Information Theory Workshop (ITW 2010). IEEE, 2010. http://dx.doi.org/10.1109/cig.2010.5592644.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Kuribayashi, Minoru, Shodai Suma, and Nobuo Funabiki. "Efficient Decoding Algorithm for Cyclically Permutable Code." In 2018 IEEE Information Theory Workshop (ITW). IEEE, 2018. http://dx.doi.org/10.1109/itw.2018.8613319.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Takacs, Gabriel, Vijay Chandrasekhar, Huizhong Chen, et al. "Permutable descriptors for orientation-invariant image matching." In SPIE Optical Engineering + Applications, edited by Andrew G. Tescher. SPIE, 2010. http://dx.doi.org/10.1117/12.863993.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

BALLESTER-BOLINCHES, A. "TOTALLY AND MUTUALLY PERMUTABLE PRODUCTS OF FINITE GROUPS." In Proceedings of the International Conference. WORLD SCIENTIFIC, 2001. http://dx.doi.org/10.1142/9789812810243_0012.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Yang, Ting-Ya, Houshou Chen, and Kuo-Cheng Chung. "Construction of Cyclically Permutable Codes From Cyclic Codes." In The 3rd IIAE International Conference on Intelligent Systems and Image Processing 2015. The Institute of Industrial Application Engineers, 2015. http://dx.doi.org/10.12792/icisip2015.029.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Al-Sharo, Doaa Mustafa, and Hajar Sulaiman. "C-normal and C-permutable subgroups in finite groups." In INTERNATIONAL CONFERENCE ON QUANTITATIVE SCIENCES AND ITS APPLICATIONS (ICOQSIA 2014): Proceedings of the 3rd International Conference on Quantitative Sciences and Its Applications. AIP Publishing LLC, 2014. http://dx.doi.org/10.1063/1.4903611.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Hu, Gongzhu. "Permutable Queue as a 1-in-N-out Message Router." In 5th ACIS International Conference on Software Engineering Research, Management & Applications (SERA 2007). IEEE, 2007. http://dx.doi.org/10.1109/sera.2007.106.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Martirosyan, Samvel, A. J. Han Vinck, and Ashot N. Harutyunyan. "On Optical Orthogonal, Cyclically Permutable, and Super Optical Orthogonal Codes." In 2007 IEEE International Symposium on Information Theory. IEEE, 2007. http://dx.doi.org/10.1109/isit.2007.4557579.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Ting-Ya Yang, Houshou Chen, and Kuo-Cheng Chung. "Generation of cyclically permutable codes by galois field Fourier transform." In 2016 Eighth International Conference on Ubiquitous and Future Networks (ICUFN). IEEE, 2016. http://dx.doi.org/10.1109/icufn.2016.7537041.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Permutable"

1

Elkholy, Abd-Elmoneim Mohamed, Mohamed Hussein Hafez Abd-ellatif, and Sarah Hassan El-sherif. Influence of S-permutable GS-subgroups on Finite Groups. "Prof. Marin Drinov" Publishing House of Bulgarian Academy of Sciences, 2019. http://dx.doi.org/10.7546/crabs.2019.07.01.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!