Related papers: Enumeration of Splitting Subspaces over Finite Fie…
We initiate the study of enumerating linear subspaces of alternating matrices over finite fields with explicit coordinates. We postulate that this study can be viewed as a linear algebraic analogue of the classical topic of enumerating…
Our overall goal is to unify and extend some results in the literature related to the approximation of generating functions of finite and infinite sequences over a field by rational functions. In our approach, numerators play a significant…
We explain how to use computer experiments over finite fields to gain heuristic information about the solution set of polynomial equations in characteristic zero. These are notes of a tutorial I gave at the NATO Advanced Study Institute on…
We show that large subsets of vector spaces over finite fields determine certain point configurations with prescribed distance structure. More specifically, we consider the complete graph with vertices as the points of $A \subseteq…
We investigate infinite versions of vector and affine space partition results, and thus obtain examples and a counterexample for a partition problem for relational structures. In particular we provide two (related) examples of an age…
Motivated by coding applications,two enumeration problems are considered: the number of distinct divisors of a degree-m polynomial over F = GF(q), and the number of ways a polynomial can be written as a product of two polynomials of degree…
For a finite separable field extension K/k, all subfields can be obtained by intersecting so-called principal subfields of K/k. In this work we present a way to quickly compute these intersections. If the number of subfields is high, then…
We introduce a family of univariate polynomials indexed by integer partitions. At prime powers, they count the number of subspaces in a finite vector space that transform under a regular diagonal matrix in a specified manner. This…
Combinatorial aspects of R-subgroups of finite dimensional Beidleman near-vector spaces over nearfields are studied. A characterization of R-subgroups is used to obtain the smallest possible size of a generating set of a subgroup, which is…
This is a short note that explains a problem on polynomial maps over finite fields for non-experts. The problem is: Do there exist odd polynomial automorphisms over the finite fields with 4,8,16,32,64,... elements? The explanation is very,…
We prove that generating subspaces of matrix rings over finite fields are counted by polynomials. We use this result to define and study two-variable versions of polynomials counting isomorphism classes of absolutely irreducible…
A vector space partition of $\mathbb{F}_q^v$ is a collection of subspaces such that every non-zero vector is contained in a unique element. We improve a lower bound of Heden, in a subcase, on the number of elements of the smallest occurring…
We compute the minimal cardinality of a covering (resp. an irredundant covering) of a vector space over an arbitrary field by proper linear subspaces. Analogues for affine linear subspaces are also given.
In this paper we will give a unified proof of several results on the sovability of systems of certain equations over finite fields, which were recently obtained by Fourier analytic methods. Roughly speaking, we show that almost all systems…
We prove a special case of Erd\H{o}s' unit distance problem using a corollary of the subspace theorem bounding the number of solutions of linear equations from a multiplicative group. We restrict our attention to unit distances coming from…
We study systems of quadratic forms over fields and their isotropy over 2-extensions. We apply this to obtain particular splitting fields for quaternion algebras defined over a finite field extension. As a consequence, we obtain that every…
We prove finiteness results on integral points on complements of large divisors in projective varieties over finitely generated fields of characteristic zero. To do so, we prove a function field analogue of arithmetic finiteness results of…
We introduce and study embeddings of graphs in finite projective planes, and present related results for some families of graphs including complete graphs and complete bipartite graphs. We also make connections between embeddings of graphs…
The paper is devoted to developing subdifferential theory for set-valued mappings taking values in ordered infinite-dimensional spaces. This study is motivated by applications to problems of vector and set optimization with various…
We define and study the Tutte polynomial of a hyperplane arrangement. We introduce a method for computing it by solving an enumerative problem in a finite field. For specific arrangements, the computation of Tutte polynomials is then…