We present a succinct data structure for permutation graphs, and their superclass of circular i.e., structures using optimal space up to lower order terms. Unlike concurrent work on circle graphs (Acan et al. 2022), our also supports distance shortest-path queries, as well adjacency neighborhood all in time. particular the first exact oracle (circular) graphs. A second degree queries time indep...

For exploring the meaning of power set in evidence theory, a possible explanation is proposed from view Pascal’s triangle and combinatorial number. Here comes question: what would happen if number replaced by permutation number? To address this issue, new kind set, named as random (RPS), paper, which consists event space (PES) mass function (PMF). The PES certain considers all that set. element...

In this paper we investigate the existence of permutation polynomials of the form F(x) = xd + L(x) over GF(2n), L being a linear polynomial. The results we derive have a certain impact on the long-term open problem on the nonexistence of APN permutations over GF(2n), when n is even. It is shown that certain choices of exponent d cannot yield APN permutations for even n. When n is odd, an infini...