Browse the catalog

All results

All 459 definitions and 1381 theorems in the catalog.

Browse pages: 1 2 3 4 5 6 7 8 9 10

KindResultPageSource
theoremFor deg p ≤ d the f-transform splits exactly when p splitsMain resultRealRooted.splits_fPolynomial_iffThe f-polynomial transformsource
theoremFor every m ≥ 2, consecutive Hoggatt rows strictly interlaceMain resultRealRooted.Hoggatt.normalized_interlaces_and_isCoprimeHoggatt polynomialssource
theoremFor every δ ≥ 0 all roots are real and negativeMain resultRealRooted originalRealRooted.JacobiDeformation.polynomial_all_rank_nonneg_parameterJacobi deformationsource
theoremFor every δ ≥ 0 the deformation is a PF polynomialRealRooted originalRealRooted.JacobiDeformation.isPFPolynomial_polynomialJacobi deformationsource
theoremFor f with nonnegative coefficients and c > 0 all roots of the image are nonpositiveRealRooted originalRealRooted.powerDerivativeShift_roots_nonposThe operator D^m (D + c) x^msource
theoremFor g(0) = 0 and deg g = deg f + 1 with nonnegative coefficients: f ≪ g iff g/X ≪ fRealRooted.strictInterl_iff_divX_strictInterl_of_coeff_zeroCommon interleavers and compatible familiessource
theoremFor i ∈ {1, 2, 3, k − 2, k − 1}, nonnegative combinations of A_{k,S} are real-rootedMain resultRealRooted.JacobiStirlingDescent.weightedDescentSum_splits_simple_negJacobi–Stirling descent polynomialssource
theoremFor k ≥ 1, A_{k,S} has degree 2k − |S| − 1, constant term 1, simple negative rootsRealRooted.JacobiStirlingDescent.isGood_descentPolyJacobi–Stirling descent polynomialssource
theoremFor m = 3, the Hoggatt polynomials are the Baxter descent polynomials (A056939)RealRooted.Hoggatt.normalized_three_eq_baxterHoggatt polynomialssource
theoremFor n ≥ 1, M_n has degree n and n simple negative rootsRealRooted.BorosMoll.bmM_rootsLog-concavity transform of the Boros–Moll rowssource
theoremFor n ≥ 1, the Boros–Moll row d(n) is infinitely log-concaveRealRooted.BorosMoll.borosMollRow_isInfinitelyLogConcaveLog-concavity transform of the Boros–Moll rowssource
theoremFor n ≥ 1, the dual Chow polynomial interlaces the augmented oneRealRooted.HosterStump.strictInterl_chowOfFlagH_dualFlagH_augChowOfFlagH_flagHChow polynomials of simplicial posetssource
theoremFor n ≥ 2, the refined descent polynomials form interlacing diagramsRealRooted.HosterStump.isInterlacingDiagram_rangeChow polynomials of simplicial posetssource
theoremFor n ≥ 3, M_{n-2} interlaces A_n; both have simple roots and no common rootMain resultRealRooted originalRealRooted.BigDescents321.motzkinRef_interl_bigDescentPoly_and_noCommonRootsBig-descent polynomials of 321-avoiding permutationssource
theoremFor PF h ≠ 0: k is PF with k ≪ h iff k is a nonnegative sum of h and h/(x − u)RealRooted originalRealRooted.isPFPolynomial_and_interl_iff_hasKreinCompanionExpansionFinite-degree tests for differential operatorssource
theoremFor positive β, consecutive Favard polynomials interlaceRealRooted.favardInterlacingFavard recurrences: real roots, interlacing and orthogonalitysource
theoremFor positive β, Favard polynomials are nonzero and real-rootedRealRooted.isRealRooted_of_favardFavard recurrences: real roots, interlacing and orthogonalitysource
theoremFor positive β, the pairing is positive definiteRealRooted.SatisfiesFavardRecurrence.pairing_posDefFavard recurrences: real roots, interlacing and orthogonalitysource
theoremFor quadratic data on the boundary of the parameter cone the ray quantifier is eliminatedRealRooted originalRealRooted.OperatorMatrix.couplingRayCriterion_quadratic_iff_of_boundaryOperator matrices preserving ordered PF vectorssource
theoremFor r = 1 and positive [u²]Q or [u²]B: simple roots, no common roots in consecutive rowsRealRooted originalRealRooted.BrandenLeite.affineNegativePowerCoeff_factor_simple_and_disjointChain polynomials of totally nonnegative matricessource
theoremFor R(0) > 0, consecutive renewal rows in a residue class are nonzero and interlaceRealRooted originalRealRooted.strictInterl_renewalPolynomial_residue_succChain polynomials of totally nonnegative matricessource
theoremFor s < 0, the exact condition is that the roots of p lie in [1/(4s), 0]RealRooted originalRealRooted.quadraticSubstitution_splits_and_roots_nonpos_iff_of_negRational substitutionssource
theoremFor s ≥ 0, nonpositive roots are preserved exactly for split p with nonpositive rootsRealRooted originalRealRooted.quadraticSubstitution_splits_and_roots_nonpos_iff_of_nonnegRational substitutionssource
theoremFor the kernel u = 1 the run sum is the product of (1 + z_i)RealRooted originalRealRooted.siteWeightedRuns_one_by_oneHessenberg rows of TP2 matricessource
theoremFor the sequence 0, 0, 0, 1, 1, ..., c_6 = x² + x + 1 is not real-rootedRealRooted.BrandenVecchi.chowPolynomial_three_zero_prefix_six_not_splitsChow polynomials of totally nonnegative matricessource
theoremFor u > 0 the n-th polynomial has degree ⌊n/2⌋RealRooted originalRealRooted.PathSquareEdge.polynomial_natDegreeWeighted matchings of the square of a path and simplicial-clique deletionsource
theoremFor |h| < 1 the roots are simple and lie in (-2/λ, 0)RealRooted originalRealRooted.Chebyshev.affineLevel_splits_simple_roots_mem_IooChebyshev level polynomialssource
theoremFor |h| < 1 the roots of T_n - h are simple and lie in (-1, 1)RealRooted originalRealRooted.Chebyshev.T_sub_C_splits_simple_roots_mem_IooChebyshev level polynomialssource
theoremFor α, λ > 0 and |h| ≤ 1 the affine level polynomials are PFRealRooted originalRealRooted.Chebyshev.affineLevel_isPFPolynomialChebyshev level polynomialssource
theoremFor β = -m the polynomial solutions are multiples of (1 + X)^m times a Jacobi polynomialRealRooted.eq_C_mul_endpoint_factor_of_reflectedJacobiOperator_eq_zeroJacobi polynomialssource
theoremFor γ < α + 1, L_n + γ L_{n-1} has simple positive rootsRealRooted.laguerreCombinationOne_splits_simple_roots_posGeneralized Laguerre polynomialssource
theoremFor γ > 0 all roots of the cubic family are negativeRealRooted originalRealRooted.cubicTransitionFamily_roots_negOrdered PF states for cubic and quartic recurrencessource
theoremFor γ, w > 0 consecutive rows in each residue class modulo three interlaceRealRooted originalRealRooted.cubicTransitionFamily_residue_interlacesOrdered PF states for cubic and quartic recurrencessource
theoremFor γ, w > 0 the nth row of the cubic family has degree ⌊n/3⌋RealRooted originalRealRooted.cubicTransitionFamily_natDegreeOrdered PF states for cubic and quartic recurrencessource
theoremFor λ ≥ 0 the Bessel operator maps real-rooted polynomials to real-rooted polynomialsRealRooted originalRealRooted.besselOperator_splitsBessel operators and imaginary central differencessource
theoremFor ℓ ≥ 1, consecutive super-Eulerian polynomials interlace, without common rootsCoauthored paperRealRooted.SuperEulerian.strictInterl_superEulerian_succEulerian-type polynomialssource
theoremFor ℓ ≥ 1, super-Eulerian polynomials are nonzero and real-rootedCoauthored paperRealRooted.SuperEulerian.isRealRooted_superEulerianEulerian-type polynomialssource
theoremForests: the minima polynomial is the acyclic sink polynomial of the line graphCoauthored paperRealRooted.Graph.minimaPolynomial_eq_ordinaryAcyclicSinkPolynomial_lineGraphMinima polynomial of local edge orderssource
theoremFormula for affine right inputsRealRooted.Poisson.starC_affine_rightPoisson star productsource
theoremForward direction: Rolle and the two Laguerre inequalitiesRealRooted.splits_derivative_and_forms_nonneg_of_splitsLaguerre inequalitiessource
theoremFour Euler insertion images have a common left interleaverRealRooted originalRealRooted.crossedEulerCompletion_commonLeftInterleaverEulerian-type polynomialssource
theoremFull truncated staircases have rook polynomial PₙRealRooted.GeneralizedSnakePosets.FiniteSkewBoard.rookPolynomial_full_eq_modifiedNarayanaRook polynomials of generalized snake posetssource
theoremFunctional calculus: S_g((t − r) p) = (g − r) ⋆ S_g(p)RealRooted originalRealRooted.derivProductPowMap_X_sub_C_mulPoisson star productsource
theoremFu–Lin–Zeng / Zhang: the descent enumerator equals S_{n+1}RealRooted.SeparablePermutations.descentEnumerator_eq_descentPolynomialDescent polynomials of separable permutationssource
theoremFu–Lin–Zeng's cubic for the gamma-polynomials (via Lagrange inversion)RealRooted.SeparablePermutations.gammaPolynomial_cubicDescent polynomials of separable permutationssource
definitionGamma transformRealRooted.gammaTransformGamma transformsource
theoremGamma transforms of adjacent degree preserve interlacingRealRooted.strictInterl_gammaTransform_succ_iffGamma transformsource
theoremGamma transforms of real-rooted nonnegative polynomialsRealRooted.GammaTransform.isRealRooted_gammaTransform_of_hasNonnegCoeffsGamma transformsource
definitionGamma-pencil operatorRealRooted.gammaOperatorGamma transformsource
definitionGamma-polynomials Γ_n through the factorial-compression representationRealRooted.SeparablePermutations.gammaPolynomialDescent polynomials of separable permutationssource
theoremGantmacher–Krein: primitive compounds give a simple positive spectrumMatrix.exists_charpoly_eq_prod_strictAnti_of_compounds_primitiveTotally nonnegative matricessource
theoremGarloff–Wagner: Hadamard products of PF polynomials are PFRealRooted.IsPFPolynomial.hadamardProductHadamard products and Schur–Szegő compositionsource
theoremGarloff–Wagner: Hadamard products preserve interlacingMain resultRealRooted.StrictInterl.interl_hadamardProductHadamard products and Schur–Szegő compositionsource
theoremGarloff–Wagner: the factorial Hadamard product preserves interlacingRealRooted.Interl.factorialHadamardProduct_rightHadamard products and Schur–Szegő compositionsource
definitionGaussian weightRealRooted.hermiteGaussianWeightHermite polynomialssource
theoremGeneral form: f ≪ af + Σ bᵢgᵢ from the combined flux at the zeros of fMain resultRealRooted.LiuWang.strictInterl_mul_add_sum_mul_of_combined_flux_of_posThe Liu–Wang and Ma–Wang interlacing criteriasource
definitionGeneralized Eulerian polynomialsRealRooted.generalizedEulerianEulerian polynomialssource
definitionGeneralized Jensen multiplierMvPolynomial.jensenMultivariate Szász growth boundsource
definitionGeneralized Laguerre polynomialsPolynomial.generalizedLaguerreGeneralized Laguerre polynomialssource
theoremGeneralized Laguerre polynomials are orthogonal on the half-lineRealRooted.generalizedLaguerre_integral_orthogonalGeneralized Laguerre polynomialssource
theoremGeneralized Laguerre polynomials are real-rootedRealRooted.generalizedLaguerre_splitsGeneralized Laguerre polynomialssource
theoremGeneralized Laguerre polynomials have simple rootsRealRooted.generalizedLaguerre_hasSimpleRootsGeneralized Laguerre polynomialssource
definitionGeneralized Narayana polynomialsRealRooted.narayanaPolynomialNarayana polynomialssource
theoremGeneralized Narayana polynomials are Pólya-frequencyRealRooted.narayanaPolynomialRootLocationNarayana polynomialssource
theoremGeneralized Narayana polynomials are real-rootedRealRooted.splits_narayanaPolynomialNarayana polynomialssource
definitionGeneralized rising factorialsRealRooted.risingFactorialPolynomialNarayana polynomialssource
definitionGenerating polynomial of the log-concavity transform of a Boros–Moll rowRealRooted.BorosMoll.bmMLog-concavity transform of the Boros–Moll rowssource
theoremGeometric factor is Pólya-frequencyRealRooted.EdreiThoma.isPolyaFreqSeries_geometricFactorEdrei–Thoma theoremsource
theoremGoncharov: Stirling numbers of the first kind are asymptotically normalPolynomial.tendsto_standardizedCoeffDistribution_prod_X_add_natCastCentral limit theorems for real-rooted coefficient distributionssource
theoremGrace's apolarity theorem for closed disksMain resultRealRooted.exists_isRoot_mem_closedBall_of_areApolarGrace's apolarity theoremsource
theoremGrace's apolarity theorem for closed half-planesRealRooted.exists_isRoot_le_im_of_areApolarGrace's apolarity theoremsource
theoremGrace–Walsh–Szegő coincidence theorem for closed disksRealRooted.exists_eval_const_eq_of_mem_closedBallGrace's apolarity theoremsource
theoremGrace–Walsh–Szegő, real form: real stable iff the diagonal is real-rootedRealRooted.mvRealStable_iff_aeval_X_ne_zero_and_splitsGrace's apolarity theoremsource
theoremGrace–Walsh–Szegő: a symmetric multiaffine polynomial is stable iff its diagonal isRealRooted.mvUpperHalfPlaneStable_iff_eval_diagonalProjection_ne_zeroGrace's apolarity theoremsource
theoremGribinski–Marcus: the rectangular convolution preserves nonnegative rootsRealRooted.HasOnlyNonnegRoots.rectangularAdditiveConvolutionFinite free convolutionssource
theoremGurvits' univariate coefficient inequalityRealRooted.Gurvits.mul_le_coeff_one_of_splitsVan der Waerden permanent boundsource
theoremGurvits: capacity drops by at most ((d−1)/d)^(d−1) per variableRealRooted.Gurvits.gurvitsFactor_mul_capacity_le_capacity_stepVan der Waerden permanent boundsource
theoremGustafsson–Solus Lemma 3.4: row-threshold matrices preserve interlacingRealRooted.isInterlacingSeq0Nonneg_gustafssonSolusActionThreshold matricessource
theoremGårding: hyperbolicity cones are convexRealRooted.convex_hyperbolicityConeReal stabilitysource
theoremh(D) preserves PF polynomials of degree at most N exactly when h(D) X^N is PFMain resultRealRooted originalRealRooted.PreservesPFUpTo.iff_finiteDifferentialTestFinite-degree tests for differential operatorssource
theoremH_y has simple real roots in [-1, 0) for 0 ≤ y ≤ 1/3RealRooted originalRealRooted.normalizedQuadraticFamily_splits_simple_roots_mem_IcoInterlacing of quadraticssource
theoremH_y interlaces (X + 1) H_z exactly when z ≤ yRealRooted originalRealRooted.normalizedQuadraticFamily_interlaces_mul_X_add_one_iffInterlacing of quadraticssource
theoremH_y interlaces H_z exactly when z ≤ yRealRooted originalRealRooted.normalizedQuadraticFamily_strictInterl_iffInterlacing of quadraticssource
definitionHadamard productRealRooted.hadamardProductHadamard products and Schur–Szegő compositionsource
theoremHadamard products of Hurwitz-stable polynomials are stableMain resultRealRooted.IsHurwitzStable.hadamardProductHadamard products of Hurwitz-stable polynomialssource
theoremHaglund–Zhang threshold matrices preserve interlacing sequencesRealRooted.HaglundZhang.isInterlacingSeq0Nonneg_matPolyActionThreshold matricessource
theoremHaglund–Zhang: binomial Eulerian polynomials are real-rootedRealRooted.HaglundZhang.binomialEulerianPolynomial_splitsThreshold matricessource
theoremHalf-growth sequences transfer consecutive interlacingRealRooted.StrictInterl.fPolynomial_sequenceThe f-polynomial transformsource
theoremHankel (Cauchy–Schwarz) inequality for the first three momentsRealRooted originalRealRooted.sq_integral_pow_one_le_mul_zero_twoBasis transforms preserving real-rootedness and PFsource
theoremHarper: real-rooted coefficient distributions are asymptotically normalPolynomial.tendsto_standardizedCoeffDistributionCentral limit theorems for real-rooted coefficient distributionssource
theoremHausdorff inequalities for finite positive measures on [0, β]RealRooted originalRealRooted.sum_alternating_choose_mul_integral_pow_nonnegBasis transforms preserving real-rootedness and PFsource
theoremHeilmann–Lieb root bound |x| ≤ 2√(Δ − 1)RealRooted.abs_le_of_isRoot_matchingPolyOnHeilmann–Lieb theoremsource
theoremHeilmann–Lieb: the matching polynomial is real-rootedRealRooted.Graph.matchingPolynomialByEdges_splitsHeilmann–Lieb theoremsource
theoremHeilmann–Lieb: μ_S is real-rootedRealRooted.splits_matchingPolyOnHeilmann–Lieb theoremsource
definitionHermite matrix of Newton power sumsPolynomial.hermiteMatrixSturm root countingsource
theoremHermite polynomials are orthogonal for the Gaussian weightRealRooted.hermiteReal_integral_orthogonalHermite polynomialssource
theoremHermite polynomials are real-rootedRealRooted.hermiteReal_isRealRootedHermite polynomialssource
theoremHermite polynomials form a Sturm sequenceRealRooted.hermiteReal_isSturmSeqHermite polynomialssource
theoremHermite polynomials have simple rootsRealRooted.hermiteReal_hasSimpleRootsHermite polynomialssource
theoremHermite polynomials satisfy a Favard recurrenceRealRooted.hermiteReal_satisfiesFavardRecurrenceHermite polynomialssource
theoremHermite–Biehler, converse: f + ig without such zeros implies g ≪ fRealRooted.strictInterl_of_upperHalfPlaneStable_hermiteBiehlerHermite–Biehler and Hurwitz stability criteriasource
theoremHermite–Biehler: g ≪ f implies f + ig has no zeros with positive imaginary partRealRooted.hermiteBiehlerForwardPosHermite–Biehler and Hurwitz stability criteriasource
theoremHermite–Kakeya–Obreschkoff converse: a stable real span gives proper positionMain resultRealRooted.AllComboMvRealStableOrZero.eq_zero_or_properPositionMultivariate Hermite–Kakeya–Obreschkoff theoremsource
theoremHermite–Kakeya–Obreschkoff: proper position gives a stable real spanRealRooted.MvProperPosition.allComboMvRealStableOrZeroMultivariate Hermite–Kakeya–Obreschkoff theoremsource
theoremHermite–Poulain operators preserve interlacingRealRooted.HermitePoulain.interl_or_interl_applyAsDifferentialOperatorHermite–Poulain theoremsource
theoremHermite–Poulain theoremMain resultRealRooted.HermitePoulain.applyAsDifferentialOperator_eq_zero_or_splitsHermite–Poulain theoremsource
theoremHermite–Sylvester: real-rooted iff the Hermite matrix is PSDMain resultPolynomial.splits_iff_hermiteMatrix_posSemidefSturm root countingsource
theoremHlavacek–Solus: interlacing shelling pieces give a real-rooted h-polynomialRealRooted.HlavacekSolus.isRealRooted_hPolynomial_of_perm_isInterlacingSeqNonnegClosure of interlacing under cones, affine combinations and shiftssource
theoremHoggar: log-concavity without internal zeros is closed under productsMain resultRealRooted.coeffLogConcaveUpTo_mulHoggar's theoremsource
theoremHomogenization in any degree at least the total degree preserves real stabilityRealRooted.MvRealStable.ordinaryHomogenization_of_totalDegree_leReal stabilitysource
theoremHomogenization preserves real stabilityRealRooted.MvRealStable.ordinaryHomogenizationReal stabilitysource
definitionHorizontal stretching by repetition of column heightsRealRooted.Schur.repeatColumnsSchur elementary-coordinate substitutionssource
theoremHurwitz criterion: stable iff the Hurwitz matrix is totally nonnegativeRealRooted.isHurwitzStable_iff_hurwitz_isTotallyNonnegHermite–Biehler and Hurwitz stability criteriasource
definitionHurwitz stable: nonnegative coefficients and no zeros with positive real partRealRooted.IsHurwitzStableHermite–Biehler and Hurwitz stability criteriasource
theoremHutchinson: such power series are Laguerre–Pólya entire functionsMain resultRealRooted.Hutchinson.isLaguerrePolya_tsumHutchinson's theoremsource
definitionHyperbolic in a directionMvPolynomial.HyperbolicAtReal stabilitysource
theoremHyperbolicity is constant on path components of the nonvanishing locusRealRooted.MvPolynomial.HyperbolicAt.of_joinedInReal stabilitysource
definitionHypergeometric polynomials R_dRealRooted.ParkingFunctions.ToricContribution.rPolynomialToric g-contribution polynomialssource
theoremIdentical invertible maps can have non-real-rooted rowwise Schur squaresRealRooted.rowwiseNormalizedSchurProduct_counterexampleHadamard products and Schur–Szegő compositionsource
theoremIf A(R) ≤ R² - 1 and B(R) ≤ 1, consecutive rows strictly interlaceMain resultRealRooted originalRealRooted.ToeplitzPerturbation.strictInterl_row_succSigned Toeplitz perturbations of the Chebyshev rowssource
theoremIf f ≪ g and both have nonnegative coefficients, then g ≪ xfRealRooted.strictInterl_mul_X_of_strictInterl_of_nonnegWagner’s lemmasource
theoremIf f ≪ g, then af + bg ≪ g for a, b ≥ 0 not both zeroRealRooted.StrictInterl.nonneg_combo_rightWagner’s lemmasource
theoremIf f ≪ g, then f ≪ af + bg for a, b ≥ 0 not both zeroRealRooted.StrictInterl.nonneg_combo_leftWagner’s lemmasource
theoremIf f ≺ g, deg g = deg f + 1 and deg f < L, then D_L f ≺ D_{L+1} gRealRooted.JacobiStirlingDescent.StrictInterleave.insertion_succJacobi–Stirling descent polynomialssource
theoremIf p ≪ q have nonnegative coefficients, the Lace matrix of (q, p) is totally nonnegativeRealRooted.StrictInterl.fullyInterlacingPairHermite–Biehler and Hurwitz stability criteriasource
theoremIf p_N is real-rooted, then p_n is real-rooted for all n ≤ NRealRooted originalRealRooted.splits_evenDerivativeTest_of_leFinite-degree tests for differential operatorssource
theoremIf p_N is real-rooted, Δ_c maps PF polynomials of degree at most N to PF polynomialsRealRooted originalRealRooted.isPFPolynomial_evenDerivativeOperatorFinite-degree tests for differential operatorssource
theoremIf p_n is real-rooted, Δ_c ∏ (x + rᵢ) is real-rooted for rᵢ ≥ 0RealRooted originalRealRooted.splits_evenDerivativeOperator_prodFinite-degree tests for differential operatorssource
theoremIf q(x²) + x p(x²) is Hurwitz stable, the Lace matrix of (q, p) is totally nonnegativeRealRooted.fullyInterlacingPair_of_isHurwitzStable_oddEvenPolynomialHermite–Biehler and Hurwitz stability criteriasource
theoremIf two constant levels of g split, every intermediate level splitsRealRooted originalRealRooted.splits_sub_C_of_mem_IccPoisson star productsource
theoremIf w ≤ 0 on ℝ, the one-factor levels decide every source setRealRooted originalRealRooted.derivProductPowMap_realRooted_iff_of_nonposPoisson star productsource
definitionImages E(x^k (x + 1)^(n − k))RealRooted.brandenBasisImageBrändén's E transformsource
definitionImaginary parts of the powers of a complex rootRealRooted.aswKarlinRootVectorAissen–Schoenberg–Whitney theoremsource
theoremImplicit derivative of a simple output root in one input rootRealRooted.exists_hasDerivAt_finRootPolynomial_shiftInterlacing from a monomial chainsource
theoremIn the half-height range η ≤ a/2 the n-th row has degree ⌊n/2⌋RealRooted originalRealRooted.weightedThreeStateRow_natDegree_halfHeightWeighted three-state recurrencesource
theoremIncreasing-column permanent is real stableRealRooted.Permanent.columnPermanent_mvRealStable_of_increasingColumnsMonotone column permanent theoremsource
definitionIncreasing-run polynomial of ternary wordsRealRooted.EulerianCompendium.ternaryWordRunEnumeratorEulerian-type polynomialssource
definitionIndependence polynomialRealRooted.Graph.indepPolyClaw-free independence polynomialssource
theoremIndependence polynomials of path powers ∑ C(m − rk, k) xᵏ are real-rootedRealRooted.splits_sum_choose_sub_mulSturm sequences from derivative recurrencessource
definitionIndex set of a Toeplitz minorRealRooted.StrictToeplitzMinorIndexLindström–Gessel–Viennot lemma and total positivitysource
theoremInduction along a multishift recurrence from a PF seedRealRooted originalRealRooted.multishiftDifferentialRecurrence_inductionFinite-degree tests for differential operatorssource
definitionInfinitely log-concave: every iterate of the transform is nonnegativeRealRooted.Branden.IsInfinitelyLogConcaveLog-concavity transform of the Boros–Moll rowssource
theoremInserting a conjugate pair in the disk of squared radius 13/3 keeps simple interval rootsRealRooted originalRealRooted.IntervalDifferential.zigzagQuadraticFactor_rootsZig-zag Eulerian polynomialssource
theoremInserting a real factor inserts a simple root into each gapRealRooted originalRealRooted.IntervalDifferential.zigzagLinearFactor_rootsZig-zag Eulerian polynomialssource
theoremInterlacing after one linear factorRealRooted.interlaces_self_mul_of_natDegree_eq_oneInterlacing for linear recurrencessource
theoremInterlacing as stability of the bivariate pencil f(z) + w g(z)RealRooted.mvUpperHalfPlaneStable_bivariatePencil_iff_strictInterlObreschkoff’s theoremsource
definitionInterlacing f ≪ g of nonzero real-rooted polynomialsRealRooted.StrictInterlInterlacingsource
theoremInterlacing families: some leaf's largest root is at most the root node'sRealRooted.RootSelectionTree.Valid.exists_leaf_largestRoot_leCommon interleavers and compatible familiessource
theoremInterlacing from a linear division remainderRealRooted.strictInterl_linear_of_remainderInterlacing for linear recurrencessource
theoremInterlacing from a quadratic division remainderRealRooted.strictInterl_quadratic_of_remainderInterlacing for linear recurrencessource
theoremInterlacing gives a nonnegative WronskianRealRooted.wronskian_eval_nonneg_of_strictInterlWronskian criterion for interlacingsource
theoremInterlacing gives a real-rooted pencilRealRooted.allComboRealRooted_of_strictInterlObreschkoff’s theoremsource
theoremInterlacing implies interlacing in the sense allowing zero polynomialsRealRooted.StrictInterl.toInterlInterlacingsource
theoremInterlacing is a nonnegative Wronskian plus a multiplicity boundMain resultRealRooted.strictInterl_iff_wronskian_eval_nonnegWronskian criterion for interlacingsource
theoremInterlacing of parity productsRealRooted.interlaces_of_parityProductInterlacing for linear recurrencessource
theoremInterlacing polynomials differ in degree by at most oneRealRooted.StrictInterl.natDegree_eq_or_eq_succInterlacingsource
definitionInterlacing sequenceRealRooted.IsInterlacingSeqToric g-contribution polynomialssource
definitionInterlacing sequence of real-rooted polynomials with nonnegative coefficientsRealRooted.IsInterlacingSeqNonnegMatrices preserving interlacing sequencessource
theoremInterlacing symbols reverse proper positionRealRooted.HermitePoulain.eq_zero_pair_or_stablePencil_applyAsDifferentialOperatorHermite–Poulain theoremsource
theoremInterlacing transferred through reversalRealRooted.interlaces_of_eq_reflectInterlacing for linear recurrencessource
theoremInterlacing when each next row has its roots in the next windowRealRooted.derivativeRecurrence_interlaces_of_endpoint_windowsInterlacing for linear recurrencessource
theoremInterlacing with a degree gap of oneMain resultRealRooted.Interlaces.iff_strictInterl_and_natDegreeInterlacingsource
theoremInterlacing with a moving lower boundRealRooted.derivativeRecurrence_interlaces_of_roots_mem_Icc_mono_divInterlacing for linear recurrencessource
theoremInterlacing with a moving upper boundRealRooted.derivativeRecurrence_interlaces_of_roots_le_mono_divInterlacing for linear recurrencessource
theoremInterlacing with an upper root boundRealRooted.derivativeRecurrence_interlaces_of_roots_leInterlacing for linear recurrencessource
definitionInterlacing with degrees differing by oneRealRooted.InterlacesInterlacingsource
definitionInterlacing, allowing zero polynomialsRealRooted.InterlInterlacingsource
theoremInversion in one variable preserves real stabilityRealRooted.MvRealStable.invertVariableReal stabilitysource
theoremInversion in one variable preserves stabilityRealRooted.MvUpperHalfPlaneStable.invertVariableReal stabilitysource
theoremInversion of equal-length interleavingsRealRooted.interleaves_reverse_map_one_div_of_length_eqReciprocal shifts and interlacingsource
theoremInversion of length-shifted interleavingsRealRooted.interleaves_reverse_map_one_div_of_length_add_one_eqReciprocal shifts and interlacingsource
theoremInversion preserves stability of univariate polynomialsRealRooted.IsUpperHalfPlaneStable.reflect_comp_neg_XReal stabilitysource
definitionInversion z^d P(−1/z) in one variableRealRooted.invertVariableReal stabilitysource
theoremIrreducible matrices have a positive eigenvectorMain resultMatrix.exists_positive_eigenvector_of_irreduciblePerron–Frobenius theoremsource
theoremIterated causal differences of polynomial values are the Euler numeratorRealRooted originalRealRooted.polynomialValueSeq_causalFwdDiff_iterPólya frequency sequences with polynomial tailssource
theoremIterated derivatives of the substitution in terms of derivatives of pRealRooted originalRealRooted.homogenizedSubstitution_iterateDerivativeRational substitutionssource
theoremIterated Laguerre raising steps preserve simple negative rootsRealRooted.laguerreRaisingSteps_splits_simple_roots_negGeneralized Laguerre polynomialssource
definitionIterated rows of the matrix from a seed vectorRealRooted.separatedCharacteristicRowsRecurrences with separated characteristic parameterssource
theoremIterates of an interlacing seed remain interlacing sequencesRealRooted originalRealRooted.separatedCharacteristicRows_interlacingRecurrences with separated characteristic parameterssource
theoremIterating ((x-a)(x-b)f)' gives a chain P_n ≪ P_{n+1}RealRooted.strictInterl_derivative_endpointProduct_sequenceInterlacing and root intervals of endpoint-derivative sequencessource
theoremIterating ((x-a)(x-b)f)' gives nonzero real-rooted rowsRealRooted.isRealRooted_derivative_endpointProduct_sequenceInterlacing and root intervals of endpoint-derivative sequencessource
theoremIterating ((x-a)(x-b)f)' with degrees rising by one: differ-by-one interlacingRealRooted.interlaces_derivative_endpointProduct_sequenceInterlacing and root intervals of endpoint-derivative sequencessource
theoremIterating (x-a)(x-b)f' gives a chain P_n ≪ P_{n+1}RealRooted.strictInterl_endpointDerivative_sequenceInterlacing and root intervals of endpoint-derivative sequencessource
theoremIterating (x-a)(x-b)f' gives nonzero real-rooted rowsRealRooted.isRealRooted_endpointDerivative_sequenceInterlacing and root intervals of endpoint-derivative sequencessource
theoremIterating (x-a)(x-b)f' with degrees rising by one: differ-by-one interlacingRealRooted.interlaces_endpointDerivative_sequenceInterlacing and root intervals of endpoint-derivative sequencessource
theoremJ_n maps PF polynomials of degree at most n to PF polynomialsRealRooted.IsPFPolynomial.binaryRunTransformBinary-run transformationsource
theoremJ_n of (n+1)g - 2Θg interlaces J_{n+1} gRealRooted.strictInterl_binaryRunTransform_succBinary-run transformationsource
theoremJ_n preserves interlacing on inputs of degree at most (n+1)/2Main resultRealRooted.strictInterl_binaryRunTransformBinary-run transformationsource
definitionJacobi–Stirling numbers of the first kindRealRooted.JacobiStirling.firstKindJacobi–Stirling numberssource
definitionJacobi–Stirling numbers of the second kindRealRooted.JacobiStirling.secondKindJacobi–Stirling numberssource
definitionJensen polynomialsRealRooted.jensenPolynomialMultiplier sequencessource
definitionJensen-multiplier operatorMvPolynomial.jensenOpMultivariate Szász growth boundsource
definitionJensen-pencil certificateRealRooted.BidiagonalJensenPencilCertificateMultiplier sequencessource
theoremJensen: non-real zeros of p' lie in Jensen disksPolynomial.exists_mem_jensenDisk_of_isRoot_derivativeInterlacing of derivatives of real-rooted polynomialssource
theoremk + r is a PF multiplier sequence for r ≥ 0RealRooted.isPFMultiplierSequence_natCast_addMultiplier sequencessource
theoremKarlin window matrices of PF sequences are totally nonnegativeRealRooted.IsPolyaFreqSeq.aswKarlinMatrix_isTotallyNonnegRectAissen–Schoenberg–Whitney theoremsource
definitionKarlin's repeated coefficient-window matrixRealRooted.aswKarlinMatrixAissen–Schoenberg–Whitney theoremsource
theoremKarlin's repeated matrices force many sign variations on the sine vectorRealRooted.aswKarlinRepeatedSineVariationLowerBoundAissen–Schoenberg–Whitney theoremsource
definitionKarlin's sector threshold mπ/(m+d−1)RealRooted.aswSectorThresholdAissen–Schoenberg–Whitney theoremsource
theoremKarlin: Gaussian matrices are strictly totally positiveMatrix.det_gaussianMatrix_submatrix_posTotally nonnegative matricessource