A square array whose all rows and columns are different permutations of the same length over symbol set is known as a Latin square. may or not be symmetric. For classification enumeration purposes, symmetric, non-symmetric, conjugate totally symmetric squares play vital roles. This article discusses Eigenproblem non-symmetric in well max-plus algebra. By defining certain vector corresponding to...

A special class of cubic graphs are the cycle permutation graphs. A cycle permutation graph Pn(α) is defined by taking two vertex-disjoint cycles on n vertices and adding a matching between the vertices of the two cycles.In this paper we determine a good upper bound for tenacity of cycle permutation graphs.

An (n, d)-permutation code of size s is a subset C of Sn with s elements such that the Hamming distance dH between any two distinct elements of C is at least equal to d. In this paper, we give new upper bounds for the maximal size μ(n, d) of an (n, d)-permutation code of degree n with 11 6 n 6 14. In order to obtain these bounds, we use the structure of association scheme of the permutation gro...

The current study focuses on the problem of determining investment attrаctiveness of countries by means of monitoring regional stock markets. The method of using the permutation entropy as a model of investment attractiveness estimation is suggested. We have calculated the permutation entropy for the time series of stock markets of countries for the period from 2005 to 2018. The countries with ...

In this paper we prove a Large Deviation Principle for the sequence of symmetrised empirical measures 1 n Pn i=1 δ(Xn i ,X n σn(i) ) where σn is a random permutation and ((X i )1≤i≤n)n≥1 is a triangular array of random variables with suitable properties. As an application we show how this result allows to improve the Large Deviation Principles for symmetrised initial-terminal conditions bridge ...

This paper deals with the amount of disorder that is left in a permutation after one of its elements has been selected with quickselect with or without median-of-three pivoting. Five measures of disorder are considered: inversions, cycles of length less than or equal to some m, cycles of any length, expected cycle length, and the distance to the identity permutation. “Grand averages” for each m...

Authenticated encryption schemes establish both privacy and authenticity. This paper specifies a family of the dedicated authenticated encryption schemes, Artemia. It is an online nonce-based authenticated encryption scheme which supports the associated data. Artemia uses the permutation based mode, JHAE, that is provably secure in the ideal permutation model. The scheme does not require the in...

We close an open issue on dictionaries dating back to the sixthies. An array of n keys can be sorted so that searching takes O(log n) time. Alternatively, it can be organized as a heap so that inserting and deleting keys take O(log n) time. We show that these bounds can be simultaneously achieved in the worst case for searching and updating by suitably maintaining a permutation of the n keys in...

In this paper, a derivation method is presented for the valid contracted graphs (CGs) with pentagonal links plus quaternary Q and ternary T using starting vertax arrays strings (SVASs) type synthesis of parallel mechanisms. First, some concepts on CGs, array (SVASs), basic (BCGs) are explained. Second, deriving CGs according to BCGs SVASs. According connections vertax, SVASs obtained. Then, pri...