Gotowa bibliografia na temat „Permutations”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Spis treści
Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Permutations”.
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.
Artykuły w czasopismach na temat "Permutations"
Wituła, Roman, Edyta Hetmaniok i Damian Słota. "On Commutation Properties of the Composition Relation of Convergent and Divergent Permutations (Part I)". Tatra Mountains Mathematical Publications 58, nr 1 (1.03.2014): 13–22. http://dx.doi.org/10.2478/tmmp-2014-0002.
Pełny tekst źródłaSavchuk, M., i M. Burlaka. "Encoding and classification of permutations bу special conversion with estimates of class power". Bulletin of Taras Shevchenko National University of Kyiv. Series: Physics and Mathematics, nr 2 (2019): 36–43. http://dx.doi.org/10.17721/1812-5409.2019/2.3.
Pełny tekst źródłaAdamczak, William. "A Note on the Structure of Roller Coaster Permutations". Journal of Mathematics Research 9, nr 3 (24.05.2017): 75. http://dx.doi.org/10.5539/jmr.v9n3p75.
Pełny tekst źródłaBrualdi, Richard A., i Geir Dahl. "Permutation Matrices, Their Discrete Derivatives and Extremal Properties". Vietnam Journal of Mathematics 48, nr 4 (24.03.2020): 719–40. http://dx.doi.org/10.1007/s10013-020-00392-5.
Pełny tekst źródłaSenashov, Vasily S., Konstantin A. Filippov i 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.
Pełny tekst źródłaGao, Alice L. L., Sergey Kitaev, Wolfgang Steiner i Philip B. Zhang. "On a Greedy Algorithm to Construct Universal Cycles for Permutations". International Journal of Foundations of Computer Science 30, nr 01 (styczeń 2019): 61–72. http://dx.doi.org/10.1142/s0129054119400033.
Pełny tekst źródłaVidybida, Alexander K. "Calculating Permutation Entropy without Permutations". Complexity 2020 (22.10.2020): 1–9. http://dx.doi.org/10.1155/2020/7163254.
Pełny tekst źródłaSteingrı́msson, Einar. "Permutation Statistics of Indexed Permutations". European Journal of Combinatorics 15, nr 2 (marzec 1994): 187–205. http://dx.doi.org/10.1006/eujc.1994.1021.
Pełny tekst źródłaZHOU, YINGCHUN, i MURAD S. TAQQU. "APPLYING BUCKET RANDOM PERMUTATIONS TO STATIONARY SEQUENCES WITH LONG-RANGE DEPENDENCE". Fractals 15, nr 02 (czerwiec 2007): 105–26. http://dx.doi.org/10.1142/s0218348x07003526.
Pełny tekst źródłaMansour, Toufik, Howard Skogman i Rebecca Smith. "Passing through a stack k times". Discrete Mathematics, Algorithms and Applications 11, nr 01 (luty 2019): 1950003. http://dx.doi.org/10.1142/s1793830919500034.
Pełny tekst źródłaRozprawy doktorskie na temat "Permutations"
Cox, Charles. "Infinite permutation groups containing all finitary permutations". Thesis, University of Southampton, 2016. https://eprints.soton.ac.uk/401538/.
Pełny tekst źródłaKu, Cheng Yeaw. "Intersecting families of permutations and partial permutations". Thesis, Queen Mary, University of London, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.416959.
Pełny tekst źródłaSteingrímsson, Einar. "Permutations statistics of indexed and poset permutations". Thesis, Massachusetts Institute of Technology, 1992. http://hdl.handle.net/1721.1/35952.
Pełny tekst źródłaWest, Julian 1964. "Permutations with forbidden subsequences, and, stack-sortable permutations". Thesis, Massachusetts Institute of Technology, 1990. http://hdl.handle.net/1721.1/13641.
Pełny tekst źródłaCooper, Joshua N. "Quasirandom permutations /". Diss., Connect to a 24 p. preview or request complete full text in PDF format. Access restricted to UC campuses, 2003. http://wwwlib.umi.com/cr/ucsd/fullcit?p3091341.
Pełny tekst źródłaHyatt, Matthew. "Quasisymmetric Functions and Permutation Statistics for Coxeter Groups and Wreath Product Groups". Scholarly Repository, 2011. http://scholarlyrepository.miami.edu/oa_dissertations/609.
Pełny tekst źródłaBoberg, Jonas. "Counting Double-Descents and Double-Inversions in Permutations". Thesis, Mälardalens högskola, Akademin för utbildning, kultur och kommunikation, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-54431.
Pełny tekst źródłaMaazoun, Mickaël. "Permutons limites universels de permutations aléatoires à motifs exclus". Thesis, Lyon, 2020. http://www.theses.fr/2020LYSEN064.
Pełny tekst źródłaPattern-avoiding permutations are an important theme of enumerative combinatorics, and their study from a probabilistic point of view form a recently expanding subject, for instance by considering the scaling limit behavior, in the permuton sense, of the diagram of a large uniform permutation in a pattern-avoiding class. The case of separable permutations was studied by Bassino, Bouvel, Féray, Gerin and Pierrot, who showed convergence to a random object, the Brownian separable permuton. We provide an explicit construction through stochastic processes, allowing to study the fractal properties, and compute some statistics, of this object. We study the universality class of this permuton among classes admitting a finite specification in the sense of the so-called decomposition substitution. For many of them, under a simple combinatorial condition, their limit is a one-parameter deformation of the Brownian permuton. In the specific instance of substitution-closed classes, we also consider sufficient conditions to escape this universality class, and introduct the family of stable permutons. Cographs are the inversion graphs of separable permutations. Using similar methods, we investigate the scaling limit in the graphon sense of uniform labeled and unlabeled cographs. We also show that the normalized degree of a uniform vertex in a uniform cograph is asymptotically uniform. Finally, we study local and scaling limits of Baxter permutations, a class avoiding vincular patterns. This family is in bijection with many remarkable combinatorial objects, in particular bipolar oriented maps. Our result has interpretations in terms of the Peanosphere convergence of such maps, completing a result of Gwynne, Holden and Sun
Dansie, B. R. "The analysis of permutations /". Title page, contents and abstract only, 1988. http://web4.library.adelaide.edu.au/theses/09PH/09phd191.pdf.
Pełny tekst źródłaVergara, John Paul C. "Sorting by Bounded Permutations". Diss., Virginia Tech, 1997. http://hdl.handle.net/10919/30401.
Pełny tekst źródłaPh. D.
Książki na temat "Permutations"
Passman, Donald S. Permutation groups. Mineola, N.Y: Dover Publications, Inc., 2012.
Znajdź pełny tekst źródłaTidhar, Lavie. Cloud permutations. [Hornsea]: PS Publishing, 2010.
Znajdź pełny tekst źródłaMaughn, James. The Arakaki permutations. United States: Black Radish Books, 2011.
Znajdź pełny tekst źródłaCombinatorics of permutations. Wyd. 2. Boca Raton, FL: Chapman and Hall/CRC, 2012.
Znajdź pełny tekst źródłaCombinatorics of permutations. Boca Raton: Chapman & Hall/CRC, 2004.
Znajdź pełny tekst źródłaStrauss, Anselm L. Continual permutations of action. New Brunswick, N.J: AldineTransaction, 2008.
Znajdź pełny tekst źródłaCamina, A. R. Linear groups and permutations. Boston: Pitman Advanced Publishing Program, 1985.
Znajdź pełny tekst źródłaPfahl, John. Permutations on the picturesque. Syracuse, NY: Robert B. Menschel Photography Gallery, Schine Student Center, Syracuse University, 1997.
Znajdź pełny tekst źródłaPfahl, John. Permutations on the picturesque. [Syracuse, NY: Robert B. Menschel Photography Gallery, Schine Student Center, Syracuse University, 1997.
Znajdź pełny tekst źródłaStrauss, Anselm L. Continual permutations of action. New Brunswick, N.J: AldineTransaction, 2008.
Znajdź pełny tekst źródłaCzęści książek na temat "Permutations"
Petersen, T. Kyle. "Permutations". W Inquiry-Based Enumerative Combinatorics, 33–41. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-18308-0_2.
Pełny tekst źródłaSane, Sharad S. "Permutations". W Texts and Readings in Mathematics, 39–56. Gurgaon: Hindustan Book Agency, 2013. http://dx.doi.org/10.1007/978-93-86279-55-2_3.
Pełny tekst źródłaArmstrong, M. A. "Permutations". W Undergraduate Texts in Mathematics, 26–31. New York, NY: Springer New York, 1988. http://dx.doi.org/10.1007/978-1-4757-4034-9_6.
Pełny tekst źródłaBlyth, T. S., i E. F. Robertson. "Permutations". W Sets and Mappings, 76–97. Dordrecht: Springer Netherlands, 1986. http://dx.doi.org/10.1007/978-94-015-7713-7_5.
Pełny tekst źródłaTapp, Kristopher. "Permutations". W Symmetry, 75–86. New York, NY: Springer New York, 2011. http://dx.doi.org/10.1007/978-1-4614-0299-2_6.
Pełny tekst źródłaEffinger, Gove, i Gary L. Mullen. "Permutations". W An Elementary Transition to Abstract Mathematics, 57–63. Boca Raton : CRC Press, Taylor … Francis Group, 2020.: CRC Press, 2019. http://dx.doi.org/10.1201/9780429324819-10.
Pełny tekst źródłaJohnson, Tom, i Franck Jedrzejewski. "Permutations". W Looking at Numbers, 1–20. Basel: Springer Basel, 2013. http://dx.doi.org/10.1007/978-3-0348-0554-4_1.
Pełny tekst źródłaKerber, Adalbert. "Permutations". W Algorithms and Combinatorics, 275–316. Berlin, Heidelberg: Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/978-3-662-11167-3_9.
Pełny tekst źródłaCaulton, Adam. "Permutations". W The Routledge Companion to Philosophy of Physics, 578–94. New York: Routledge, 2021. http://dx.doi.org/10.4324/9781315623818-54.
Pełny tekst źródłaGolomb, Solomon W., i Andy Liu. "Permutations". W Solomon Golomb’s Course on Undergraduate Combinatorics, 149–92. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-72228-9_4.
Pełny tekst źródłaStreszczenia konferencji na temat "Permutations"
Galvão, Gustavo Rodrigues, i Zanoni Dias. "Algorithms for Sorting by Reversals or Transpositions, with Application to Genome Rearrangement". W XXIX Concurso de Teses e Dissertações da SBC. Sociedade Brasileira de Computação - SBC, 2020. http://dx.doi.org/10.5753/ctd.2016.9145.
Pełny tekst źródłaRyabov, Vladimir Gennadievich. "On number of substitutions of vector space over finite field with affine approximations with given accuracy". W Academician O.B. Lupanov 14th International Scientific Seminar "Discrete Mathematics and Its Applications". Keldysh Institute of Applied Mathematics, 2022. http://dx.doi.org/10.20948/dms-2022-88.
Pełny tekst źródłaMatyushkin, Igor, i Pavel Rubis. "CELLULAR AUTOMATA ALGORITHMS FOR PSEUDORANDOM NUMBERS GENERATION". W International Forum “Microelectronics – 2020”. Joung Scientists Scholarship “Microelectronics – 2020”. XIII International conference «Silicon – 2020». XII young scientists scholarship for silicon nanostructures and devices physics, material science, process and analysis. LLC MAKS Press, 2020. http://dx.doi.org/10.29003/m1648.silicon-2020/354-357.
Pełny tekst źródłaSkala, Matthew. "Counting distance permutations". W 2008 IEEE 24th International Conference on Data Engineeing workshop (ICDE Workshop 2008). IEEE, 2008. http://dx.doi.org/10.1109/icdew.2008.4498346.
Pełny tekst źródłaChen, Yiling, Lance Fortnow, Evdokia Nikolova i David M. Pennock. "Betting on permutations". W the 8th ACM conference. New York, New York, USA: ACM Press, 2007. http://dx.doi.org/10.1145/1250910.1250957.
Pełny tekst źródłaSkala, Matthew. "Counting Distance Permutations". W 2008 First International Workshop on Similarity Search and Applications (SISAP). IEEE, 2008. http://dx.doi.org/10.1109/sisap.2008.15.
Pełny tekst źródłaDomsa, Ovidiu, i Nicolae Bold. "GENERATOR OF VARIANTS OF TESTS USING THE SAME QUESTIONS". W eLSE 2016. Carol I National Defence University Publishing House, 2016. http://dx.doi.org/10.12753/2066-026x-16-174.
Pełny tekst źródłaMoraga, Claudio. "Permutations under Spectral Transforms". W 2008 38th International Symposium on Multiple Valued Logic (ismvl 2008). IEEE, 2008. http://dx.doi.org/10.1109/ismvl.2008.16.
Pełny tekst źródłaWang, Da, Arya Mazumdar i Gregory W. Wornell. "Lossy compression of permutations". W 2014 IEEE International Symposium on Information Theory (ISIT). IEEE, 2014. http://dx.doi.org/10.1109/isit.2014.6874785.
Pełny tekst źródłaSu, Lili, Farzad Farnoud i Olgica Milenkovic. "Similarity distances between permutations". W 2014 IEEE International Symposium on Information Theory (ISIT). IEEE, 2014. http://dx.doi.org/10.1109/isit.2014.6875237.
Pełny tekst źródłaRaporty organizacyjne na temat "Permutations"
Tovar, Benjamin, Luigi Freda i Steven M. LaValle. Learning Combinatorial Map Information from Permutations of Landmarks. Fort Belvoir, VA: Defense Technical Information Center, październik 2010. http://dx.doi.org/10.21236/ada536930.
Pełny tekst źródłaHoran, Victoria. Overlap Cycles for Permutations: Necessary and Sufficient Conditions. Fort Belvoir, VA: Defense Technical Information Center, wrzesień 2013. http://dx.doi.org/10.21236/ada623587.
Pełny tekst źródłaTavare, Simon. International Conference on Random Mappings, Partitions and Permutations Held in Los Angeles, California on 3-6 January 1992. Fort Belvoir, VA: Defense Technical Information Center, sierpień 1992. http://dx.doi.org/10.21236/ada257259.
Pełny tekst źródłaAlexander-Morrison, G. M. Experimental attempt to achieve microstructure variations through temperature/time permutations for a nonwrought powder metallurgy uranium-6 niobium alloy. Office of Scientific and Technical Information (OSTI), czerwiec 1985. http://dx.doi.org/10.2172/5791338.
Pełny tekst źródłaRay, Jason, James Kinnebrew, Ramsay Bell i Martin Schultz. Sensitivity of simulated flaw-height estimates to phased array scan parameters. Engineer Research and Development Center (U.S.), sierpień 2023. http://dx.doi.org/10.21079/11681/47403.
Pełny tekst źródłaFLORIDA STATE UNIV TALLAHASSEE. Scrambled Sobol Sequences via Permutation. Fort Belvoir, VA: Defense Technical Information Center, styczeń 2009. http://dx.doi.org/10.21236/ada510216.
Pełny tekst źródłaHuang, Jonathan, Carlos Guestrin i Leonidas Guibas. Inference for Distributions over the Permutation Group. Fort Belvoir, VA: Defense Technical Information Center, maj 2008. http://dx.doi.org/10.21236/ada488051.
Pełny tekst źródłaKilian, Joe, Shlomo Kipnis i Charles E. Leiserson. The Organization of Permutation Architectures with Bussed Interconnections. Fort Belvoir, VA: Defense Technical Information Center, październik 1987. http://dx.doi.org/10.21236/ada208817.
Pełny tekst źródłaBugni, Federico A., i Joel L. Horowitz. Permutation tests for equality of distributions of functional data. The IFS, marzec 2018. http://dx.doi.org/10.1920/wp.cem.2018.1818.
Pełny tekst źródłaDworkin, Morris J. SHA-3 Standard: Permutation-Based Hash and Extendable-Output Functions. National Institute of Standards and Technology, lipiec 2015. http://dx.doi.org/10.6028/nist.fips.202.
Pełny tekst źródła