Related papers: New Identities Relating Wild Goppa Codes

Let $X, Y$ be smooth algebraic varieties of the same dimension. Let $f, g : X \to Y$ be finite polynomial mappings. We say that $f, g$ are equivalent if there exists a regular automorphism $\Phi \in Aut(X)$ such that $f = g\circ \Phi$. Of…

Let $ \mathbb{Q}\mathcal{E}_{\mathbb{Z}} $ be the set of power sums whose characteristic roots belong to $ \mathbb{Z} $ and whose coefficients belong to $ \mathbb{Q} $, i.e. $ G : \mathbb{N} \rightarrow \mathbb{Q} $ satisfies…

We consider a primitive distance-regular graph $\Gamma$ with diameter at least $3$. We use the intersection numbers of $\Gamma$ to find a positive semidefinite matrix $G$ with integer entries. We show that $G$ has determinant zero if and…

If for any k the k-th coefficient of a polynomial I(G;x)is equal to the number of stable sets of cardinality k in graph G, then it is called the independence polynomial of G (Gutman and Harary, 1983). A graph G is very well-covered…

We consider the generalised root identities introduced in [1] for simple functions, and also for \Gamma(z+1) and \zeta(s). In this paper, unlike [1], we focus on the case of noninteger \mu. For the simplest function f(z)=z, and hence for…

$q$-Analogues of the coefficients of $x^a$ in the expansion of $\prod_{j=1}^N (1+x+...+x^j)^{L_j}$ are proposed. Useful properties, such as recursion relations, symmetries and limiting theorems of the ``$q$-supernomial coefficients'' are…

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…

In a previous paper, we studied an overpartition analogue of Gaussian polynomials as the generating function for overpartitions fitting inside an $m \times n$ rectangle. Here, we add one more parameter counting the number of overlined…

Let $\Gamma$ denote a $Q$-polynomial distance-regular graph with diameter $D$ and valency $k \ge 3$. In [Homotopy in $Q$-polynomial distance-regular graphs, Discrete Math., {\bf 223} (2000), 189-206], H. Lewis showed that the girth of…

Let G be a simple, simply connected algebraic group defined over an algebraically closed field k of positive characteristic p. Let \sigma:G->G be a strict endomorphism (i. e., the subgroup G(\sigma) of \sigma-fixed points is finite). Also,…

Let $F$ be a totally real field. We study the root numbers $\epsilon(1/2, \pi)$ of self-dual cuspidal automorphic representations $\pi$ of $\mathrm{GL}_{2N}/F$ with conductor $\mathfrak n$ and regular integral infinitesimal character…

Let $\Gamma=(X,\mathcal{R})$ denote a finite, simple, connected, and undirected non-bipartite graph with vertex set $X$ and edge set $\mathcal{R}$. Fix a vertex $x \in X$, and define $\mathcal{R}_f = \mathcal{R} \setminus \{yz \mid…

The present paper proves a $q$-identity, which arises from a representation $\pi_{N,\psi}$ of $\text{GL}_n(\mathbb{F}_q)$. This identity gives a significant simplification for the dimension of $\pi_{N,\psi}$, which allowed the second author…

A code over GF$(q^m)$ can be imaged or expanded into a code over GF$(q)$ using a basis for the extension field over the base field. The properties of such an image depend on the original code and the basis chosen for imaging. Problems…

Extending the classical result that the roots of a polynomial with coefficients in $\mathbf{C}$ are continuous functions of the coefficients of the polynomial, nonstandard analysis is used to prove that if $\mathcal{F} = \{f_{\lambda}…

We describe the higher weights of the Grassmann codes $G(2,m)$ over finite fields ${\mathbb F}_q$ in terms of properties of Schubert unions, and in each case we determine the weight as the minimum of two explicit polynomial expressions in…

We derive polynomial identities of arbitrary degree $n$ for syzygies degrees of numerical semigroups S_m=<d_1,...,d_m> and show that for n>=m they contain higher genera G_r=\sum_{s\in Z_>\setminus S_m}s^r of S_m. We find a number…

Motivated by recent works of Sun and Tauraso, we prove some variations on the Green-Krammer identity involving central q-binomial coefficients, such as $$ \sum_{k=0}^{n-1}(-1)^kq^{-{k+1\choose 2}}{2k\brack k}_q \equiv (\frac{n}{5})…

Goppa codes form an important class of alternant codes with wide applications in algebraic coding theory and code-based cryptography. Determining the true minimum distance of a Goppa code is a difficult problem. In this paper, we provide a…

Let $\mathbb{F}_q$ be the finite field of $q$ elements. In this paper we obtain bounds on the following counting problem: given a polynomial $f(x)\in \mathbb{F}_q[x]$ of degree $k+m$ and a non-negative integer $r$, count the number of…