Exponential Sums for Symmetric Matrices in a Finite Field

1955 ◽  
Vol 14 (4-6) ◽  
pp. 331-339 ◽  
Author(s):  
John H. Hodges
Keyword(s):  
Finite Field ◽  
Exponential Sums ◽  
Symmetric Matrices

Weighted partitions for symmetric matrices in a finite field

1956 ◽  
Vol 66 (1) ◽  
pp. 13-24 ◽  
Author(s):  
John H. Hodges
Keyword(s):  
Finite Field ◽  
Symmetric Matrices

Bivectors over a Finite Field

1981 ◽  
Vol 24 (4) ◽  
pp. 489-490
Author(s):  
J. A. MacDougall
Keyword(s):  
Finite Field ◽  
Vector Space ◽  
Symmetric Matrices ◽  
Dimensional Vector ◽  
Dimensional Vector Space

AbstractLet U be an n -dimensional vector space over a finite field of q elements. The number of elements of Λ2U of each irreducible length is found using the isomorphism of Λ2U with Hn, the space of n x n skew-symmetric matrices, and results due to Carlitz and MacWilliams on the number of skew-symmetric matrices of any given rank.

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.

Exponential sums for skew matrices in a finite field

1956 ◽  
Vol 7 (2) ◽  
pp. 116-121 ◽  
Author(s):  
John H. Hodges
Keyword(s):  
Finite Field ◽  
Exponential Sums

DEGREE MATRICES AND ESTIMATES FOR EXPONENTIAL SUMS OF POLYNOMIALS OVER FINITE FIELDS

2013 ◽  
Vol 12 (07) ◽  
pp. 1350030 ◽  
Author(s):  
WEI CAO
Keyword(s):  
Finite Field ◽  
Finite Fields ◽  
Exponential Sums ◽  
Elementary Approach ◽  
Multivariate Polynomial ◽  
Elementary Divisors ◽  
Polynomials Over Finite Fields ◽  
Degree Matrix

Let f be a multivariate polynomial over a finite field and its degree matrix be composed of the degree vectors appearing in f. In this paper, we provide an elementary approach to estimating the exponential sums of the polynomials with positive square degree matrices in terms of the elementary divisors of the degree matrices.

scholarly journals Infinite Families of 2-Designs from a Class of Linear Codes Related to Dembowski-Ostrom Functions

2021 ◽  
pp. 1-15
Author(s):  
Rong Wang ◽  
Xiaoni Du ◽  
Cuiling Fan ◽  
Zhihua Niu
Keyword(s):  
Finite Field ◽  
Weight Distribution ◽  
Coding Theory ◽  
Exponential Sums ◽  
Linear Codes ◽  
Cyclic Codes ◽  
Research Interest ◽  
Combinatorial Formula ◽  
Text Design ◽  
Fixed Weight

Due to their important applications to coding theory, cryptography, communications and statistics, combinatorial [Formula: see text]-designs have attracted lots of research interest for decades. The interplay between coding theory and [Formula: see text]-designs started many years ago. It is generally known that [Formula: see text]-designs can be used to derive linear codes over any finite field, and that the supports of all codewords with a fixed weight in a code also may hold a [Formula: see text]-design. In this paper, we first construct a class of linear codes from cyclic codes related to Dembowski-Ostrom functions. By using exponential sums, we then determine the weight distribution of the linear codes. Finally, we obtain infinite families of [Formula: see text]-designs from the supports of all codewords with a fixed weight in these codes. Furthermore, the parameters of [Formula: see text]-designs are calculated explicitly.

scholarly journals Pairs of Quadratic Forms over Finite Fields

10.37236/4072 ◽  
2016 ◽  
Vol 23 (2) ◽  
Author(s):  
Alexander Pott ◽  
Kai-Uwe Schmidt ◽  
Yue Zhou
Keyword(s):  
Finite Field ◽  
Finite Fields ◽  
Boolean Functions ◽  
Quadratic Forms ◽  
Symmetric Matrices ◽  
Explicit Expressions

Let $\mathbb{F}_q$ be a finite field with $q$ elements and let $X$ be a set of matrices over $\mathbb{F}_q$. The main results of this paper are explicit expressions for the number of pairs $(A,B)$ of matrices in $X$ such that $A$ has rank $r$, $B$ has rank $s$, and $A+B$ has rank $k$ in the cases that (i) $X$ is the set of alternating matrices over $\mathbb{F}_q$ and (ii) $X$ is the set of symmetric matrices over $\mathbb{F}_q$ for odd $q$. Our motivation to study these sets comes from their relationships to quadratic forms. As one application, we obtain the number of quadratic Boolean functions that are simultaneously bent and negabent, which solves a problem due to Parker and Pott.

scholarly journals On the set of distances between two sets over finite fields

2006 ◽  
Vol 2006 ◽  
pp. 1-5 ◽  
Author(s):  
Igor E. Shparlinski
Keyword(s):  
Finite Field ◽  
Finite Fields ◽  
Lower Bounds ◽  
Exponential Sums

We use bounds of exponential sums to derive new lower bounds on the number of distinct distances between all pairs of points(x,y)∈×ℬfor two given sets,ℬ∈Fqn, whereFqis a finite field ofqelements andn≥1is an integer.

EXPONENTIAL SUMS ON 𝔸n. IV

2009 ◽  
Vol 05 (05) ◽  
pp. 747-764 ◽  
Author(s):  
ALAN ADOLPHSON ◽  
STEVEN SPERBER
Keyword(s):  
Finite Field ◽  
Cohomology Group ◽  
Exponential Sums ◽  
Exponential Sum

We find new conditions on a polynomial over a finite field that guarantee that the exponential sum defined by the polynomial has only one nonvanishing p-adic cohomology group, hence the L-function associated to the exponential sum is a polynomial or the reciprocal of a polynomial.

Convolution and Equidistribution

2012 ◽  
Author(s):  
Nicholas M. Katz
Keyword(s):  
Finite Field ◽  
Finite Fields ◽  
Mellin Transform ◽  
Exponential Sums ◽  
Multiplicative Group ◽  
Input Function ◽  
Point Of View ◽  
Basic Question ◽  
Mellin Transforms ◽  
The Subject

This book explores an important aspect of number theory—the theory of exponential sums over finite fields and their Mellin transforms—from a new, categorical point of view. The book presents fundamentally important results and a plethora of examples, opening up new directions in the subject. The finite-field Mellin transform (of a function on the multiplicative group of a finite field) is defined by summing that function against variable multiplicative characters. The basic question considered in the book is how the values of the Mellin transform are distributed (in a probabilistic sense), in cases where the input function is suitably algebro-geometric. This question is answered by the book's main theorem, using a mixture of geometric, categorical, and group-theoretic methods. By providing a new framework for studying Mellin transforms over finite fields, this book opens up a new way for researchers to further explore the subject.

Sign in / Sign up

Export Citation Format

Share Document