scholarly journals Partitions and Compositions over Finite Fields

10.37236/2678 ◽  
2013 ◽  
Vol 20 (1) ◽  
Author(s):  
Amela Muratovic-Ribic ◽  
Qiang Wang

In this paper we  find an exact formula for the number of partitions of an element  $z$ into $m$ parts over a finite field,  i.e. we find the number of nonzero solutions of the equation $x_1+x_2+\cdots +x_m=z$ over a finite field when the order of terms does not matter. This is equivalent to counting the number of $m$-multi-subsets whose sum is $z$.  When the order of the terms in a solution does matter, such a solution is called a composition of $z$. The number of compositions is useful in the study of zeta functions of toric hypersurfaces over finite fields.  We also give an application in the study of polynomials of prescribed ranges over finite fields.

1990 ◽  
Vol 33 (3) ◽  
pp. 282-285 ◽  
Author(s):  
Amilcar Pacheco

AbstractLet C be a complete irreducible nonsingular algebraic curve defined over a finite field k. Let G be a finite subgroup of the group of automorphisms Aut(C) of C. We prove that certain idempotent relations in the rational group ring Q[G] imply other relations between the zeta-functions of the quotient curves C/H, where H is a subgroup of G. In particular we generalize some results of Kani in the special case of curves over finite fields.


2012 ◽  
Vol 55 (2) ◽  
pp. 418-423 ◽  
Author(s):  
Le Anh Vinh

AbstractGiven a positive integern, a finite fieldofqelements (qodd), and a non-degenerate symmetric bilinear formBon, we determine the largest possible cardinality of pairwiseB-orthogonal subsets, that is, for any two vectorsx,y∈ Ε, one hasB(x,y) = 0.


2003 ◽  
Vol 55 (2) ◽  
pp. 225-246 ◽  
Author(s):  
William D. Banks ◽  
Asma Harcharras ◽  
Igor E. Shparlinski

AbstractWe extend to the setting of polynomials over a finite field certain estimates for short Kloosterman sums originally due to Karatsuba. Our estimates are then used to establish some uniformity of distribution results in the ring [x]/M(x) for collections of polynomials either of the form f−1g−1 or of the form f−1g−1 + afg, where f and g are polynomials coprime to M and of very small degree relative to M, and a is an arbitrary polynomial. We also give estimates for short Kloosterman sums where the summation runs over products of two irreducible polynomials of small degree. It is likely that this result can be used to give an improvement of the Brun-Titchmarsh theorem for polynomials over finite fields.


2020 ◽  
Vol 31 (03) ◽  
pp. 411-419
Author(s):  
Masamichi Kuroda

Generalized almost perfect nonlinear (GAPN) functions were defined to satisfy some generalizations of basic properties of almost perfect nonlinear (APN) functions for even characteristic. In particular, on finite fields of even characteristic, GAPN functions coincide with APN functions. In this paper, we study monomial GAPN functions for odd characteristic. We give monomial GAPN functions whose algebraic degree are maximum or minimum on a finite field of odd characteristic. Moreover, we define a generalization of exceptional APN functions and give typical examples.


2014 ◽  
Vol 57 (4) ◽  
pp. 834-844
Author(s):  
Doowon Koh

AbstractWe study Lp → Lr restriction estimates for algebraic varieties V in the case when restriction operators act on radial functions in the finite field setting. We show that if the varieties V lie in odd dimensional vector spaces over finite fields, then the conjectured restriction estimates are possible for all radial test functions. In addition, assuming that the varieties V are defined in even dimensional spaces and have few intersection points with the sphere of zero radius, we also obtain the conjectured exponents for all radial test functions.


2016 ◽  
Vol 12 (06) ◽  
pp. 1519-1528
Author(s):  
Kwang Yon Kim ◽  
Ryul Kim ◽  
Jin Song Kim

In order to extend the results of [Formula: see text] in [P. Das, The number of permutation polynomials of a given degree over a finite field, Finite Fields Appl. 8(4) (2002) 478–490], where [Formula: see text] is a prime, to arbitrary finite fields [Formula: see text], we find a formula for the number of permutation polynomials of degree [Formula: see text] over a finite field [Formula: see text], which has [Formula: see text] elements, in terms of the permanent of a matrix. We write down an expression for the number of permutation polynomials of degree [Formula: see text] over a finite field [Formula: see text], using the permanent of a matrix whose entries are [Formula: see text]th roots of unity and using this we obtain a nontrivial bound for the number. Finally, we provide a formula for the number of permutation polynomials of degree [Formula: see text] less than [Formula: see text].


2017 ◽  
Vol 9 (3) ◽  
pp. 8
Author(s):  
Yasanthi Kottegoda

We consider homogeneous linear recurring sequences over a finite field $\mathbb{F}_{q}$, based on an irreducible characteristic polynomial of degree $n$ and order $m$. Let $t=(q^{n}-1)/ m$. We use quadratic forms over finite fields to give the exact number of occurrences of zeros of the sequence within its least period when $t$ has q-adic weight 2. Consequently we prove that the cardinality of the set of zeros for sequences from this category is equal to two.


2019 ◽  
Vol 19 (2) ◽  
pp. 263-268 ◽  
Author(s):  
Saeed Tafazolian ◽  
Fernando Torres

Abstract Let 𝓧 be the nonsingular model of a plane curve of type yn = f(x) over the finite field F of order q2, where f(x) is a separable polynomial of degree coprime to n. If the number of F-rational points of 𝓧 attains the Hasse–Weil bound, then the condition that n divides q+1 is equivalent to the solubility of f(x) in F; see [20]. In this paper, we investigate this condition for f(x) = xℓ(xm+1).


2020 ◽  
Vol 71 (3) ◽  
pp. 781-822
Author(s):  
Corentin Perret-Gentil

Abstract By adapting the technique of David, Koukoulopoulos and Smith for computing sums of Euler products, and using their interpretation of results of Schoof à la Gekeler, we determine the average number of subgroups (or cyclic subgroups) of an elliptic curve over a fixed finite field of prime size. This is in line with previous works computing the average number of (cyclic) subgroups of finite abelian groups of rank at most $2$. A required input is a good estimate for the divisor function in both short interval and arithmetic progressions, that we obtain by combining ideas of Ivić–Zhai and Blomer. With the same tools, an asymptotic for the average of the number of divisors of the number of rational points could also be given.


Sign in / Sign up

Export Citation Format

Share Document