scholarly journals On Growth of the Set $A(A+1)$ in Arbitrary Finite Fields

10.37236/8496 ◽  
2020 ◽  
Vol 27 (4) ◽  
Author(s):  
Ali Mohammadi
Keyword(s):  
Lower Bound ◽  
Finite Field ◽  
Finite Fields ◽  
Explicit Lower Bound

Let $\mathbb{F}_q$ be a finite field of order $q$, where $q$ is a power of a prime. For a set $A \subset \mathbb{F}_q$, under certain structural restrictions, we prove a new explicit lower bound on the size of the product set $A(A + 1)$. Our result improves on the previous best known bound due to Zhelezov and holds under more relaxed restrictions.

EXPANSION OF ORBITS OF SOME DYNAMICAL SYSTEMS OVER FINITE FIELDS

2010 ◽  
Vol 82 (2) ◽  
pp. 232-239 ◽  
Author(s):  
JAIME GUTIERREZ ◽  
IGOR E. SHPARLINSKI
Keyword(s):  
Dynamical Systems ◽  
Lower Bound ◽  
Finite Field ◽  
Rational Function ◽  
Finite Fields ◽  
Exponential Sums ◽  
Short Interval ◽  
Additive Combinatorics ◽  
Distribution Of Elements ◽  
Image Position

AbstractGiven a finite field 𝔽p={0,…,p−1} of p elements, where p is a prime, we consider the distribution of elements in the orbits of a transformation ξ↦ψ(ξ) associated with a rational function ψ∈𝔽p(X). We use bounds of exponential sums to show that if N≥p1/2+ε for some fixed ε then no N distinct consecutive elements of such an orbit are contained in any short interval, improving the trivial lower bound N on the length of such intervals. In the case of linear fractional functions we use a different approach, based on some results of additive combinatorics due to Bourgain, that gives a nontrivial lower bound for essentially any admissible value of N.

Groups generated by iterations of polynomials over finite fields

2015 ◽  
Vol 59 (1) ◽  
pp. 235-245 ◽  
Author(s):  
Igor E. Shparlinski
Keyword(s):  
Lower Bound ◽  
Finite Field ◽  
Finite Fields ◽  
Mild Condition ◽  
Character Sums ◽  
Small Subgroup ◽  
Polynomials Over Finite Fields

AbstractGiven a finite field of q elements, we consider a trajectory of the map associated with a polynomial ]. Using bounds of character sums, under some mild condition on f, we show that for an appropriate constant C > 0 no N ⩾ Cq½ distinct consecutive elements of such a trajectory are contained in a small subgroup of , improving the trivial lower bound . Using a different technique, we also obtain a similar result for very small values of N. These results are multiplicative analogues of several recently obtained bounds on the length of intervals containing N distinct consecutive elements of such a trajectory.

scholarly journals ON THE KROHN–RHODES COMPLEXITY OF SEMIGROUPS OF UPPER TRIANGULAR MATRICES

2007 ◽  
Vol 17 (01) ◽  
pp. 187-201 ◽  
Author(s):  
MARK KAMBITES
Keyword(s):  
Lower Bound ◽  
Finite Field ◽  
Finite Fields ◽  
Finite Semigroup ◽  
Triangular Matrices ◽  
Upper Triangular Matrices ◽  
Triangular Representation

We consider the Krohn–Rhodes complexity of certain semigroups of upper triangular matrices over finite fields. We show that for any n > 1 and finite field k, the semigroups of all n × n upper triangular matrices over k and of all n × n unitriangular matrices over k have complexity n - 1. A consequence is that the complexity c > 1 of a finite semigroup places a lower bound of c + 1 on the dimension of any faithful triangular representation of that semigroup over a finite field.

scholarly journals On the k-Error Linear Complexity of Binary Sequences Derived from the Discrete Logarithm in Finite Fields

Complexity ◽  
2019 ◽  
Vol 2019 ◽  
pp. 1-7
Author(s):  
Zhixiong Chen ◽  
Qiuyan Wang
Keyword(s):  
Lower Bound ◽  
Finite Field ◽  
Finite Fields ◽  
Linear Complexity ◽  
Discrete Logarithm ◽  
Binary Sequence ◽  
Binary Sequences ◽  
Quadratic Character ◽  
Legendre Sequence ◽  
Error Linear Complexity

Let Fq be the finite field with q=pr elements, where p is an odd prime. For the ordered elements ξ0,ξ1,…,ξq-1∈Fq, the binary sequence σ=(σ0,σ1,…,σq-1) with period q is defined over the finite field F2={0,1} as follows: σn=0,  if  n=0,  (1-χ(ξn))/2,  if  1≤n<q,  σn+q=σn, where χ is the quadratic character of Fq. Obviously, σ is the Legendre sequence if r=1. In this paper, our first contribution is to prove a lower bound on the linear complexity of σ for r≥2, which improves some results of Meidl and Winterhof. Our second contribution is to study the distribution of the k-error linear complexity of σ for r=2. Unfortunately, the method presented in this paper seems not suitable for the case r>2 and we leave it open.

scholarly journals On the Density of Normal Bases in Finite Fields

1997 ◽  
Vol 4 (44) ◽  
Author(s):  
Gudmund Skovbjerg Frandsen
Keyword(s):  
Lower Bound ◽  
Finite Field ◽  
Vector Space ◽  
Prime Power ◽  
Constant Factor ◽  
Normal Basis ◽  
Dimensional Vector ◽  
Dimensional Vector Space ◽  
Linearly Independent ◽  
Explicit Lower Bound

<p>Let Fqn denote the finite field with q^n elements, for q being a prime power. Fqn may be regarded as an n-dimensional vector space over Fq. alpha in Fqn generates a normal basis for this vector space (Fqn : Fq), if<br />{alpha, alpha^q, alpha^q^2 , . . . , alpha^q^(n−1)} are linearly independent over Fq. Let N(q; n) denote the number of elements in Fqn that generate a normal basis for<br />Fqn : Fq, and let nu(q, n) = N(q,n)/q^n denote the frequency of such elements.<br />We show that there exists a constant c > 0 such that<br />nu(q, n) >= c / sqrt(log _q n) ,for all n, q >= 2<br />and this is optimal up to a constant factor in that we show<br />0.28477 <= lim inf (q, n) sqrt( log_q n ) <= 0.62521, for all q >= 2</p><p>We also obtain an explicit lower bound:<br /> nu(q, n) >= 1 / e [log_q n], for all n, q >= 2</p>

Maximal Sets of Pairwise Orthogonal Vectors in Finite Fields

2012 ◽  
Vol 55 (2) ◽  
pp. 418-423 ◽  
Author(s):  
Le Anh Vinh
Keyword(s):  
Positive Integer ◽  
Finite Field ◽  
Finite Fields ◽  
Bilinear Form ◽  
Symmetric Bilinear Form

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.

scholarly journals Short Kloosterman Sums for Polynomials over Finite Fields

2003 ◽  
Vol 55 (2) ◽  
pp. 225-246 ◽  
Author(s):  
William D. Banks ◽  
Asma Harcharras ◽  
Igor E. Shparlinski
Keyword(s):  
Finite Field ◽  
Finite Fields ◽  
Small Degree ◽  
Kloosterman Sums ◽  
Degree Relative ◽  
Irreducible Polynomials ◽  
Arbitrary Polynomial ◽  
Polynomials Over Finite Fields ◽  
Titchmarsh Theorem

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.

scholarly journals Monomial Generalized Almost Perfect Nonlinear Functions

2020 ◽  
Vol 31 (03) ◽  
pp. 411-419
Author(s):  
Masamichi Kuroda
Keyword(s):  
Finite Field ◽  
Finite Fields ◽  
Algebraic Degree ◽  
Apn Functions ◽  
Nonlinear Functions ◽  
Almost Perfect Nonlinear ◽  
Basic Properties ◽  
Almost Perfect Nonlinear Functions

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.

scholarly journals Restriction Operators Acting on Radial Functions on Vector Spaces over Finite Fields

2014 ◽  
Vol 57 (4) ◽  
pp. 834-844
Author(s):  
Doowon Koh
Keyword(s):  
Finite Field ◽  
Finite Fields ◽  
Vector Spaces ◽  
Dimensional Vector ◽  
Algebraic Varieties ◽  
Test Functions ◽  
Radial Functions ◽  
Zero Radius ◽  
Intersection Points ◽  
Field Setting

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.

scholarly journals On the number of permutation polynomials over a finite field

2016 ◽  
Vol 12 (06) ◽  
pp. 1519-1528
Author(s):  
Kwang Yon Kim ◽  
Ryul Kim ◽  
Jin Song Kim
Keyword(s):  
Finite Field ◽  
Finite Fields ◽  
Roots Of Unity ◽  
Permutation Polynomials

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].

Sign in / Sign up

Export Citation Format

Share Document