4 papers · 1 filter
On the quantum chromatic number of Hamming and generalized Hadamard graphs
Xiwang Cao, Keqin Feng, Hexiang Huang +2
As a fundamental metric for quantifying quantum advantage in non-local games, the quantum chromatic number reveals the power of entanglement in distributed tasks. In this paper, we…
Closed-Form Decomposition for Simplicial Cones and PDBarv Algorithm for Lattice Point Counting
Sihao Tao, Guoce Xin, Zihao Zhang
Counting lattice points within a rational polytope is a foundational problem with applications across mathematics and computer science. A key approach is Barvinok's algorithm, whic…
A combinatorial simplicial cone decomposition
Guoce Xin, Xinyu Xu, Zihao Zhang
This paper introduces an algebraic combinatorial approach to simplicial cone decompositions, a key step in solving inhomogeneous linear Diophantine systems and counting lattice poi…
An Algorithm for Computing Hankel Determinants up to Order
Feihu Liu, Guoce Xin, Zihao Zhang
Given the rational power series , the Hankel determinant of order is defined as $H_n(h(x)) := \det (h_{i+j})_{1 \leq i,j \le…