AMS Subject Classi cation: 58F20, 60J60, 65G05 We investigate the effects of round-off errors on quasi-periodic motions in a linear symplectic planar map. By discretizing coordinates uniformly we transform this map into a permutation of Z2 , and study motions near infinity, which correspond to a fine discretization. We provide numerical evidence that all orbits are periodic and that the average...

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

Abstract This paper is devoted to providing a unifying approach the study of uniqueness unconditional bases, up equivalence and permutation, infinite direct sums quasi-Banach spaces. Our new this type problem permits show that wide class vector-valued sequence spaces have unique basis permutation. In particular, solving from Albiac Leránoz (J Math Anal Appl 374(2):394–401, 2011. 10.1016/j.jmaa....

We are solving the classical Riemann-Hilbert problem of rank N > 1 on the extended complex plane punctured in 2m + 2 points, for N × N quasi-permutation monodromy matrices with 2m(N − 1) parameters. Our approach is based on the finite gap integration method applied to study the Riemann-Hilbert by Deift, Its, Kapaev and Zhou [1] and Kitaev and Korotkin [2, 3]. This permits us to solve the Rieman...

December 23, 2009 Version 1.1-0 Date 2009-12-22 Depends R (>= 2.10.1), mvtnorm Title Modified Maximum Contrast Method Author Kengo NAGASHIMA and Yasunori SATO Maintainer Kengo NAGASHIMA Description This package provides an implementation of a modified maximum contrast method and the maximum contrast method. This version supports functions mmcm.mvt, mcm.mvt that gives P-va...

January 15, 2016 Type Package Title Modified Maximum Contrast Method Version 1.2-6 Author Kengo NAGASHIMA and Yasunori SATO Maintainer Kengo NAGASHIMA Depends mvtnorm Description An implementation of modified maximum contrast methods and the maximum contrast method: Functions 'mmcm.mvt' and 'mcm.mvt' give P-value by using randomized quasi-Monte Carlo method with 'pmvt' functio...

The class of bipartite permutation graphs enjoys many nice and important properties. In particular, this is critically in the study clique- rank-width graphs, because it one minimal hereditary classes unbounded rank-width. It also contains a number subclasses, which are critical with respect to other parameters, such as graph lettericity or shrub-depth, notions, well-quasi-ordering complexity a...

Here we solve N × N Riemann-Hilbert (inverse monodromy) problems with all monodromy matrices having the structure of matrices of quasi-permutation (i.e. matrices which have only one non-zero element in each column and each row). Such RiemannHilbert problem may be associated to arbitrary Hurwitz space of algebraic curves L of genus g realized as N -sheeted covering over CP1, and allowes solution...