Related papers: Gr\"obner Bases for Linearized Polynomials
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.
Non-commutative Gr\"obner bases of two-sided ideals are not necessarily finite. Motivated by this, we provide a closed-form description of a finite and reduced Gr\"obner bases for the two-sided ideal used in the construction of Wangs…
In the paper, we establish Gr\"obner-Shirshov bases for semirings and commutative semirings. As applications, we obtain Gr\"obner-Shirshov bases and A. Blass's (1995) and M. Fiore -T. Leinster's (2004) normal forms of the semirings…
We introduce the universal unitarily graded A-algebra for a commutative ring A and an arbitrary abelian extension U of the group of units of A, and use this concept to give simplified proofs of the main theorems of co-Galois theory in the…
We propose a novel encoding scheme for algebraic codes such as codes on algebraic curves, multidimensional cyclic codes, and hyperbolic cascaded Reed-Solomon codes and present numerical examples. We employ the recurrence from the Gr\"obner…
We present an elegant, generic and extensive formalization of Gr\"obner bases in Isabelle/HOL. The formalization covers all of the essentials of the theory (polynomial reduction, S-polynomials, Buchberger's algorithm, Buchberger's criteria…
Gcd-graphs over the ring of integers modulo $n$ are a natural generalization of unitary Cayley graphs. The study of these graphs has foundations in various mathematical fields, including number theory, ring theory, and representation…
In this paper, by the generalized Bell umbra and Rolle's theorem, we give some results on the real rootedness of polynomials. Some applications on partition polynomials and the sigma polynomials of graphs are given.
In this paper we consider systems of partial (multidimensional) linear difference equations. Specifically, such systems arise in scientific computing under discretization of linear partial differential equations and in computational high…
In this paper, we extend the idea of comprehensive Gr\"{o}bner bases given by Weispfenning (1992) to border bases for zero dimensional parametric polynomial ideals. For this, we introduce a notion of comprehensive border bases and border…
Experiment shows that the reverse length-lexicographical word ordering consistently yields far smaller Gr\"obner bases for modular p-group algebras than the length-lexicographical ordering. For the so-called Jennings word ordering, based on…
In classical invariant theory, the Gr\"obner base of the ideal of syzygies and the normal forms of polynomials of invariants are two core contents. To improve the performance of invariant theory in symbolic computing of classical geometry,…
In this paper, we introduce (almost) skew 2-nomial algebras and look for a one-sided or two-sided Gr\"obner basis theory for such algebras at a modest level. That is, we establish the existence of a skew multiplicative $K$-basis for every…
We consider chaining multiplicative-inverse operations in finite fields under alternating polynomial bases. When using two distinct polynomial bases to alternate the inverse operation we obtain a partition of $\mathbb F_{p^n}\setminus…
We prove an extension of the Bourgain-Sarnak-Ziegler theorem and then apply it to bound certain polynomial exponential sums with modular coefficients.
Suppose L is any finite algebraic extension of either the ordinary rational numbers or the p-adic rational numbers. Also let g_1,...,g_k be polynomials in n variables, with coefficients in L, such that the total number of monomial terms…
Several problems in algebraic geometry and coding theory over finite rings are modeled by systems of algebraic equations. Among these problems, we have the rank decoding problem, which is used in the construction of public-key cryptography.…
We present a framework for the construction of linearizations for scalar and matrix polynomials based on dual bases which, in the case of orthogonal polynomials, can be described by the associated recurrence relations. The framework…
We describe the T-space of central polynomials for both the unitary and the nonunitary finite dimensional Grassmann algebra over a field of characteristic p not equal to 2 (infinite field in the case of the unitary algebra).
Linearized polynomials over finite fields have been intensively studied over the last several decades. Interesting new applications of linearized polynomials to coding theory and finite geometry have been also highlighted in recent years.…