One of the encryption algorithms is the Hill Cipher. The square key matrix in the Hill Cipher
method must have an inverse modulo. The unimodular matrix is one of the few matrices that …

We consider some combinatorial problems on matrix polynomials over finite fields. Using
results from control theory, we give a proof of a result of Lieb, Jordan and Helmke on the …

Let 𝔽 q be a finite field, F/𝔽 q be a function field of genus g having full constant field 𝔽 q, 𝒮 a
set of places of F and H the holomorphy ring of 𝒮. In this paper, we compute the density of …

On Rectangular Unimodular Matrices over the Algebraic Integers Page 1 Copyright © by SIAM.
Unauthorized reproduction of this article is prohibited. SIAM J. DISCRETE MATH. c 2019 …

Let $ d $ be a positive integer and $\mathbb H $ be an integrally closed subring of a global
function field $ F $. The purpose of this paper is to provide a general sieve method to …

This paper constructs a new local to global principle for expected values over free Z-
modules of finite rank. In our strategy we use the same philosophy as Ekedahl's Sieve for …

有限域上随机多项式的统计渐近性质 Page 1 第50卷第3期 2022年5月 河南师范大学学报(自然
科学版) Journalof HenanNormalUniversity(NaturalScienceEdition) Vol.50 No.3 May2022 …

In this paper we compute the density of monic and non-monic Eisenstein polynomials of
fixed degree having entries in an integrally closed subring of a function field over a finite …

Let FqŒx be the polynomial ring over the finite field Fq containing q elements. We compute
the probability that n polynomials in FqŒx are k-wise relatively coprime, using the concept of …

Let q be a prime power and F/Fq an algebraic function field in one variable over Fq, with
genus g. We will mostly be using the notation of [8] in this paper. Let P be the set of places of …