Thematische Bibliographien / Permutation groups

Inhaltsverzeichnis

Zeitschriftenartikel
Dissertationen
Bücher
Buchteile
Konferenzberichte
Berichte der Organisationen

Auswahl der wissenschaftlichen Literatur zum Thema „Permutation groups“

Autor: Grafiati

Veröffentlicht am 4. Juni 2021

Zuletzt aktualisiert am 31. Juli 2024

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Permutation groups" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Zeitschriftenartikel zum Thema "Permutation groups"

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

Der volle Inhalt der Quelle

Annotation:

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.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Burns, J. M., B. Goldsmith, B. Hartley und R. Sandling. „On quasi-permutation representations of finite groups“. Glasgow Mathematical Journal 36, Nr. 3 (September 1994): 301–8. http://dx.doi.org/10.1017/s0017089500030901.

Der volle Inhalt der Quelle

Annotation:

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.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Bigelow, Stephen. „Supplements of bounded permutation groups“. Journal of Symbolic Logic 63, Nr. 1 (März 1998): 89–102. http://dx.doi.org/10.2307/2586590.

Der volle Inhalt der Quelle

Annotation:

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.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Tovstyuk, K. D., C. C. Tovstyuk und 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.

Der volle Inhalt der Quelle

Annotation:

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.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Senashov, Vasily S., Konstantin A. Filippov und Anatoly K. Shlepkin. „Regular permutations and their applications in crystallography“. E3S Web of Conferences 525 (2024): 04002. http://dx.doi.org/10.1051/e3sconf/202452504002.

Der volle Inhalt der Quelle

Annotation:

The representation of a group G in the form of regular permutations is widely used for studying the structure of finite groups, in particular, parameters like the group density function. This is related to the increased potential of computer technologies for conducting calculations. The work addresses the problem of calculation regular permutations with restrictions on the structure of the degree and order of permutations. The considered regular permutations have the same nontrivial order, which divides the degree of the permutation. Examples of the application of permutation groups in crystallography and crystal chemistry are provided.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Cameron, Peter J. „Cofinitary Permutation Groups“. Bulletin of the London Mathematical Society 28, Nr. 2 (März 1996): 113–40. http://dx.doi.org/10.1112/blms/28.2.113.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Kearnes, Keith A. „Collapsing permutation groups“. Algebra Universalis 45, Nr. 1 (01.02.2001): 35–51. http://dx.doi.org/10.1007/s000120050200.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Dissertationen zum Thema "Permutation groups"

Cox, Charles. „Infinite permutation groups containing all finitary permutations“. Thesis, University of Southampton, 2016. https://eprints.soton.ac.uk/401538/.

Der volle Inhalt der Quelle

Annotation:

Groups naturally occu as the symmetries of an object. This is why they appear in so many different areas of mathematics. For example we find class grops in number theory, fundamental groups in topology, and amenable groups in analysis. In this thesis we will use techniques and approaches from various fields in order to study groups. This is a 'three paper' thesis, meaning that the main body of the document is made up of three papers. The first two of these look at permutation groups which contain all permutations with finite support, the first focussing on decision problems and the second on the R? property (which involves counting the number of twisting conjugacy classes in a group). The third works with wreath products C}Z where C is cyclic, and looks to dermine the probability of choosing two elements in a group which commute (known as the degree of commutativity, a topic which has been studied for finite groups intensely but at the time of writing this thesis has only two papers involving infinite groups, one of which is in this thesis).

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Hyatt, Matthew. „Quasisymmetric Functions and Permutation Statistics for Coxeter Groups and Wreath Product Groups“. Scholarly Repository, 2011. http://scholarlyrepository.miami.edu/oa_dissertations/609.

Der volle Inhalt der Quelle

Annotation:

Eulerian quasisymmetric functions were introduced by Shareshian and Wachs in order to obtain a q-analog of Euler's exponential generating function formula for the Eulerian polynomials. They are defined via the symmetric group, and applying the stable and nonstable principal specializations yields formulas for joint distributions of permutation statistics. We consider the wreath product of the cyclic group with the symmetric group, also known as the group of colored permutations. We use this group to introduce colored Eulerian quasisymmetric functions, which are a generalization of Eulerian quasisymmetric functions. We derive a formula for the generating function of these colored Eulerian quasisymmetric functions, which reduces to a formula of Shareshian and Wachs for the Eulerian quasisymmetric functions. We show that applying the stable and nonstable principal specializations yields formulas for joint distributions of colored permutation statistics. The family of colored permutation groups includes the family of symmetric groups and the family of hyperoctahedral groups, also called the type A Coxeter groups and type B Coxeter groups, respectively. By specializing our formulas to these cases, they reduce to the Shareshian-Wachs q-analog of Euler's formula, formulas of Foata and Han, and a new generalization of a formula of Chow and Gessel.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Kuzucuoglu, M. „Barely transitive permutation groups“. Thesis, University of Manchester, 1987. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.233097.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Lajeunesse, Lisa (Lisa Marie) Carleton University Dissertation Mathematics and Statistics. „Models and permutation groups“. Ottawa, 1996.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Schaefer, Artur. „Synchronizing permutation groups and graph endomorphisms“. Thesis, University of St Andrews, 2016. http://hdl.handle.net/10023/9912.

Der volle Inhalt der Quelle

Annotation:

The current thesis is focused on synchronizing permutation groups and on graph endo- morphisms. Applying the implicit classification of rank 3 groups, we provide a bound on synchronizing ranks of rank 3 groups, at first. Then, we determine the singular graph endomorphisms of the Hamming graph and related graphs, count Latin hypercuboids of class r, establish their relation to mixed MDS codes, investigate G-decompositions of (non)-synchronizing semigroups, and analyse the kernel graph construction used in the theorem of Cameron and Kazanidis which identifies non-synchronizing transformations with graph endomorphisms [20]. The contribution lies in the following points: 1. A bound on synchronizing ranks of groups of permutation rank 3 is given, and a complete list of small non-synchronizing groups of permutation rank 3 is provided (see Chapter 3). 2. The singular endomorphisms of the Hamming graph and some related graphs are characterised (see Chapter 5). 3. A theorem on the extension of partial Latin hypercuboids is given, Latin hyper- cuboids for small values are counted, and their correspondence to mixed MDS codes is unveiled (see Chapter 6). 4. The research on normalizing groups from [3] is extended to semigroups of the form < G, T >, and decomposition properties of non-synchronizing semigroups are described which are then applied to semigroups induced by combinatorial tiling problems (see Chapter 7). 5. At last, it is shown that all rank 3 graphs admitting singular endomorphisms are hulls and it is conjectured that a hull on n vertices has minimal generating set of at most n generators (see Chapter 8).

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Fawcett, Joanna Bethia. „Bases of primitive permutation groups“. Thesis, University of Cambridge, 2013. https://www.repository.cam.ac.uk/handle/1810/252304.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Spiga, Pablo. „P elements in permutation groups“. Thesis, Queen Mary, University of London, 2004. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.413152.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

McNab, C. A. „Some problems in permutation groups“. Thesis, University of Oxford, 1987. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.382633.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Astles, David Christopher. „Permutation groups acting on subsets“. Thesis, University of East Anglia, 1990. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.280040.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Yang, Keyan. „On Orbit Equivalent Permutation Groups“. The Ohio State University, 2008. http://rave.ohiolink.edu/etdc/view?acc_num=osu1222455916.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Bücher zum Thema "Permutation groups"

Passman, Donald S. Permutation groups. Mineola, N.Y: Dover Publications, Inc., 2012.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Cameron, Peter J. Oligomorphic permutation groups. Cambridge: Cambridge University Press, 1990.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Cameron, Peter J. Permutation groups. Cambridge: Cambridge University Press, 1999.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Dixon, John D., und Brian Mortimer. Permutation Groups. New York, NY: Springer New York, 1996. http://dx.doi.org/10.1007/978-1-4612-0731-3.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Brian, Mortimer, Hrsg. Permutation groups. New York: Springer, 1996.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Charles, Holland W., Hrsg. Ordered groups and infinite permutation groups. Dordrecht: Kluwer Academic Publishers, 1996.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

1965-, Bhattacharjee M., Hrsg. Notes on infinite permutation groups. Berlin: Springer, 1998.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Holland, W. Charles, Hrsg. Ordered Groups and Infinite Permutation Groups. Boston, MA: Springer US, 1996. http://dx.doi.org/10.1007/978-1-4613-3443-9.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Bhattacharjee, Meenaxi, Dugald Macpherson, Rögnvaldur G. Möller und Peter M. Neumann. Notes on Infinite Permutation Groups. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/bfb0092550.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Butler, Gregory, Hrsg. Fundamental Algorithms for Permutation Groups. Berlin, Heidelberg: Springer Berlin Heidelberg, 1991. http://dx.doi.org/10.1007/3-540-54955-2.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Buchteile zum Thema "Permutation groups"

Camina, Alan, und Barry Lewis. „Permutation Groups“. In Springer Undergraduate Mathematics Series, 59–78. London: Springer London, 2011. http://dx.doi.org/10.1007/978-0-85729-600-9_4.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mazzola, Guerino, Maria Mannone und Yan Pang. „Permutation Groups“. In Computational Music Science, 163–69. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-42937-3_20.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Roman, Steven. „Permutation Groups“. In Fundamentals of Group Theory, 191–206. Boston: Birkhäuser Boston, 2011. http://dx.doi.org/10.1007/978-0-8176-8301-6_6.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Paulsen, William. „Permutation Groups“. In Abstract Algebra, 149–80. 2nd edition. | Boca Raton : Taylor & Francis, 2016. | Series: Textbooks in mathematics ; 40 | “A CRC title.”: Chapman and Hall/CRC, 2018. http://dx.doi.org/10.1201/9781315370972-6.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Isaacs, I. „Permutation groups“. In Graduate Studies in Mathematics, 223–69. Providence, Rhode Island: American Mathematical Society, 2008. http://dx.doi.org/10.1090/gsm/092/08.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Isaacs, I. „Permutation groups“. In Graduate Studies in Mathematics, 70–82. Providence, Rhode Island: American Mathematical Society, 2009. http://dx.doi.org/10.1090/gsm/100/06.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Kurzweil, Hans, und Bernd Stellmacher. „Permutation Groups“. In The Theory of Finite Groups, 77–97. New York, NY: Springer New York, 2004. http://dx.doi.org/10.1007/0-387-21768-1_4.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Birken, Philipp. „Permutation Groups“. In Student Solutions Manual, 21–26. 10. Aufl. Boca Raton: Chapman and Hall/CRC, 2021. http://dx.doi.org/10.1201/9781003182306-6.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Tapp, Kristopher. „Permutation Groups“. In Symmetry, 111–33. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-51669-7_6.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Davvaz, Bijan. „Permutation Groups“. In A First Course in Group Theory, 105–30. Singapore: Springer Singapore, 2021. http://dx.doi.org/10.1007/978-981-16-6365-9_5.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Konferenzberichte zum Thema "Permutation groups"

Babai, L., E. Luks und A. Seress. „Permutation groups in NC“. In the nineteenth annual ACM conference. New York, New York, USA: ACM Press, 1987. http://dx.doi.org/10.1145/28395.28439.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Babai, L., E. M. Luks und A. Seress. „Fast management of permutation groups“. In [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science. IEEE, 1988. http://dx.doi.org/10.1109/sfcs.1988.21943.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Kabanov, Vladislav, Theodore E. Simos, George Psihoyios und Ch Tsitouras. „Graphs and Transitive Permutation Groups“. In ICNAAM 2010: International Conference of Numerical Analysis and Applied Mathematics 2010. AIP, 2010. http://dx.doi.org/10.1063/1.3498638.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Banica, Teodor, Julien Bichon und Benoît Collins. „Quantum permutation groups: a survey“. In Noncommutative Harmonic Analysis with Applications to Probability. Warsaw: Institute of Mathematics Polish Academy of Sciences, 2007. http://dx.doi.org/10.4064/bc78-0-1.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Luks, Eugene M., Ferenc Rákóczi und Charles R. B. Wright. „Computing normalizers in permutation p-groups“. In the international symposium. New York, New York, USA: ACM Press, 1994. http://dx.doi.org/10.1145/190347.190390.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Luks, Eugene M., und Pierre Mckenzie. „Fast parallel computation with permutation groups“. In 26th Annual Symposium on Foundations of Computer Science (sfcs 1985). IEEE, 1985. http://dx.doi.org/10.1109/sfcs.1985.26.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Fiat, A., S. Moses, A. Shamir, I. Shimshoni und G. Tardos. „Planning and learning in permutation groups“. In 30th Annual Symposium on Foundations of Computer Science. IEEE, 1989. http://dx.doi.org/10.1109/sfcs.1989.63490.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Egner, Sebastian, und Markus Püschel. „Solving puzzles related to permutation groups“. In the 1998 international symposium. New York, New York, USA: ACM Press, 1998. http://dx.doi.org/10.1145/281508.281611.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

PRAEGER, CHERYL E. „REGULAR PERMUTATION GROUPS AND CAYLEY GRAPHS“. In Proceedings of the 13th General Meeting. WORLD SCIENTIFIC, 2009. http://dx.doi.org/10.1142/9789814277686_0003.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

DALLA VOLTA, FRANCESCA, und JOHANNES SIEMONS. „Permutation groups defined by unordered relations“. In Proceedings of the Conference. WORLD SCIENTIFIC, 2009. http://dx.doi.org/10.1142/9789814277808_0004.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Berichte der Organisationen zum Thema "Permutation groups"

Huang, Jonathan, Carlos Guestrin und Leonidas Guibas. Inference for Distributions over the Permutation Group. Fort Belvoir, VA: Defense Technical Information Center, Mai 2008. http://dx.doi.org/10.21236/ada488051.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Ramm-Granberg, Tynan, F. Rocchio, Catharine Copass, Rachel Brunner und Eric Nelsen. Revised vegetation classification for Mount Rainier, North Cascades, and Olympic national parks: Project summary report. National Park Service, Februar 2021. http://dx.doi.org/10.36967/nrr-2284511.

Der volle Inhalt der Quelle

Annotation:

Field crews recently collected more than 10 years of classification and mapping data in support of the North Coast and Cascades Inventory and Monitoring Network (NCCN) vegetation maps of Mount Rainier (MORA), Olympic (OLYM), and North Cascades (NOCA) National Parks. Synthesis and analysis of these 6000+ plots by Washington Natural Heritage Program (WNHP) and Institute for Natural Resources (INR) staff built on the foundation provided by the earlier classification work of Crawford et al. (2009). These analyses provided support for most of the provisional plant associations in Crawford et al. (2009), while also revealing previously undescribed vegetation types that were not represented in the United States National Vegetation Classification (USNVC). Both provisional and undescribed types have since been submitted to the USNVC by WNHP staff through a peer-reviewed process. NCCN plots were combined with statewide forest and wetland plot data from the US Forest Service (USFS) and other sources to create a comprehensive data set for Washington. Analyses incorporated Cluster Analysis, Nonmetric Multidimensional Scaling (NMS), Multi-Response Permutation Procedure (MRPP), and Indicator Species Analysis (ISA) to identify, vet, and describe USNVC group, alliance, and association distinctions. The resulting revised classification contains 321 plant associations in 99 alliances. A total of 54 upland associations were moved through the peer review process and are now part of the USNVC. Of those, 45 were provisional or preliminary types from Crawford et al. (2009), with 9 additional new associations that were originally identified by INR. WNHP also revised the concepts of 34 associations, wrote descriptions for 2 existing associations, eliminated/archived 2 associations, and created 4 new upland alliances. Finally, WNHP created 27 new wetland alliances and revised or clarified an additional 21 as part of this project (not all of those occur in the parks). This report and accompanying vegetation descriptions, keys and synoptic and environmental tables (all products available from the NPS Data Store project reference: https://irma.nps.gov/DataStore/Reference/Profile/2279907) present the fruit of these combined efforts: a comprehensive, up-to-date vegetation classification for the three major national parks of Washington State.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!