Related papers: Counting zero kernel pairs over a finite field
We investigate the complexity of computing the Zariski closure of a finitely generated group of matrices. The Zariski closure was previously shown to be computable by Derksen, Jeandel, and Koiran, but the termination argument for their…
In this paper, we describe an elementary method for counting the number of non-isomorphic algebras of a fixed dimension over a given finite field. We show how this method works for the explicit example of $2$-dimensional algebras over the…
We calculate the probability that random polynomial matrices over a finite field with certain structures are right prime or left prime, respectively. In particular, we give an asymptotic formula for the probability that finitely many…
We give an improved polynomial bound on the complexity of the equation solvability problem, or more generally, of finding the value sets of polynomials over finite nilpotent rings. Our proof depends on a result in additive combinatorics,…
Let $T$ be a complete theory of fields, possibly with extra structure. Suppose that model-theoretic algebraic closure agrees with field-theoretic algebraic closure, or more generally that model-theoretic algebraic closure has the exchange…
In this paper, we introduce the notion of reproducing kernel Hilbert spaces for graphs and the Gram matrices associated with them. Our aim is to investigate the Gram matrices of reproducing kernel Hilbert spaces. We provide several bounds…
Let $M$ be a random matrix chosen according to Haar measure from the unitary group $\mathrm{U}(n,\mathbb{C})$. Diaconis and Shahshahani proved that the traces of $M,M^2,\ldots,M^k$ converge in distribution to independent normal variables as…
Let $q$ be a prime power. For $u=(u_1,\dots ,u_n), v=(v_1,\dots ,v_n)\in \mathbb {F}_{q^2}^n$ let $\langle u,v\rangle := \sum _{i=1}^{n} u_i^qv_i$ be the Hermitian form of $\mathbb {F} _{q^2}^n$. Fix an $n\times n$ matrix $M$ over $\mathbb…
We consider the groups of regular circulant matrices over finite fields and integer residue class rings. In both cases we present a formula for the order of these groups. We also make a first step towards finding the algebraic structure of…
Kernel methods have been widely applied to machine learning and other questions of approximating an unknown function from its finite sample data. To ensure arbitrary accuracy of such approximation, various denseness conditions are imposed…
We present an exposition of our ongoing project in a new area of applicable mathematics: practical computation with finitely generated linear groups over infinite fields. Methodology and algorithms available for practical computation in…
We consider the problem of determining the maximum number of common zeros in a projective space over a finite field for a system of linearly independent multivariate homogeneous polynomials defined over that field. There is an elaborate…
We develop a theory of sesquilinear forms over finite fields, investigating their representations via polynomials and coefficient matrices, along with classification results for these forms. Through their connection to quadratic forms, we…
We investigate the problem asking when any square matrix whose entries lie in a finite field of characteristic 2 is decomposable into the sum of a diagonalizable matrix and a nilpotent matrix with index of nilpotency at most 2 and, as a…
The main goal of the paper is the discussion of a deeper interaction between matrix theory over polynomial rings over a field and typical methods of commutative algebra and related algebraic geometry. This is intended in the sense of…
Matrices are very popular and widely used in mathematics and other fields of science. Every mathematician has known the properties of finite-sized matrices since the time of study. In this paper, we consider the basic theory of infnite…
An effective formula for the Bergman kernel on $\mathbb{H}_{\gamma} = \{|z_1|^\gamma < |z_2| < 1 \}$ is obtained for rational $\gamma = \frac{m}{n} >1$. The formula depends on arithmetic properties of $\gamma$, which uncovers new symmetries…
We study the set of algebraic objects known as vanishing polynomials (the set of polynomials that annihilate all elements of a ring) over general commutative rings with identity. These objects are of special interest due to their close…
The uniform distribution on matrices with specified row and column sums is often a natural choice of null model when testing for structure in two-way tables (binary or nonnegative integer). Due to the difficulty of sampling from this…
In this paper we study algebraic sets of pairs of matrices defined by the vanishing of either the diagonal of their commutator matrix or its anti-diagonal. We find a system of parameters for the coordinate rings of these two sets and their…