Related papers: The Reverse Ultra Log-Concavity of the Boros-Moll …
We prove that a random bivariate polynomial with plus minus 1 coefficients is irreducible with high probability.
We prove a conjecture by Shannon Starr regarding the asymptotics for the number of tuples of commuting permutations with given number of joint orbits. These numbers generalize unsigned Stirling numbers of the first kind which count how many…
Consider the number of permutations in the symmetric group on n letters that contain c copies of a given pattern. As c varies (with n held fixed) these numbers form a sequence whose properties we study for the monotone patterns and the…
We establish discrete and continuous log-concavity results for a biparametric extension of the $q$-numbers and of the $q$-binomial coefficients. By using classical results for the Jacobi theta function we are able to lift some of our…
In the $1970$s, Nicolas proved that the partition function $p(n)$ is log-concave for $ n > 25$. In \cite{HNT21}, a precise conjecture on the log-concavity for the plane partition function $\func{pp}(n)$ for $n >11$ was stated. This was…
An important theme in recent work in asymptotic geometric analysis is that many classical implications between different types of geometric or functional inequalities can be reversed in the presence of convexity assumptions. In this note,…
We derive some Fibonacci and Lucas identities which contain inverse binomial coefficients. Extension of the results to the general Horadam sequence is possible, in some cases.
We give a complete classification of Dembowski-Ostram polynomials from reversed Dickson polynomials in odd characteristic.
In the monotone integer dualization problem, we are given two sets of vectors in an integer box such that no vector in the first set is dominated by a vector in the second. The question is to check if the two sets of vectors cover the…
We prove a recent conjecture by Ulas on reducible polynomial substitutions.
We prove new, general versions of Bernstein-von Mises theorem for both well-specified and misspecified models when the log-likelihood is concave in the parameter and the prior distribution is log-concave. Unlike classical versions of…
We present an algorithm for finding all time-reversible systems within a given family of 2-dim systems of ODE's whose right-hand sides are polynomials. We also study an interconnection of time-reversibility and invariants of a subgroup of…
We show that the sequence of moduli of the eigenvalues of a matrix polynomial is log-majorized, up to universal constants, by a sequence of "tropical roots" depending only on the norms of the matrix coefficients. These tropical roots are…
In this paper we develop tools for studying limit theorems by means of convexity. We establish bounds for the discrepancy in total variation between probability measures $\mu$ and $\nu$ such that $\nu$ is log-concave with respect to $\mu$.…
We provide two different proofs of an irreducibility criterion for the preimages of a transverse subvariety of a product of elliptic curves under a diagonal endomorphism of sufficiently large degree.For curves, we present an arithmetic…
The aim of this work is to establish congruences $\left( \operatorname{mod}p^{2}\right) $ involving the trinomial coefficients $\binom{np-1}{p-1}_{2}$ and $\binom{np-1}{\left( p-1\right)/2}_{2}$ arising from the expansion of the powers of…
Minimal log discrepancies (mld's) are related not only to termination of log flips, and thus to the existence of log flips but also to the ascending chain condition (acc) of some global invariants and invariants of singularities in the Log…
We propose a subconjecture that implies the semiampleness conjecture for quasi-numerically positive log canonical divisors and prove the semiampleness in some elementary cases.
In response to [6], we discover the looked for inversion formula for F-nomial coefficients. Before supplying its proof, we generalize F-nomial coefficients to multi F-nomial coefficients and we give their combinatorial interpretation in…
We prove a lemma, which we call the Order Ideal Lemma, that can be used to demonstrate a wide array of log-concavity and log-convexity results in a combinatorial manner using order ideals in distributive lattices. We use the Order Ideal…