Let us briefly describe the setting in which we are working. D denotes the set of all dyadic intervals contained in the unit interval. π : D → D denotes a permutation of the dyadic intervals. The operator induced by π is determined by the equation TπhI = hπ(I) where hI denotes the L∞-normalised Haar function supported on the dyadic intervall I. The main result of this paper treats general permu...

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.

Radio Frequency Identification (RFID) technology will become one of the most popular technologies to identify objects in the near future. However, the major barrier that the RFID system is facing presently is the security and privacy issue. Recently, an ultralightweight RFID authentication protocol with permutation has been proposed to provide security and prevent all possible attacks. However,...

This paper introduces the notion of multiset codes as relevant to the problem of reliable information transmission over permutation channels. The motivation for studying permutation channels comes from the effect of out of order delivery of packets in some types of packet networks. The proposed codes are a generalization of the so-called subset codes, recently proposed by the authors. Some of t...

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

1.1. Main theorem. In usual, the irreducible decomposition of a representation of an operator algebra does not make sense because there is no uniqueness of such decomposition in general. This fact disturbs an intention to study an ordinary representation theory of operator algebras like that of semisimple Lie algebras and quantum groups. In spite of this, permutative representations of the Cunt...

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