Related papers: Designs over finite fields by difference methods
We investigate the class groups and the distribution of prime divisors in affine monoid algebras over fields and thereby extend the result of Kainrath that every finitely generated integral algebra of Krull dimension at least 2 over an…
Let $m, n$ be positive integers such that $m>1$ divides $n$. In this paper, we introduce a special class of piecewise-affine permutations of the finite set $[1, n]:=\{1, \ldots, n\}$ with the property that the reduction $\pmod m$ of $m$…
Cylindric algebras, or concept algebras in another name, form an interface between algebra, geometry and logic; they were invented by Alfred Tarski around 1947. We prove that there are 2 to the alpha many varieties of geometric (i.e.,…
We study the problem when every matrix over a division ring is representable as either the product of traceless matrices or the product of semi-traceless matrices, and also give some applications of such decompositions. Specifically, we…
We present a new construction of triple arrays by combining a symmetric 2-design with a resolution of another 2-design. This is the first general method capable of producing non-extremal triple arrays. We call the triple arrays which can be…
Numerous results on self-reciprocal polynomials over finite fields have been studied. In this paper we generalize some of these to a-self reciprocal polynomials defined in [4]. We consider some properties of the divisibility of a-reciprocal…
For various positive integers $n$, we show the existence of infinite families of elliptic curves over $\mathbb{Q}$ with $n$-division fields, $\mathbb{Q}(E[n])$, that are not monogenic, i.e., the ring of integers does not admit a power…
We determine the minimal number of separating invariants for the invariant ring of a matrix group $G < \mathrm{GL}_n(\mathbb{F}_q)$ over the finite field $\mathbb{F}_q$. We show that this minimal number can be obtained with invariants of…
In this paper we obtained the formula for the number of irreducible polynomials with degree $n$ over finite fields of characteristic two with given trace and subtrace. This formula is a generalization of the result of Cattell et al.(2003)…
We consider the problem of existence and enumeration of primitive TSRs of order n over any finite field. Here we prove the existence of primitive TSRs of order two over finite fields of characteristic two and establish an equivalence…
The problem of expressing an element of K_2(F) in a more explicit form gives rise to many works. To avoid a restrictive condition in a work of Tate, Browkin considered cyclotomic elements as the candidate for the element with an explicit…
Revised: just some typos, reorganized a bit the article. It will be published in the VIASM Annual meeting, Hanoi. We give a detailed account of Deligne's letter to Drinfeld dated June 18, 2011, in which he shows that there are finitely many…
The projective special linear group $\PSL_2(n)$ is $2$-transitive for all primes $n$ and $3$-homogeneous for $n \equiv 3 \pmod{4}$ on the set $\{0,1, \cdots, n-1, \infty\}$. It is known that the extended odd-like quadratic residue codes are…
Our main objective is to show that the computational methods that we previously developed to search for difference families in cyclic groups can be fully extended to the more general case of arbitrary finite abelian groups. In particular…
In this paper we analyze possible actions of an automorphism of order six on a $2$-$(70, 24, 8)$ design, and give a complete classification for the action of the cyclic automorphism group of order six $G= \langle \rho \rangle \cong Z_6…
We prove that the automorphism groups of simple polarized abelian varieties of odd prime dimension over finite fields are cyclic, and give a complete list of finite groups that can be realized as such automorphism groups.
Generalising Solomon's theorem, C. Gordon and F. Rodriguez-Villegas have proven recently that, in any group, the number of solutions to a system of coefficient-free equations is divisible by the order of this group whenever the rank of the…
Linear codes with a few weights have many nice applications including combinatorial design, distributed storage system, secret sharing schemes and so on. In this paper, we construct two families of linear codes with a few weights based on…
Most integers are composite and most univariate polynomials over a finite field are reducible. The Prime Number Theorem and a classical result of Gau{\ss} count the remaining ones, approximately and exactly. For polynomials in two or more…
In an interesting paper Professor Cunsheng Ding provided three constructions of cyclic codes of length being a product of two primes. Numerical data shows that many codes from these constructions are best cyclic codes of the same length and…