Extension theorems for Hamming varieties over finite fields

Generalized incidence theorems, homogeneous forms and sum–product estimates in finite fields

In this paper we study extension theorems associated with general varieties in two dimensional vector spaces over finite fields. Applying Bezout’s theorem, we obtain the sufficient and necessary conditions on general curves where sharp L^p - L^r extension estimates hold. Our main result can be considered as a nice generalization of works by Mockenhaupt and Tao in [17] and Iosevich and Koh in [10]. As an application of our sharp extension estimates, we also study the Falconer distance problems in two dimensions.

Root-free exterior squares over finite fields

Grassmann codes are linear codes associated with the Grassmann variety $G(\ell,m)$ of $\ell$-dimensional subspaces of an $m$ dimensional vector space $\mathbb{F}_{q}^{m}.$ They were studied by Nogin for general $q.$ These codes are conveniently described using the correspondence between non-degenerate $[n,k]_{q}$ linear codes on one hand and non-degenerate $[n,k]$ projective systems on the other hand. A non-degenerate $[n,k]$ projective system is simply a collection of $n$ points in projective space $\mathbb{P}^{k-1}$ satisfying the condition that no hyperplane of $\mathbb{P}^{k-1}$ contains all the $n$ points under consideration. In this paper we will determine the weight of linear codes $C(3,8)$ associated with Grassmann varieties $G(3,8)$ over an arbitrary finite field $\mathbb{F}_{q}$. We use a formula for the weight of a codeword of $C(3,8)$, in terms of the cardinalities certain varieties associated with alternating trilinear forms on $\mathbb{F}_{q}^{8}.$ For $m=6$ and $7,$ the weight spectrum of $C(3,m)$ associated with $G(3,m),$ have been fully determined by Kaipa K.V, Pillai H.K and Nogin Y. A classification of trivectors depends essentially on the dimension $n$ of the base space. For $n\leq 8 $ there exist only finitely many trivector classes under the action of the general linear group $GL(n).$ The methods of Galois cohomology can be used to determine the classes of nondegenerate trivectors which split into multiple classes when going from $\mathbb{\bar{F}}$ to $\mathbb{F}.$ This program is partially determined by Noui L. and Midoune N. and the classification of trilinear alternating forms on a vector space of dimension $8$ over a finite field $\mathbb{F}_{q}$ of characteristic other than $2$ and $3$ was solved by Noui L. and Midoune N. We describe the $\mathbb{F}_{q}$-forms of $2$-step splitting trivectors of rank $8$, where char $\mathbb{F}_{q}\neq 3.$ This fact we use to determine the weight of the $\mathbb{F}_{q}$-forms.

We investigate some connections between the Fraiss? theory of amalgamation classes and ultrahomogeneous structures, Ramsey theory, and topological dynamics of automorphism groups of countable structures. We show, in particular, that results from the structural Ramsey theory can be quite useful in recognizing the universal minimal flows of this kind of groups. As result we compute universal minimal flows of several well known topological groups such as, for example, the automorphism group of the random graph, the automorphism group of the random triangle-free graph, the automorphism group of the ?-dimensional vector space over a finite field, the automorphism group of the countable atomless Boolean algebra, etc. So we have here a reversal in the traditional relationship between topological dynamics and Ramsey theory, the Ramsey-theoretic results are used in proving theorems of topological dynamics rather than vice versa.

A set $\mathcal{F}_q$ of $3$-dimensional subspaces of $\mathbb{F}_q^7$, the $7$-dimensional vector space over the finite field $\mathbb{F}_q$, is said to form a $q$-analogue of the Fano plane if every $2$-dimensional subspace of $\mathbb{F}_q^7$ is contained in precisely one member of $\mathcal{F}_q$. The existence problem for such $q$-analogues remains unsolved for every single value of $q$. Here we report on an attempt to construct such $q$-analogues using ideas from the theory of subspace codes, which were introduced a few years ago by Koetter and Kschischang in their seminal work on error-correction for network coding. Our attempt eventually fails, but it produces the largest subspace codes known so far with the same parameters as a putative $q$-analogue. In particular we find a ternary subspace code of new record size $6977$, and we are able to construct a binary subspace code of the largest currently known size $329$ in an entirely computer-free manner.

We show that if the cardinality of a subset of the $(2k-1)$-dimensional vector space over a finite field with $q$ elements is $\gg q^{2k-1-\frac{1}{ 2k}}$, then it contains a positive proportional of all $k$-simplexes up to congruence. Nous montrons que si la cardinalité d'un sous-ensemble de l'espace vectoriel à $(2k-1)$ dimensions sur un corps fini à $q$ éléments est $\gg q^{2k-1-\frac{1}{ 2k}}$, alors il contient une proportion non-nulle de tous les $k$-simplexes de congruence.

The probability of spanning a classical space by two non-degenerate subspaces of complementary dimensions

We extend the “method of multiplicities” to get the following results, of interest in combinatorics and randomness extraction. (i) We show that every Kakeya set in $\mathbb{F}_q^n$, the $n$-dimensional vector space over the finite field on $q$ elements, must be of size at least $q^n/2^n$. This bound is tight to within a $2+o(1)$ factor for every $n$ as $q\to\infty$. (ii) We give improved “randomness mergers”: Mergers are seeded functions that take as input $\ell$ (possibly correlated) random variables in $\{0,1\}^N$ and a short random seed and output a single random variable in $\{0,1\}^N$ that is statistically close to having entropy $(1-\delta)\cdot N$ when one of the $\ell$ input variables is distributed uniformly. The seed we require is only $(1/\delta)\cdot\log\ell$-bits long, which significantly improves upon previous construction of mergers. (iii) We give improved randomness extractors, based on our improved mergers. Specifically, we show how to construct randomness extractors that use logarithmic ...

-In a previous paper [2] we developed the basic features of the vector and tensor analysis under the assumption that there is an n -dimensional vector space at every point of an m -dimensional parameter manifold. Here we make the final step to connect the vector spaces X(P), P ∈ Ω with the parameter manifold as far as possible. Such a manifold with a structure determined by the fundamental tensor and by the connection coefficients may be called a space. We therefore require the dimension m of the parameter manifold and the dimension n of the vector spaces X(P), P ∈ Ω to be equal, m = n Naturally, the results obtained for the case m not necessarily equal to n [2], when adapted to the case m = n remain conserved, while some new results and relations, characteristic of the case m = n, will be derived.

The first purpose of this paper is to provide new finite field extension theorems for paraboloids and spheres. By using the unusual good Fourier transform of the zero sphere in some specific dimensions, which has been discovered recently in the work of Iosevich, Lee, Shen, and the first and second listed authors (2018), we provide new L2→Lr extension estimates for paraboloids in certain odd dimensions with −1 non-square, which improves significantly the recent exponent obtained by the first listed author. In the case of spheres, we introduce a way of using the first association scheme graph to analyze energy sets, and as a consequence, we obtain new Lp→L4 extension theorems for spheres of primitive radii in odd dimensions, which break the Stein-Tomas result toward Lp→L4 which has stood for more than ten years. Most significantly, it follows from the results for spheres that there exists a different extension phenomenon between spheres and paraboloids in odd dimensions, namely, the Lp→L4 estimates for spheres with primitive radii are much stronger than those for paraboloids. The second purpose is to show that there is a connection between the restriction conjecture associated to paraboloids and the Erdős-Falconer distance conjecture over finite fields. The last is to prove that the Erdős-Falconer distance conjecture holds in odd dimensional spaces when we study distances between two sets: one set lies on a variety (a paraboloid or a sphere), and the other set is arbitrary in vector spaces over finite fields.

The sheaf-function correspondence identifies the group of constructible functions on a real analytic manifold M with the Grothendieck group of constructible sheaves on M. When M is a finite dimensional real vector space, Kashiwara-Schapira have recently introduced the convolution distance between sheaves of $\mathbf {k}$ -vector spaces on M. In this paper, we characterize distances on the group of constructible functions on a real finite dimensional vector space that can be controlled by the convolution distance through the sheaf-function correspondence. Our main result asserts that such distances are almost trivial: they vanish as soon as two constructible functions have the same Euler integral. We formulate consequences of our result for Topological Data Analysis: there cannot exist nontrivial additive invariants of persistence modules that are continuous for the interleaving distance.

Let L be a number field and OL the ring of algebraic integers in L. For apolynomial f with coefficients in OL, the content of f in L is the ideal of OLgenerated by coefficients of f. The polynomial f is primitive in L if the contentof f in L is OL. In 2005, Arturo Magidin and David McKinnon proved the Gauss’ lemma fornumber fields, the product of two primitive polynomials is also primitive, andsome applications following from Gauss’ lemma for number fields. A function field K over a finite field k is a finite separable field extension overk(x) where x is a transcendantal element. In this research, we study Magidin and McKinnon’s work on the function fields.

In this communication the design of an array consisting of dipoles having an arbitrary orientation is effected; the dipoles are specified by five coordinates, three positional and two directional. The intensity of the electric field is considered as both i) a vector in Euclidian space and ii) a vector of an <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</tex> -dimensional vector space. Some examples follow.

A digraph is primitive if some positive degree of it is a complete digraph, i.e. has all possible arcs. The smallest degree of this kind is called the exponent of the digraph. Given a primitive digraph, the elementary local exponent for some vertices $$u$$ and $$v $$ is the least positive integer $$\gamma $$ such that there exists a path from $$u $$ to $$v$$ of any length not less than $$\gamma $$ . For the transformation on the binary $$n $$ -dimensional vector space which is given by a set of $$n $$ coordinate functions, there corresponds some $$n $$ vertex digraph such that a pair $$(u,v) $$ is an arc if the $$v $$ th coordinate component of the transformation depends essentially on the $$u$$ th variable. Such a digraph we call a mixing digraph of the transformation. Under study are the mixing digraphs of $$n$$ -bit shift registers with a nonlinear Boolean feedback function (NFSR), $$n>1 $$ , which are widely used in cryptography. We find the exact formulas for the exponent and elementary local exponents of the $$n $$ -vertex primitive mixing digraph associated to an NFSR. The above results can be applied to evaluating the length of the blank run of the pseudo-random sequences generators based on NFSRs.