Related papers: Generalized Hamming weights of affine cartesian co…
Consider a system $f_1(x)=0,\ldots,f_n(x)=0$ of $n$ random real polynomials in $n$ variables, where each $f_i$ has a prescribed set of exponent vectors described by a set $A_i \subseteq \mathbb{Z}^n$ of cardinality $t_i$, whose convex hull…
Following work of Raleigh and Akiyama (\cite{raleigh1962fourier, akiyama1992note}), in \cite{interpolating} we considered (among other objects) families of weight zero meromorphic modular forms $J_m$ for Hecke groups $G(\lambda_m)$. We…
We establish asymptotic formulae for the number of $k$-free values of polynmilas $F(x_1,\cdots,x_n)\in\mathbb{Z}[x_1,\cdots,x_n]$ of degree $d\geq 2$ for any $n\geq 1$, including when the variables are prime, as long as $k\geq (3d+1)/4$.…
Few-weight codes have been constructed and studied for many years, since their fascinating relations to finite geometries, strongly regular graphs and Boolean functions. Simplex codes are one-weight Griesmer $[\frac{q^k-1}{q-1},k…
Suppose $A=\{a_1,\ldots,a_{n+2}\}\subset\mathbb{Z}^n$ has cardinality $n+2$, with all the coordinates of the $a_j$ having absolute value at most $d$, and the $a_j$ do not all lie in the same affine hyperplane. Suppose $F=(f_1,\ldots,f_n)$…
We analyze the behavior of the Euclidean algorithm applied to pairs (g,f) of univariate nonconstant polynomials over a finite field F_q of q elements when the highest-degree polynomial g is fixed. Considering all the elements f of fixed…
Coding Theory where the alphabet is identified with the elements of a ring or a module has become an important research topic over the last 30 years. Such codes over rings had important applications and many interesting mathematical…
Consider real bivariate polynomials f and g, respectively having 3 and m monomial terms. We prove that for all m>=3, there are systems of the form (f,g) having exactly 2m-1 roots in the positive quadrant. Even examples with m=4 having 7…
We first find the combinatorial degree of any map $f:V\to F$ where $F$ is a finite field and $V$ is a finite-dimensional vector space over $F$. We then simplify and generalize a certain construction due to Chein and Goodaire that was used…
Let ${\mathbb{F}_{q}}$ be the finite field of order $q$. Let $G$ be one of the three groups ${\rm GL}(n, \mathbb{F}_q)$, ${\rm SL}(n, \mathbb{F}_q)$ or ${\rm U}(n, \mathbb{F}_q)$ and let $W$ be the standard $n$-dimensional representation of…
In this paper, we study and characterise certain blocking sets in generalised polygons. This will allow us to derive new results about the minimum weight and minimum weight code words in the code generated by the rows of the incidence…
Hayes equivalence is defined on monic polynomials over a finite field $\fq$ in terms of the prescribed leading coefficients and the residue classes modulo a given monic polynomial $Q$. We study the distribution of the number of zeros in a…
Given a finite field $\mathbb{F}_{q}$, we study the distribution of the number of $\mathbb{F}_{q}$-points on (possibly singular) affine curves given by the polynomial equations of the form $C_{f} : y^{m} = f(x)$, where $f$ is randomly…
Higher-order Fourier analysis, developed over prime fields, has been recently used in different areas of computer science, including list decoding, algorithmic decomposition and testing. We extend the tools of higher-order Fourier analysis…
We show that the counts of low degree irreducible factors of a random polynomial $f$ over $\mathbb{F}_q$ with independent but non-uniform coefficients behave like that of a uniform random polynomial, exhibiting a form of universality for…
We study the set of common F_q-rational zeros of systems of multivariate symmetric polynomials with coefficients in a finite field F_q. We establish certain properties on these polynomials which imply that the corresponding set of zeros…
Continuing our work on group-theoretic generalizations of the prime Ax-Katz Theorem, we give a lower bound on the $p$-adic divisibility of the cardinality of the set of simultaneous zeros $Z(f_1,f_2,\ldots,f_r)$ of $r$ maps…
Security of linear ramp secret sharing schemes can be characterized by the relative generalized Hamming weights of the involved codes. In this paper we elaborate on the implication of these parameters and we devise a method to estimate…
The main purpose of this paper is solve polynomial equations that are satisfied by (generalized) polynomials. More exactly, we deal with the following problem: let $\mathbb{F}$ be a field with $\mathrm{char}(\mathbb{F})=0$ and $P\in…
We give algorithms to compute isomorphism classes of ordinary abelian varieties defined over a finite field $\mathbb{F}_q$ whose characteristic polynomial (of Frobenius) is square-free and of abelian varieties defined over the prime field…