# Towards a function field version of Freiman's Theorem

@article{Bachoc2017TowardsAF, title={Towards a function field version of Freiman's Theorem}, author={Christine Bachoc and Alain Couvreur and Gilles Z'emor}, journal={arXiv: Number Theory}, year={2017} }

We discuss a multiplicative counterpart of Freiman's $3k-4$ theorem in the context of a function field $F$ over an algebraically closed field $K$. Such a theorem would give a precise description of subspaces $S$, such that the space $S^2$ spanned by products of elements of $S$ satisfies $\dim S^2 \leq 3 \dim S-4$. We make a step in this direction by giving a complete characterisation of spaces $S$ such that $\dim S^2 = 2 \dim S$. We show that, up to multiplication by a constant field element…

## 5 Citations

### The quadratic hull of a code and the geometric view on multiplication algorithms

- Mathematics, Computer ScienceArXiv
- 2019

It is shown that any symmetric bilinear multiplication algorithm for a finite-dimensional algebra over a field can be obtained by evaluation-interpolation at simple points on a naturally associated space, namely the quadratic hull of the corresponding code.

### A pr 2 02 2 HOW ARITHMETIC AND GEOMETRY MAKE ERROR CORRECTING CODES BETTER by Alain Couvreur

- Computer Science
- 2021

A part of the history of algebraic geometry codes together with some of their recent applications is discussed, with a particular focus on the “multiplicative” structure of these codes, i.e. their behaviour with respect to the component wise product.

### Submodular functions in additive combinatorics problems for group actions and representations

- Mathematics
- 2022

We establish analogues in the context of group actions or group representations of some classical problems and results in addtive combinatorics of groups. We also study the notion of left invariant…

### Asymptotically-Good Arithmetic Secret Sharing over Z/pZ with Strong Multiplication and Its Applications to E cient MPC

- Computer Science, Mathematics
- 2021

An arithmetic secret sharing with strong multiplication is established, which is the most important primitive in the BGW model, and a new multiplicative triples check is introduced, which compares to [GSZ20, Crypto'20] in that it has constant latency and a di erent complexity trade-o, both in the particular case of nite elds and when lifted over rings Z/pZ.

### Codes algébriques et géométriques, applications à la cryptographie et à l'information quantique

- Computer Science
- 2019

HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not, for teaching and research institutions in France or abroad, or from public or private research centers.

## References

SHOWING 1-10 OF 20 REFERENCES

### An analogue of Vosper's theorem for extension fields

- MathematicsMathematical Proceedings of the Cambridge Philosophical Society
- 2017

A linear analogue of Vosper's Theorem is given, which gives the structure of vector spaces S, T in a prime extension L of a finite field F such that the linear span ST of the set of products of elements S and of elements of T has small dimension.

### Varieties Defined by Quadratic Equations

- Mathematics
- 2010

First of all, let me fix my terminology and set-up. I will always be working over an algebraically closed ground field k. We will be concerned almost entirely with projective varieties over k…

### A Generalization of an Addition Theorem of Kneser

- Mathematics
- 2002

Abstract A theorem of Kneser states that in an abelian group G, if A and B are finite subsets in G and AB={ab:a∈A,b∈B}, then ∣AB∣⩾∣A∣+ ∣B∣− ∣H(AB)∣ where H(AB)={g∈G:g(AB)=AB}. Motivated by the study…

### Construction of Sidon Spaces With Applications to Coding

- Computer ScienceIEEE Transactions on Information Theory
- 2018

A conjecture by Trautmann regarding the existence of non-trivial cyclic subspace codes is resolved for most parameters, and multi-orbit cyclicSubspace codes are attained, whose cardinality is within a constant factor from the sphere-packing bound for subspace code.

### Additive combinatorics methods in associative algebras

- Mathematics
- 2015

We adapt methods coming from additive combinatorics in groups to the study of linear span in associative unital algebras. In particular, we establish for these algebras analogues of…

### Revisiting Kneser’s Theorem for Field Extensions

- MathematicsComb.
- 2018

An alternative proof of the theorem that also holds in the non-separable case is given, thus solving Hou’s conjecture and solving the conjecture that Kneser's addition Theorem is valid for all extensions.

### On products and powers of linear codes under componentwise multiplication

- Computer Science, MathematicsArXiv
- 2013

An expanded version of the author's talk at AGCT-14, focus is put mostly on basic properties and descriptive statements that could otherwise probably not fit in a regular research paper.

### On linear versions of some addition theorems

- Mathematics
- 2008

Let K ⊂ L be a field extension. Given K-subspaces A, B of L, we study the subspace ⟨AB⟩ spanned by the product set AB = {ab∣ a ∈ A, b ∈ B}. We obtain some lower bounds on dim K ⟨AB⟩ and dim K ⟨B n ⟩…

### Algebraic function fields and codes

- MathematicsUniversitext
- 1993

This new edition, published in the series Graduate Texts in Mathematics, has been considerably expanded and contains numerous exercises that help the reader to understand the basic material.

### Critical Pairs for the Product Singleton Bound

- Computer ScienceIEEE Transactions on Information Theory
- 2015

It is proved, for C = D, that if the square of the code C has minimum distance at least 2, and (C, C) is a PMDS pair, then either C is a generalized Reed-Solomon code, orC is a direct sum of self-dual codes.