English
Related papers

Related papers: Counting polynomials over finite fields with given…

200 papers

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…

Number Theory · Mathematics 2019-07-31 Jiyou Li , Daqing Wan

We announce recent results on a connection between factorization statistics of polynomials over a finite field and the structure of the cohomology of configurations in $\mathbb{R}^3$ as a representation of the symmetric group. This…

Number Theory · Mathematics 2018-04-02 Trevor Hyde

This work is divided into three parts. The first part concerns polynomials in one variable with all real roots. We consider linear transformations that preserve real rootedness, as well as matrices that preserve interlacing. The second part…

Classical Analysis and ODEs · Mathematics 2008-03-11 Steve Fisk

For a polynomial in several variables depending on some parameters, we discuss some results to the effect that for almost all values of the parameters the polynomial is irreducible. In particular we recast in this perspective some results…

Algebraic Geometry · Mathematics 2015-10-22 Arnaud Bodin , Pierre Dèbes , Salah Najib

This paper presents new formulary solutions for quantic polynomial equations in general forms, where we present five solutions for any fifth degree polynomial equation with real coefficients, and thereby having the possibility to calculate…

General Mathematics · Mathematics 2022-10-17 Yassine Larbaoui

The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear…

Optimization and Control · Mathematics 2011-12-08 Jesus A. De Loera , Peter N. Malkin , Pablo A. Parrilo

We obtain results describing the behavior of the action of rotation generators on polynomials over a commutative ring. We also explore harmonic polynomials in a purely algebraic setting.

Representation Theory · Mathematics 2021-01-11 Keith Conrad , Ambar N. Sengupta

We develop the theory of Gr\"obner bases for ideals in a polynomial ring with countably infinite variables over a field. As an application we reconstruct some of the one-one correspondences among various sets of partitions by using division…

Commutative Algebra · Mathematics 2008-06-04 Kei-ichiro Iima , Yuji Yoshino

We present some results about the number of rational points on a certain family of curves defined over a finite field. In a small number of cases the curves have more rational points than expected. Fibonacci numbers make an appearance, as…

Number Theory · Mathematics 2021-02-04 Robin Chapman , Gary McGuire

We consider four classes of polynomials over the fields $\mathbb{F}_{q^3}$, $q=p^h$, $p>3$, $f_1(x)=x^{q^2+q-1}+Ax^{q^2-q+1}+Bx$, $f_2(x)=x^{q^2+q-1}+Ax^{q^3-q^2+q}+Bx$, $f_3(x)=x^{q^2+q-1}+Ax^{q^2}-Bx$, $f_4(x)=x^{q^2+q-1}+Ax^{q}-Bx$,…

Combinatorics · Mathematics 2018-04-05 Daniele Bartoli

We prove the existence of complexified real arrangements with the same combinatorics but different embeddings in the complex projective plane. Such pair of arrangements has an additional property: they admit conjugated equations on the ring…

Algebraic Geometry · Mathematics 2018-05-04 E. Artal , J. Carmona , J. I. Cogolludo , M. Marco

We consider various counting questions for irreducible binomials over finite fields. We use various results from analytic number theory to investigate these questions.

Number Theory · Mathematics 2017-07-12 Randell Heyman , Igor E. Shparlinski

We give a counting formula in terms of modified Hall-Littlewood polynomials and the chromatic quasisymmetric function for the number of points on an arbitrary Hessenberg variety over a finite field. As a consequence, we express the…

Combinatorics · Mathematics 2025-10-27 Alex Abreu , Antonio Nigro , Samrith Ram

It will be shown that the polynomial time computable numbers form a field, and especially an algebraically closed field.

Computational Complexity · Computer Science 2007-05-23 Tetsushi Matsui

We consider an algebraic variety and its foliation, both defined over a number field. We prove upper bounds for the geometric complexity of the intersection between a leaf of the foliation and a subvariety of complementary dimension (also…

Algebraic Geometry · Mathematics 2023-06-22 Gal Binyamini

We offer a new proof that a certain q-analogue of multinomial coeffi- cients furnishes a q-counting of the set of permutations of an associated multiset of positive integers, according to the number of inversions in such arrangements. Our…

Combinatorics · Mathematics 2018-08-28 Shashikant Mulay , Carl Wagner

We estimate the frequency of polynomial iterations which falls in a given multiplicative subgroup of a finite field of $p$ elements. We also give a lower bound on the size of the subgroup which is multiplicatively generated by the first $N$…

Number Theory · Mathematics 2019-09-12 László Mérai , Igor E. Shparlinski

We develop a theory of sesquilinear forms over finite fields, investigating their representations via polynomials and coefficient matrices, along with classification results for these forms. Through their connection to quadratic forms, we…

Number Theory · Mathematics 2025-07-01 Ruikai Chen

For a finite field of odd number of elements we construct families of permutation binomials and permutation trinomials with one fixed-point (namely zero) and remaining elements being permuted as disjoint cycles of same length. Binomials and…

Combinatorics · Mathematics 2023-06-28 Anitha G , P Vanchinathan

Given any polynomial system with fixed monomial term structure, we give explicit formulae for the generic number of roots with specified coordinate vanishing restrictions. For the case of affine space minus an arbitrary union of coordinate…

Algebraic Geometry · Mathematics 2016-09-06 J. Maurice Rojas