Jie Wang

collaborators

4 papers

math.CO2025

A lower bound theorem for $d$ -polytopes with at most $3 d - 1$ vertices

Guillermo Pineda-Villavicencio, Jie Wang

We prove a lower bound theorem for the number of $k$ -faces ( $1 \leq k \leq d - 2$ ) in a $d$ -dimensional polytope $P$ (or $d$ -polytope) with up to $3 d - 1$ vertices. Previous lower bound th…

quant-ph2025

Simultaneous variances of Pauli strings, weighted independence numbers, and a new kind of perfection of graphs

Zhen-Peng Xu, Jie Wang, Qi Ye +3

A set of Pauli stings is well characterized by the graph that encodes its commutatitivity structure, i.e., by its frustration graph. This graph provides a natural interface between…

quant-ph2025

Commutators with multiple unitary symmetry

Shu Li, Jie Wang, Binfeng Wang +1

Commutators are essential in quantum information theory, influencing quantum state symmetries and information storage robustness. This paper systematically investigates the charact…

math.CO2025

A refined lower bound theorem for $d$ -polytopes with at most $2 d$ vertices

Guillermo Pineda-Villavicencio, Jie Wang, David Yost

In 1967, Grünbaum conjectured that the function $ϕ_{k} (d + s, d) := (k + 1 d + 1) + (k + 1 d) - (k + 1 d + 1 - s), for 2 \leq s \leq d$ provides the minimum number of $k$ -…

A lower bound theorem for d-polytopes with at most 3d−1 vertices

Simultaneous variances of Pauli strings, weighted independence numbers, and a new kind of perfection of graphs

Commutators with multiple unitary symmetry

A refined lower bound theorem for d-polytopes with at most 2d vertices

A lower bound theorem for $d$ -polytopes with at most $3 d - 1$ vertices

A refined lower bound theorem for $d$ -polytopes with at most $2 d$ vertices