Zaloguj się

Gotowe bibliografie tematyczne / Permutation groups / Artykuły w czasopismach

Artykuły w czasopismach na temat „Permutation groups”

Kliknij ten link, aby zobaczyć inne rodzaje publikacji na ten temat: Permutation groups.

Autor: Grafiati

Data publikacji: 4 czerwca 2021

Data aktualizacji: 4 marca 2023

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Sprawdź 50 najlepszych artykułów w czasopismach naukowych na temat „Permutation groups”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Przeglądaj artykuły w czasopismach z różnych dziedzin i twórz odpowiednie bibliografie.

1

Niemenmaa, Markku. "Decomposition of Transformation Groups of Permutation Machines". Fundamenta Informaticae 10, nr 4 (1.10.1987): 363–67. http://dx.doi.org/10.3233/fi-1987-10403.

Pełny tekst źródła

Streszczenie:

By a permutation machine we mean a triple (Q,S,F), where Q and S are finite sets and F is a function Q × S → Q which defines a permutation on Q for every element from S. These permutations generate a permutation group G and by considering the structure of G we can obtain efficient ways to decompose the transformation group (Q,G). In this paper we first consider the situation where G is half-transitive and after this we show how to use our result in the general non-transitive case.

Style APA, Harvard, Vancouver, ISO itp.

2

Burns, J. M., B. Goldsmith, B. Hartley i R. Sandling. "On quasi-permutation representations of finite groups". Glasgow Mathematical Journal 36, nr 3 (wrzesień 1994): 301–8. http://dx.doi.org/10.1017/s0017089500030901.

Pełny tekst źródła

Streszczenie:

In [6], Wong defined a quasi-permutation group of degree n to be a finite group G of automorphisms of an n-dimensional complex vector space such that every element of G has non-negative integral trace. The terminology derives from the fact that if G is a finite group of permutations of a set ω of size n, and we think of G as acting on the complex vector space with basis ω, then the trace of an element g ∈ G is equal to the number of points of ω fixed by g. In [6] and [7], Wong studied the extent to which some facts about permutation groups generalize to the quasi-permutation group situation. Here we investigate further the analogy between permutation groups and quasipermutation groups by studying the relation between the minimal degree of a faithful permutation representation of a given finite group G and the minimal degree of a faithful quasi-permutation representation. We shall often prefer to work over the rational field rather than the complex field.

Style APA, Harvard, Vancouver, ISO itp.

3

Bigelow, Stephen. "Supplements of bounded permutation groups". Journal of Symbolic Logic 63, nr 1 (marzec 1998): 89–102. http://dx.doi.org/10.2307/2586590.

Pełny tekst źródła

Streszczenie:

AbstractLet λ ≤ κ be infinite cardinals and let Ω be a set of cardinality κ. The bounded permutation group Bλ(Ω), or simply Bλ, is the group consisting of all permutations of Ω which move fewer than λ points in Ω. We say that a permutation group G acting on Ω is a supplement of Bλ if BλG is the full symmetric group on Ω.In [7], Macpherson and Neumann claimed to have classified all supplements of bounded permutation groups. Specifically, they claimed to have proved that a group G acting on the set Ω is a supplement of Bλ if and only if there exists Δ ⊂ Ω with ∣Δ∣ < λ such that the setwise stabiliser G{Δ} acts as the full symmetric group on Ω ∖ Δ. However I have found a mistake in their proof. The aim of this paper is to examine conditions under which Macpherson and Neumann's claim holds, as well as conditions under which a counterexample can be constructed. In the process we will discover surprising links with cardinal arithmetic and Shelah's recently developed pcf theory.

Style APA, Harvard, Vancouver, ISO itp.

4

Cohen, Stephen D. "Permutation polynomials and primitive permutation groups". Archiv der Mathematik 57, nr 5 (listopad 1991): 417–23. http://dx.doi.org/10.1007/bf01246737.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

5

Boy de la Tour, Thierry, i Mnacho Echenim. "On leaf permutative theories and occurrence permutation groups". Electronic Notes in Theoretical Computer Science 86, nr 1 (maj 2003): 61–75. http://dx.doi.org/10.1016/s1571-0661(04)80653-4.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

6

Tovstyuk, K. D., C. C. Tovstyuk i O. O. Danylevych. "The Permutation Group Theory and Electrons Interaction". International Journal of Modern Physics B 17, nr 21 (20.08.2003): 3813–30. http://dx.doi.org/10.1142/s0217979203021812.

Pełny tekst źródła

Streszczenie:

The new mathematical formalism for the Green's functions of interacting electrons in crystals is constructed. It is based on the theory of Green's functions and permutation groups. We constructed a new object of permutation groups, which we call double permutation (DP). DP allows one to take into consideration the symmetry of the ground state as well as energy and momentum conservation in every virtual interaction. We developed the classification of double permutations and proved the theorem, which allows the selection of classes of associated double permutations (ADP). The Green's functions are constructed for series of ADP. We separate in the DP the convolving columns by replacing the initial interaction between the particles with the effective interaction. In convoluting the series for Green's functions, we use the methods developed for permutation groups schemes of Young–Yamanuti.

Style APA, Harvard, Vancouver, ISO itp.

7

Cameron, Peter J. "Cofinitary Permutation Groups". Bulletin of the London Mathematical Society 28, nr 2 (marzec 1996): 113–40. http://dx.doi.org/10.1112/blms/28.2.113.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

8

Lucchini, A., F. Menegazzo i M. Morigi. "Generating Permutation Groups". Communications in Algebra 32, nr 5 (31.12.2004): 1729–46. http://dx.doi.org/10.1081/agb-120029899.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

9

Kearnes, Keith A. "Collapsing permutation groups". Algebra Universalis 45, nr 1 (1.02.2001): 35–51. http://dx.doi.org/10.1007/s000120050200.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

10

Guralnick, Robert M., i David Perkinson. "Permutation polytopes and indecomposable elements in permutation groups". Journal of Combinatorial Theory, Series A 113, nr 7 (październik 2006): 1243–56. http://dx.doi.org/10.1016/j.jcta.2005.11.004.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

11

Liebeck, Martin W., i Aner Shalev. "Simple groups, permutation groups, and probability". Journal of the American Mathematical Society 12, nr 2 (1999): 497–520. http://dx.doi.org/10.1090/s0894-0347-99-00288-x.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

12

Chalapathi, T., i R. V. "Graphs of Permutation Groups". International Journal of Computer Applications 179, nr 3 (15.12.2017): 14–19. http://dx.doi.org/10.5120/ijca2017915872.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

13

Burness, Timothy C., i Emily V. Hall. "Almost elusive permutation groups". Journal of Algebra 594 (marzec 2022): 519–43. http://dx.doi.org/10.1016/j.jalgebra.2021.11.037.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

14

Lucchini, Andrea, Marta Morigi i Mariapia Moscatiello. "Primitive permutation IBIS groups". Journal of Combinatorial Theory, Series A 184 (listopad 2021): 105516. http://dx.doi.org/10.1016/j.jcta.2021.105516.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

15

Conway, John H., Alexander Hulpke i John McKay. "On Transitive Permutation Groups". LMS Journal of Computation and Mathematics 1 (1998): 1–8. http://dx.doi.org/10.1112/s1461157000000115.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

16

Gerner, M. "Predicate-Induced Permutation Groups". Journal of Semantics 29, nr 1 (13.10.2011): 109–44. http://dx.doi.org/10.1093/jos/ffr007.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

17

Adeleke, S. A., i Peter M. Neumann. "Infinite Bounded Permutation Groups". Journal of the London Mathematical Society 53, nr 2 (kwiecień 1996): 230–42. http://dx.doi.org/10.1112/jlms/53.2.230.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

18

KOVÁCS, L. G., i M. F. NEWMAN. "GENERATING TRANSITIVE PERMUTATION GROUPS". Quarterly Journal of Mathematics 39, nr 3 (1988): 361–72. http://dx.doi.org/10.1093/qmath/39.3.361.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

19

Neumann, Peter M. "Some Primitive Permutation Groups". Proceedings of the London Mathematical Society s3-50, nr 2 (marzec 1985): 265–81. http://dx.doi.org/10.1112/plms/s3-50.2.265.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

20

Atkinson, M. D. "Permutation Involvement and Groups". Quarterly Journal of Mathematics 52, nr 4 (1.12.2001): 415–21. http://dx.doi.org/10.1093/qjmath/52.4.415.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

21

Cossey, John. "Quotients of permutation groups". Bulletin of the Australian Mathematical Society 57, nr 3 (czerwiec 1998): 493–95. http://dx.doi.org/10.1017/s0004972700031907.

Pełny tekst źródła

Streszczenie:

If G is a finite permutation group of degree d and N is a normal subgroup of G, Derek Holt has given conditions which show that in some important special cases the least degree of a faithful permutation representation of the quotient G/N will be no larger than d. His conditions do not apply in all cases of interest and he remarks that it would be interesting to know if G/F(G) has a faithful representation of degree no larger than d (where F(G) is the Fitting subgroup of G). We prove in this note that this is the case.

Style APA, Harvard, Vancouver, ISO itp.

22

Cigler, Grega. "Permutation-like matrix groups". Linear Algebra and its Applications 422, nr 2-3 (kwiecień 2007): 486–505. http://dx.doi.org/10.1016/j.laa.2006.11.007.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

23

Mazurov, V. D. "2-Transitive permutation groups". Siberian Mathematical Journal 31, nr 4 (1991): 615–17. http://dx.doi.org/10.1007/bf00970632.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

24

Galvin, Fred. "Almost disjoint permutation groups". Proceedings of the American Mathematical Society 124, nr 6 (1996): 1723–25. http://dx.doi.org/10.1090/s0002-9939-96-03264-9.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

25

Hulpke, Alexander. "Constructing transitive permutation groups". Journal of Symbolic Computation 39, nr 1 (styczeń 2005): 1–30. http://dx.doi.org/10.1016/j.jsc.2004.08.002.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

26

Cameron, Peter J. "Cycle-closed permutation groups". Journal of Algebraic Combinatorics 5, nr 4 (październik 1996): 315–22. http://dx.doi.org/10.1007/bf00193181.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

27

Grech, Mariusz. "Graphical cyclic permutation groups". Discrete Mathematics 337 (grudzień 2014): 25–33. http://dx.doi.org/10.1016/j.disc.2014.08.006.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

28

Bichon, Julien. "ALGEBRAIC QUANTUM PERMUTATION GROUPS". Asian-European Journal of Mathematics 01, nr 01 (marzec 2008): 1–13. http://dx.doi.org/10.1142/s1793557108000023.

Pełny tekst źródła

Streszczenie:

We discuss some algebraic aspects of quantum permutation groups, working over arbitrary fields. If 𝕂 is any characteristic zero field, we show that there exists a universal cosemisimple Hopf algebra coacting on the diagonal algebra 𝕂n: this is a refinement of Wang's universality theorem for the (compact) quantum permutation group. We also prove a structural result for Hopf algebras having a non-ergodic coaction on the diagonal algebra 𝕂n, on which we determine the possible group gradings when 𝕂 is algebraically closed and has characteristic zero.

Style APA, Harvard, Vancouver, ISO itp.

29

Neumann, Peter M., i Cheryl E. Praeger. "Three-star permutation groups". Illinois Journal of Mathematics 47, nr 1-2 (marzec 2003): 445–52. http://dx.doi.org/10.1215/ijm/1258488164.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

30

Franchi, Clara. "Abelian sharp permutation groups". Journal of Algebra 283, nr 1 (styczeń 2005): 1–5. http://dx.doi.org/10.1016/j.jalgebra.2004.06.031.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

31

Kuzucuoğlu, M. "Barely transitive permutation groups". Archiv der Mathematik 55, nr 6 (grudzień 1990): 521–32. http://dx.doi.org/10.1007/bf01191686.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

32

Li, Jiongsheng. "TheL-sharp permutation groups". Science in China Series A: Mathematics 43, nr 1 (styczeń 2000): 22–27. http://dx.doi.org/10.1007/bf02903844.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

33

Khashaev, Arthur A. "On the membership problem for finite automata over symmetric groups". Discrete Mathematics and Applications 32, nr 6 (1.12.2022): 383–89. http://dx.doi.org/10.1515/dma-2022-0033.

Pełny tekst źródła

Streszczenie:

Abstract We consider automata in which transitions are labelled with arbitrary permutations. The language of such an automaton consists of compositions of permutations for all possible admissible computation paths. The membership problem for finite automata over symmetric groups is the following decision problem: does a given permutation belong to the language of a given automaton? We show that this problem is NP-complete. We also propose an efficient algorithm for the case of strongly connected automata.

Style APA, Harvard, Vancouver, ISO itp.

34

Pearson, Mike, i Ian Short. "Magic letter groups". Mathematical Gazette 91, nr 522 (listopad 2007): 493–99. http://dx.doi.org/10.1017/s0025557200182130.

Pełny tekst źródła

Streszczenie:

Certain numeric puzzles, known as ‘magic letters’, each have a finite permutation group associated with them in a natural manner. We describe how the isomorphism type of these permutation groups relates to the structure of the magic letters.

Style APA, Harvard, Vancouver, ISO itp.

35

Vesanen, Ari. "Finite classical groups and multiplication groups of loops". Mathematical Proceedings of the Cambridge Philosophical Society 117, nr 3 (maj 1995): 425–29. http://dx.doi.org/10.1017/s0305004100073278.

Pełny tekst źródła

Streszczenie:

Let Q be a loop; then the left and right translations La(x) = ax and Ra(x) = xa are permutations of Q. The permutation group M(Q) = 〈La, Ra | a ε Q〉 is called the multiplication group of Q; it is well known that the structure of M(Q) reflects strongly the structure of Q (cf. [1] and [8], for example). It is thus an interesting question, which groups can be represented as multiplication groups of loops. In particular, it seems important to classify the finite simple groups that are multiplication groups of loops. In [3] it was proved that the alternating groups An are multiplication groups of loops, whenever n ≥ 6; in this paper we consider the finite classical groups and prove the following theorems

Style APA, Harvard, Vancouver, ISO itp.

36

Grech, Mariusz, i Andrzej Kisielewicz. "Cyclic Permutation Groups that are Automorphism Groups of Graphs". Graphs and Combinatorics 35, nr 6 (13.09.2019): 1405–32. http://dx.doi.org/10.1007/s00373-019-02096-1.

Pełny tekst źródła

Streszczenie:

Abstract In this paper we establish conditions for a permutation group generated by a single permutation to be an automorphism group of a graph. This solves the so called concrete version of König’s problem for the case of cyclic groups. We establish also similar conditions for the symmetry groups of other related structures: digraphs, supergraphs, and boolean functions.

Style APA, Harvard, Vancouver, ISO itp.

37

Gill, Nick, i Pablo Spiga. "Binary permutation groups: Alternating and classical groups". American Journal of Mathematics 142, nr 1 (2020): 1–43. http://dx.doi.org/10.1353/ajm.2020.0000.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

38

Banica, Teodor, Julien Bichon i Sonia Natale. "Finite quantum groups and quantum permutation groups". Advances in Mathematics 229, nr 6 (kwiecień 2012): 3320–38. http://dx.doi.org/10.1016/j.aim.2012.02.012.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

39

BRYANT, R. M., L. G. KOVÁCS i G. R. ROBINSON. "TRANSITIVE PERMUTATION GROUPS AND IRREDUCIBLE LINEAR GROUPS". Quarterly Journal of Mathematics 46, nr 4 (1995): 385–407. http://dx.doi.org/10.1093/qmath/46.4.385.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

40

Heath-Brown, D. R., Cheryl E. Praeger i Aner Shalev. "Permutation groups, simple groups, and sieve methods". Israel Journal of Mathematics 148, nr 1 (grudzień 2005): 347–75. http://dx.doi.org/10.1007/bf02775443.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

41

Burov, Dmitry A. "Subgroups of direct products of groups invariant under the action of permutations on factors". Discrete Mathematics and Applications 30, nr 4 (26.08.2020): 243–55. http://dx.doi.org/10.1515/dma-2020-0021.

Pełny tekst źródła

Streszczenie:

AbstractWe study subgroups of the direct product of two groups invariant under the action of permutations on factors. An invariance criterion for the subdirect product of two groups under the action of permutations on factors is put forward. Under certain additional constraints on permutations, we describe the subgroups of the direct product of a finite number of groups that are invariant under the action of permutations on factors. We describe the subgroups of the additive group of vector space over a finite field of characteristic 2 which are invariant under the coordinatewise action of inversion permutation of nonzero elements of the field.

Style APA, Harvard, Vancouver, ISO itp.

42

., Haci Aktas. "On Finite Topological Permutation Groups". Journal of Applied Sciences 2, nr 1 (15.12.2001): 60–61. http://dx.doi.org/10.3923/jas.2002.60.61.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

43

Jones, Gareth. "Combinatorial categories and permutation groups". Ars Mathematica Contemporanea 10, nr 2 (20.10.2015): 237–54. http://dx.doi.org/10.26493/1855-3974.545.fd5.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

44

Neumann, Peter M. "Homogeneity of Infinite Permutation Groups". Bulletin of the London Mathematical Society 20, nr 4 (lipiec 1988): 305–12. http://dx.doi.org/10.1112/blms/20.4.305.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

45

Birszki, Bálint. "ON PRIMITIVE SHARP PERMUTATION GROUPS". Communications in Algebra 30, nr 6 (19.06.2002): 3013–23. http://dx.doi.org/10.1081/agb-120004005.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

46

Moshe, Yossi. "ON PERMUTATION GROUPS AND PARTITIONS". Communications in Algebra 30, nr 10 (12.01.2002): 4889–903. http://dx.doi.org/10.1081/agb-120014674.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

47

Ponomarev, K. N. "Permutation modules of profinite groups". Siberian Mathematical Journal 58, nr 4 (lipiec 2017): 687–92. http://dx.doi.org/10.1134/s0037446617040152.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

48

Macpherson, H. D. "Orbits of Infinite Permutation Groups". Proceedings of the London Mathematical Society s3-51, nr 2 (wrzesień 1985): 246–84. http://dx.doi.org/10.1112/plms/s3-51.2.246.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

49

Brozovic, Douglas P. "On primitive sharp permutation groups". Communications in Algebra 24, nr 12 (styczeń 1996): 3979–94. http://dx.doi.org/10.1080/00927879608825797.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

50

CAMERON, PETER J., i ALEXANDER W. DENT. "ORBIT-HOMOGENEITY IN PERMUTATION GROUPS". Bulletin of the London Mathematical Society 38, nr 04 (24.07.2006): 587–96. http://dx.doi.org/10.1112/s0024609306018601.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!