Guoce Xin

activity

20232026

most citedA Combinatorial Approach to Frobenius Numbers of Some Special Sequences (Complete Version)

6 citations · 12 across the 23 of their papers we have counts for

collaborators

Showing 2025Show all

4 papers · 1 filter

math.CO2025

MacMahon's $Ω_{\geq}$ operator: A computational framework

Feihu Liu, Guoce Xin

MacMahon introduced partition analysis in his book ``Combinatory Analysis'' as a computational technique for solving problems related to systems of linear Diophantine equations and…

math.CO2025

The Sign Pattern Problem for Ehrhart Polynomials

Feihu Liu, Sihao Tao, Guoce Xin

We investigate the sign patterns of coefficients in the Ehrhart polynomial of the Cartesian product between the $r$ -th pyramid over the Reeve tetrahedron and the hypercube $[0, n]^…

math.CO2025

Enumeration of Corona for Lozenge Tilings

Craig Knecht, Feihu Liu, Guoce Xin

Knecht considers the enumeration of coronas. This is a counting problem for two specific types of lozenge tilings. Their exact closed formulas are conjectured in [A380346] and [A38…

math.CO2025

An $O (n lo g^{2} n)$ Algorithm for Computing Hankel Determinants up to Order $n$

Feihu Liu, Guoce Xin, Zihao Zhang

Given the rational power series $h (x) = \sum_{i \geq 0} h_{i} x^{i} \in C [[x]]$ , the Hankel determinant of order $n$ is defined as $H_n(h(x)) := \det (h_{i+j})_{1 \leq i,j \le…

MacMahon's Ω≥​ operator: A computational framework

The Sign Pattern Problem for Ehrhart Polynomials

Enumeration of Corona for Lozenge Tilings

An O(nlog2n) Algorithm for Computing Hankel Determinants up to Order n

MacMahon's $Ω_{\geq}$ operator: A computational framework

An $O (n lo g^{2} n)$ Algorithm for Computing Hankel Determinants up to Order $n$