The Tsallis-complexity of a semiclassical time-evolution

An investigation is undertaken of semiclassical time-evolutions and their classical limit with the intent of getting insights into the classical–quantum frontier. We deal with a system that represents the interaction between matter and a given field, and our main research tool is the so-called q$q$-complexity quantifier, for which two different versions are considered. The probability distribution associated with the time-evolution process is determined by recourse to the Bandt–Pompe symbolic technique [C. Bandt, B. Pompe, Permutation entropy: a natural complexity measure for time series, Phys. Rev. Lett. 88 (2002) 174102:1–174102:4]. The most salient details of the quantum–classical transition turn out to be described not only well, but also in a better fashion than that of previous literature.     

Constructing new differentially 4-uniform permutations from known ones

In this paper we study a new construction of differentially 4-uniform permutations from known ones and the inverse function. We focus on constructing methods of [20]. We split a finite field into its subfield and remainder, and, we choose known differentially 4-uniform permutations over the subfield and the inverse function over the entire field. As a result, we obtain two families of differentially 4-uniform permutations.     

On a conjecture of Fernando,Hou and Lappano concerning permutation polynomials over finite fields

Let ${\mathbb{F}}_q$ be the finite field with q elements and let $p=\text{char}{\mathbb{F}}_q$. It was conjectured that for integers $e\ge 2$ and $1\le a\le pe-2$, the polynomial $X^{q-2}+X^{q^2-2}+\cdots +X^{q^a-2}$ is a permutation polynomial of ${\mathbb{F}}_{q^e}$ if and only if (i) $a=2$ and $q=2$, or (ii) $a=1$ and $\text{gcd}(q-2,q^e-1)=1$. In the present paper we confirm this conjecture.     

Lengths of involutions in finite Coxeter groups

Let W be a finite Coxeter group and X a subset of W. The length polynomial $L_{W,X}(t)$ is defined by $L_{W,X}(t)={\sum }_{x\in X}{t}^{?(x)}$, where ? is the length function on W. If $X=\{x\in W:x^2=1\}$ then we call $L_{W,X}(t)$ the involution length polynomial of W. In this article we derive expressions for the length polynomial where X is any conjugacy class of involutions, and the involution length polynomial, in any finite Coxeter group W. In particular, these results correct errors in [11] for the involution length polynomials of Coxeter groups of type $B_n$ and $D_n$. Moreover, we give a counterexample to a unimodality conjecture stated in [11].     

具有最高代数次数的2n元n维Bent函数的构造

本文给出了代数次数达到最高的一类布尔置换的代数标准形 ;并用m序列的状态转移矩阵和所得置换 ,构造了一类代数次数达到最高的 2n元n维Bent函数 ,用这类函数所构造的S盒具有较高的安全强度 .     

有限域上两个奇质数乘积长度的m次剩余码北大核心CSCD

设q为质数幂,m为大于1的正整数,p_(1),p_(2)为不同的奇质数满足gcd(q,p_(1)p_(2))=1且m|gcd(p_(1)-1,p_(2)-1).本文基于m次剩余的思想,给出码长为p_(1)p_(2)的m次剩余码的两种构造.对每种构造,分别给出其为相似文献