Relevant bibliographies by topics / Permutations

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Permutations'

Author: Grafiati
Published: 4 June 2021
Last updated: 29 July 2024

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 'Permutations.'

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 "Permutations"

1

Wituła, Roman, Edyta Hetmaniok, and Damian Słota. "On Commutation Properties of the Composition Relation of Convergent and Divergent Permutations (Part I)." Tatra Mountains Mathematical Publications 58, no. 1 (March 1, 2014): 13–22. http://dx.doi.org/10.2478/tmmp-2014-0002.

Full text
Abstract:
Abstract In the paper we present the selected properties of composition relation of the convergent and divergent permutations connected with commutation. We note that a permutation on ℕ is called the convergent permutation if for each convergent series ∑an of real terms, the p-rearranged series ∑ap(n) is also convergent. All the other permutations on ℕ are called the divergent permutations. We have proven, among others, that, for many permutations p on ℕ, the family of divergent permutations q on ℕ commuting with p possesses cardinality of the continuum. For example, the permutations p on ℕ having finite order possess this property. On the other hand, an example of a convergent permutation which commutes only with some convergent permutations is also presented.
APA, Harvard, Vancouver, ISO, and other styles
2

Savchuk, M., and 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, no. 2 (2019): 36–43. http://dx.doi.org/10.17721/1812-5409.2019/2.3.

Full text
Abstract:
Scientific articles investigating properties and estimates of the number of so-called complete permutations are surveyed and analyzed. The paper introduces a special S-transform on the set of permutations and determines the permutation properties according to this transform. Classification and coding of permutations by equivalence classes according to their properties with respect to S-transformation is proposed. This classification and permutation properties, in particular, generalize known results for complete permutations regarding determining certain cryptographic properties of substitutions that affect the cryptographic transformations security. The exact values of the number of permutations in equivalence classes for certain permutation sizes are calculated and the estimates of the cardinality of classes with various properties are constructed by statistical modeling. The complete list of permutation classes with the exact values of their sizes for permutations of order n = 11 is presented. The interval estimates for the size of classes with various characteristics for permutations of order n = 11, 26, 30, 31, 32, 33, 45, 55 are obtained. Monte Carlo estimates and bounds of confidence intervals used the approximation of the binomial distribution by the normal and Poisson distributions, as well as the Python programming language package Scipy. Statistical tables have been calculated that can be used for further conclusions and estimates. The classification of permutations by their properties with respect to the introduced transform can be used in constructing high-quality cryptographic transformations and transformations with special features. The classes of complete permutations with their properties are selected as the best for rotary cryptosystems applications. The obtained results can be used, in particular, to search for permutations with certain characteristics and properties, to find the probability that the characteristic of the generated permutation belongs to a collection of given characteristics, to estimate the complexity of finding permutations with certain properties. A statistical criterion of consent, which uses the characteristics of permutations by S-transformation to test the generators of random permutations and substitutions is proposed.
APA, Harvard, Vancouver, ISO, and other styles
3

Adamczak, William. "A Note on the Structure of Roller Coaster Permutations." Journal of Mathematics Research 9, no. 3 (May 24, 2017): 75. http://dx.doi.org/10.5539/jmr.v9n3p75.

Full text
Abstract:
In this paper we consider the structure of a special class of permutations known as roller coaster permutations, first introduced by Ahmed & Snevily (2013). A roller coaster permutation is described as, a permutation that maximizes the total switches from ascending to descending, or visa versa, for the permutation as well as all of its subpermutations, simultaneously. This paper looks at the structure of these permutations, particularly the alternating structure, what the entires of these permutations can look like, we then introduce a notion of a condition stronger than alternating that we shall refer to as recursively alternating.
APA, Harvard, Vancouver, ISO, and other styles
4

Brualdi, Richard A., and Geir Dahl. "Permutation Matrices, Their Discrete Derivatives and Extremal Properties." Vietnam Journal of Mathematics 48, no. 4 (March 24, 2020): 719–40. http://dx.doi.org/10.1007/s10013-020-00392-5.

Full text
Abstract:
AbstractFor a permutation π, and the corresponding permutation matrix, we introduce the notion of discrete derivative, obtained by taking differences of successive entries in π. We characterize the possible derivatives of permutations, and consider questions for permutations with certain properties satisfied by the derivative. For instance, we consider permutations with distinct derivatives, and the relationship to so-called Costas arrays.
APA, Harvard, Vancouver, ISO, and other styles
5

Senashov, Vasily S., Konstantin A. Filippov, and 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.

Full text
Abstract:
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, and other styles
6

Gao, Alice L. L., Sergey Kitaev, Wolfgang Steiner, and Philip B. Zhang. "On a Greedy Algorithm to Construct Universal Cycles for Permutations." International Journal of Foundations of Computer Science 30, no. 01 (January 2019): 61–72. http://dx.doi.org/10.1142/s0129054119400033.

Full text
Abstract:
A universal cycle for permutations of length [Formula: see text] is a cyclic word or permutation, any factor of which is order-isomorphic to exactly one permutation of length [Formula: see text], and containing all permutations of length [Formula: see text] as factors. It is well known that universal cycles for permutations of length [Formula: see text] exist. However, all known ways to construct such cycles are rather complicated. For example, in the original paper establishing the existence of the universal cycles, constructing such a cycle involves finding an Eulerian cycle in a certain graph and then dealing with partially ordered sets. In this paper, we offer a simple way to generate a universal cycle for permutations of length [Formula: see text], which is based on applying a greedy algorithm to a permutation of length [Formula: see text]. We prove that this approach gives a unique universal cycle [Formula: see text] for permutations, and we study properties of [Formula: see text].
APA, Harvard, Vancouver, ISO, and other styles
7

Vidybida, Alexander K. "Calculating Permutation Entropy without Permutations." Complexity 2020 (October 22, 2020): 1–9. http://dx.doi.org/10.1155/2020/7163254.

Full text
Abstract:
A method for analyzing sequential data sets, similar to the permutation entropy one, is discussed. The characteristic features of this method are as follows: it preserves information about equal values, if any, in the embedding vectors; it is exempt from combinatorics; and it delivers the same entropy value as does the permutation method, provided the embedding vectors do not have equal components. In the latter case, this method can be used instead of the permutation one. If embedding vectors have equal components, this method could be more precise in discriminating between similar data sets.
APA, Harvard, Vancouver, ISO, and other styles
8

Steingrı́msson, Einar. "Permutation Statistics of Indexed Permutations." European Journal of Combinatorics 15, no. 2 (March 1994): 187–205. http://dx.doi.org/10.1006/eujc.1994.1021.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

ZHOU, YINGCHUN, and MURAD S. TAQQU. "APPLYING BUCKET RANDOM PERMUTATIONS TO STATIONARY SEQUENCES WITH LONG-RANGE DEPENDENCE." Fractals 15, no. 02 (June 2007): 105–26. http://dx.doi.org/10.1142/s0218348x07003526.

Full text
Abstract:
Bucket random permutations (shuffling) are used to modify the dependence structure of a time series, and this may destroy long-range dependence, when it is present. Three types of bucket permutations are considered here: external, internal and two-level permutations. It is commonly believed that (1) an external random permutation destroys the long-range dependence and keeps the short-range dependence, (2) an internal permutation destroys the short-range dependence and keeps the long-range dependence, and (3) a two-level permutation distorts the medium-range dependence while keeping both the long-range and short-range dependence. This paper provides a theoretical basis for investigating these claims. It extends the study started in Ref. 1 and analyze the effects that these random permutations have on a long-range dependent finite variance stationary sequence both in the time domain and in the frequency domain.
APA, Harvard, Vancouver, ISO, and other styles
10

Mansour, Toufik, Howard Skogman, and Rebecca Smith. "Passing through a stack k times." Discrete Mathematics, Algorithms and Applications 11, no. 01 (February 2019): 1950003. http://dx.doi.org/10.1142/s1793830919500034.

Full text
Abstract:
We consider the number of passes a permutation needs to take through a stack if we only pop the appropriate output values and start over with the remaining entries in their original order. We define a permutation [Formula: see text] to be [Formula: see text]-pass sortable if [Formula: see text] is sortable using [Formula: see text] passes through the stack. Permutations that are [Formula: see text]-pass sortable are simply the stack sortable permutations as defined by Knuth. We define the permutation class of [Formula: see text]-pass sortable permutations in terms of their basis. We also show all [Formula: see text]-pass sortable classes have finite bases by giving bounds on the length of a basis element of the permutation class for any positive integer [Formula: see text]. Finally, we define the notion of tier of a permutation [Formula: see text] to be the minimum number of passes after the first pass required to sort [Formula: see text]. We then give a bijection between the class of permutations of tier [Formula: see text] and a collection of integer sequences studied by Parker [The combinatorics of functional composition and inversion, PhD thesis, Brandeis University (1993)]. This gives an exact enumeration of tier [Formula: see text] permutations of a given length and thus an exact enumeration for the class of [Formula: see text]-pass sortable permutations. Finally, we give a new derivation for the generating function in [S. Parker, The combinatorics of functional composition and inversion, PhD thesis, Brandeis University (1993)] and an explicit formula for the coefficients.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Permutations"

1

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

Full text
Abstract:
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, and other styles
2

Ku, 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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Steingrímsson, Einar. "Permutations statistics of indexed and poset permutations." Thesis, Massachusetts Institute of Technology, 1992. http://hdl.handle.net/1721.1/35952.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

West, Julian 1964. "Permutations with forbidden subsequences, and, stack-sortable permutations." Thesis, Massachusetts Institute of Technology, 1990. http://hdl.handle.net/1721.1/13641.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Cooper, 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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

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

Full text
Abstract:
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, and other styles
7

Boberg, 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.

Full text
Abstract:
In this paper, new variations of some well-known permutation statistics are introduced and studied. Firstly, a double-descent of a permutation π is defined as a position i where πi ≥ 2πi+1. By proofs by induction and direct proofs, recursive and explicit expressions for the number of n-permutations with k double-descents are presented. Also, an expression for the total number of double-descents in all n-permutations is presented. Secondly, a double-inversion of a permutation π is defined as a pair (πi,πj) where i<j but πi ≥ 2πj. The total number of double-inversions in all n-permutations is presented.
APA, Harvard, Vancouver, ISO, and other styles
8

Maazoun, Mickaël. "Permutons limites universels de permutations aléatoires à motifs exclus." Thesis, Lyon, 2020. http://www.theses.fr/2020LYSEN064.

Full text
Abstract:
Les permutations à motifs exclus sont un thème important de la combinatoire énumérative et leur étude probabiliste un sujet récent en pleine expansion, notamment l'étude de la limite d'échelle, au sens des permutons, du diagramme d'une permutation aléatoire uniforme dont la taille tent vers l'infini dans une classe définie par exclusion de motifs. Le cas des permutations séparables a été étudié par Bassino, Bouvel, Féray, Gerin et Pierrot, qui ont démontré la convergence vers un objet aléatoire, permuton séparable Brownien. Nous fournissons une construction explicite à partir de processus stochastiques permettant d'étudier les propriétés fractales et de calculer certaines statistiques de cet objet. Nous étudions la classe d'universalité de ce permuton dans le cadre des classes admettant une spécification finie au sens de la décomposition par substitution. Pour nombre d'entre elles, sous une condition combinatoire simple, leur limite est une déformation à un paramètre du permuton séparable Brownien. Dans le cas des classes closes par substitution, nous considérons également des conditions suffisantes pour sortir de cette classe d'universalité, et introduisons la famille des permutons stables. Les cographes sont les graphes d'inversion des permutations séparables. Nous étudions par des méthodes similaires la convergence au sens des graphons du cographe étiqueté ou non-étiqueté uniforme, et montrons que le degré normalisé d'un sommet uniforme dans un cographe uniforme est asymptotiquement uniforme. Finalement, nous étudions les limites d'échelle et locale de la famille à motifs vinculaires exclus des permutations de Baxter. Cette classest en bijection avec de nombreux objets combinatoires remarquables, notamment les cartes bipolaires orientées. Notre résultat s'interprète en terme de la convergence de telles cartes au sens de la Peanosphere, complétant un résultat de Gwynne, Holden et Sun
Pattern-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
APA, Harvard, Vancouver, ISO, and other styles
9

Bogaerts, Mathieu. "Codes et tableaux de permutations, construction, énumération et automorphismes." Doctoral thesis, Universite Libre de Bruxelles, 2009. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/210302.

Full text
Abstract:

Un code de permutations G(n,d) un sous-ensemble C de Sym(n) tel que la distance de Hamming D entre deux éléments de C est supérieure ou égale à d. Dans cette thèse, le groupe des isométries de (Sym(n),D) est déterminé et il est prouvé que ces isométries sont des automorphismes du schéma d'association induit sur Sym(n) par ses classes de conjugaison. Ceci mène, par programmation linéaire, à de nouveaux majorants de la taille maximale des G(n,d) pour n et d fixés et n compris entre 11 et 13. Des algorithmes de génération avec rejet d'objets isomorphes sont développés. Pour classer les G(n,d) non isométriques, des invariants ont été construits et leur efficacité étudiée. Tous les G(4,3) et les G(5,4) ont été engendrés à une isométrie près, il y en a respectivement 61 et 9445 (dont 139 sont maximaux et décrits explicitement). D’autres classes de G(n,d) sont étudiées.

A permutation code G(n,d) is a subset C of Sym(n) such that the Hamming distance D between two elements of C is larger than or equal to d. In this thesis, we characterize the isometry group of the metric space (Sym(n),D) and we prove that these isometries are automorphisms of the association scheme induced on Sym(n) by the conjugacy classes. This leads, by linear programming, to new upper bounds for the maximal size of G(n,d) codes for n and d fixed and n between 11 and 13. We develop generating algorithms with rejection of isomorphic objects. In order to classify the G(n,d) codes up to isometry, we construct invariants and study their efficiency. We generate all G(4,3) and G(4,5)codes up to isometry; there are respectively 61 and 9445 of them. Precisely 139 out of the latter codes are maximal and explicitly described. We also study other classes of G(n,d)codes.


Doctorat en sciences, Spécialisation mathématiques
info:eu-repo/semantics/nonPublished

APA, Harvard, Vancouver, ISO, and other styles
10

Dansie, B. R. "The analysis of permutations /." Title page, contents and abstract only, 1988. http://web4.library.adelaide.edu.au/theses/09PH/09phd191.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Permutations"

1

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

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Tidhar, Lavie. Cloud permutations. [Hornsea]: PS Publishing, 2010.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Maughn, James. The Arakaki permutations. United States: Black Radish Books, 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Strauss, Anselm L. Continual permutations of action. New Brunswick, N.J: AldineTransaction, 2008.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Camina, A. R. Linear groups and permutations. Boston: Pitman Advanced Publishing Program, 1985.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Pfahl, John. Permutations on the picturesque. Syracuse, NY: Robert B. Menschel Photography Gallery, Schine Student Center, Syracuse University, 1997.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Pfahl, John. Permutations on the picturesque. [Syracuse, NY: Robert B. Menschel Photography Gallery, Schine Student Center, Syracuse University, 1997.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Strauss, Anselm L. Continual permutations of action. New Brunswick, N.J: AldineTransaction, 2008.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Camina, A. R. Linear groups and permutations. Boston: Pitman, 1985.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Kitaev, Sergey. Patterns in Permutations and Words. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-17333-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Permutations"

1

Petersen, T. Kyle. "Permutations." In Inquiry-Based Enumerative Combinatorics, 33–41. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-18308-0_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Sane, Sharad S. "Permutations." In Texts and Readings in Mathematics, 39–56. Gurgaon: Hindustan Book Agency, 2013. http://dx.doi.org/10.1007/978-93-86279-55-2_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Armstrong, M. A. "Permutations." In 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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Blyth, T. S., and E. F. Robertson. "Permutations." In Sets and Mappings, 76–97. Dordrecht: Springer Netherlands, 1986. http://dx.doi.org/10.1007/978-94-015-7713-7_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Tapp, Kristopher. "Permutations." In Symmetry, 75–86. New York, NY: Springer New York, 2011. http://dx.doi.org/10.1007/978-1-4614-0299-2_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Effinger, Gove, and Gary L. Mullen. "Permutations." In 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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Johnson, Tom, and Franck Jedrzejewski. "Permutations." In Looking at Numbers, 1–20. Basel: Springer Basel, 2013. http://dx.doi.org/10.1007/978-3-0348-0554-4_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Kerber, Adalbert. "Permutations." In Algorithms and Combinatorics, 275–316. Berlin, Heidelberg: Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/978-3-662-11167-3_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Caulton, Adam. "Permutations." In The Routledge Companion to Philosophy of Physics, 578–94. New York: Routledge, 2021. http://dx.doi.org/10.4324/9781315623818-54.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Golomb, Solomon W., and Andy Liu. "Permutations." In 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.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Permutations"

1

Galvão, Gustavo Rodrigues, and Zanoni Dias. "Algorithms for Sorting by Reversals or Transpositions, with Application to Genome Rearrangement." In 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.

Full text
Abstract:
The problem of finding the minimum sequence of rearrangements that transforms one genome into another is a well-studied problem that finds application in comparative genomics. Representing genomes as permutations, in which genes appear as elements, that problem can be reduced to the combinatorial problem of sorting a permutation using a minimum number of rearrangements. Such combinatorial problem varies according to the types of rearrangements considered. The PhD thesis summarized in this paper presents exact, approximation, and heuristic algorithms for solving variants of the permutation sorting problem involving two types of rearrangements: reversals and transpositions.
APA, Harvard, Vancouver, ISO, and other styles
2

Ryabov, Vladimir Gennadievich. "On number of substitutions of vector space over finite field with affine approximations with given accuracy." In 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.

Full text
Abstract:
Nonlinear mapping of a vector space over a finite field in vector space over the same field and, in particular, the non-linearity the permutation space is defined in terms of the Hamming distance to sets of affine mappings. For permutations of an n-dimensional vector space over a field of q elements, an upper bound for the number permutations with non-linearity, not higher than a given value r, where 0 ≤ r < q<sup>n</sup> - q<sup>n-1</sup>, and for r < (q<sup>n</sup> - q<sup>n-1</sup>)/2, the exact the value of the specified number, which allows us to draw conclusions about distribution of nonlinearity on the set of substitutions.
APA, Harvard, Vancouver, ISO, and other styles
3

Matyushkin, Igor, and Pavel Rubis. "CELLULAR AUTOMATA ALGORITHMS FOR PSEUDORANDOM NUMBERS GENERATION." In 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.

Full text
Abstract:
Work describes four permutation algorithms of square matrices based on cyclic rows and columns shifts. This choice of discrete transformation algorithms is justified by the convenience of the cellular automaton (CA) formulation. Output matrices can be considered as pseudo-random sequences of numbers. As a result of numerical calculation, empirical formulas are obtained for the permutation period and the function of the period of a single CA-cell on the order of the matrix n. As a parameter of CA dynamics, we analyze two "mixing metrics" on permutations of the matrix (compared to the initial matrix).
APA, Harvard, Vancouver, ISO, and other styles
4

Skala, Matthew. "Counting distance permutations." In 2008 IEEE 24th International Conference on Data Engineeing workshop (ICDE Workshop 2008). IEEE, 2008. http://dx.doi.org/10.1109/icdew.2008.4498346.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Chen, Yiling, Lance Fortnow, Evdokia Nikolova, and David M. Pennock. "Betting on permutations." In the 8th ACM conference. New York, New York, USA: ACM Press, 2007. http://dx.doi.org/10.1145/1250910.1250957.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Skala, Matthew. "Counting Distance Permutations." In 2008 First International Workshop on Similarity Search and Applications (SISAP). IEEE, 2008. http://dx.doi.org/10.1109/sisap.2008.15.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Domsa, Ovidiu, and Nicolae Bold. "GENERATOR OF VARIANTS OF TESTS USING THE SAME QUESTIONS." In eLSE 2016. Carol I National Defence University Publishing House, 2016. http://dx.doi.org/10.12753/2066-026x-16-174.

Full text
Abstract:
To obtain the expected results in the academic environment, various mechanisms for presenting the information in a form as much as attractive were made. This thing implied the development of complex means which involves the usage of technical and software support as varied as possible. Another important component related to learning validation is the assessment component. In this moment, a variety of assessment mechanisms exists, from the classical ones which use detailed requirements and answers to those which use templates with simple or more complex questions and answers. In the assessment process it is important to use tests with the same content for all the students, in order to obtain a correct hierarchy of them. However, for a better security regarding the answers given by the student, it is useful to elaborate more test variants with the same questions, but with answers numbered in a different way. The generator presented in this paper uses a probabilistic algorithm for solving this request. The generator accomplishes two roles: firstly, it does the generation of a random permutation of the answers choices and, secondly, it generates a random permutation of the questions which forms the test. A specified number of tests will be generated using these permutations. The application which uses the generator contains three files: the first one with the question statements, the second one with the answers choices and the third with the right answer. Using the generator for the permutations of answers choices and of questions, variants of the same test are obtained.
APA, Harvard, Vancouver, ISO, and other styles
8

Moraga, Claudio. "Permutations under Spectral Transforms." In 2008 38th International Symposium on Multiple Valued Logic (ismvl 2008). IEEE, 2008. http://dx.doi.org/10.1109/ismvl.2008.16.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Wang, Da, Arya Mazumdar, and Gregory W. Wornell. "Lossy compression of permutations." In 2014 IEEE International Symposium on Information Theory (ISIT). IEEE, 2014. http://dx.doi.org/10.1109/isit.2014.6874785.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Su, Lili, Farzad Farnoud, and Olgica Milenkovic. "Similarity distances between permutations." In 2014 IEEE International Symposium on Information Theory (ISIT). IEEE, 2014. http://dx.doi.org/10.1109/isit.2014.6875237.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Permutations"

1

Tovar, Benjamin, Luigi Freda, and Steven M. LaValle. Learning Combinatorial Map Information from Permutations of Landmarks. Fort Belvoir, VA: Defense Technical Information Center, October 2010. http://dx.doi.org/10.21236/ada536930.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Horan, Victoria. Overlap Cycles for Permutations: Necessary and Sufficient Conditions. Fort Belvoir, VA: Defense Technical Information Center, September 2013. http://dx.doi.org/10.21236/ada623587.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Tavare, 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, August 1992. http://dx.doi.org/10.21236/ada257259.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Alexander-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), June 1985. http://dx.doi.org/10.2172/5791338.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Ray, Jason, James Kinnebrew, Ramsay Bell, and Martin Schultz. Sensitivity of simulated flaw-height estimates to phased array scan parameters. Engineer Research and Development Center (U.S.), August 2023. http://dx.doi.org/10.21079/11681/47403.

Full text
Abstract:
Phased array ultrasonic testing (PAUT) is a nondestructive testing (NDT) technique for detecting and sizing flaws in welds. Estimates of flaw size are sensitive to a variety of PAUT scan parameters. In this study, estimates of flaw height are simulated using computer software. The sensitivity of these estimates to selected PAUT scan parameters is analyzed to identify those that have the greatest influence on estimates of flaw height. Understanding how varying different parameters within a phased array instrument affects the accuracy of flaw-height estimates helps to validate PAUT scan procedures and improve flaw-height estimates. For this research, a series of permutations on selected flaws were performed to see how certain parameters affect the accuracy in sizing flaw height. In addition, an analysis on how beam spread leads to flaw sizing inaccuracies was also conducted as part of this work.
APA, Harvard, Vancouver, ISO, and other styles
6

FLORIDA STATE UNIV TALLAHASSEE. Scrambled Sobol Sequences via Permutation. Fort Belvoir, VA: Defense Technical Information Center, January 2009. http://dx.doi.org/10.21236/ada510216.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Kilian, Joe, Shlomo Kipnis, and Charles E. Leiserson. The Organization of Permutation Architectures with Bussed Interconnections. Fort Belvoir, VA: Defense Technical Information Center, October 1987. http://dx.doi.org/10.21236/ada208817.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Bugni, Federico A., and Joel L. Horowitz. Permutation tests for equality of distributions of functional data. The IFS, March 2018. http://dx.doi.org/10.1920/wp.cem.2018.1818.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Dworkin, Morris J. SHA-3 Standard: Permutation-Based Hash and Extendable-Output Functions. National Institute of Standards and Technology, July 2015. http://dx.doi.org/10.6028/nist.fips.202.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Permutations' for particular source types:
Journal articles Dissertations / Theses Books
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!

To the bibliography