SearcharxivSearch

arXiv subjects

Dijia Chen

Publications and source records attributed to Dijia Chen.

3 recordsLinked to original sources

Bounded Ratios of Lorentzian Polynomials II: The Complete Quadratic Local-to-Global Classification

Every quadratic Hessian slice of a Lorentzian polynomial yields bounded monomial ratios among the normalized coefficients of the polynomial. We determine exactly for which pairs $(n,d)$ these quadratic-slice ratios generate the full bounded-ratio cone for every $M$-convex support $S\subseteq\Delta_n^d$. For $d\geq 2$, this quadratic local-to-global principle holds universally if and only if \[ n\leq 3,\qquad d=2,\qquad\text{or}\qquad (n,d)=(4,3). \] In every remaining case, the principle fails already for Lorentzian polynomials with full support: for cubics in $n\geq 5$ variables and for polynomials of degree $d\geq 4$ in $n\geq 4$ variables. We identify the two minimal obstructions, at $(n,d)=(4,4)$ and $(n,d)=(5,3)$, and propagate them using cut-cone certificates and variable-lifting arguments. The quartic bounded ratio extends to every higher degree by differentiation, while perturbing a square-transportation direction yields an explicit degree-uniform family of separating functionals. As a conceptual byproduct, we show that transportation costs on finite median graphs give polar directions in arbitrary dimension and degree.

math.CO

Bounded Ratios of Lorentzian Polynomials I: The Ternary Theory and Optimal Bounding Constants

We study bounded ratios and optimal bounding constants among the normalized coefficients of ternary Lorentzian polynomials. For every fixed $M$-convex support and in arbitrary degree, we give an explicit presentation of the bounded-ratio cone in terms of quadratic Hessian slices. We then express the optimal bounding constants through a variational formula combining local support functions with linear compatibility constraints between slices. For full support, we determine all compatibility relations in arbitrary degree; in degree three, this yields explicit optimal constants for every two-generator section. Finally, we compare the resulting Lorentzian bounds with those for volume polynomials and rank-three matroid basis profiles.

math.CO

Rigidity of Averages over the Two Largest Prime Factors

Let \(P_1(n)\) and \(P_2(n)\) be the largest and second-largest distinct prime factors of \(n\), respectively. Alladi and Johnson asked whether there exists a bounded function \(f\) on the primes for which both limits \(\frac{1}{x}\sum_{2\le n\le x} f(P_1(n)) \longrightarrow \kappa_1\) and \(\frac{1}{x}\sum_{2\le n\le x} f(P_2(n)) \longrightarrow \kappa_2\) exist with \(\kappa_1\neq\kappa_2\), where we set \(f(P_2(n))=0\) when \(n\) is a prime power. We prove that this is impossible: convergence of the first average forces convergence of the second to the same limit. On the \(\log\log\)-scale, the two averages are expressed as convolutions with explicit Dickman kernels. The Fourier transform of the Dickman kernel associated with the \(P_1\)-average has no real zeros. Wiener's Tauberian theorem then yields vague convergence of the translated measures associated with the weighted prime sums. The convergence of the second average follows.

math.NT