Zobrazeno 1 - 10
of 154
pro vyhledávání: '"Mullen, Gary L."'
Publikováno v:
Computing (Springer) 68 (2002) pp 97-109
In this exploratory article, we present a constructive method for scattering points on the surface of $d$ dimensional spheres which we believe is new and of interest. Indeed, the problem of uniformly distributing points on spheres is an interesting a
Externí odkaz:
http://arxiv.org/abs/1512.02984
For any given polynomial $f$ over the finite field $\mathbb{F}_q$ with degree at most $q-1$, we associate it with a $q\times q$ matrix $A(f)=(a_{ik})$ consisting of coefficients of its powers $(f(x))^k=\sum_{i=0}^{q-1}a_{ik} x^i$ modulo $x^q -x$ for
Externí odkaz:
http://arxiv.org/abs/1503.07487
We provide upper bounds for the cardinality of the value set of a polynomial map in several variables over a finite field. These bounds generalize earlier bounds for univariate polynomials.
Comment: To appear in the Oxford Quarterly Journal of M
Comment: To appear in the Oxford Quarterly Journal of M
Externí odkaz:
http://arxiv.org/abs/1210.8119
Autor:
Hou, Xiang-dong, Mullen, Gary L.
We discuss several enumerative results for irreducible polynomials of a given degree and pairs of relatively prime polynomials of given degrees in several variables over finite fields. Two notions of degree, the {\em total degree} and the {\em vector
Externí odkaz:
http://arxiv.org/abs/0811.3986
Autor:
Huczynska, Sophie, Mullen, Gary L.
Motivated by recent interest in permutation arrays, we introduce and investigate the more general concept of frequency permutation arrays (FPAs). An FPA of length n=m lambda and distance d is a set T of multipermutations on a multiset of m symbols, e
Externí odkaz:
http://arxiv.org/abs/math/0511173
Autor:
Ham, Kie H., Mullen, Gary L.
Publikováno v:
Mathematics of Computation, 1998 Jan 01. 67(221), 337-341.
Externí odkaz:
https://www.jstor.org/stable/2584987
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.