Literatura académica sobre el tema "Permutations"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte las listas temáticas de artículos, libros, tesis, actas de conferencias y otras fuentes académicas sobre el tema "Permutations".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Artículos de revistas sobre el tema "Permutations"
Wituła, Roman, Edyta Hetmaniok y Damian Słota. "On Commutation Properties of the Composition Relation of Convergent and Divergent Permutations (Part I)". Tatra Mountains Mathematical Publications 58, n.º 1 (1 de marzo de 2014): 13–22. http://dx.doi.org/10.2478/tmmp-2014-0002.
Texto completoSavchuk, M. y 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, n.º 2 (2019): 36–43. http://dx.doi.org/10.17721/1812-5409.2019/2.3.
Texto completoAdamczak, William. "A Note on the Structure of Roller Coaster Permutations". Journal of Mathematics Research 9, n.º 3 (24 de mayo de 2017): 75. http://dx.doi.org/10.5539/jmr.v9n3p75.
Texto completoBrualdi, Richard A. y Geir Dahl. "Permutation Matrices, Their Discrete Derivatives and Extremal Properties". Vietnam Journal of Mathematics 48, n.º 4 (24 de marzo de 2020): 719–40. http://dx.doi.org/10.1007/s10013-020-00392-5.
Texto completoSenashov, Vasily S., Konstantin A. Filippov y 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.
Texto completoGao, Alice L. L., Sergey Kitaev, Wolfgang Steiner y Philip B. Zhang. "On a Greedy Algorithm to Construct Universal Cycles for Permutations". International Journal of Foundations of Computer Science 30, n.º 01 (enero de 2019): 61–72. http://dx.doi.org/10.1142/s0129054119400033.
Texto completoVidybida, Alexander K. "Calculating Permutation Entropy without Permutations". Complexity 2020 (22 de octubre de 2020): 1–9. http://dx.doi.org/10.1155/2020/7163254.
Texto completoSteingrı́msson, Einar. "Permutation Statistics of Indexed Permutations". European Journal of Combinatorics 15, n.º 2 (marzo de 1994): 187–205. http://dx.doi.org/10.1006/eujc.1994.1021.
Texto completoZHOU, YINGCHUN y MURAD S. TAQQU. "APPLYING BUCKET RANDOM PERMUTATIONS TO STATIONARY SEQUENCES WITH LONG-RANGE DEPENDENCE". Fractals 15, n.º 02 (junio de 2007): 105–26. http://dx.doi.org/10.1142/s0218348x07003526.
Texto completoMansour, Toufik, Howard Skogman y Rebecca Smith. "Passing through a stack k times". Discrete Mathematics, Algorithms and Applications 11, n.º 01 (febrero de 2019): 1950003. http://dx.doi.org/10.1142/s1793830919500034.
Texto completoTesis sobre el tema "Permutations"
Cox, Charles. "Infinite permutation groups containing all finitary permutations". Thesis, University of Southampton, 2016. https://eprints.soton.ac.uk/401538/.
Texto completoKu, 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.
Texto completoSteingrímsson, Einar. "Permutations statistics of indexed and poset permutations". Thesis, Massachusetts Institute of Technology, 1992. http://hdl.handle.net/1721.1/35952.
Texto completoWest, Julian 1964. "Permutations with forbidden subsequences, and, stack-sortable permutations". Thesis, Massachusetts Institute of Technology, 1990. http://hdl.handle.net/1721.1/13641.
Texto completoCooper, 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.
Texto completoHyatt, Matthew. "Quasisymmetric Functions and Permutation Statistics for Coxeter Groups and Wreath Product Groups". Scholarly Repository, 2011. http://scholarlyrepository.miami.edu/oa_dissertations/609.
Texto completoBoberg, 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.
Texto completoMaazoun, Mickaël. "Permutons limites universels de permutations aléatoires à motifs exclus". Thesis, Lyon, 2020. http://www.theses.fr/2020LYSEN064.
Texto completoPattern-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.
Texto completoVergara, John Paul C. "Sorting by Bounded Permutations". Diss., Virginia Tech, 1997. http://hdl.handle.net/10919/30401.
Texto completoPh. D.
Libros sobre el tema "Permutations"
Passman, Donald S. Permutation groups. Mineola, N.Y: Dover Publications, Inc., 2012.
Buscar texto completoTidhar, Lavie. Cloud permutations. [Hornsea]: PS Publishing, 2010.
Buscar texto completoMaughn, James. The Arakaki permutations. United States: Black Radish Books, 2011.
Buscar texto completoCombinatorics of permutations. 2a ed. Boca Raton, FL: Chapman and Hall/CRC, 2012.
Buscar texto completoCombinatorics of permutations. Boca Raton: Chapman & Hall/CRC, 2004.
Buscar texto completoStrauss, Anselm L. Continual permutations of action. New Brunswick, N.J: AldineTransaction, 2008.
Buscar texto completoCamina, A. R. Linear groups and permutations. Boston: Pitman Advanced Publishing Program, 1985.
Buscar texto completoPfahl, John. Permutations on the picturesque. Syracuse, NY: Robert B. Menschel Photography Gallery, Schine Student Center, Syracuse University, 1997.
Buscar texto completoPfahl, John. Permutations on the picturesque. [Syracuse, NY: Robert B. Menschel Photography Gallery, Schine Student Center, Syracuse University, 1997.
Buscar texto completoStrauss, Anselm L. Continual permutations of action. New Brunswick, N.J: AldineTransaction, 2008.
Buscar texto completoCapítulos de libros sobre el tema "Permutations"
Petersen, T. Kyle. "Permutations". En Inquiry-Based Enumerative Combinatorics, 33–41. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-18308-0_2.
Texto completoSane, Sharad S. "Permutations". En Texts and Readings in Mathematics, 39–56. Gurgaon: Hindustan Book Agency, 2013. http://dx.doi.org/10.1007/978-93-86279-55-2_3.
Texto completoArmstrong, M. A. "Permutations". En 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.
Texto completoBlyth, T. S. y E. F. Robertson. "Permutations". En Sets and Mappings, 76–97. Dordrecht: Springer Netherlands, 1986. http://dx.doi.org/10.1007/978-94-015-7713-7_5.
Texto completoTapp, Kristopher. "Permutations". En Symmetry, 75–86. New York, NY: Springer New York, 2011. http://dx.doi.org/10.1007/978-1-4614-0299-2_6.
Texto completoEffinger, Gove y Gary L. Mullen. "Permutations". En 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.
Texto completoJohnson, Tom y Franck Jedrzejewski. "Permutations". En Looking at Numbers, 1–20. Basel: Springer Basel, 2013. http://dx.doi.org/10.1007/978-3-0348-0554-4_1.
Texto completoKerber, Adalbert. "Permutations". En Algorithms and Combinatorics, 275–316. Berlin, Heidelberg: Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/978-3-662-11167-3_9.
Texto completoCaulton, Adam. "Permutations". En The Routledge Companion to Philosophy of Physics, 578–94. New York: Routledge, 2021. http://dx.doi.org/10.4324/9781315623818-54.
Texto completoGolomb, Solomon W. y Andy Liu. "Permutations". En 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.
Texto completoActas de conferencias sobre el tema "Permutations"
Galvão, Gustavo Rodrigues y Zanoni Dias. "Algorithms for Sorting by Reversals or Transpositions, with Application to Genome Rearrangement". En 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.
Texto completoRyabov, Vladimir Gennadievich. "On number of substitutions of vector space over finite field with affine approximations with given accuracy". En 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.
Texto completoMatyushkin, Igor y Pavel Rubis. "CELLULAR AUTOMATA ALGORITHMS FOR PSEUDORANDOM NUMBERS GENERATION". En 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.
Texto completoSkala, Matthew. "Counting distance permutations". En 2008 IEEE 24th International Conference on Data Engineeing workshop (ICDE Workshop 2008). IEEE, 2008. http://dx.doi.org/10.1109/icdew.2008.4498346.
Texto completoChen, Yiling, Lance Fortnow, Evdokia Nikolova y David M. Pennock. "Betting on permutations". En the 8th ACM conference. New York, New York, USA: ACM Press, 2007. http://dx.doi.org/10.1145/1250910.1250957.
Texto completoSkala, Matthew. "Counting Distance Permutations". En 2008 First International Workshop on Similarity Search and Applications (SISAP). IEEE, 2008. http://dx.doi.org/10.1109/sisap.2008.15.
Texto completoDomsa, Ovidiu y Nicolae Bold. "GENERATOR OF VARIANTS OF TESTS USING THE SAME QUESTIONS". En eLSE 2016. Carol I National Defence University Publishing House, 2016. http://dx.doi.org/10.12753/2066-026x-16-174.
Texto completoMoraga, Claudio. "Permutations under Spectral Transforms". En 2008 38th International Symposium on Multiple Valued Logic (ismvl 2008). IEEE, 2008. http://dx.doi.org/10.1109/ismvl.2008.16.
Texto completoWang, Da, Arya Mazumdar y Gregory W. Wornell. "Lossy compression of permutations". En 2014 IEEE International Symposium on Information Theory (ISIT). IEEE, 2014. http://dx.doi.org/10.1109/isit.2014.6874785.
Texto completoSu, Lili, Farzad Farnoud y Olgica Milenkovic. "Similarity distances between permutations". En 2014 IEEE International Symposium on Information Theory (ISIT). IEEE, 2014. http://dx.doi.org/10.1109/isit.2014.6875237.
Texto completoInformes sobre el tema "Permutations"
Tovar, Benjamin, Luigi Freda y Steven M. LaValle. Learning Combinatorial Map Information from Permutations of Landmarks. Fort Belvoir, VA: Defense Technical Information Center, octubre de 2010. http://dx.doi.org/10.21236/ada536930.
Texto completoHoran, Victoria. Overlap Cycles for Permutations: Necessary and Sufficient Conditions. Fort Belvoir, VA: Defense Technical Information Center, septiembre de 2013. http://dx.doi.org/10.21236/ada623587.
Texto completoTavare, 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, agosto de 1992. http://dx.doi.org/10.21236/ada257259.
Texto completoAlexander-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), junio de 1985. http://dx.doi.org/10.2172/5791338.
Texto completoRay, Jason, James Kinnebrew, Ramsay Bell y Martin Schultz. Sensitivity of simulated flaw-height estimates to phased array scan parameters. Engineer Research and Development Center (U.S.), agosto de 2023. http://dx.doi.org/10.21079/11681/47403.
Texto completoFLORIDA STATE UNIV TALLAHASSEE. Scrambled Sobol Sequences via Permutation. Fort Belvoir, VA: Defense Technical Information Center, enero de 2009. http://dx.doi.org/10.21236/ada510216.
Texto completoHuang, Jonathan, Carlos Guestrin y Leonidas Guibas. Inference for Distributions over the Permutation Group. Fort Belvoir, VA: Defense Technical Information Center, mayo de 2008. http://dx.doi.org/10.21236/ada488051.
Texto completoKilian, Joe, Shlomo Kipnis y Charles E. Leiserson. The Organization of Permutation Architectures with Bussed Interconnections. Fort Belvoir, VA: Defense Technical Information Center, octubre de 1987. http://dx.doi.org/10.21236/ada208817.
Texto completoBugni, Federico A. y Joel L. Horowitz. Permutation tests for equality of distributions of functional data. The IFS, marzo de 2018. http://dx.doi.org/10.1920/wp.cem.2018.1818.
Texto completoDworkin, Morris J. SHA-3 Standard: Permutation-Based Hash and Extendable-Output Functions. National Institute of Standards and Technology, julio de 2015. http://dx.doi.org/10.6028/nist.fips.202.
Texto completo