Related papers: Initial values of ML-degree polynomials
Volume polynomials form a distinguished class of log-concave polynomials with remarkable analytic and combinatorial properties. I will survey realization problems related to them, review fundamental inequalities they satisfy, and discuss…
In this paper we give new identities involving q-Euler polynomials of higher order.
A-polynomials were introduced by Meyn and play an important role in the iterative construction of high degree self-reciprocal irreducible polynomials over the field F_2, since they constitute the starting point of the iteration. The exact…
We study Wronskians of Appell polynomials indexed by integer partitions. These families of polynomials appear in rational solutions of certain Painlev\'e equations and in the study of exceptional orthogonal polynomials. We determine their…
The second author studied arithmetic properties of a class of sequences that generalize the sequence of derangements. The aim of the following paper is to disprove two conjectures stated in \cite{miska}. The first conjecture regards the set…
The van der Waerden's Conjecture states that the set $\mathscr{P}_{n,N}^0(\mathbb{Q})$ of monic integer polynomials $f(X)$ of degree $n$, with height $\le N$ such that the Galois group $G_{K_f/\mathbb{Q}}$ of the splitting field…
Let $F$ be a univariate polynomial or rational fraction of degree $d$ defined over a number field. We give bounds from above on the absolute logarithmic Weil height of $F$ in terms of the heights of its values at small integers: we review…
We investigate Drinfeld modular polynomials parametrizing $T$-isogenies between Drinfeld $\mathbb{F}_q[T]$-modules of rank $r\geq 2$. By providing an explicit classification of such isogenies, we derive explicit bounds on the $T$-degrees of…
We consider multilinear Littlewood polynomials, polynomials in $n$ variables in which a specified set of monomials $U$ have $\pm 1$ coefficients, and all other coefficients are $0$. We provide upper and lower bounds (which are close for $U$…
We show under a mild hypothesis that given field elements $a_0, \dots, a_m \in K$, there always exists a degree-$m$ polynomial whose $n$th power whose degree-$jn$ coefficient is equal to $a_j$ for $0 \leq j \leq m$. We provide an alternate…
We prove an analogue of the classical Bateman-Horn conjecture on prime values of polynomials for the ring of polynomials over a large finite field. Namely, given non-associate, irreducible, separable and monic (in the variable $x$)…
We present an elementary proof of a conjecture by I. Ra\c{s}a which is an inequality involving Bernstein basis polynomials and convex functions. It was affirmed in positive very recently by the use of stochastic convex orderings. Moreover,…
We express the maximum likelihood (ML) degrees of a family toric varieties in terms of Mobius invariants of matroids. The family of interest are those parametrized by monomial maps given by Lawrence lifts of totally unimodular matrices with…
In this paper we obtain several new identities for Bernoulli and Euler polynomials; some of them extend Miki's and Matiyasevich's identities. Our new method involves differences and derivatives of polynomials.
We settled a conjecture of Feigin, Wang and Yoshinaga, appeared in the preprint "Integral expressions for derivations of multiarrangements" (arXiv: 2309.01287v2).
In this article, we prove some factorization results for several classes of polynomials having integer coefficients, which in particular yield several classes of irreducible polynomials. Such classes of polynomials are devised by imposing…
In this paper we prove Shapiro's 1958 Conjecture on exponential polynomials, assuming Schanuel's Conjecture.
An observation on Hall-Littlewood polynomials.
The maximum likelihood degree (ML degree) measures the algebraic complexity of a fundamental optimization problem in statistics: maximum likelihood estimation. In this problem, one maximizes the likelihood function over a statistical model.…
In this paper we establish function field versions of two classical conjectures on prime numbers. The first says that the number of primes in intervals (x,x+x^epsilon] is about x^epsilon/log x and the second says that the number of primes…