No Arabic abstract
Let $mathbb{F}_q$ be an arbitrary finite field of order $q$. In this article, we study $det S$ for certain types of subsets $S$ in the ring $M_2(mathbb F_q)$ of $2times 2$ matrices with entries in $mathbb F_q$. For $iin mathbb{F}_q$, let $D_i$ be the subset of $M_2(mathbb F_q)$ defined by $ D_i := {xin M_2(mathbb F_q): det(x)=i}.$ Then our results can be stated as follows. First of all, we show that when $E$ and $F$ are subsets of $D_i$ and $D_j$ for some $i, jin mathbb{F}_q^*$, respectively, we have $$det(E+F)=mathbb F_q,$$ whenever $|E||F|ge {15}^2q^4$, and then provide a concrete construction to show that our result is sharp. Next, as an application of the first result, we investigate a distribution of the determinants generated by the sum set $(Ecap D_i) + (Fcap D_j),$ when $E, F$ are subsets of the product type, i.e., $U_1times U_2subseteq mathbb F_q^2times mathbb F_q^2$ under the identification $ M_2(mathbb F_q)=mathbb F_q^2times mathbb F_q^2$. Lastly, as an extended version of the first result, we prove that if $E$ is a set in $D_i$ for $i e 0$ and $k$ is large enough, then we have [det(2kE):=det(underbrace{E + dots + E}_{2k~terms})supseteq mathbb{F}_q^*,] whenever the size of $E$ is close to $q^{frac{3}{2}}$. Moreover, we show that, in general, the threshold $q^{frac{3}{2}}$ is best possible. Our main method is based on the discrete Fourier analysis.
The determinants of ${pm 1}$-matrices are calculated by via the oriented hypergraphic Laplacian and summing over an incidence generalization of vertex cycle-covers. These cycle-covers are signed and partitioned into families based on their hyperedge containment. Every non-edge-monic family is shown to contribute a net value of $0$ to the Laplacian, while each edge-monic family is shown to sum to the absolute value of the determinant of the original incidence matrix. Simple symmetries are identified as well as their relationship to Hadamards maximum determinant problem. Finally, the entries of the incidence matrix are reclaimed using only the signs of an adjacency-minimal set of cycle-covers from an edge-monic family.
The purpose of the article is to provide an unified way to formulate zero-sum invariants. Let $G$ be a finite additive abelian group. Let $B(G)$ denote the set consisting of all nonempty zero-sum sequences over G. For $Omega subset B(G$), let $d_{Omega}(G)$ be the smallest integer $t$ such that every sequence $S$ over $G$ of length $|S|geq t$ has a subsequence in $Omega$.We provide some first results and open problems on $d_{Omega}(G)$.
A finite or infinite matrix $A$ is image partition regular provided that whenever $mathbb N$ is finitely colored, there must be some $vec{x}$ with entries from $mathbb N$ such that all entries of $Avec{x}$ are in some color class. In [6], it was proved that the diagonal sum of a finite and an infinite image partition regular matrix is also image partition regular. It was also shown there that centrally image partition regular matrices are closed under diagonal sum. Using Theorem 3.3 of [2], one can conclude that diagonal sum of two infinite image partition regular matrices may not be image partition regular. In this paper we shall study the image partition regularity of diagonal sum of some infinite image partition regular matrices. In many cases it will produce more infinite image partition regular matrices.
A compound determinant identity for minors of rectangular matrices is established. As an application, we derive Vandermonde type determinant formulae for classical group characters.
Given three nonnegative integers $p,q,r$ and a finite field $F$, how many Hankel matrices $left( x_{i+j}right) _{0leq ileq p, 0leq jleq q}$ over $F$ have rank $leq r$ ? This question is classical, and the answer ($q^{2r}$ when $rleqminleft{ p,qright} $) has been obtained independently by various authors using different tools (Daykin, Elkies, Garcia Armas, Ghorpade and Ram). In this note, we study a refinement of this result: We show that if we fix the first $k$ of the entries $x_{0},x_{1},ldots,x_{k-1}$ for some $kleq rleqminleft{ p,qright} $, then the number of ways to choose the remaining $p+q-k+1$ entries $x_{k},x_{k+1},ldots,x_{p+q}$ such that the resulting Hankel matrix $left( x_{i+j}right) _{0leq ileq p, 0leq jleq q}$ has rank $leq r$ is $q^{2r-k}$. This is exactly the answer that one would expect if the first $k$ entries had no effect on the rank, but of course the situation is not this simple. The refined result generalizes (and provides an alternative proof of) a result by Anzis, Chen, Gao, Kim, Li and Patrias on evaluations of Jacobi-Trudi determinants over finite fields.