Related papers: Stable Polynomials over Finite Fields

The file contains PhD Dissertation by Oskar Jakub Szyma\'nski. This work ends his study at Doctoral School of Exact and Natural Sciences at Jagiellonian University where the Author has attended in years 2019-2024. The subject of the Thesis…

The freeness of hyperplane arrangements in a three dimensional vector space over finite field is discussed. We prove that if the number of hyperplanes is greater than some bound, then the freeness is determined by the characteristic…

In this paper, we give some counting results on integer polynomials of fixed degree and bounded height whose distinct non-zero roots are multiplicatively dependent. These include sharp lower bounds, upper bounds and asymptotic formulas for…

Permutation polynomials over finite fields have taken an important role in vast areas in mathematics as well as engineering. Recently, Tu et al. gave some classes of complete permutation polynomials over finite fields of even…

Let $q\geqslant 2$ be a fixed prime power. We prove an asymptotic formula for counting the number of monic polynomials that are of degree $n$ and have exactly $k$ irreducible factors over the finite field $\mathbb{F}_q$. We also compare our…

We introduce a new method for showing that the roots of the characteristic polynomial of certain finite lattices are all nonnegative integers. This method is based on the notion of a quotient of a poset which will be developed to explain…

We give a lower bound for the degree of an irreducible factor of a given polynomial. This improves and generalizes the results obtained in [4, On the irreducible factors of a polynomial, Proc. Amer. Math. Soc., 148 (2020] 1429 -- 1437].

We study the stability of randomized Taylor schemes for ODEs. We consider three notions of probabilistic stability: asymptotic stability, mean-square stability, and stability in probability. We prove fundamental properties of the…

We use the Weil bound of multiplicative character sums together with some recent results of N. Boston and R. Jones, to show that the critical orbit of quadratic polynomials over a finite field of $q$ elements is of length $O(q^{3/4})$,…

The relationship between nonnegative polynomials and sums of squares is a classical topic in real algebraic geometry. We study \emph{stubborn polynomials} $f$ on a real variety $X$, which are polynomials nonnegative on $X$, such that no odd…

For dispersive Hamiltonian partial differential equations of order 2N+1, N integer, there are two criteria to analyse to examine the stability of small-amplitude, periodic travelling wave solutions to high-frequency perturbations. The first…

We compute the graded polynomial identities of the infinite dimensional upper triangular matrix algebra over an arbitrary field. If the grading group is finite, we prove that the set of graded polynomial identities admits a finite basis. We…

We give an explanation for the Pieri coefficients for the stable and dual stable Grothendieck polynomials; their non-leading terms are obtained by taking an alternating sum of meets (or joins) of their leading terms.

We investigate a family of distributions having a property of stability-under-addition, provided that the number $\nu$ of added-up random variables in the random sum is also a random variable. We call the corresponding property a…

In this paper we present new results on the preservation of polynomial stability of damped wave equations under addition of perturbing terms. We in particular introduce sufficient conditions for the stability of perturbed two-dimensional…

We give a short proof, using profinite techniques, that idempotent pointlikes, stable pairs and triples are decidable for the pseudovariety of aperiodic monoids. Stable pairs are also described for the pseudovariety of all finite monoids.

Extending the thoroughly studied theory of group stability, we study Ulam stability type problems for associative and Lie algebras; namely, we investigate obstacles to rank-approximation of almost solutions by exact solutions for systems of…

We prove an effective form of Hilbert's irreducibility theorem for polynomials over a global field $K$. More precisely, we give effective bounds for the number of specializations $t\in \mathcal{O}_K$ that do not preserve the irreducibility…

Some cubic polynomials over the integers have three distinct real roots with continued fractions that all have the same common tail. We characterize the polynomials for which this happens, and then investigate the situation for other…

Polynomial optimization problems often arise in sequences indexed by dimension, and it is of interest to compute bounds on the optimal values of all problems in the sequence. Examples include certifying inequalities between symmetric…