Acessibilidade / Reportar erro

Group of Isometries of Niederreiter-Rosenbloom-Tsfasman Block Space

ABSTRACT

Let P = 1, 2, ..., n be a poset that is an union of disjoint chains of the same length and V = FqN be the space of N-tuples over the finite field Fq. Let Vi = Fqki , with 1 i n, be a family of finite-dimensional linear spaces such that k1 + k2 + ... + kn = N and let V = V1 × V2 × ... × Vn endow with the poset block metric dP, π induced by the poset P and the partition π = k1, k2, ..., kn, encompassing both Niederreiter-Rosenbloom-Tsfasman metric and error-block metric. In this paper, we give a complete description of group of isometries of the metric space V, dP, π, also called the Niederreiter-Rosenbloom-Tsfasman block space. In particular, we reobtain the group of isometries of the Niederreiter-Rosenbloom-Tsfasman space and obtain the group of isometries of the error-block metric space.

Keywords:
error-block metric; poset metric; Niederreiter-Rosenbloom-Tsfasman metric; ordered Hamming metric; isometries; automorphisms

RESUMO

Seja P = 1, 2, ..., n, um conjunto parcialmente ordenado dado por uma união disjunta de cadeias de mesmo comprimento e V = FqN o espaço vetorial das N-uplas sobre o corpo finito Fq. Seja V = V1 × V2 × ... ×Vn um produto direto de V, em blocos de subespaços Vi = Fqki com k1 + k2 + ... + kn = N, munido com a métrica de blocos ordenados dP, π induzida pela ordem P e pela partição π = k1, k2, ..., kn. Neste trabalho descrevemos o grupo de isometrias do espaço métrico V, dP, π.

Palavras-chave:
métrica de bloco; métrica de ordem; métrica de Niederreiter-Rosenbloom-Tsfasman; isometrias; automorfismos

1 INTRODUCTION

One of the main classical problem of the coding theory is to find sets with qk elements in FqN, the space of N-tuples over the finite field Fq, with the largest minimum distance possible. There are many possible metrics that can be defined in FqN, but the most common ones are the Hamming and Lee metrics.

In 1987 Harald Niederreiter generalized the classical problem of coding theory (see 88 H. Niederreiter. A combinatorial problem for vector spaces over finite fields. Discrete Mathematics, 96 (1991), 221-228.): given positive integers s and m1, ..., ms, to f ind sets C of vectors cij FqN, for 1 i s and 1 j mi, with the largest minimum sumi = 1sdi, where the minimum is extended over all integers d1, ..., ds with 0 di mi for 1 i s and i = 1sdi 1 for which the subset ci, j : 1 i s and 1 j di is linearly dependent in FqN. The classical problem corresponds to the special case where s > m and mi = 1 for all 1 i s.

Brualdi, Graves and Lawrence (see 22 R. Brualdi, J.S. Graves & M. Lawrence. Codes with a poset metric. Discrete Mathematics, 147 (2008), 57-72.) also provided in 1995 a wider situation for the Niederreiter’s problem: using partially ordered sets (posets) and defining the concept of poset codes, they started to study codes with a poset metric. Later Feng, Xu and Hickernell ( 44 K. Feng, L. Xu & F.J. Hickernell. Linear error-block codes. Finite Fields and Their Applications, (12) (2006), 638-652., 2006) introduced the block metric, by partitioning the set of coordinate positions of FqN into families of blocks. Both kinds of metrics are generalizations of the Hamming metric, in the sense that the latter is attained when considering the trivial order (in the poset case) or one-dimensional blocks (in the block metric case). In 2008, Alves, Panek and Firer (see 11 M.M.S. Alves, L. Panek & M. Firer. Error-block codes and poset metrics. Advances in Mathematics of Communications, 2 (2008), 95-111.) combined the poset and block structure, obtaining a further generalization, the poset block metrics. As a unified reading we cite the book of Firer et al.55 M. Firer, M.M. Alves, J.A. Pinheiro & L. Panek. “Poset codes: partial orders, metrics and coding theory”. Springer (2018)..

A particular instance of poset block codes and spaces, with one-dimensional blocks, are the spaces introduced by Niederreiter in 1991 (see 88 H. Niederreiter. A combinatorial problem for vector spaces over finite fields. Discrete Mathematics, 96 (1991), 221-228.) and Rosenbloom and Tsfasman in 1997 (see 1212 M.Y. Rosenbloom & M.A. Tsfasman. Codes for the m-metric. Probl. Inf. Transm., 33 (1997), 45-52.), where the posets taken into consideration have a finite number of disjoint chains of equal size. This spaces are of special interest since there are several rather disparate applications, as noted by Rosenbloom and Tsfasman (see 1212 M.Y. Rosenbloom & M.A. Tsfasman. Codes for the m-metric. Probl. Inf. Transm., 33 (1997), 45-52.) and Park e Barg (see 1111 W. Park & A. Barg. The ordered Hamming metric and ordered symmetric channels. In “IEEE Internacional Symposium on Information Theory Proceedings”. IEEE (2011), pp. 2283-2287.).

In 77 K. Lee. The automorphism group of a linear space with the Rosenbloom-Tsfasman metric. Eur. J. Combin., (24) (2003), 607-612., 33 S. Cho & D. Kim. Automorphism group of crown-weight space. Eur. J. Combin., 1(27) (2006), 90-100. and 1010 L. Panek, M. Firer, H. Kim & J. Hyun. Groups of linear isometries on poset structures. Discrete Mathematics, 308 (2008), 4116-4123. the groups of linear isometries of poset metrics were determined for the Rosenbloom-Tsfasman space, crown space and arbitrary poset-space respectively. In 99 L. Panek, M. Firer & M.M.S. Alves. Symmetry groups of Rosenbloom-Tsfasman spaces. Discrete Mathematics, 309 (2009), 763-771. we describe the full isometry group (which includes non-linear isometries) of a poset metric that is a product of Rosenbloom-Tsfasman spaces and in 66 J. Hyun. A subgroup of the full poset-isometry group. SIAM Journal of Discrete Mathematics, 2(24) (2010), 589-599. the author studied the full isometry group to any poset metric. The full description of the group of linear isometries of a poset block space were determined by Alves, Panek and Firer in 11 M.M.S. Alves, L. Panek & M. Firer. Error-block codes and poset metrics. Advances in Mathematics of Communications, 2 (2008), 95-111..

In this work, we describe the group of isometries (not necessarily linear ones) of the poset block space whose underlying poset is a finite union of disjoint chains of same length. We call this space the Niederreiter-Rosenbloom-Tsfasman block space (or NRT block space, for short).

2 POSET BLOCK METRIC SPACE

Let n : = 1, 2, ..., n be a finite set with n elements and let ≤ be a partial order on [n]. We call the pair P : = n, a poset and say that k is smaller than j if k j and k j. An ideal in n, is a subset I n that contains every element that is smaller than some of its elements, i.e., if j I and k j, then k I. Given a subset X n, we denote by 〈X〉 the smallest ideal containing X, called the ideal generated by X . An order on the finite set [n] is called a linear order or a chain if any two elements are comparable, that is, given i, j n we have that either i j or j i. In this case, n is said to be the length of the chain and the set can be labeled in such a way that i1 < i2 < ... < in. For the simplicity of the notation, in this situation we will always assume that the order P is defined as 1 < 2 < ... < n.

Let q be a power of a prime, Fq be the finite field of q elements and V : = FqN the N-dimensional vector space of N-tuples over Fq. Let π = k1, k2, ..., kn be a partition of N, that is,

N = k 1 + k 2 + . . . + k n ,

with ki > 0 an integer. For each integer k i , let Vi : Fqki be the k i -dimensional vector space over the finite field Fq and define

V = V 1 × V 2 × . . . × V n ,

called the π-direct product decomposition of V. A vector v V can be uniquely decomposed as

v = v 1 , v 2 , . . . , v n ,

with vi Vi for each 1 i n. We will call this the π-direct product decomposition of v. Given a poset P = n, , we define the poset block weightωP, πv (or simply the (P, π)-weight) of a vector v = v1, v2, ..., vn to be

ω P , π v : = s u p p v

where suppv : = i n : vi 0 is the π-support of the vector v and |X| is the cardinality of the set X . The block structure is said to be trivial when ki = 1, for all 1 i n. The (P, π)-weight induces a metric d (P,π) on V , that we call the poset block metric (or simply (P, π)-metric):

d P , π u , v : = ω P , π u - v .

The pair (V, d (P,π) ) is a metric space and where no ambiguity may rise, we say it is a poset block space, or simply a (P, π)-space.

An isometry of (V, d (P,π) ) is a bijection T : V V that preserves distance, that is,

d P , π T u , T v = d P , π u , v ,

for all u, v V. The set Isom(V, d (P,π) ) of all isometries of (V, d (P,π) ) is a group with the natural operation of composition of functions, and we call it the isometry group of (V, d (P,π) ). An automorphism is a linear isometry.

In 99 L. Panek, M. Firer & M.M.S. Alves. Symmetry groups of Rosenbloom-Tsfasman spaces. Discrete Mathematics, 309 (2009), 763-771. the group of isometries of a product of Niederreiter-Rosenbloom-Tsfasman spaces is characterized. In 66 J. Hyun. A subgroup of the full poset-isometry group. SIAM Journal of Discrete Mathematics, 2(24) (2010), 589-599. is studied a subgroup of the full isometry group for any given poset. In this work, we will describe the full isometry group of an important class of poset block spaces, namely, those induced by posets that are an union of disjoint chains of the same length. This class includes the block metric spaces over chains and the Niederreiter-Rosembloom-Tsfasman spaces with trivial block structures.

We remark that the initial idea is the same as in 99 L. Panek, M. Firer & M.M.S. Alves. Symmetry groups of Rosenbloom-Tsfasman spaces. Discrete Mathematics, 309 (2009), 763-771.. The main differences are that we follow a more coordinate free approach an that the dimensions of the blocks pose a new restraint. We first study the isometry group of NRT block space induced by one simple chain (Theorem 1), analogous to those of 99 L. Panek, M. Firer & M.M.S. Alves. Symmetry groups of Rosenbloom-Tsfasman spaces. Discrete Mathematics, 309 (2009), 763-771.. In this work, we prove some results on isometries, also anologous to those of 99 L. Panek, M. Firer & M.M.S. Alves. Symmetry groups of Rosenbloom-Tsfasman spaces. Discrete Mathematics, 309 (2009), 763-771., plus a result on preservation of block dimensions (Lemma 4), and conclude that Isom(V, d(P,π)) is the semi-direct product of the direct product of the isometry groups induced by each chain and the automorphism group of the permutations of chains that preserves the block dimensions (Theorem 6).

3 ISOMETRIES OF LINEAR ORDERED BLOCK SPACE

Let P = n, be the linear order 1 < 2 < ... < n, let π = k1, k2, ..., kn be a partition of N and let

V = V 1 × V 2 × . . . × V n ,

where Vi = Fqki, for i = 1, 2, ..., n, be the π-direct product decomposition of the vector space V = FqN endow with the poset block metric d (p, π) . In this section we will describe the full isometry group of the poset block space (V, d (P,π) ). This description will be used in the next section to describe the isometry group of the NRT block space. In this section, P = n, will be the linear order 1 < 2 < ... < n.

We note that, given u = u1, ..., un and v = v1, ..., vn in the total ordered block space V,

d P , π u , v = m a x i : u i v i .

For each i 1, 2, ..., n, let

F i : V i × V i + 1 × . . . × V n V i

be a map that is a bijection with respect to the first block space V i , that is, given vi + 1, ..., vn Vi + 1 × ... × Vn, the map F~vi + 1, ..., vn : Vi Vi defined by

F ~ v i + 1 , . . . , v n v i = F i v i , v i + 1 , . . . , v n

is a bijection. Let S q,π,i be the set of such maps F i . Given Fi Sq, π, i, with 1 ≤ in, we define a map TF1, F2, ..., Fn : V V by

T F 1 , F 2 , . . . , F n v 1 , . . . , v n : = F 1 v 1 , . . . , v n , . . . , F n v n

Theorem 1.LetP = n, be the linear order1 < 2 < ... < nand letV = V1 × V2 × ... × Vnbe the π-direct product decomposition ofV = FqNendowed with the poset block metric induced by the poset P and the partition π. Then, the group Isom(V, d(P,π) ) of isometries of (V, d (P,π) ) is the set of all mapsTF1, F2, ..., Fn : V V.

Proof. Given u = u1, ..., un and v = v1, ..., vn V, let l = dP, πu, v = maxi : ui vi. Since each Fi : Vi × Vi + 1 × ... Vn Vi is a bijection in relation to the first block space V i , it follows that

F l u l , u l + 1 , . . . , u n F l v l , v l + 1 , . . . , v n

and

F t u t , u t + 1 , . . . , u n = F t v t , v t + 1 , . . . , v n

for any t > l. It follows that

d P , π T F 1 , . . . , F n u , T F 1 , . . . , F n v = m a x i : F i u i , . . . , u n F i v i , . . . , v n = l

and hence TF1, F2, ..., Fn is distance preserving. Since V is a finite metric space, it follows that TF1, F2, ..., Fn is also a bijection.

Now let T be an isometry of V . Let us write

T v 1 , v 2 , . . . , v n = T 1 v 1 , v 2 , . . . , v n , . . . , T n v 1 , v 2 , . . . , v n .

We prove first that Tjv1, v2, ..., vn = Fjvj, vj + 1, ..., vn, that is, T j does not depend on the first j - 1 coordinates. In other words, we want to prove that

T j v 1 , . . . , v j - 1 , v j , . . . , v n = T j u 1 , . . . , u j - 1 , v j , . . . , v n

regardless of the values of the first j - 1 coordinates. Since

d P , π u 1 , . . . , u j - 1 , v j , . . . , v n , v 1 , . . . , v j - 1 , v j , . . . , v n = m a x i j - 1 i : v i u i

and since T is an isometry, it follows that

d P , π T v 1 , . . . , v j - 1 , v j , . . . , v n , T u 1 , . . . , u j - 1 , v j , . . . , v n = = d P , π u 1 , . . . , u j - 1 , v j , . . . , v n , v 1 , . . . , v j - 1 , v j , . . . , v n j - 1 ,

and so,

T j v 1 , . . . , v j - 1 , v j , . . . , v n = T j u 1 , . . . , u j - 1 , v j , . . . , v n ,

for any v1, ..., vj - 1, u1, ..., uj - 1 V1 × ... × Vj - 1 and vj, ..., vn Vj × ... × Vn. Thus,

T v 1 , v 2 , . . . , v n = F 1 v 1 , v 2 , . . . , v n , F 2 v 2 , . . . , v n , . . . , F n v n

and the first statement is proved. Now, we need to prove that each F~vi + 1, ..., vn is a bijection, what is equivalent to prove those maps are injective. If F~vi + 1, ..., vn is not injective, then there are vi ui in V i such that

F ~ v i + 1 , . . . , v n v i = F ~ v i + 1 , . . . , v n u i .

Considering i minimal with this property, it follows that

i = d P , π v 1 , . . . , v i , . . . , v n , v 1 , . . . , u i , . . . , v n = d P , π T v 1 , . . . , v i , . . . , v n , T v 1 , . . . , u i , . . . , v n < 1

contradicting the assumption that T is an isometry of (V, d (P,π) ).

Let S m be the symmetric group of permutations of a set with m elements and V = V1 × V2 × ... × Vn be the π-direct product decomposition of V = FqN with π = k1, k2, ..., kn. Since V has q N elements we can identify the group S q,π,1 of functions F : V1 × V2 × ... × Vn V1 such that F~v2, ..., vn is a permutation of V1 = Fqk1, with operation

F · G v : = F G v 1 , v 2 , . . . , v n , v 2 , . . . , v n ,

with F, G Sq, π, 1 and v = v1, v2, ..., vn V, with the direct product1 1 If H 1 ,..., H l are groups, then their direct product, denoted by H1 × ... × Hl, is the group with elements h1, ..., hl, hi ∈ Hi for each 1 ≤ i ≤ l, and with operation h1, ..., hlh1', ..., hl' = h1h1', ..., hlhl'. Sqk1qN - k1. With this notations, it follows the following result.

Theorem 2.LetP = n, be the linear order1 < 2 < ... < nand letV = V1 × V2 × ... × Vnbe the π-direct product decomposition ofV = FqNendowed with the poset block metric induced by the poset P and the partition π. Ifπ = k1, k2, ..., kn, then the group of isometries Isom(V, d(P,π) ) has a semi-direct product2 2 Let G be a group with identity 1G and let N 1 and Q 1 be subgroups of G. We recall that the group G is a semi-direct product of N by Q (see 13, p. 167), denoted by G = N ⋊ Q, if N ≅ N1, Q ≅ Q1, N1 ∩ Q1 = 1G, N1Q1 = G and N1 is a normal subgroup of G. structure given by

S q k 1 q N - k 1 . . . S q k n - 1 q N - k 1 - k 2 - . . . - k n - 1 S q k n q N - k 1 - k 2 - . . . - k n - 1 - k n . . . .

Proof. Let GP^, π^ be the isometry group IsomV^, dP^, π^ of

V ^ = V ^ 1 × V ^ 2 × . . . × V ^ n - 1 ,

where V^i = Vi + 1 for each i = 1, 2, ..., n - 1, P^ = n - 1, is the linear order 1 < 2 < ... < n - 1 and π^ = k2, k3, ..., kn. Let

H = T I s o m V , d P , π : T = F 1 , P r v 2 , . . . , P r v n w i t h F 1 S q , π , l

and

K = T I s o m V , d P , π : T = P r v 1 , F 2 , . . . , F n w i t h F i S q , π , i ,

where each PrVi : Vi × Vi + 1 × ... × Vn Vi is the projection map given by PrVivi, vi + 1, ..., vn = vi. We claim that Isom(V, d (P,π) ) is a semi-direct product of H by K. Clearly, IsomV, dP, π = HK, because each isometry of (V, d (P,π) ) is a composition T1 T2 with T1 H and T2 K. Let L H K. Since L H, Lx1, x2, ..., xn + 1 = x1', x2, ..., xn + 1 and, since L is also in K, it follows that x1' = x1. Hence, L = idv and the groups H and K intersect trivially. Now, we prove that H is a normal subgroup of Isom(V, d (P,π) ). In fact, since IsomV, dP, π = HK, it suffices to check that THT-1 H for each T K. Let L H and T K. Then Lx1, .., xn = F1x1, ..., xn, x2, ..., xn and Tx1, ..., xn = x1, T~x2, ..., xn for some F1 Sq, π, 1 and T~ IsomV^, dP^, π^. If x1, ..., xn V, then

T L T - 1 x 1 , . . . , x n = T L x 1 , T ~ - 1 x 2 , . . . , x n = T F 1 x 1 , T ~ - 1 x 2 , . . . , x n , T ~ - 1 x 2 , . . . , x n = F 1 x 1 , T ~ - 1 x 2 , . . . , x n , T ~ T ~ - 1 x 2 , . . . , x n = F 1 x 1 , T ~ - 1 x 2 , . . . , x n , x 2 , . . . , x n .

Since F 1 is a bijection with respect to the first block space V 1, it follows that TLT TLT-1 H. This shows that H is a normal subgroup of Isom(V, d (P,π) ) and that

I s o m V , d P , π = H K .

In order to simplify notation, we will denote the elements of Sqk1QN - k1 by(πX ), where

π x : = π x X F q N - k 1 .

The group GP^, π^ acts on V = V1 × V^ by

T x 1 , . . . , x n = x 1 , T x 2 , . . . , x n

and Sqk1QN - k1 acts by

π X x 1 , . . . , x n = π x 2 , . . . , x n x 1 , x 2 , . . . , x n .

Both groups act as groups of isometries and both act faithfully. Therefore these actions establish isomorphisms of these groups with subgroups H and K: H Sqk1qN - k1 and K GP^, π^. Using the aforementioned isomorphisms involving H and K, it follows that

I s o m V , d P , π = S q k 1 q N - k 1 G P ^ , π ^ ,

which concludes the proof.

Corollary 3. Let P = n , be the linear order 1 < 2 < . . . < n and let V = V 1 × V 2 × . . . × V n be the π-direct product decomposition of V = F q N endowed with the poset block metric induced by the poset P and the partition π. If

H = T I s o m V , d P , π : T = F 1 , P r V 2 , . . . , P r V n w i t h F 1 S q , π , l

and

K = T I s o m V , d P , π : T = P r V 1 , F 2 , . . . , F n w i t h F i S q , π , i ,

then 3 3 Given groups Q and N and a homomorphism θ : Q → AutN, then N × Q equipped with the operation a, xb, y : = aθxb, xy is a semi-direct product of N by Q (see 13, Theorem 7.22), denoted by N ⋊ θQ. If G = N ⋊ Q and θxa = xax-1, for all x ∈ Q and a ∈ N, then G ≅ N ⋊ θQ (see 13, Theorem 7.23).

I s o m V , d P , π H θ K

with θ : K A u t H given by

θ T L x 1 , x 2 , . . . , x n = F 1 x 1 , T ~ - 1 x 2 , . . . , x n , x 2 , . . . , x n

for all L = F 1 , P r V 2 , . . . , P r V n H , T = P r V 1 , F 2 , . . . , F n K a n d x 1 , . . . , x n V w i t h T ~ : = F 2 , . . . , F n .

Corollary 4. Let P = n , be the linear order 1 < 2 < . . . < n and let V = V 1 × V 2 × . . . × V n be the π-direct product decomposition of V = F q n endowed with the poset block metric induced by the poset P and the partition π = k 1 , k 2 , . . . , k n . Then

I s o m V , d P , π = q k 1 ! q N - k 1 · q k 2 ! q N - k 1 - k 2 · . . . · q k n - 1 ! q · q k n ! .

Now, if the partition π = l, l, ..., l, it follows the following result (see 99 L. Panek, M. Firer & M.M.S. Alves. Symmetry groups of Rosenbloom-Tsfasman spaces. Discrete Mathematics, 309 (2009), 763-771., Corollary 3.1):

Corollary 5.LetP = n, be the linear order1 < 2 < ... < nand letV = Fqnbe the vector space endowed with the poset metric induced by the poset P. Then the group of isometries Isom(V, dP ) is a semi-direct product

S q q n - 1 . . . S q q S q . . . .

In particular,

I s o m V , d P = q ! q n - 1 q - 1 .

4 ISOMETRIES OF NRT BLOCK SPACE

In this section, we consider an order P = m · n, , that is, the union of m disjoint chains P 1 , P 2 , ..., P m of order n. We identify the elements of m · n with the set of ordered pairs of integers (i, j), with 1 i m, 1 j n, where i, j k, l iff i = k and j l, where is just the usual order on ℕ. We denote Pi = i, j : 1 j n. Each P i is a chain and those are the connected components of m · n, .

Let π = k1l, ..., k1n, ..., kml, ..., kmn be a partition of N = mn and for each 1 i m let πi = kil, ..., kin. Let

V = U 1 × U 2 × . . . × U m , (4.1)

where

U i : = V i 1 × V i 2 × . . . × V i n

and Vij = Fqkij, for all 1 i m, 1 j n. The space V with the poset metric induced by the order P = m · n, is called the (m, n, π)-NRT block space. Note that if n = 1, then P = m · l, induces just the error-block metric on V, and in particular, if π = 1, 1, ..., 1, then P = m · l, induces just the Hamming metric on Fqm. Hence the induced metric from the poset P = m · n, can be viewed as a generalization of the error-block metric.

Let V = U1 × U2 × ... × Um, as in (4.1), called the canonical decomposition of V. Given the canonical decompositions u = u1, ..., um and v = v1, ..., vm with ui, vi Ui, we have that

d P , π u , v = i = 1 m d P i , π i u i , v i ,

where dPi, πi, the restriction of d (P,π) to U i , is a linear poset block metric. We note that the restriction of d (P,π) to each U i turns it into a poset space defined by a linear order, that is, each U i is isometric to Ui, dn, πi with the metric dn, πi determined by the chain 1 < 2 < ... < n. Let Gi, πi, n be the group of isometries , of Ui, dn, πi. The direct product Πi = 1mGi, πi, n acts on V in the following manner: given T = T1, ..., Tm Πi = 1mGi, πi, n and v = v1, ..., vm V,

T v : = T 1 v 1 , . . . , T m v m .

Lemma 1.Let (V, d (P,π) ) be the (m, n, π)-NRT block space overFqand letGi, πi, nbe the group of isometries ofUi, dn, πi. GivenTi Gi, πi, n, with1 i m, the mapT = T1, ..., Tmdefined by

T v : = T 1 v 1 , . . . , T m v m

is an isometry of (V, d (P,π) ).

Proof. Given u, v V, consider the canonical decompositions u = u1, ..., um and v = v1, ..., vm with ui, vi Ui. Then,

d P , π T u , T v = i = 1 m d P i , π i T i u i , T i v i = i = 1 m d P i , π i u i , v i = d P , π u , v ,

which concludes the proof.

Let S m be the permutation group of {1, 2, ..., m}. We will call a permutation σ Sπadmissible if σi = j implies that kil = kjl, for all 1 l n. Cleary, the set of all admissible permutations is a subgroup of S m .

Let us consider the canonical decomposition v = v1, ..., vm of a vector v in the (m, n, π)NRT block space V. The group S π acts on V as a group of isometries: given σ Sπ and v = v1, ..., vm V, we define

T σ v = v σ 1 , v σ 2 , . . . , v σ m .

Lemma 2.Let (V, d (P,π) ) be the (m, n, π)-NRT block space V and letσ Sπ. Then T σ is an isometry of (V, d (P,π) ).

Proof. Given u, v V, we consider their canonical decompositions u = u1, ..., um and v = v1, ..., vm with ui, vi Ui. Then,

d P , π T σ u , T σ v = i = 1 m d P i , π i u σ i , v σ i = i = 1 m d P i , π i u i , v i = d P , π u , v ,

which concludes the proof.

The Lemmas 1 and 2 assure that the groups Πi = 1mGi, πi, n and S π are both isometry groups of the (m, n, π)-NRT block space V, and so is the group G (m, n, π) generated by both of them. We identify Πi = 1mGi, πi, n and with their images in G (m, n, π) and make an abuse of notation, denoting the images in G (m, n, π) by the same symbols. With this notation, analogous calculations as those of Theorem 2 show that

i = 1 m G i , π i , n S π = i d v

And

σ i = 1 m G i , π i , n σ - 1 = i = 1 m G i , π i , n ,

for every σ Sπ. Since Πi = 1mGi, πi, n is normal in G (m;n;π) and G (m,n,π) is generated by Πi = 1mGi, πi, n and S π , it follows that

G m , n , π = i = 1 m G i , π i , n · S π ,

and therefore, it follows the following proposition:

Proposition 3. The group G (m,n,π) has the structure of a semi-direct product given by

i = 1 m G i , π i , n S π .

We need two more lemmas in order to prove that every isometry of the (m, n, π)-NRT block space V is in G (m,n,π) , i.e., that G (m,n,π) is the group of isometries of V . We will identify the block space U i of V with the subspace of V of vectors v = v1, ..., vm such that vj = 0 for j i.

Lemma 4.Let (V, d (P,π) ) be the (m, n, π)-NRT block space and letV = U1 × U2 × ... × Umbe the canonical decomposition of V. If

π = k 1 l , . . . , k 1 n , . . . , k m 1 , . . . , k m n

and T : V V is an isometry such that T 0 = 0 , then for each index 1 i m there is another index 1 j m such that

T U i = U j

And

k i l = d i m V i l = d i m V j l = k j l ,

for all1 l n.

Proof. In the following we denote the subspace Vi1 × Vi2 × ... × Vik by Uik. We begin by showing that for each index 1 i m there is another index 1 j m such that TUi1 = Uj1 and ki1 = kj1. Let vi Ui1, with vi 0. Since

d P , π T v i , 0 = d P , π v i , 0 = 1 ,

it follows that vj = Tvi is a vector of (P, π)-weight 1. Thus Tvi Uj1 for some index 1 j m. If vi' Uil, with vi' vi and vi' 0, then Tvi' = vk for some vk Uk1 with vk 0, but also

d P , π T v i , T v i ' = d P , π v i , v i ' = 1 .

If k j, then dP, πTvi, Tvi' = dP, πvj, vk = 2. Hence k = j and TUi1 Uj1. Now apply the same reasoning to T −1. If vi Ui1, with vi 0, and Tvi = vj with vj Uj1, then T-1vj Ui1 and therefore T-1Uj1 Ui1. So that Uj1 T-1Ui1. Therefore TUi1 = Uj1. Since T is bijective, it follows that ki1 = kj1. For induction on k, suppose that for each s there exists an index l such that

T U s k = U l k

and ksj = klj for all 1 j k and for all 1 k n. We note that Usn = Us. Without loss of generality, let us consider s = 1, P1 = 1, 1, ..., 1, n. Let P l be the chain that begins at (l, 1) such that TU11 = Ul1 and suppose that U1k - 1 is taken by T onto Ulk - 1 with k1j = klj for all 1 j k - 1. Let v = v11, ..., vlk, v1i V1i with v1k 0, and let Tv = u1, ..., um, ui Ui. Since T0 = 0, it follows that

ω P , π v = ω P , π T v = ω P , π u 1 + . . . + ω P , π u m .

We will use this to show that Tv = ul. First suppose that ul = 0. In this case, ωP, πv = j lωP, πuj and therefore, if u11 U11, with u11 0 and Tu11 = ul1, then

k = d P , π u 11 , v = d P , π T u 11 , T v = j l ω P , π u j + ω P , π u l 1 = k + 1 ,

a contradiction. Hence ul 0. Let ul = ul1, ..., ult, uli vli, and suppose now there is another summand ui 0. Then k = jωP, πuj > ωP, πul and therefore t < k. By the induction hypothesis, it follows that T −1(u l ) is a vector in V1k - 1 with ωP, πT-1ul < k. Hence

k = d P , π T - 1 u l , v = d P , π u l , T v = j l ω P , π u j < k ,

again a contradiction. Hence, Tv Ulk. From the induction hypothesis and from the fact that T is a weight-preserving bijection, it follows that

T v 11 , . . . , v 1 k = u l 1 , . . . , u l k ,

where vlk 0 implies ulk 0. Therefore, TU1k = Ulk. Since k1j = klj for all 1 j k - 1 and T is a bijection, it follows that k1k = klk. Hence TU1 = Ul with k1j = klj for all 1 j n.

We recall that we defined an action of the group S π of the admissible permutations of S m on the canonical decomposition U1 × U2 × ... × Um of V by

T σ v : = v σ 1 , v σ 2 , . . . , v σ m

and that we defined an action of i = 1mGi, πi, n on V by

g 1 , g 2 , . . . , g m v 1 , v 2 , . . . , v m = g 1 v 1 , g m v m .

Lemma 5.Let (V, d (P,π) ) be the (m, n, π)-NRT block space. Each isometry of V that preserves the origin is a productTσ g, with σ in S π and g ini = 1mGi, πi, n.

Proof. Let T be an isometry of V , with T0 = 0. By the Lemma 4, for each 1 i m there is a σ (i) such that TUi = Uσi with kil = kσil for all 1 l n. Since T is a bijection, it follows that the map i σi is an admissible permutation of the set {1,..., m}. We define Tσ : V V by

T σ v : = v σ 1 , v σ 2 , . . . , v σ m .

Thus, T = Tσ-1TσT = Tσ-1TσT, where σ Sπ. Let g = TσT. Since gUi = TσTUi = TσUσi = Uσ-1σi = Ui, we have that g | Ui is an isometry of U i . Defining gi : = g | Ui it follows that g = g1, ..., gm, and hence, g i = 1mGi, πi, n.

Theorem 6.Let (V, d (P,π) ) be the (m, n, π)-NRT block space. The group of isometries of V is isomorphic to

i = 1 m G i , π i , n S π .

Proof. Let G (m,n,π) be the group of isometries of V generated by the action of i = 1mGi, πi, n and S π . Let T be an isometry of V and let v = T0. The translation S-vu : = u - v is clearly an isometry of V and S-v T0 = S-vv = 0 is an isometry that fixes the origin. Hence, by the previous lemma, it follows that S-v T Gm, n, π. Consider the canonical decomposition of v on the chain spaces, v = v1, ..., vm, vi Ui. Since the restriction Svi of Sv = Sv1, ..., Svm to Ui, with Sviui = ui + vi for each i, is the translation by v i , it follows that is an isometry of U i . Thus, Sv i = 1mGi, πi, n Gm, n, π and hence, that T = Sv S-v T is in G (m, n, p). Thus G (m, n, p) is the isometry group of V . By Proposition 3, it follows that G (m,n,π) is isomorphic to i = 1mGi, πi, n Sπ.

If n = 1 (P is an antichain) and π = k1, k2, ..., km, where

k 1 = . . . = k m 1 = l 1 , . . . , k m 1 + . . . + m l - 1 + 1 = . . . = k m 1 + . . . + m l = l r

with l1 > ... > lr and m1, ..., ml positive integers such that m1 + ... + ml = m, it follows that Gi, ki, 1 = Sqki, for 1 i m, and Sπ = Sm1 × ... × Sml (S π only permutes those blocks with same dimensions). Therefore it follows the following result.

Corollary 7. If P is an antichain, then

I s o m V , d P , π = i = 1 m S q k i i = 1 l S m i ,

When n = 1 and π = 1, 1, ..., 1, the (P, π)-weight is the usual Hamming weight on Fqm. In this case, each G i,(1) ,1 in Corollary 7 is equal to S q and every permutation in S m is also admissible. Thus, we reobtain the isometry groups of Hamming space:

Corollary 8. Let d H be the Hamming metric over F q m . The isometry group of F q m , d H is isomorphic to S q m S m .

If π = 1, 1, ..., 1, then every permutation in S m is admissible. Hence, it follows the following result (see 99 L. Panek, M. Firer & M.M.S. Alves. Symmetry groups of Rosenbloom-Tsfasman spaces. Discrete Mathematics, 309 (2009), 763-771., Theorem 4.1):

Corollary 9. Let V = F q m n be the vector space endowed with the poset metric d P induced by the poset P = m n , which is union of chains P 1 , ..., P m of length n. Then

I s o m V , d P = G n m S m ,

where G n : = S q q n - 1 . . . S q q S q . . . . In particular,

I s o m V , d P = q ! m · q n - 1 q - 1 + m · m ! .

5 AUTOMORPHISMS

The group of automorphisms of (V, d (P,π) ) is easily deduced from the Lemma 5 and Theorem 6. Let T = Tσ g be a isometry. Since T σ is linear, it follows that the linearity of T is a matter of whether g is linear or not. Now, if g = g1, g2, ..., gm is linear, then each component g i must also be linear. Since each g i is an isometry, it follows that g i is in the group AutUi, dn, πi of linear isometries of Ui, dn, πi. Therefore g i = 1mAutUi, dn, πi. On the other hand, any element of this group is a linear isometry. Hence, it follows the following result:

Theorem 1.The automorphism group Aut (V, d (P,π) ) of (V, d (P,π) ) is isomorphic to

i = 1 m A u t U i , d n , π i S π .

Corollary 2. Let n = 1 a n d π = k 1 , k 2 , . . . , k m be a partition of N. If

k 1 = . . . = k m 1 = l 1 , . . . , k m 1 + . . . + m l - 1 + 1 = . . . = k n = l r

with l 1 > l 2 > . . . > l r , then

A u t F q N , d P , π = i = 1 m q k i - 1 q k i - q . . . q k i - q k i - 1 · j = 1 l m j ! .

Proof. Note initially that there is a bijection from Aut (U i ) and the family of all ordered bases of U i . Let e1, e2, ..., eki be an ordered basis of U i . If T AutVi, then Te1, Te2, ..., Teki is an ordered basis of U i . If v1, v2, ..., vki is an ordered basis of U i , then there exists a unique automorphism T with Tej = vj for all j 1, 2, ..., ki. Since the number of ordered basis of U i is equal to

q k i - 1 q k i - q . . . q k i - q k i - 1

follows that AutUi = qki - 1qki - q...qki - qki - 1. Since

A u t U i , d n , π i = A u t U i

for each i, from Theorem 1

A u t F q N , d P , π = i = 1 m A u t U i · S π .

Since Sπ = j = 1lmj!, it follows the result.

Restricting to the Hamming case again, it follows that

A u t U i , d n , π i = A u t U i = A u t F q F q *

and Sπ = Sm, and therefore, it follows the following corollary:

Corollary 3.The automorphism group ofFqm, dH is Fq*m Sm.

ACKNOWLEDGEMENT

The authors thank the reviewers for carefully reading the manuscript and for all the suggestions and corrections that improved the presentation of the work.

REFERENCES

  • 1
    M.M.S. Alves, L. Panek & M. Firer. Error-block codes and poset metrics. Advances in Mathematics of Communications, 2 (2008), 95-111.
  • 2
    R. Brualdi, J.S. Graves & M. Lawrence. Codes with a poset metric. Discrete Mathematics, 147 (2008), 57-72.
  • 3
    S. Cho & D. Kim. Automorphism group of crown-weight space. Eur. J. Combin., 1(27) (2006), 90-100.
  • 4
    K. Feng, L. Xu & F.J. Hickernell. Linear error-block codes. Finite Fields and Their Applications, (12) (2006), 638-652.
  • 5
    M. Firer, M.M. Alves, J.A. Pinheiro & L. Panek. “Poset codes: partial orders, metrics and coding theory”. Springer (2018).
  • 6
    J. Hyun. A subgroup of the full poset-isometry group. SIAM Journal of Discrete Mathematics, 2(24) (2010), 589-599.
  • 7
    K. Lee. The automorphism group of a linear space with the Rosenbloom-Tsfasman metric. Eur. J. Combin., (24) (2003), 607-612.
  • 8
    H. Niederreiter. A combinatorial problem for vector spaces over finite fields. Discrete Mathematics, 96 (1991), 221-228.
  • 9
    L. Panek, M. Firer & M.M.S. Alves. Symmetry groups of Rosenbloom-Tsfasman spaces. Discrete Mathematics, 309 (2009), 763-771.
  • 10
    L. Panek, M. Firer, H. Kim & J. Hyun. Groups of linear isometries on poset structures. Discrete Mathematics, 308 (2008), 4116-4123.
  • 11
    W. Park & A. Barg. The ordered Hamming metric and ordered symmetric channels. In “IEEE Internacional Symposium on Information Theory Proceedings”. IEEE (2011), pp. 2283-2287.
  • 12
    M.Y. Rosenbloom & M.A. Tsfasman. Codes for the m-metric. Probl. Inf. Transm., 33 (1997), 45-52.
  • 13
    J.J. Rotman. “An introduction to the theory of groups”. Springer (1995).
  • 1
    If H 1 ,..., H l are groups, then their direct product, denoted by H1 × ... × Hl, is the group with elements h1, ..., hl, hi Hi for each 1 i l, and with operation h1, ..., hlh1', ..., hl' = h1h1', ..., hlhl'.
  • 2
    Let G be a group with identity 1G and let N 1 and Q 1 be subgroups of G. We recall that the group G is a semi-direct product of N by Q (see 1313 J.J. Rotman. “An introduction to the theory of groups”. Springer (1995)., p. 167), denoted by G = N Q, if N N1, Q Q1, N1 Q1 = 1G, N1Q1 = G and N1 is a normal subgroup of G.
  • 3
    Given groups Q and N and a homomorphism θ : Q AutN, then N × Q equipped with the operation a, xb, y : = aθxb, xy is a semi-direct product of N by Q (see 1313 J.J. Rotman. “An introduction to the theory of groups”. Springer (1995)., Theorem 7.22), denoted by N θQ. If G = N Q and θxa = xax-1, for all x Q and a N, then G N θQ (see 1313 J.J. Rotman. “An introduction to the theory of groups”. Springer (1995)., Theorem 7.23).

Publication Dates

  • Publication in this collection
    03 Aug 2020
  • Date of issue
    May-Aug 2020

History

  • Received
    15 Dec 2017
  • Accepted
    18 Feb 2020
Sociedade Brasileira de Matemática Aplicada e Computacional Rua Maestro João Seppe, nº. 900, 16º. andar - Sala 163 , 13561-120 São Carlos - SP, Tel. / Fax: (55 16) 3412-9752 - São Carlos - SP - Brazil
E-mail: sbmac@sbmac.org.br