67 research outputs found

    Davenport constant with weights

    Get PDF
    For the cyclic group G=Z/nZG=\mathbb{Z}/n\mathbb{Z} and any non-empty A∈ZA\in\mathbb{Z}. We define the Davenport constant of GG with weight AA, denoted by DA(n)D_A(n), to be the least natural number kk such that for any sequence (x1,...,xk)(x_1, ..., x_k) with xi∈Gx_i\in G, there exists a non-empty subsequence (xj1,...,xjl)(x_{j_1}, ..., x_{j_l}) and a1,...,al∈Aa_1, ..., a_l\in A such that βˆ‘i=1laixji=0\sum_{i=1}^l a_ix_{j_i} = 0. Similarly, we define the constant EA(n)E_A(n) to be the least t∈Nt\in\mathbb{N} such that for all sequences (x1,>...,xt)(x_1, >..., x_t) with xi∈Gx_i \in G, there exist indices j1,...,jn∈N,1≀j1<...<jn≀tj_1, ..., j_n\in\mathbb{N}, 1\leq j_1 <... < j_n\leq t, and Ο‘1,>...,Ο‘n∈A\vartheta_1, >..., \vartheta_n\in A with βˆ‘i=1nΟ‘ixji=0\sum^{n}_{i=1} \vartheta_ix_{j_i} = 0. In the present paper, we show that EA(n)=DA(n)+nβˆ’1E_A(n)=D_A(n)+n-1. This solve the problem raised by Adhikari and Rath \cite{ar06}, Adhikari and Chen \cite{ac08}, Thangadurai \cite{th07} and Griffiths \cite{gr08}.Comment: 6page

    Further Results on Permutation Polynomials over Finite Fields

    Full text link
    Permutation polynomials are an interesting subject of mathematics and have applications in other areas of mathematics and engineering. In this paper, we develop general theorems on permutation polynomials over finite fields. As a demonstration of the theorems, we present a number of classes of explicit permutation polynomials on \gf_q
    • …
    corecore