English
Related papers

Related papers: Generalized Hamming weights of toric codes over hy…

200 papers

If $\mathbb{F}_{q}$ is a finite field, $C$ is a vector subspace of $\mathbb{F}_{q}^{n}$ (linear code), and $G$ is a subgroup of the group of linear automorphisms of $\mathbb{F}_{q}^{n}$, $C$ is said to be $G$-invariant if $g(C)=C$ for all…

Information Theory · Computer Science 2018-10-23 Elias Javier Garcia Claro , Horacio Tapia Recillas

In this paper, we give results that partially prove a conjecture which was discussed in our previous work (arXiv:1307.4991). More precisely, we prove that as $n\to \infty,$ the zeros of the polynomial$${}_{2}\text{F}_{1}\left[…

Complex Variables · Mathematics 2016-03-27 Addisalem Abathun , Rikard Bøgvad

We show factorization of polynomials in one variable over the tropical semiring is in general NP-complete, either if all coefficients are finite, or if all are either 0 or infinity (Boolean case). We give algorithms for the factorization…

Combinatorics · Mathematics 2007-05-23 Ki Hang Kim , Fred W. Roush

We give a complete conjectural formula for the number $e_r(d,m)$ of maximum possible ${\mathbb{F}}q$-rational points on a projective algebraic variety defined by $r$ linearly independent homogeneous polynomial equations of degree $d$ in…

Algebraic Geometry · Mathematics 2022-03-23 Peter Beelen , Mrinmoy Datta , Sudhir R. Ghorpade

The results of [1,2] on linear homogeneous two-weight codes over finite Frobenius rings are exended in two ways: It is shown that certain non-projective two-weight codes give rise to strongly regular graphs in the way described in [1,2].…

Combinatorics · Mathematics 2014-01-29 Thomas Honold

As a generalization of cyclic codes of length p^s over F_{p^a}, we study n-dimensional cyclic codes of length p^{s_1} X ... X p^{s_n} over F_{p^a} generated by a single "monomial". Namely, we study multi-variable cyclic codes of the form…

Information Theory · Computer Science 2010-03-18 Edgar Martinez-Moro , Hakan Ozadam , Ferruh Ozbudak , Steve Szabo

In this note, we use estimates given in the recent preprint [Her11b]to deduce a formula for the F-pure threshold of a binomial hypersurface over a field of prime characteristic. These formulas are given in terms of the associated splitting…

Commutative Algebra · Mathematics 2011-12-13 Daniel J. Hernández

We describe an algorithm to compute the essentially different factorizations of a given image primitive integer-valued polynomial $f(X)=g(X)/d\in\Q[X]$, where $g\in\Z[X]$ and $d\in\N$ is square-free, assuming that the factorization of…

Commutative Algebra · Mathematics 2018-10-03 Giulio Peruginelli

Let $a_{i1}x_1+\cdots+a_{ik}x_k=0$, $i\in[m]$ be a balanced homogeneous system of linear equations with coefficients $a_{ij}$ from a finite field $\mathbb{F}_q$. We say that a solution $x=(x_1,\ldots, x_k)$ with $x_1,\ldots, x_k\in…

Combinatorics · Mathematics 2023-12-19 Dion Gijswijt

For a rational $q=u+\frac{\alpha}{d}$ with $u, \alpha, d\in \ACOBZ$ with $u\ge 0, 1\le \alpha<d$, $\gcd(\alpha, d)=1$, the \emph{generalized Hermite-Laguerre polynomials $G_q(x)$} are defined by \begin{align*} G_q(x)&=a_nx^n+a_{n-1}(\alpha…

Number Theory · Mathematics 2013-06-05 Shanta Laishram , T. N. Shorey

We exhibit an algorithm to compute the strongest polynomial (or algebraic) invariants that hold at each location of a given affine program (i.e., a program having only non-deterministic (as opposed to conditional) branching and all of whose…

Logic in Computer Science · Computer Science 2018-05-03 Ehud Hrushovski , Joël Ouaknine , Amaury Pouly , James Worrell

Let $\mathbb{F}_{q}$ be a finite field of characteristic $p$, and let $f \in \mathbb{F}_{q}[x]$ be a polynomial of degree $d > 0$. Denote the image set of this polynomial as $V_{f}=\{f(\alpha)\mid\alpha\in\mathbb{F}_{q}\}$ and denote the…

Number Theory · Mathematics 2026-02-04 Jiyou Li , Zhiyao Zhang

For any q which is a power of 2 we describe a finite subgroup of the group of invertible complex q by q matrices under which the complete weight enumerators of generalized doubly-even self-dual codes over the field with q elements are…

Number Theory · Mathematics 2014-09-17 Gabriele Nebe , H. -G. Quebbemann , E. M. Rains , N. J. A. Sloane

For any finite field $\mathbb{F}$ and any positive integer $n$ we count the number of monic polynomials of degree $n$ over $\mathbb{F}$ with nonzero constant coefficient and a self-reciprocal factor of any specified degree. An application…

Number Theory · Mathematics 2022-10-31 Geoffrey Price , Katherine Thompson

It is known that the weight (that is, the number of nonzero coefficients) of a univariate polynomial over a field of characteristic zero is larger than the multiplicity of any of its nonzero roots. We extend this result to an appropriate…

Number Theory · Mathematics 2011-11-10 Sandro Mattarei

L. Bary-Soroker and R. Shmueli (2026) have given an asymptotic formula for the number of irreducible polynomials over the finite fields $\mathbb F_q$ of $q$ elements, such that their coefficients are perfect squares in $\mathbb F_q$ and…

Number Theory · Mathematics 2026-01-21 Alina Ostafe , Igor E. Shparlinski

We present algorithms to factorize weighted homogeneous elements in the first polynomial Weyl algebra and $q$-Weyl algebra, which are both viewed as a $\mathbb{Z}$-graded rings. We show, that factorization of homogeneous polynomials can be…

Symbolic Computation · Computer Science 2016-02-19 Albert Heinle , Viktor Levandovskyy

We prove that if $f$ is a non zero cusp form of weight $k$ on $\Gamma_0(N)$ with character $\chi$ such that $N/(\text{conductor }\chi)$ square-free, then there exists a square-free $n\ll_{\epsilon} k^{3+\epsilon}N^{7/2+\epsilon}$ such that…

Number Theory · Mathematics 2020-02-03 Pramath Anamby , Soumya Das

For $S \subseteq \{0,1\}^n$ a Boolean function $f \colon S \to \{-1,1\}$ is a polynomial threshold function (PTF) of degree $d$ and weight $W$ if there is a polynomial $p$ with integer coefficients of degree $d$ and with sum of absolute…

Computational Complexity · Computer Science 2022-12-22 Vladimir Podolskii , Nikolay V. Proskurin

We study conditions on polynomials such that the ideal generated by their orbits under the symmetric group action becomes a monomial ideal or has a monomial radical. If the polynomials are homogeneous, we expect that such an ideal has a…

Commutative Algebra · Mathematics 2022-04-26 Andreas Kretschmer
‹ Prev 1 8 9 10 Next ›