English
Related papers

Related papers: Partition Polynomials: Asymptotics and Zeros

200 papers

We study separable plus quadratic (SPQ) polynomials, i.e., polynomials that are the sum of univariate polynomials in different variables and a quadratic polynomial. Motivated by the fact that nonnegative separable and nonnegative quadratic…

Optimization and Control · Mathematics 2021-05-12 Amir Ali Ahmadi , Cemil Dibek , Georgina Hall

Below we discuss the partition of the space of real univariate polynomials according to the number of positive and negative roots and signs of the coefficients. We present several series of non-realizable combinations of signs together with…

Classical Analysis and ODEs · Mathematics 2015-01-06 Jens Forsgard , Vladimir P. Kostov , Boris Shapiro

This paper investigates coefficients of cyclotomic polynomials theoretically and experimentally. We prove the following result. {{\em If $n=p_1\ldots p_k$ where $p_i$ are odd primes and $p_1<p_2<\ldots<p_r<p_1+p_2<p_{r+1}<\ldots<p_t$ with…

Number Theory · Mathematics 2019-02-14 Marcin Mazur , Bogdan V. Petrenko

We provide an algorithm to classify the asymptotic sets of the dominant polynomial mappings $F: \C^3 \to \C^3$ of degree 2, using the definition of the so-called "{\it fa\c{c}ons}" in \cite{Thuy}. We obtain a classification theorem for the…

Algebraic Geometry · Mathematics 2023-05-16 Nguyen Thi Bich Thuy

We investigate average gradient degree of normal random polynomials of fixed algebraic degree n. In particular, for polynomials of two variables, asymptotics of the average gradient degree for large values of n is determined.

High Energy Physics - Theory · Physics 2007-05-23 George Khimshiashvili , Alexander Ushveridze

Let $F$ and $G$ be integer polynomials where $F$ has degree at least $2$. Define the sequence $(a_n)$ by $a_n=F(a_{n-1})$ for all $n\ge 1$ and $a_0=0.$ Let $\mathscr{B}_{F,\,G,\,k}$ be the set of all positive integers $n$ such that $k\mid…

Number Theory · Mathematics 2022-08-09 Abhishek Jha

Let $r_{k}(n)$ denote the number of representations of the integer $n$ as a sum of $k$ squares. In this paper, we give an asymptotic for $r_{k}(n)$ when $n$ grows linearly with $k$. As a special case, we find that \[ r_{n}(n) \sim \frac{B…

Number Theory · Mathematics 2023-12-20 John Holley-Reid , Jeremy Rouse

The recurrence for the $k$-Fibonacci polynomials is usually iterated upwards to positive values of $n$ only. When the recurrence is iterated downwards to $n<0$, there are indices where the polynomials vanish identically. This fact does not…

Combinatorics · Mathematics 2026-02-25 S. R. Mane

It is well known that a random cosine polynomial $ V_n(x) = \sum_ {j=0} ^{n} a_j \cos (j x) , \ x \in (0,2 \pi) $, with the coefficients being independent and identically distributed (i.i.d.) real-valued standard Gaussian random variables…

Probability · Mathematics 2019-08-23 Ali Pirhadi

In this paper we investigate the generalization of the Bessenrodt--Ono inequality by following Gian-Carlo Rota's advice in studying problems in combinatorics and number theory in terms of roots of polynomials. We consider the number of…

Combinatorics · Mathematics 2019-10-24 Bernhard Heim , Markus Neuhauser , Robert Tröger

Given a quadratic map Q : K^n -> K^k defined over a computable subring D of a real closed field K, and a polynomial p(Y_1,...,Y_k) of degree d, we consider the zero set Z=Z(p(Q(X)),K^n) of the polynomial p(Q(X_1,...,X_n)). We present a…

Symbolic Computation · Computer Science 2007-05-23 Dima Grigoriev , Dmitrii V. Pasechnik

Linear recursions of degree $k$ are determined by evaluating the sequence of Generalized Fibonacci Polynomials, $\{F_{k,n}(t_1,...,t_k)\}$ (isobaric reflects of the complete symmetric polynomials) at the integer vectors $(t_1,...,t_k)$. If…

Number Theory · Mathematics 2007-12-17 Trueman MacHenry , Kieh Wong

We derive an asymptotic formula for $A(n,j,r)$ the number of integer partitions of $n$ into at most $j$ parts each part $\le r$. We assume $j$ and $r$ are near their mean values. We also investigate the second largest part, the number of…

Combinatorics · Mathematics 2018-03-26 L. Bruce Richmond

This thesis focuses on two concepts which are widely studied in the field of computational geometry. Namely, visibility and unit disk graphs. In the field of visibility, we have studied the conflict-free chromatic guarding of polygons, for…

Computational Geometry · Computer Science 2021-11-02 Onur Çağırıcı

For $G=G_{n, 1/2}$, the Erd\H{o}s--Renyi random graph, let $X_n$ be the random variable representing the number of distinct partitions of $V(G)$ into sets $A_1, \ldots, A_q$ so that the degree of each vertex in $G[A_i]$ is divisible by $q$…

Combinatorics · Mathematics 2022-11-23 Paul Balister , Emil Powierski , Alex Scott , Jane Tan

Strong asymptotics on the whole complex plane of a sequence of monic Jacobi polynomials $P_n^{(\alpha_n, \beta_n)}$ is studied, assuming that $$ \lim_{n\to\infty} \frac{\alpha_n}{n}=A, \qquad \lim_{n\to\infty} \frac{\beta _n}{n}=B, $$ with…

Classical Analysis and ODEs · Mathematics 2007-05-23 A. B. J. Kuijlaars , A. Martinez-Finkelshtein

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

Let $Q_n(x)=\sum_{i=0}^{n} A_{i}x^{i}$ be a random polynomial where the coefficients $A_0,A_1,... $ form a sequence of centered Gaussian random variables. Moreover, assume that the increments $\Delta_j=A_j-A_{j-1}$, $j=0,1,2,...$ are…

Probability · Mathematics 2007-06-13 S. Rezakhah , S. Shemehsavar

For any positive integers $m$ and $\alpha$, we prove that $$\sum_{k=0}^{n-1}\epsilon^k(2k+1)A_k^{(\alpha)}(x)^m\equiv0\pmod{n}, $$ where $\epsilon\in\{1,-1\}$ and $$…

Number Theory · Mathematics 2011-08-09 Hao Pan

We study piecewise polynomial functions $\gamma_k(c)$ that appear in the asymptotics of averages of the divisor sum in short intervals. Specifically, we express these polynomials as the inverse Fourier transform of a Hankel determinant that…

Number Theory · Mathematics 2019-12-10 Estelle Basor , Fan Ge , Michael O. Rubinstein