Zaloguj się

Gotowe bibliografie tematyczne / Permutations / Artykuły w czasopismach

Kliknij ten link, aby zobaczyć inne rodzaje publikacji na ten temat: Permutations.

Artykuły w czasopismach na temat „Permutations”

Autor: Grafiati

Data publikacji: 4 czerwca 2021

Data aktualizacji: 25 lipca 2025

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Sprawdź 50 najlepszych artykułów w czasopismach 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.

Przeglądaj artykuły w czasopismach z różnych dziedzin i twórz odpowiednie bibliografie.

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.

Pełny tekst źródła

Streszczenie:

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.

Style APA, Harvard, Vancouver, ISO itp.

2

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.

Pełny tekst źródła

Streszczenie:

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

Style APA, Harvard, Vancouver, ISO itp.

3

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

Pełny tekst źródła

Streszczenie:

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 substitutio

Style APA, Harvard, Vancouver, ISO itp.

4

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.

Pełny tekst źródła

Streszczenie:

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

Style APA, Harvard, Vancouver, ISO itp.

5

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.

Pełny tekst źródła

Streszczenie:

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.

Style APA, Harvard, Vancouver, ISO itp.

6

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.

Pełny tekst źródła

Streszczenie:

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 crystal

Style APA, Harvard, Vancouver, ISO itp.

7

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 (2019): 61–72. http://dx.doi.org/10.1142/s0129054119400033.

Pełny tekst źródła

Streszczenie:

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 gra

Style APA, Harvard, Vancouver, ISO itp.

8

Just, Matthew, and Hua Wang. "Note on packing patterns in colored permutations." Online Journal of Analytic Combinatorics, no. 11 (December 31, 2016): 1–9. https://doi.org/10.61091/ojac-1104.

Pełny tekst źródła

Streszczenie:

Packing patterns in permutations concerns finding the permutation with the maximum number of a prescribed pattern. In 2002, Albert, Atkinson, Handley, Holton and Stromquist showed that there always exists a layered permutation containing the maximum number of a layered pattern among all permutations of length n. Consequently the packing density for all but two (up to equivalence) patterns up to length 4 can be obtained. In this note we consider the analogous question for colored patterns and permutations. By introducing the concept of “colored blocks” we characterize the optimal permutations w

Style APA, Harvard, Vancouver, ISO itp.

9

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

Pełny tekst źródła

Streszczenie:

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 lo

Style APA, Harvard, Vancouver, ISO itp.

10

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

Pełny tekst źródła

Streszczenie:

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.

Style APA, Harvard, Vancouver, ISO itp.

11

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.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

12

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

Pełny tekst źródła

Streszczenie:

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

Style APA, Harvard, Vancouver, ISO itp.

13

Recchia, Gabriel, Magnus Sahlgren, Pentti Kanerva, and Michael N. Jones. "Encoding Sequential Information in Semantic Space Models: Comparing Holographic Reduced Representation and Random Permutation." Computational Intelligence and Neuroscience 2015 (2015): 1–18. http://dx.doi.org/10.1155/2015/986574.

Pełny tekst źródła

Streszczenie:

Circular convolution and random permutation have each been proposed as neurally plausible binding operators capable of encoding sequential information in semantic memory. We perform several controlled comparisons of circular convolution and random permutation as means of encoding paired associates as well as encoding sequential information. Random permutations outperformed convolution with respect to the number of paired associates that can be reliably stored in a single memory trace. Performance was equal on semantic tasks when using a small corpus, but random permutations were ultimately cap

Style APA, Harvard, Vancouver, ISO itp.

14

Drakakis, Konstantinos. "On the Measurement of the (Non)linearity of Costas Permutations." Journal of Applied Mathematics 2010 (2010): 1–14. http://dx.doi.org/10.1155/2010/149658.

Pełny tekst źródła

Streszczenie:

We study several criteria for the (non)linearity of Costas permutations, with or without the imposition of additional algebraic structure in the domain and the range of the permutation, aiming to find one that successfully identifies Costas permutations as more nonlinear than randomly chosen permutations of the same order.

Style APA, Harvard, Vancouver, ISO itp.

15

QI, XINGQIN, GUOJUN LI, JICHANG WU, and BINGQIANG LIU. "SORTING SIGNED PERMUTATIONS BY FIXED-LENGTH REVERSALS." International Journal of Foundations of Computer Science 17, no. 04 (2006): 933–48. http://dx.doi.org/10.1142/s0129054106004194.

Pełny tekst źródła

Streszczenie:

A signed n-permutation is a permutation on {1,2,…,n} in which each element is labelled by a positive or negative sign. Here we consider the problem of sorting signed permutations by fixed-length reversals. Indeed, limiting the transformations to reversals of length exactly k can be very restrictive, for example, (+1,+3,+2,+4,…,+n) can never be sorted to (+1,+2,+3,+4,…,+n) by 2-reversals. That is, for given two signed permutations it is not obvious whether they can be sorted to each other by k-reversals. Thus in 1996, Chen and Skiena gave the following open problem: what is the connectedness of

Style APA, Harvard, Vancouver, ISO itp.

16

Choi, Wonseok, Jooyoung Lee, and Yeongmin Lee. "Building PRFs from TPRPs: Beyond the Block and the Tweak Length Bounds." IACR Transactions on Symmetric Cryptology 2024, no. 1 (2024): 35–70. http://dx.doi.org/10.46586/tosc.v2024.i1.35-70.

Pełny tekst źródła

Streszczenie:

A secure n-bit tweakable block cipher (TBC) using t-bit tweaks can be modeled as a tweakable uniform random permutation, where each tweak defines an independent random n-bit permutation. When an input to this tweakable permutation is fixed, it can be viewed as a perfectly secure t-bit random function. On the other hand, when a tweak is fixed, it can be viewed as a perfectly secure n-bit random permutation, and it is well known that the sum of two random permutations is pseudorandom up to 2n queries.A natural question is whether one can construct a pseudorandom function (PRF) beyond the block a

Style APA, Harvard, Vancouver, ISO itp.

17

SMYCZYŃSKI, SEBASTIAN. "CONSTANT-MEMORY ITERATIVE GENERATION OF SPECIAL STRINGS REPRESENTING BINARY TREES." International Journal of Foundations of Computer Science 23, no. 02 (2012): 375–87. http://dx.doi.org/10.1142/s0129054112400187.

Pełny tekst źródła

Streszczenie:

The shapes of binary trees can be encoded as permutations having a very special property. These permutations are tree permutations, or equivalently they avoid subwords of the type 231. The generation of binary trees in natural order corresponds to the generation of these special permutations in the lexicographic order. In this paper we use a stringologic approach to the generation of these special permutations: decompositions of essential parts into the subwords having staircase shapes. A given permutation differs from the next one with respect to its tail called here the working suffix. Some

Style APA, Harvard, Vancouver, ISO itp.

18

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.

Pełny tekst źródła

Streszczenie:

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.

Style APA, Harvard, Vancouver, ISO itp.

19

Cioni, Lapo, and Luca Ferrari. "Sorting with a popqueue." RAIRO - Theoretical Informatics and Applications 58 (2024): 13. http://dx.doi.org/10.1051/ita/2024010.

Pełny tekst źródła

Streszczenie:

We introduce a new sorting device for permutations, which we call popqueue. It consists of a special queue, having the property that any time one wants to extract elements from the queue, actually all the elements currently in the queue are poured into the output. We illustrate two distinct optimal algorithms, called Min and Cons, to sort a permutation using such a device, which allow us also to characterize sortable permutations in terms of pattern avoidance. We next investigate what happens by making two passes through a popqueue, showing that the set of sortable permutations is not a class

Style APA, Harvard, Vancouver, ISO itp.

20

Mishin, Dmitry V., Anatoly A. Gladkikh, Vladislav I. Kutuzov, and Aqeel Latif Khudair. "Research of cognitive data processing in radio communication systems with permutation decoding." Physics of Wave Processes and Radio Systems 27, no. 1 (2024): 103–12. http://dx.doi.org/10.18469/1810-3189.2024.27.1.103-112.

Pełny tekst źródła

Streszczenie:

Background. The need to use permutation decoding tools in radio communication systems is explained by the increased error correction capabilities of this method. In this case, complex matrix calculations during the search for equivalent codes according to the classical scheme of permutation decoding are replaced by a list of ready-made solutions. These solutions are calculated a priori and entered into the cognitive cards of the decoder processor, which makes the method a convenient tool in the procedure for ensuring information reliability when controlling, for example, unmanned vehicles via

Style APA, Harvard, Vancouver, ISO itp.

21

Liu, Mengyu, and Huilan Li. "A Hopf Algebra on Permutations Arising from Super-Shuffle Product." Symmetry 13, no. 6 (2021): 1010. http://dx.doi.org/10.3390/sym13061010.

Pełny tekst źródła

Streszczenie:

In this paper, we first prove that any atom of a permutation obtained by the super-shuffle product of two permutations can only consist of some complete atoms of the original two permutations. Then, we prove that the super-shuffle product and the cut-box coproduct on permutations are compatible, which makes it a bialgebra. As this algebra is graded and connected, it is a Hopf algebra.

Style APA, Harvard, Vancouver, ISO itp.

22

BLOCK, LOUIS, ALEXANDER M. BLOKH, and ETHAN M. COVEN. "ZERO ENTROPY PERMUTATIONS." International Journal of Bifurcation and Chaos 05, no. 05 (1995): 1331–37. http://dx.doi.org/10.1142/s0218127495001009.

Pełny tekst źródła

Streszczenie:

The entropy of a permutation is the (topological) entropy of the "connect-the-dots" map determined by it. We give matrix- and graph-theoretic, geometric, and dynamical characterizations of zero entropy permutations, as well as a procedure for constructing all of them. We also include some information about the number of zero entropy permutations.

Style APA, Harvard, Vancouver, ISO itp.

23

GNEDIN, ALEXANDER, ALEXANDER IKSANOV, and ALEXANDER MARYNYCH. "A Generalization of the Erdős–Turán Law for the Order of Random Permutation." Combinatorics, Probability and Computing 21, no. 5 (2012): 715–33. http://dx.doi.org/10.1017/s0963548312000247.

Pełny tekst źródła

Streszczenie:

We consider random permutations derived by sampling from stick-breaking partitions of the unit interval. The cycle structure of such a permutation can be associated with the path of a decreasing Markov chain on n integers. Under certain assumptions on the stick-breaking factor we prove a central limit theorem for the logarithm of the order of the permutation, thus extending the classical Erdős–Turán law for the uniform permutations and its generalization for Ewens' permutations associated with sampling from the PD/GEM(θ)-distribution. Our approach is based on using perturbed random walks to ob

Style APA, Harvard, Vancouver, ISO itp.

24

KING, DEBORAH M. "Maximal entropy of permutations of even order." Ergodic Theory and Dynamical Systems 17, no. 6 (1997): 1409–17. http://dx.doi.org/10.1017/s0143385797086367.

Pełny tekst źródła

Streszczenie:

A finite invariant set of a continuous map of an interval induces a permutation called its type. If this permutation is a cycle, it is called its orbit type. It has been shown by Geller and Tolosa that Misiurewicz–Nitecki orbit types of period $n$ congruent to $1$ (mod 4) and their generalizations to orbit types of period $n$ congruent to $3$ (mod 4) have maximal entropy among all orbit types of odd period $n$, and indeed among all permutations of period $n$. We further generalize this family to permutations of even period $n$ and show that they again attain maximal entropy amongst $n$-permuta

Style APA, Harvard, Vancouver, ISO itp.

25

Hajnal, Péter. "A short note on Layman permutations." Acta Universitatis Sapientiae, Mathematica 14, no. 2 (2022): 231–38. http://dx.doi.org/10.2478/ausm-2022-0015.

Pełny tekst źródła

Streszczenie:

Abstract A permutation p of [k] = {1, 2, 3, …, k} is called Layman permutation iff i + p(i) is a Fibonacci number for 1 ≤ i ≤ k. This concept is introduced by Layman in the A097082 entry of the Encyclopedia of Integers Sequences, that is the number of Layman permutations of [n]. In this paper, we will study Layman permutations. We introduce the notion of the Fibonacci complement of a natural number, that plays a crucial role in our investigation. Using this notion we prove some results on the number of Layman permutations, related to a conjecture of Layman that is implicit in the A097083 entry

Style APA, Harvard, Vancouver, ISO itp.

26

Enayat, Enayatullah. "Using Tree Graphs to Solve Some Problems in Combinatorial Analysis." Samangan Academic & Research Journal 2, no. 01 (2024): 90–105. https://doi.org/10.64226/sarj.v2i01.47.

Pełny tekst źródła

Streszczenie:

This paper aims to explore computational methods for solving non-repetitive and repetitive permutations using tree graphs as tools for representation and problem-solving in combinatorial analysis. The study aims to assess the effectiveness of tree graphs in addressing these problems and to identify their limitations in cases involving repetitive elements. The study employs a systematic review, sourcing literature from reputable databases like Web of Science, Scopus, and IEEE and search engines such as Google Scholar. Specific keywords related to permutations, graphs, and generating functions w

Style APA, Harvard, Vancouver, ISO itp.

27

Wocjan, Paweł, and Michał Horodecki. "Characterization of Combinatorially Independent Permutation Separability Criteria." Open Systems & Information Dynamics 12, no. 04 (2005): 331–45. http://dx.doi.org/10.1007/s11080-005-4483-2.

Pełny tekst źródła

Streszczenie:

The so-called permutation separability criteria are simple operational conditions that are necessary for separability of mixed states of multipartite systems: (1) permute the indices of the density matrix and (2) check if the trace norm of at least one of the resulting operators is greater than one. If it is greater than one then the state is necessarily entangled. A shortcoming of the permutation separability criteria is that many permutations give rise to equivalent separability criteria. Therefore, we introduce a necessary condition for two permutations to yield independent criteria called

Style APA, Harvard, Vancouver, ISO itp.

28

Donets, G. A., and V. I. Biletskyi. "On the Problem of a Linear Function Localization on Permutations." Cybernetics and Computer Technologies, no. 2 (July 24, 2020): 14–18. http://dx.doi.org/10.34229/2707-451x.20.2.2.

Pełny tekst źródła

Streszczenie:

Combinatorial optimization problems and methods of their solution have been a subject of numerous studies, since a large number of practical problems are described by combinatorial optimization models. Many studies consider approaches to and describe methods of solution for combinatorial optimization problems with linear or fractionally linear target functions on combinatorial sets such as permutations and arrangements. Studies consider solving combinatorial problems by means of well-known methods, as well as developing new methods and algorithms of searching a solution. We describe a method o

Style APA, Harvard, Vancouver, ISO itp.

29

Faure, Emil, Anatoly Shcherba, Mykola Makhynko, Bohdan Stupka, Joanna Nikodem, and Ruslan Shevchuk. "Permutation-Based Block Code for Short Packet Communication Systems." Sensors 22, no. 14 (2022): 5391. http://dx.doi.org/10.3390/s22145391.

Pełny tekst źródła

Streszczenie:

This paper presents an approach to the construction of block error-correcting code for data transmission systems with short packets. The need for this is driven by the necessity of information interaction between objects of machine-type communication network with a dynamically changing structure and unique system of commands or alerts for each network object. The codewords of a code are permutations with a given minimum pairwise Hamming distance. The purpose of the study is to develop a statistical method for constructing a code, in contrast to known algebraic methods, and to investigate the c

Style APA, Harvard, Vancouver, ISO itp.

30

Burov, Dmitry A. "Subgroups of direct products of groups invariant under the action of permutations on factors." Discrete Mathematics and Applications 30, no. 4 (2020): 243–55. http://dx.doi.org/10.1515/dma-2020-0021.

Pełny tekst źródła

Streszczenie:

AbstractWe study subgroups of the direct product of two groups invariant under the action of permutations on factors. An invariance criterion for the subdirect product of two groups under the action of permutations on factors is put forward. Under certain additional constraints on permutations, we describe the subgroups of the direct product of a finite number of groups that are invariant under the action of permutations on factors. We describe the subgroups of the additive group of vector space over a finite field of characteristic 2 which are invariant under the coordinatewise action of inve

Style APA, Harvard, Vancouver, ISO itp.

31

Malyshev, Fedor Mikhailovich. "Realization of permutations of even degree by products of three fixed-point-free involutions." Sbornik: Mathematics 215, no. 12 (2024): 1720–54. https://doi.org/10.4213/sm10020e.

Pełny tekst źródła

Streszczenie:

We consider representations of a permutation $\pi$ of degree $2n$, $n\geqslant3$, by a product of three so-called pairwise-cycle permutations, all of whose cycles have length $2$. This is a valid question for even permutations if $n$ is even and for odd permutations if $n$ is odd. We prove constructively that for $n\geqslant4$, $n\neq8$, such a representation holds for all permutations $\pi$ of the same parity as $n$, apart from four exceptional conjugacy classes. For $n=8$ there are five exceptional conjugacy classes, and for $n=3$ there is one such class. Bibliography: 32 titles.

Style APA, Harvard, Vancouver, ISO itp.

32

Cao, Xiwang, Lei Hu, and Zhengbang Zha. "Constructing permutation polynomials from piecewise permutations." Finite Fields and Their Applications 26 (March 2014): 162–74. http://dx.doi.org/10.1016/j.ffa.2013.12.001.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

33

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.

Pełny tekst źródła

Streszczenie:

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

Style APA, Harvard, Vancouver, ISO itp.

34

AKL, SELIM G., and IVAN STOJMENOVIĆ. "A SIMPLE OPTIMAL SYSTOLIC ALGORITHM FOR GENERATING PERMUTATIONS." Parallel Processing Letters 02, no. 02n03 (1992): 231–39. http://dx.doi.org/10.1142/s0129626492000362.

Pełny tekst źródła

Streszczenie:

We describe a simple parallel algorithm for generating all permutations of n elements. The algorithm is designed to be executed on a linear array of n processors, each having constant size memory and each being responsible for producing one element of a given permutation. There is a constant delay per permutation, leading to an O (n!) time solution. The algorithm is cost-optimal, assuming the time to output the permutations is counted.

Style APA, Harvard, Vancouver, ISO itp.

35

Cioni, Lapo. "Preimages under a popqueue-sorting algorithm." Pure Mathematics and Applications 30, no. 1 (2022): 63–67. http://dx.doi.org/10.2478/puma-2022-0010.

Pełny tekst źródła

Streszczenie:

Abstract Following the footprints of what has been done with other sorting devices, we study a popqueue and define an optimal sorting algorithm, called Cons. Our results include a description of the set of all the preimages of a given permutation, an enumeration of the set of the preimages of permutations with some specific properties and, finally, the exact enumeration of permutations having 0, 1 and 2 preimages, respectively, with a characterization of permutations having 3 preimages.

Style APA, Harvard, Vancouver, ISO itp.

36

Abba, Sani, Usman Sanusi, and Sulaiman Sani. "Permutation Pattern Avoidance in the Alternating Sign Matrices." UMYU Scientifica 3, no. 4 (2024): 386–98. https://doi.org/10.56919/usci.2434.033.

Pełny tekst źródła

Streszczenie:

Study’s Excerpt Aunu permutations (permutations of prime length with their first entry as unity) are explored with a specific focus on involutions. The concept of pattern avoidance is examined using Aunu permutations that avoid the 213 pattern. The results reveal that Catalan numbers count the set of alternating sign matrices. Both bijective and algebraic proofs are provided to support the findings. The study transforms classical ideas, first presented by Abdullahi bin Fodiyo in his book called Da'ulmusalli (light to a worshipper), into modern mathematical science. Full Abstract We represented

Style APA, Harvard, Vancouver, ISO itp.

37

Andreoli, Samuele, Enrico Piccione, Lilya Budaghyan, Pantelimon Stănică, and Svetla Nikova. "On Decompositions of Permutations in Quadratic Functions." Journal of Cryptology 38, no. 3 (2025). https://doi.org/10.1007/s00145-025-09547-4.

Pełny tekst źródła

Streszczenie:

Abstract The algebraic degree of a vectorial Boolean function is one of the main parameters driving the cost of its hardware implementation. Thus, finding decompositions of functions into sequences of functions of lower algebraic degrees has been explored to reduce the cost of implementations. In this paper, we consider such decompositions of permutations over $$\mathbb {F}_{2^n}$$ F 2 n . We prove the existence of a decomposition of the inverse using quadratic and linear power permutations for all permutations when $$2^n-1$$ 2 n - 1 is a prime, and we prove the non-existence of such decomposi

Style APA, Harvard, Vancouver, ISO itp.

38

Ayyer, Arvind, and Beáta Bényi. "Toppling on Permutations with an Extra Chip." Electronic Journal of Combinatorics 28, no. 4 (2021). http://dx.doi.org/10.37236/10420.

Pełny tekst źródła

Streszczenie:

The study of toppling on permutations with an extra labeled chip was initiated by the first author with D. Hathcock and P. Tetali (arXiv:2010.11236), where the extra chip was added in the middle. We extend this to all possible locations $p$ as well as values $r$ of the extra chip and give a complete characterization of permutations which topple to the identity. Further, we classify all permutations which are outcomes of the toppling process in this generality, which we call resultant permutations. Resultant permutations turn out to be certain decomposable permutations. The number of configurat

Style APA, Harvard, Vancouver, ISO itp.

39

Kobayashi, Masato. "Bijection Between Bigrassmannian Permutations Maximal below a Permutation and its Essential Set." Electronic Journal of Combinatorics 17, no. 1 (2010). http://dx.doi.org/10.37236/476.

Pełny tekst źródła

Streszczenie:

Bigrassmannian permutations are known as permutations which have precisely one left descent and one right descent. They play an important role in the study of Bruhat order. Fulton introduced the essential set of a permutation and studied its combinatorics. As a consequence of his work, it turns out that the essential set of bigrassmannian permutations consists of precisely one element. In this article, we generalize this observation for essential sets of arbitrary permutations. Our main theorem says that there exists a bijection between bigrassmanian permutations maximal below a permutation an

Style APA, Harvard, Vancouver, ISO itp.

40

Burstein, Alexander, and Niklas Eriksen. "Combinatorial properties of permutation tableaux." Discrete Mathematics & Theoretical Computer Science DMTCS Proceedings vol. AJ,..., Proceedings (2008). http://dx.doi.org/10.46298/dmtcs.3615.

Pełny tekst źródła

Streszczenie:

International audience We give another construction of a permutation tableau from its corresponding permutation and construct a permutation-preserving bijection between $1$-hinge and $0$-hinge tableaux. We also consider certain alignment and crossing statistics on permutation tableaux that have previously been shown to be equidistributed by mapping them to patterns in related permutations. We give two direct maps on tableaux that prove the equidistribution of those statistics by exchanging some statistics and preserving the rest. Finally, we enumerate some sets of permutations that are restric

Style APA, Harvard, Vancouver, ISO itp.

41

Khovanova, Tanya, and Eric Zhang. "Limit Densities of Patterns in Permutation Inflations." Electronic Journal of Combinatorics 28, no. 1 (2021). http://dx.doi.org/10.37236/8234.

Pełny tekst źródła

Streszczenie:

Call a permutation $k$-inflatable if the sequence of its tensor products with uniform random permutations of increasing lengths has uniform $k$-point pattern densities. Previous work has shown that nontrivial $k$-inflatable permutations do not exist for $k \geq 4$. In this paper, we derive a general formula for the limit densities of patterns in the sequence of tensor products of a fixed permutation with each permutation from a convergent sequence. By applying this result, we completely characterize $3$-inflatable permutations and find explicit examples of $3$-inflatable permutations with vari

Style APA, Harvard, Vancouver, ISO itp.

42

Cho, Soojin, and Kyoungsuk Park. "Alignments, crossings, cycles, inversions, and weak Bruhat order in permutation tableaux of type $B$." Discrete Mathematics & Theoretical Computer Science DMTCS Proceedings, 27th..., Proceedings (2015). http://dx.doi.org/10.46298/dmtcs.2484.

Pełny tekst źródła

Streszczenie:

International audience Alignments, crossings and inversions of signed permutations are realized in the corresponding permutation tableaux of type $B$, and the cycles of signed permutations are understood in the corresponding bare tableaux of type $B$. We find the relation between the number of alignments, crossings and other statistics of signed permutations, and also characterize the covering relation in weak Bruhat order on Coxeter system of type $B$ in terms of permutation tableaux of type $B$. De nombreuses statistiques importantes des permutations signées sont réalisées dans les tableaux

Style APA, Harvard, Vancouver, ISO itp.

43

Avgustinovich, Sergey, Sergey Kitaev, and Anna Taranenko. "On Five Types of Crucial Permutations with Respect to Monotone Patterns." Electronic Journal of Combinatorics 30, no. 1 (2023). http://dx.doi.org/10.37236/11500.

Pełny tekst źródła

Streszczenie:

A crucial permutation is a permutation that avoids a given set of prohibitions, but any of its extensions, in an allowable way, results in a prohibition being introduced.  In this paper, we introduce five natural types of crucial permutations with respect to monotone patterns, notably quadracrucial permutations that are linked most closely to Erdős-Szekeres extremal permutations. The way we define right-crucial and bicrucial permutations is consistent with the definition of respective permutations studied in the literature in the contexts of other prohibitions. For each of the five types

Style APA, Harvard, Vancouver, ISO itp.

44

Claesson, Anders, Vít Jelínek, Eva Jelínková, and Sergey Kitaev. "Pattern avoidance in partial permutations (extended abstract)." Discrete Mathematics & Theoretical Computer Science DMTCS Proceedings vol. AN,..., Proceedings (2010). http://dx.doi.org/10.46298/dmtcs.2818.

Pełny tekst źródła

Streszczenie:

International audience Motivated by the concept of partial words, we introduce an analogous concept of partial permutations. A $\textit{partial permutation of length n with k holes}$ is a sequence of symbols $\pi = \pi_1 \pi_2 \cdots \pi_n$ in which each of the symbols from the set $\{1,2,\ldots,n-k\}$ appears exactly once, while the remaining $k$ symbols of $\pi$ are "holes''. We introduce pattern-avoidance in partial permutations and prove that most of the previous results on Wilf equivalence of permutation patterns can be extended to partial permutations with an arbitrary number of holes. W

Style APA, Harvard, Vancouver, ISO itp.

45

Blitvić, Natasha. "SIF Permutations and Chord-Connected Permutations." Discrete Mathematics & Theoretical Computer Science DMTCS Proceedings vol. AT,..., Proceedings (2014). http://dx.doi.org/10.46298/dmtcs.2443.

Pełny tekst źródła

Streszczenie:

International audience A <i>stabilized-interval-free </i> (SIF) permutation on [n], introduced by Callan, is a permutation that does not stabilize any proper interval of [n]. Such permutations are known to be the irreducibles in the decomposition of permutations along non-crossing partitions. That is, if $s_n$ denotes the number of SIF permutations on [n], $S(z)=1+\sum_{n\geq1} s_n z^n$, and $F(z)=1+\sum_{n\geq1} n! z^n$, then $F(z)= S(zF(z))$. This article presents, in turn, a decomposition of SIF permutations along non-crossing partitions. Specifically, by working with a convenie

Style APA, Harvard, Vancouver, ISO itp.

46

Dimitrov, Alexander, Sebastiyan Georgiev, and Nikolay Yankov. "Programming realization of permutations." Proceedings. College Dobrich X (December 25, 2018). https://doi.org/10.5281/zenodo.10004792.

Pełny tekst źródła

Streszczenie:

We are studying permutations. Algorithms for generating permutations are shown: a naive one, and an algorithm based on the successor of a given permutation. Both algorithms are realized in C++. The second part of this work shows rank and unrank functions for permutation

Style APA, Harvard, Vancouver, ISO itp.

47

Lipson, Mark. "Completion of the Wilf-Classification of 3-5 Pairs Using Generating Trees." Electronic Journal of Combinatorics 13, no. 1 (2006). http://dx.doi.org/10.37236/1057.

Pełny tekst źródła

Streszczenie:

A permutation $\pi$ is said to avoid the permutation $\tau$ if no subsequence in $\pi$ has the same order relations as $\tau$. Two sets of permutations $\Pi_1$ and $\Pi_2$ are Wilf-equivalent if, for all $n$, the number of permutations of length $n$ avoiding all of the permutations in $\Pi_1$ equals the number of permutations of length $n$ avoiding all of the permutations in $\Pi_2$. Using generating trees, we complete the problem of finding all Wilf-equivalences among pairs of permutations of which one has length 3 and the other has length 5 by proving that $\{123,32541\}$ is Wilf-equivalent

Style APA, Harvard, Vancouver, ISO itp.

48

Eriksson, Kimmo, and Svante Linusson. "The size of Fulton's essential set." Electronic Journal of Combinatorics 2, no. 1 (1995). http://dx.doi.org/10.37236/1200.

Pełny tekst źródła

Streszczenie:

The essential set of a permutation was defined by Fulton as the set of southeast corners of the diagram of the permutation. In this paper we determine explicit formulas for the average size of the essential set in the two cases of arbitrary permutations in $S_n$ and $321$-avoiding permutations in $S_n$. Vexillary permutations are discussed too. We also prove that the generalized Catalan numbers ${r+k-1\choose n}-{r+k-1\choose n-2}$ count $r\times k$-matrices dotted with $n$ dots that are extendable to $321$-avoiding permutation matrices.

Style APA, Harvard, Vancouver, ISO itp.

49

Timashev, Aleksandr N. "On the probability of coincidence of cycle lengths for independent random permutations with given number of cycles." Discrete Mathematics and Applications 25, no. 6 (2015). http://dx.doi.org/10.1515/dma-2015-0036.

Pełny tekst źródła

Streszczenie:

AbstractFrom the set of all permutations of the degree n with a given number N ≤ n of cycles two permutations are choosed randomly, uniformly and independently. The cycles of each permutation are numbered in some of N! possible ways. We study the coincidence probability of the cycle lengths of permutations for a given numbering. This probability up to a suitably selected renumbering of cycles of the first permutation equals to the probability of similarity of these permutations. The asymptotic estimates of the coincidence probability of the cycle lengths are obtained for five types of relation

Style APA, Harvard, Vancouver, ISO itp.

50

Claesson, Anders, Vít Jelínek, Eva Jelínková, and Sergey Kitaev. "Pattern Avoidance in Partial Permutations." Electronic Journal of Combinatorics 18, no. 1 (2011). http://dx.doi.org/10.37236/512.

Pełny tekst źródła

Streszczenie:

Motivated by the concept of partial words, we introduce an analogous concept of partial permutations. A partial permutation of length $n$ with $k$ holes is a sequence of symbols $\pi=\pi_1\pi_2\dotsb\pi_n$ in which each of the symbols from the set $\{1,2,\dotsc,n-k\}$ appears exactly once, while the remaining $k$ symbols of $\pi$ are "holes". We introduce pattern-avoidance in partial permutations and prove that most of the previous results on Wilf equivalence of permutation patterns can be extended to partial permutations with an arbitrary number of holes. We also show that Baxter permutations

Style APA, Harvard, Vancouver, ISO itp.

Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!