𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the construction of a family of transversal subspaces over finite fields

✍ Scribed by Alexander Chistov; Hervé Fournier; Pascal Koiran; Sylvain Perifel

Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
172 KB
Volume
429
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Power Sums over Finite Subspaces of a Fi
Power Sums over Finite Subspaces of a Field
✍ Nigel P. Byott; Robin J. Chapman 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 134 KB

Let < be a "nite additive subgroup of a "eld K of characteristic p'0. We consider sums of the form S F (< : )" TZ4 (v# )F for h50 and 3 K. In particular, we give necessary and su$cient conditions for the vanishing of S F (<; ), in terms of the digit sum in the base-p expansion of h, in the case that

Invariant Subspaces of the Ring of Funct
Invariant Subspaces of the Ring of Functions on a Vector Space over a Finite Field
✍ Nicholas J Kuhn 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 270 KB

If F is the finite field of characteristic p and order q s p , let F F q be the q category whose objects are functors from finite dimensional F -vector spaces to q F -vector spaces, and with morphisms the natural transformations between such q functors. Ž . A fundamental object in F F q is the injec

The computer construction of matrix repr
The computer construction of matrix representationsof finite groups over finite fields
✍ R.A. Parker; R.A. Wilson 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 517 KB

Given an abstract group G it is important to be able to find explicit generators for a concrete group isomorphic to G, in order to perform calculations with the group. In this paper we describe a method of using the "Meat-axe" to construct explicit matrix generators for a given group.

Explicit Constructions of Perfect Hash F
Explicit Constructions of Perfect Hash Families from Algebraic Curves over Finite Fields
✍ Huaxiong Wang; Chaoping Xing 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 149 KB

Let A be a set of order n and B be a set of order m. An (n, m, w)-perfect hash family is a set H of functions from A to B such that for any X A with |X |=w, there exists an element h # H such that h is one-to-one when restricted to X. Perfect hash families have many applications to computer science,