English
Related papers

Related papers: Roots of Polynomials and The Derangement Problem

200 papers

Let $\mathbb{F}_q$ be the finite field of $q$ elements. Then a \emph{permutation polynomial} (PP) of $\mathbb{F}_q$ is a polynomial $f \in \mathbb{F}_q[x]$ such that the associated function $c \mapsto f(c)$ is a permutation of the elements…

Number Theory · Mathematics 2012-11-27 Christopher J. Shallue

The probability that a zero of a random real polynomial of increasing degree is real tends to zero. However, passing from polynomials to Laurent polynomials yields a surprising result: the probability that a root is real tends not to zero,…

Algebraic Geometry · Mathematics 2025-09-03 Boris Kazarnovskii

We derive conditions under which random sequences of polarizations (two-point symmetrizations) converge almost surely to the symmetric decreasing rearrangement. The parameters for the polarizations are independent random variables whose…

Functional Analysis · Mathematics 2013-01-16 Almut Burchard , Marc Fortier

Let $Z_1,\, Z_2,\dots$ be independent and identically distributed complex random variables with common distribution $\mu$ and set $$ P_n(z) := (z - Z_1)\cdots (z - Z_n)\,. $$ Recently, Angst, Malicet and Poly proved that the critical points…

Probability · Mathematics 2023-07-14 Marcus Michelen , Xuan-Truong Vu

The extended de Finetti theorem characterizes exchangeable infinite random sequences as conditionally i.i.d. and shows that the apparently weaker distributional symmetry of spreadability is equivalent to exchangeability. Our main result is…

Operator Algebras · Mathematics 2008-06-24 Claus Köstler

We use recent results about linking the number of zeros on algebraic varieties over $\mathbb{C}$, defined by polynomials with integer coefficients, and on their reductions modulo sufficiently large primes to study congruences with products…

Number Theory · Mathematics 2022-07-25 Bryce Kerr , Jorge Mello , Igor Shparlinski

Empirical analysis of many colored knot polynomials, made possible by recent computational advances in Chern-Simons theory, reveals their stability: for any given negative N and any given knot the set of coefficients of the polynomial in…

High Energy Physics - Theory · Physics 2015-09-03 Ya. Kononov , A. Morozov

The number of fixed points of a random permutation of 1,2,...,n has a limiting Poisson distribution. We seek a generalization, looking at other actions of the symmetric group. Restricting attention to primitive actions, a complete…

Combinatorics · Mathematics 2007-08-21 Persi Diaconis , Jason Fulman , Robert Guralnick

We bound the location of roots of polynomials that have nonnegative coefficients with respect to a fixed but arbitrary basis of the vector space of polynomials of degree at most $d$. For this, we interpret the basis polynomials as vector…

Combinatorics · Mathematics 2009-11-16 Julian Pfeifle

Motivated by the question of whether a random polynomial with integer coefficients is likely to be irreducible, we study the probability that a monic polynomial with integer coefficients has a low-degree factor over the integers, which is…

Probability · Mathematics 2018-05-23 Sean O'Rourke , Philip Matchett Wood

This paper is concerned with multivariate refinements of the gamma-positivity of Eulerian polynomials by using the succession and fixed point statistics. Properties of the enumerative polynomials for permutations, signed permutations and…

Combinatorics · Mathematics 2020-08-11 Shi-Mei Ma , Jun Ma , Jean Yeh , Yeong-Nan Yeh

We provide a unified, elementary, topological approach to the classical results stating the continuity of the complex roots of a polynomial with respect to its coefficients, and the continuity of the coefficients with respect to the roots.…

General Mathematics · Mathematics 2012-06-11 Branko Ćurgus , Vania Mascioni

Assume that the Riemann hypothesis holds for Dedekind zeta functions. Under this assumption, we prove that a degree $d$ polynomial with random multiplicative $\pm1$ coefficients is irreducible in $\mathbb{Z}[x]$ with probability…

Number Theory · Mathematics 2025-11-07 Péter P. Varjú , Max Wenqiang Xu

Suppose that $\langle f_n \rangle$ is a sequence of polynomials, $\langle f_n^{(k)}(0)\rangle$ converges for every non-negative integer $k$, and that the limit is not $0$ for some $k$. It is shown that if all the zeros of $f_1, f_2, \dots$…

Complex Variables · Mathematics 2019-03-05 Min-Hee Kim , Young-One Kim , Jungseob Lee

Feldman and Karlin conjectured that the number of isolated fixed points for deterministic models of viability selection and recombination among n possible haplotypes has an upper bound of 2^n - 1. Here a proof is provided. The upper bound…

Populations and Evolution · Quantitative Biology 2013-02-04 Lee Altenberg

We prove limit theorems for the number of fixed points occurring in a random pattern-avoiding permutation distributed according to a one-parameter family of biased distributions. The bias parameter exponentially tilts the distribution…

Probability · Mathematics 2026-03-11 Aksheytha Chelikavada , Hugo Panzo

Let $f$ be a polynomial of degree $d$ in $n$ variables over a finite field $\mathbb{F}$. The polynomial is said to be unbiased if the distribution of $f(x)$ for a uniform input $x \in \mathbb{F}^n$ is close to the uniform distribution over…

Discrete Mathematics · Computer Science 2022-01-21 Abhishek Bhowmick , Shachar Lovett

In this paper we look at polynomials arising from statistics on the classes of involutions, $I_n$, and involutions with no fixed points, $J_n$, in the symmetric group. Our results are motivated by F. Brenti's conjecture which states that…

Combinatorics · Mathematics 2007-05-23 W. M. B. Dukes

A well-known conjecture states that a random symmetric $n \times n$ matrix with entries in $\{-1,1\}$ is singular with probability $\Theta\big( n^2 2^{-n} \big)$. In this paper we prove that the probability of this event is at most…

Combinatorics · Mathematics 2020-10-20 Marcelo Campos , Letícia Mattos , Robert Morris , Natasha Morrison

Given a countable set X (usually taken to be the natural numbers or integers), an infinite permutation, \pi, of X is a linear ordering of X. This paper investigates the combinatorial complexity of infinite permutations on the natural…

Discrete Mathematics · Computer Science 2011-08-19 Steven Widmer