English
Related papers

Related papers: On the enumeration of polynomials with prescribed …

200 papers

We study questions around the existence of bounds and the dependence on parameters for linear-algebraic problems in polynomial rings over rings of an arithmetic flavor.In particular, we show that the module of syzygies of polynomials…

Commutative Algebra · Mathematics 2007-05-23 Matthias Aschenbrenner

In this paper we consider an aggregation model f: X1 x ... x Xn --> Y for arbitrary sets X1, ..., Xn and a finite distributive lattice Y, factorizable as f(x1, ..., xn) = p(u1(x1), ..., un(xn)), where p is an n-variable lattice polynomial…

Rings and Algebras · Mathematics 2011-10-11 Miguel Couceiro , Tamás Waldhauser

In this paper, we study polynomial norms, i.e. norms that are the $d^{\text{th}}$ root of a degree-$d$ homogeneous polynomial $f$. We first show that a necessary and sufficient condition for $f^{1/d}$ to be a norm is for $f$ to be strictly…

Optimization and Control · Mathematics 2018-07-18 Amir Ali Ahmadi , Etienne de Klerk , Georgina Hall

The aim of this article is to obtain a formula giving, for a positive integer $n$, the number of roots of the $n^{th}$ continuant polynomial over a finite local ring. In particular, we will give counting formulae for the roots of the…

Combinatorics · Mathematics 2024-07-30 Flavien Mabilat

Let n be a positive integer and let p be a prime. We calculate the probability that a random monic polynomial of degree n with coefficients in the ring Z_p of p-adic integers splits over Z_p into linear factors.

Number Theory · Mathematics 2007-05-23 Joe Buhler , Daniel Goldstein , David Moews , Joel Rosenberg

For a polynomial map $\mathbf{f} : k^n \to k^m$ ($k$ a field), we investigate those polynomials $g \in k[t_1,\ldots, t_n]$ that can be written as a composition $g = h \circ \mathbf{f}$, where $h: k^m \to k$ is an arbitrary function. In the…

Commutative Algebra · Mathematics 2019-09-04 Erhard Aichinger

We determine the density of monic integer polynomials of given degree $n>1$ that have squarefree discriminant; in particular, we prove for the first time that the lower density of such polynomials is positive. Similarly, we prove that the…

Number Theory · Mathematics 2022-01-04 Manjul Bhargava , Arul Shankar , Xiaoheng Wang

We study a class polynomials obtained from an enumeration of the number of queen paths. In particular, we find the generating function for the diagonal sequence of this table and the zero distribution of a sequence of related polynomials.

Combinatorics · Mathematics 2024-09-27 Ashish Goswami , Khang Tran

Let $f$ be a monic quadratic polynomial over a finite field of odd characteristic. In 2012, Boston and Jones constructed a Markov process based on the post-critical orbit of $f$, and conjectured that its limiting distribution explains the…

Number Theory · Mathematics 2023-10-16 Vefa Goksel

As a generalization of polyominoes we consider edge-to-edge connected nonoverlapping unions of regular $k$-gons. For $n\le 4$ we determine formulas for the number $a_k(n)$ of generalized polyominoes consisting of $n$ regular $k$-gons.…

Combinatorics · Mathematics 2007-05-23 Matthias Koch , Sascha Kurz

A method for generating irreducible polynomials of degree n over the finite field GF(2) is proposed. The irreducible polynomials are found by solving a system of equations that brings the information on the internal properties of the…

Chaotic Dynamics · Physics 2007-05-23 Ricardo Lopez-Ruiz

We describe fast algorithms for approximating the connection coefficients between a family of orthogonal polynomials and another family with a polynomially or rationally modified measure. The connection coefficients are computed via…

Numerical Analysis · Mathematics 2024-03-27 Timon S. Gutleb , Sheehan Olver , Richard Mikael Slevinsky

In this paper, we give error bounds on the number of monic irreducible polynomials $a_0+a_1x+\dots+a_{n-1}x^{n-1}+x^n$ over a finite field $\mathbb{F}_q$ of degree $n$ with $(a_0, a_1, \dots, a_{n-1}, 1)$ lying in a fixed affine algebraic…

Number Theory · Mathematics 2025-12-11 Neil Kolekar

Polynomials and elements over finite fields exhibit closely related algebraic structures, and many properties defined for elements extend naturally to polynomials. The concepts of order and $\mathbb{F}_q$-Order for elements have been…

Rings and Algebras · Mathematics 2026-01-15 Maithri K. , Vadiraja Bhatta G. R. , Indira K. P. , Prasanna Poojary

Permutation polynomials with coefficients 1 over finite fields attract researchers' interests due to their simple algebraic form. In this paper, we first construct four classes of fractional permutation polynomials over the cyclic subgroup…

Number Theory · Mathematics 2022-07-28 Hutao Song , Hua Guo , Xiyong Zhang , Yapeng Wu , Jianwei Liu

Exponential sums with monomials are highly related to many interesting problems in number theory and well studied by many literatures. In this paper, we consider the exponential sums with polynomials and prove a new upper bound. As an…

Number Theory · Mathematics 2025-10-24 Lingyu Guo , Victor Zhenyu Guo , Mengyao Jing

Let $F$ be a field of prime characteristic $p$ and let $q$ be a power of $p$. We assume that $F$ contains the finite field of order $q$. A $q$-polynomial $L$ over $F$ is an element of the polynomial ring $F[x]$ with the property that those…

Number Theory · Mathematics 2023-03-10 Rod Gow , Gary McGuire

The space of monic squarefree polynomials has a stratification according to the multiplicities of the critical points, called the equicritical stratification. Tracking the positions of roots and critical points, there is a map from the…

Geometric Topology · Mathematics 2024-08-14 Nick Salter

Permutation polynomials are an interesting subject of mathematics and have applications in other areas of mathematics and engineering. In this paper, we develop general theorems on permutation polynomials over finite fields. As a…

Information Theory · Computer Science 2013-08-28 Pingzhi Yuan , Cunsheng Ding

This paper mainly studies problems about so called "permutation polynomials modulo $m$", polynomials with integer coefficients that can induce bijections over Z_m={0,...,m-1}. The necessary and sufficient conditions of permutation…

Number Theory · Mathematics 2007-05-23 Shujun Li
‹ Prev 1 8 9 10 Next ›