惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

B
Blog
A
About on SuperTechFans
Microsoft Security Blog
Microsoft Security Blog
Y
Y Combinator Blog
罗磊的独立博客
J
Java Code Geeks
人人都是产品经理
人人都是产品经理
MongoDB | Blog
MongoDB | Blog
The GitHub Blog
The GitHub Blog
G
Google Developers Blog
U
Unit 42
Microsoft Azure Blog
Microsoft Azure Blog
博客园 - Franky
Jina AI
Jina AI
F
Fortinet All Blogs
H
Help Net Security
B
Blog RSS Feed
H
Hackread – Cybersecurity News, Data Breaches, AI and More
Last Week in AI
Last Week in AI
博客园 - 司徒正美
云风的 BLOG
云风的 BLOG
M
MIT News - Artificial intelligence
C
Check Point Blog
GbyAI
GbyAI

math.CO updates on arXiv.org

Complement Submodular Information Measures for Balanced and Robust Data Selection A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs Laplacian Spectrum of the Weakly Zero-Divisor Graph of a Finite Commutative Ring An identity for second Eulerian numbers via lattice-point counting $t$-tone edge coloring of graphs Constructing Maximal Bumpless Pipedreams for Double Grothendieck Polynomials Mubayi's Polynomial-Ideal Conjecture and Cover-Ideal Turán Methods Implicit Binarization via Complex Phase Dynamics in Combinatorial Optimization The limits of Schur multipliers in Pólya conversion problems for the $q$-permanent function Universality theorems for generalized splines Framing Triangulations for Arbitrary Integer Flow Polytopes On the Common Generalization of Gentle Algebras and Framed Directed Acyclic Graphs The complexity of frugal digraph homomorphisms Chaotic and periodic behavior of jeu de taquin on infinite Young tableaux Enumerating Pattern Avoiding Parking Functions Incidence toric ideals and three-point functions Unique Winning Opening Move in Three-Row Chomp Strong majority colorings of graphs A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs Spectral radius and edge-disjoint connected factors of graphs New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256 Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles Balanced intersection size distributions in projective planes List Reconstruction Problem with List Size Two Is Dimensionality a Barrier for Retrieval Models? The INIEP: Irreducible and Positive Realizations The number of Pfaffian orientations on punctured polygonally cellulated surfaces Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern Finite-state enumeration of adjacency-constrained 132-avoiding permutations AMDS and quantum AMDS Constacyclic codes of length $4p^ς$ over $\mathbb{F}_{{p}^{m}}$
Stability of combinatorial polynomials and its applications
Ming-Jian Ding, Bao-Xuan Zhu · 2021-06-23 · via math.CO updates on arXiv.org

The aim of this paper is to make a systematical study on the stability of polynomials in combinatorics. Applying the characterizations of Borcea and Brändén concerning linear operators preserving stability, we present criteria for real stability and Hurwitz stability. We also give a criterion for Hurwitz stability of the Turán expressions. As applications, we derive some stability results occurred in the literature in a unified manner. In addition, we obtain the Hurwitz stability of Turán expressions for alternating runs polynomials of types $A$ and $B$ and solve a conjecture concerning Hurwitz stability of alternating runs polynomials defined on a dual set of Stirling permutations. Furthermore, we prove that the Hurwitz stability of any symmetric polynomial implies its semi-$γ$-positivity. We study a class of symmetric polynomials and derive many nice properties including Hurwitz stability, semi-$γ$-positivity, non $γ$-positivity, unimodality, strong $q$-log-convexity, the Jacobi continued fraction expansion and the relation with derivative polynomials. In particular, these properties of the alternating descents polynomials of types $A$ and $B$ can be obtained in a unified approach. Finally, we use real stability to prove a criterion for zeros interlacing between a polynomial and its reciprocal polynomial, which implies the alternatingly increasing property. This criterion extends a result of Brändén and Solus and unifies such properties for many combinatorial polynomials, including ascent polynomials for $k$-ary words, descent polynomials on signed Stirling permutations and $q$-analog of descent polynomials on colored permutations, and so on. We prove the alternatingly increasing property and zeros interlacing for two kinds of peak polynomials on the dual set of Stirling permutations.