Relevant bibliographies by topics / Permutation

Contents

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

Academic literature on the topic 'Permutation'

Author: Grafiati
Published: 4 June 2021
Last updated: 25 July 2025

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

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

1

Malyshev, Fedor M. "Realization of even permutations of even degree by products of four involutions without fixed points." Discrete Mathematics and Applications 34, no. 5 (2024): 263–76. http://dx.doi.org/10.1515/dma-2024-0023.

Full text
Abstract:
Abstract We consider representations of an arbitrary permutation π of degree 2n, n ⩾ 3, by products of the so-called (2 n )-permutations (any cycle of such a permutation has length 2). We show that any even permutation is represented by the product of four (2 n )-permutations. Products of three (2 n )-permutations cannot represent all even permutations. Any odd permutation is realized (for odd n) by a product of five (2 n )-permutations.
APA, Harvard, Vancouver, ISO, and other styles
2

Adamczak, William. "A Note on the Structure of Roller Coaster Permutations." Journal of Mathematics Research 9, no. 3 (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 w
APA, Harvard, Vancouver, ISO, and other styles
3

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 (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 ℕ ha
APA, Harvard, Vancouver, ISO, and other styles
4

Miranda, Guilherme Henrique Santos, Alexsandro Oliveira Alexandrino, Carla Negri Lintzmayer та Zanoni Dias. "Approximation Algorithms for Sorting λ-Permutations by λ-Operations". Algorithms 14, № 6 (2021): 175. http://dx.doi.org/10.3390/a14060175.

Full text
Abstract:
Understanding how different two organisms are is one question addressed by the comparative genomics field. A well-accepted way to estimate the evolutionary distance between genomes of two organisms is finding the rearrangement distance, which is the smallest number of rearrangements needed to transform one genome into another. By representing genomes as permutations, one of them can be represented as the identity permutation, and, so, we reduce the problem of transforming one permutation into another to the problem of sorting a permutation using the minimum number of rearrangements. This work
APA, Harvard, Vancouver, ISO, and other styles
5

Bean, Christian, Émile Nadeau, Jay Pantone, and Henning Ulfarsson. "Using large random permutations to partition permutation classes." Pure Mathematics and Applications 30, no. 1 (2022): 31–36. http://dx.doi.org/10.2478/puma-2022-0006.

Full text
Abstract:
Abstract Permutation classes are sets of permutations defined by the absence of certain substructures. In some cases permutation classes can be decomposed as unions of subclasses. We use combinatorial specifications automatically discovered by Combinatorial Exploration: An algorithmic framework for enumeration, Albert et al. 2022, to uniformly generate large random permutations in a permutation class, and apply clustering methods to partition them into interesting subclasses. We seek to automate as much of this process as possible.
APA, Harvard, Vancouver, ISO, and other styles
6

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
7

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

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

Brualdi, Richard A., and Geir Dahl. "Permutation Matrices, Their Discrete Derivatives and Extremal Properties." Vietnam Journal of Mathematics 48, no. 4 (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
9

KRASILENKO, VLADIMIR, NATALIYA YURCHUK, and DIANA NIKITOVICH. "THE APPLICATION OF ISOMORPHIC MATRIX REPRESENTATIONS FOR MODELING THE PROTOCOL FOR THE FORMATION OF SECRET KEYS-PERMUTATIONS OF HUGE SIZES." HERALD OF KHMELNYTSKYI NATIONAL UNIVERSITY 295, no. 2 (2021): 78–88. http://dx.doi.org/10.31891/2307-5732-2021-295-2-78-88.

Full text
Abstract:
A The article considers the peculiarities of the application of isomorphic matrix representations for modeling the protocol of matching secret keys-permutations of significant dimension. The situation is considered when for cryptographic transformations of blocks with a length of 256 * 256 bytes, presented in the form of a matrix of a black-and-white image, it is necessary to rearrange all bytes in accordance with the matrix keys. To generate a basic matrix key and the appearance of the components KeyA and KeyB in the format of two black and white images, a software module using engineering ma
APA, Harvard, Vancouver, ISO, and other styles
10

WANG, LI-YUAN, and HAI-LIANG WU. "APPLICATIONS OF LERCH’S THEOREM TO PERMUTATIONS OF QUADRATIC RESIDUES." Bulletin of the Australian Mathematical Society 100, no. 3 (2019): 362–71. http://dx.doi.org/10.1017/s000497271900073x.

Full text
Abstract:
Let $n$ be a positive integer and $a$ an integer prime to $n$. Multiplication by $a$ induces a permutation over $\mathbb{Z}/n\mathbb{Z}=\{\overline{0},\overline{1},\ldots ,\overline{n-1}\}$. Lerch’s theorem gives the sign of this permutation. We explore some applications of Lerch’s result to permutation problems involving quadratic residues modulo $p$ and confirm some conjectures posed by Sun [‘Quadratic residues and related permutations and identities’, Preprint, 2018, arXiv:1809.07766]. We also study permutations involving arbitrary $k$th power residues modulo $p$ and primitive roots modulo
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Permutation"

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 t
APA, Harvard, Vancouver, ISO, and other styles
2

Neou, Both Emerite. "Permutation pattern matching." Thesis, Paris Est, 2017. http://www.theses.fr/2017PESC1239/document.

Full text
Abstract:
Cette thèse s'intéresse au problème de la recherche de motif dans les permutations, qui a pour objectif de savoir si un motif apparaît dans un texte, en prenant en compte que le motif et le texte sont des permutations. C'est-à-dire s'il existe des éléments du texte tel que ces éléments sont triés de la même manière et apparaissent dans le même ordre que les éléments du motif. Ce problème est NP complet. Cette thèse expose des cas particuliers de ce problème qui sont solvable en temps polynomial.Pour cela nous étudions le problème en donnant des contraintes sur le texte et/ou le motif. En parti
APA, Harvard, Vancouver, ISO, and other styles
3

Cernes, John. "Ends of permutation groups and some centrality properties of permutational wreath products." Thesis, University of Oxford, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.339282.

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

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 qua
APA, Harvard, Vancouver, ISO, and other styles
5

Urfer, Jean-Marie. "Modules d'endo-p-permutation /." [S.l.] : [s.n.], 2006. http://library.epfl.ch/theses/?nr=3544.

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

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

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

BREGA, LEONARDO SANTOS. "COMPRESSION USING PERMUTATION CODES." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2003. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=4379@1.

Full text
Abstract:
COORDENAÇÃO DE APERFEIÇOAMENTO DO PESSOAL DE ENSINO SUPERIOR<br>Em um sistema de comunicações, procura-se representar a informação gerada de forma eficiente, de modo que a redundância da informação seja reduzida ou idealmente eliminada, com o propósito de armazenamento e/ou transmissão da mesma. Este interesse justifica portanto, o estudo e desenvolvimento de técnicas de compressão que vem sendo realizado ao longo dos anos. Este trabalho de pesquisa investiga o uso de códigos de permutação para codificação de fontes segundo um critério de fidelidade, mais especificamente de fontes se
APA, Harvard, Vancouver, ISO, and other styles
8

Diene, Adama. "Structure of Permutation Polynomials." University of Cincinnati / OhioLINK, 2005. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1123788311.

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

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

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

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

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

Books on the topic "Permutation"

1

Passman, Donald S. Permutation groups. Dover Publications, Inc., 2012.

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

Mielke, Paul W., and Kenneth J. Berry. Permutation Methods. Springer New York, 2007. http://dx.doi.org/10.1007/978-0-387-69813-7.

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

Good, Phillip. Permutation Tests. Springer New York, 2000. http://dx.doi.org/10.1007/978-1-4757-3235-1.

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

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

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

Good, Phillip. Permutation Tests. Springer New York, 1994. http://dx.doi.org/10.1007/978-1-4757-2346-5.

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

Linton, Steve, Nik Ruskuc, and Vincent Vatter, eds. Permutation Patterns. Cambridge University Press, 2009. http://dx.doi.org/10.1017/cbo9780511902499.

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

Mielke, Paul W., and Kenneth J. Berry. Permutation Methods. Springer New York, 2001. http://dx.doi.org/10.1007/978-1-4757-3449-2.

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

Brian, Mortimer, ed. Permutation groups. Springer, 1996.

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

Bradbury, Ian Stuart. Permutation tests. University of Birmingham, 1987.

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

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

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Permutation"

1

Weik, Martin H. "permutation." In Computer Science and Communications Dictionary. Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_13852.

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

Dixon, John D., and Brian Mortimer. "The Basic Ideas." In Permutation Groups. Springer New York, 1996. http://dx.doi.org/10.1007/978-1-4612-0731-3_1.

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

Dixon, John D., and Brian Mortimer. "Examples and Constructions." In Permutation Groups. Springer New York, 1996. http://dx.doi.org/10.1007/978-1-4612-0731-3_2.

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

Dixon, John D., and Brian Mortimer. "The Action of a Permutation Group." In Permutation Groups. Springer New York, 1996. http://dx.doi.org/10.1007/978-1-4612-0731-3_3.

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

Dixon, John D., and Brian Mortimer. "The Structure of a Primitive Group." In Permutation Groups. Springer New York, 1996. http://dx.doi.org/10.1007/978-1-4612-0731-3_4.

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

Dixon, John D., and Brian Mortimer. "Bounds on Orders of Permutation Groups." In Permutation Groups. Springer New York, 1996. http://dx.doi.org/10.1007/978-1-4612-0731-3_5.

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

Dixon, John D., and Brian Mortimer. "The Mathieu Groups and Steiner Systems." In Permutation Groups. Springer New York, 1996. http://dx.doi.org/10.1007/978-1-4612-0731-3_6.

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

Dixon, John D., and Brian Mortimer. "Multiply Transitive Groups." In Permutation Groups. Springer New York, 1996. http://dx.doi.org/10.1007/978-1-4612-0731-3_7.

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

Dixon, John D., and Brian Mortimer. "The Structure of the Symmetric Groups." In Permutation Groups. Springer New York, 1996. http://dx.doi.org/10.1007/978-1-4612-0731-3_8.

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

Dixon, John D., and Brian Mortimer. "Examples and Applications of Infinite Permutation Groups." In Permutation Groups. Springer New York, 1996. http://dx.doi.org/10.1007/978-1-4612-0731-3_9.

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

Conference papers on the topic "Permutation"

1

Burge, Iain, Minh Thong Mai, and Michel Barbeau. "A Permutation Dispatch Circuit Design for Quantum Permutation Pad Symmetric Encryption." In 2024 13th International Conference on Communications, Circuits and Systems (ICCCAS). IEEE, 2024. http://dx.doi.org/10.1109/icccas62034.2024.10652827.

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

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 sort
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 ma
APA, Harvard, Vancouver, ISO, and other styles
4

Wang, Lusheng, and David Binet. "Best permutation." In the 2009 International Conference. ACM Press, 2009. http://dx.doi.org/10.1145/1582379.1582574.

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

Gurevich, Maxim, and Tamás Sarlós. "Permutation indexing." In the 22nd ACM international conference. ACM Press, 2013. http://dx.doi.org/10.1145/2505515.2505646.

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

"Permutation Tests." In APRIL 29-MAY 1, 2025 PARIS (FRANCE). Universal Researchers (UAE), 2025. https://doi.org/10.17758/uruae25.c0425133.

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

Alsalem, Shuker, Abu F. Almusawi, and Enoch Suleiman. "On permutation G-part in permutation Q-algebras." In International Conference on Mathematical and Statistical Physics, Computational Science, Education, and Communication (ICMSCE 2022), edited by Lazim Abdullah and Norma bt Alias. SPIE, 2023. http://dx.doi.org/10.1117/12.2674993.

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

Alsalem, Shuker, Abu Firas Al Musawi, and Enoch Suleiman. "On Permutation Upper and Transitive Permutation BE-Algebras." In 2022 14th International Conference on Mathematics, Actuarial Science, Computer Science and Statistics (MACS). IEEE, 2022. http://dx.doi.org/10.1109/macs56771.2022.10022454.

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

Haney, Michael W. "Optoelectronic Shuffle-Exchange Network for Multiprocessor Architectures." In Photonic Switching. Optica Publishing Group, 1991. http://dx.doi.org/10.1364/phs.1991.we19.

Full text
Abstract:
The perfect shuffle (PS) [1] is one of the most studied interconnection patterns for multiprocessor architectures. PS links are coupled to arrays of local 2×2 exchange/bypass switches to form shuffle/exchange networks. These networks perform arbitrary permutations of the elements in multistage interconnection networks for applications such as routing and sorting [2,3]. The PS of a 1-D array results by interleaving the elements of the first half of the array with those of the second half, with the first and last elements remaining unchanged in their position. For example, the PS of the 8 elemen
APA, Harvard, Vancouver, ISO, and other styles
10

Etzel, Joset A. "MVPA Permutation Schemes: Permutation Testing for the Group Level." In 2015 International Workshop on Pattern Recognition in NeuroImaging (PRNI). IEEE, 2015. http://dx.doi.org/10.1109/prni.2015.29.

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

Reports on the topic "Permutation"

1

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

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

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

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

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

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

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

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

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

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

Goff, James, Charles Sievers, Mitchell Wood, and Aidan Thompson. Permutation-adapted complete and independent basis for atomic cluster expansion descriptors. Office of Scientific and Technical Information (OSTI), 2022. http://dx.doi.org/10.2172/1879613.

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

Kamat, Vishal, and Ivan A. Canay. Approximate permutation tests and induced order statistics in the regression discontinuity design. Institute for Fiscal Studies, 2015. http://dx.doi.org/10.1920/wp.cem.2015.2715.

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

Canay, Ivan A., and Vishal Kamat. Approximate permutation tests and induced order statistics in the regression discontinuity design. IFS, 2016. http://dx.doi.org/10.1920/wp.cem.2016.3316.

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

Canay, Ivan A., and Vishal Kamat. Approximate permutation tests and induced order statistics in the regression discontinuity design. The IFS, 2017. http://dx.doi.org/10.1920/wp.cem.2017.2117.

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

Данильчук, Г. Б., О. А. Засядько та В. М. Соловйов. Застосування методів теорії складних систем при оцінці економічної безпеки підприємства. Видавець Вовчок О.Ю., 2017. http://dx.doi.org/10.31812/0564/1260.

Full text
Abstract:
The paper estimated the financial stability of the enterprise «Motor Sich» network measures and using permutation entropy. The analysis and comparison of the weights with integrated measurement of financial security. The conclusions about the possibility of using methods of the theory of complex systems in assessing economic security.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Permutation' 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