English
Related papers

Related papers: Infinite log-concavity for polynomial P\'olya freq…

200 papers

Assume that $\{a_{n};\,n\geq0\}$ is a sequence of positive numbers and $\sum a_{n}^{\,-1}<\infty$. Let $\alpha_{n}=ka_{n}$, $\beta_{n}=a_{n}+k^{2}a_{n-1}$ where $k\in(0,1)$ is a parameter, and let $\{P_{n}(x)\}$ be an orthonormal polynomial…

Mathematical Physics · Physics 2022-03-11 Pavel Stovicek

Let T_n denote the set of log canonical thresholds of pairs (X,Y), with X a nonsingular variety of dimension n, and Y a nonempty closed subscheme of X. Using non-standard methods, we show that every limit of a decreasing sequence in T_n…

Algebraic Geometry · Mathematics 2009-02-02 Tommaso de Fernex , Mircea Mustata

In 2020, Budaghyan, Helleseth and Kaleyski [IEEE TIT 66(11): 7081-7087, 2020] considered an infinite family of quadrinomials over $\mathbb{F}_{2^{n}}$ of the form $x^3+a(x^{2^s+1})^{2^k}+bx^{3\cdot 2^m}+c(x^{2^{s+m}+2^m})^{2^k}$, where…

Information Theory · Computer Science 2021-01-28 Lijing Zheng , Haibin Kan , Yanjun Li , Jie Peng , Deng Tang

We say that a diagonal in an array is {\em $\lambda$-balanced} if each entry occurs $\lambda$ times. Let $L$ be a frequency square of type $F(n;\lambda^m)$; that is, an $n\times n$ array in which each entry from $\{1,2,\dots ,m\}$ occurs…

Combinatorics · Mathematics 2018-02-06 Nicholas Cavenagh , Adam Mammoliti

We consider a class of strongly q-log-convex polynomials based on a triangular recurrence relation with linear coefficients, and we show that the Bell polynomials, the Bessel polynomials, the Ramanujan polynomials and the Dowling…

Combinatorics · Mathematics 2019-08-15 William Y. C. Chen , Larry X. W. Wang , Arthur L. B. Yang

A well known theorem of Lagrange states that the simple continued fraction of a real number $\alpha$ is periodic if and only if $\alpha$ is a quadratic irrational. We examine non-periodic and non-simple continued fractions formed by two…

Number Theory · Mathematics 2018-12-03 Michael Obiero Oyengo

We study a conjecture called "linear rank conjecture" recently raised in (Tsang et al., FOCS'13), which asserts that if many linear constraints are required to lower the degree of a GF(2) polynomial, then the Fourier sparsity (i.e. number…

Computational Complexity · Computer Science 2015-08-11 Hing Yin Tsang , Ning Xie , Shengyu Zhang

This paper explores a natural action of the group $\mathrm{PGL}_2(\mathbb F_q)$ on the set of monic irreducible polynomials of degree at least two over a finite field $\mathbb F_q$. Our main results deal with the existence and number of…

Rings and Algebras · Mathematics 2018-11-07 Lucas Reis

We consider a continuous family $(f_s)$, $s\in[0,1]$ of complex polynomials in two variables with isolated singularities, that are Newton non-degenerate. We suppose that the Euler characteristic of a generic fiber is constant (or…

Algebraic Geometry · Mathematics 2007-05-23 Arnaud Bodin

We prove that the partition function $p(n)$ is log-concave for all $n>25$. We then extend the results to resolve two related conjectures by Chen. The proofs are based on Lehmer's estimates on the remainders of the Hardy--Ramanujan and the…

Combinatorics · Mathematics 2014-07-07 Stephen DeSalvo , Igor Pak

Pilgrim's Finite Global Attractor Conjecture has been verified for polynomials [1], but remains open for general rational maps. In this paper, we prove the conjecture for a family of rational maps obtained by gluing two PCF polynomials…

Dynamical Systems · Mathematics 2026-05-04 Panjing Wu

Given a power $q$ of a prime number $p$ and "nice" polynomials $f_1,...,f_r\in\bbF_q[T,X]$ with $r=1$ if $p=2$, we establish an asymptotic formula for the number of pairs $(a_1,a_2)\in\bbF_q^2$ such that…

Number Theory · Mathematics 2012-03-06 Lior Bary-Soroker , Moshe Jarden

One question that we investigate in this paper is, how can we build log-concave polynomials using sparse polynomials as building blocks? More precisely, let $f = \sum\_{i = 0}^d a\_i X^i \in \mathbb{R}^+[X]$ be a polynomial satisfying the…

Computational Complexity · Computer Science 2017-01-17 Ignacio García-Marco , Pascal Koiran , Sébastien Tavenas

The purpose of this note is to characterize those orthogonal polynomials sequences $(P_n)_{n\geq0}$ for which $$ \pi(x)\mathcal{D}_q P_n(x)=(a_n x+b_n)P_n(x)+c_n P_{n-1}(x),\quad n=0,1,2,\dots, $$ where $\mathcal{D}_q$ is the Askey-Wilson…

Classical Analysis and ODEs · Mathematics 2021-10-08 K. Castillo , D. Mbouna , J. Petronilho

Let $\mathcal{A}=(a_i)_{i=1}^\infty$ be a non-decreasing sequence of positive integers and let $k\in\mathbb{N}_+$ be fixed. The function $p_\mathcal{A}(n,k)$ counts the number of partitions of $n$ with parts in the multiset…

Combinatorics · Mathematics 2022-06-13 Krystian Gajdzica

The theory of log concave polynomials has recently been developed to study objects and problems in combinatorics and other subfields in mathematics. Particular classes of log concave polynomials called Lorentzian polynomials and…

Combinatorics · Mathematics 2026-05-15 Jonathan Leake , Maryam Mohammadi Yekta

We prove a series of Stephan's conjectures concerning Pascal triangle modulo 2 and give a polynomial generalization.

Number Theory · Mathematics 2012-04-03 Vladimir Shevelev

We prove that there is an absolute constant $c > 0$ such that for every $$a_0,a_1, \ldots,a_n \in [1,M]\,, \qquad 1 \leq M \leq \frac 14 \exp \left( \frac n9 \right)\,,$$ there are $$b_0,b_1,\ldots,b_n \in \{-1,0,1\}$$ such that the…

Number Theory · Mathematics 2024-10-17 Tamás Erdélyi

Let $\omega=[a_1, a_2, \cdots]$ be the infinite expansion of continued fraction for an irrational number $\omega \in (0,1)$; let $R_n (\omega)$ (resp. $R_{n, \, k} (\omega)$, $R_{n, \, k+} (\omega)$) be the number of distinct partial…

Number Theory · Mathematics 2016-03-16 Jun Wu , Jian-Sheng Xie

In 1952 Lee and Yang proposed the program of analyzing phase transitions in terms of zeros of partition functions. Linear operators preserving non-vanishing properties are essential in this program and various contexts in complex analysis,…

Complex Variables · Mathematics 2012-04-18 Julius Borcea , Petter Brändén