A function f (X 1 ; X 2 ; : : : ; X n) is said to be t th-order correlation-immune if the ran-ally, if all possible outputs are equally likely, then f is called a t ?resilient function. In this paper, we provide three diierent characterizations of t th-order correlation immune functions and resilient functions where the random variable is over GF (q). The rst is in terms of the structure of a c...

by a quasi-permutation matrix we mean a square matrix over the complex field c with non-negative integral trace. thus every permutation matrix over c is a quasipermutation matrix. for a given finite group g, let p(g) denote the minimal degree of a faithful permutation representation of g (or of a faithful representation of g by permutation matrices), let q(g) denote the minimal degree of a fait...

Abstract We prove that the Ring Learning With Errors (RLWE) and Polynomial (PLWE) problems over cyclotomic field $${\mathbb {Q}}(\zeta _n)$$ Q ( ζ n ) are not equivalent. Precisely, we show reduci...

' ŽŽ . . We present an O m q n n log n time algorithm to select the k th smallest item from an m = n totally monotone matrix for any k F mn. This is the first subquadratic algorithm for selecting an item from a totally monotone matrix. Our method also yields an algorithm of the same time complexity for a generalized 4 row-selection problem in monotone matrices. Given a set S s p , . . . , p of ...

Let G be a simple connected graph. The transmission of any vertex v of a graph G is defined as the sum of distances of a vertex v from all other vertices in a graph G. Then the distance signless Laplacian matrix of G is defined as D^{Q}(G)=D(G)+Tr(G), where D(G) denotes the distance matrix of graphs and Tr(G) is the diagonal matrix of vertex transmissions of G. For a given minimum dominating se...

In this paper we propose design of three systolic arrays to perform QR decomposition of a square matrix. Our first design is based on Given’s rotation method [1]. In contrast to the earlier designs [1], [2] based on this method, our design uses n(n − 1)/2 homogeneous PEs. Our next design is based on Householder method [4]. This method performs only (n− 1) square root operations in contrast to n...

Abstract. We study the Hopf algebra structure and the highest weight representation of a multiparameter version of Uqgl(2). The commutation relations as well as other Hopf algebra maps are explicitly given. We show that the multiparameter universal R matrix can be constructed directly as a quantum double intertwiner, without using Reshetikhin’s transformation. An interesting feature automatical...

An exact S-matrix is conjectured for the imaginary coupled d (3) 4 affine Toda field theory, using the U q (g (1) 2) symmetry. It is shown that this S-matrix is consistent with the results for the case of real coupling using the breather-particle correspondence. For q a root of unity it is argued that the theory can be restricted to yield Φ(11|14) perturbations of W A 2 minimal models and the r...