Zijian Zeng
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Zijian Zeng has a total of 29 co-authors. Here are the top co-authors by number of shared publications:
- Houde Liu
Tsinghua Shenzhen International Graduate School, Tsinghua University, Shenzhen 518055, China
4 shared publications - Kurunathan Ratnavelu
UCSI University, Malaysia
4 shared publications - Bo Wei
Faculty of Environmental, Life, Natural Science and Technology, Okayama University, Okayama, 700-8530, Japan
2 shared publications Houde Liu
2 shared publications- Xianwei Li
Bengbu University
2 shared publications - Amr Tolba
King Saud University
1 shared publication
Latest Publications
- Open Access
- 8 September 2026
- Published by Elsevier in SSRN Electronic Journal
Exact Counterexamples to an Ehrhart Root-Disk Conjecture for Generalized Snake Posets
Lee, Vindas-Meléndez, and Wang conjectured a disk bound for the roots of Ehrhart polynomials of generalized-snake order polytopes. The printed statement has a sign error and an off-by-one length parameter; we use the unique repair compatible with their definition and their proved functional equation. We give exact computer-assisted counterexamples for the regular snake words of lengths 9 and 10. For length 10, the requested next finite layer, the word εLRLRLRLRLR has a root ρ satisfying |ρ + 7| > 6. A rational Rouché disk proves the strict inequality without floating-point roots. A separate verifier reconstructs the Ehrhart polynomial from order-ideal multichains and certifies the same failure through an exact Cayley transform and Routh table. The length-9 example also shows that the authors' reported computation through length 9 is incompatible with the corrected statement.
- 8 September 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessExact Counterexamples to an Ehrhart Root-Disk Conjecture for Generalized Snake Posets
Lee, Vindas-Meléndez, and Wang conjectured a disk bound for the roots of Ehrhart polynomials of generalized-snake order polytopes. The printed statement has a sign error and an off-by-one length parameter; we use the unique repair compatible with their definition and their proved functional equation. We give exact computer-assisted counterexamples for the regular snake words of lengths 9 and 10. For length 10, the requested next finite layer, the word εLRLRLRLRLR has a root ρ satisfying |ρ + 7| > 6. A rational Rouché disk proves the strict inequality without floating-point roots. A separate verifier reconstructs the Ehrhart polynomial from order-ideal multichains and certifies the same failure through an exact Cayley transform and Routh table. The length-9 example also shows that the authors' reported computation through length 9 is incompatible with the corrected statement.
- Open Access
- 8 September 2026
- Published by Elsevier in SSRN Electronic Journal
A Computer-Assisted Proof of the Oriented Ramsey Value k(3, 4) = 21
Let k(3, 4) be the least positive integer N such that every loopless oriented graph on N vertices contains an independent triple or a complete transitive tournament on four vertices. We give a computer-assisted proof that k(3, 4) = 21. A previously recorded cyclic graph supplies the lower bound. For the upper bound, elementary neighbourhood restrictions and an oddorder parity argument reduce a hypothetical graph on 21 vertices to 129 template cases. Eight checked classification refutations establish coverage of the local templates. A further 108 checked refutations, together with 21 explicit reversal transports, exclude every case. Acceptance of the certificates relies on a stricter LRAT checker: an independent computational audit found that the original deposited checker could accept an unsupported empty clause and replayed the entire selected corpus after correcting that defect. The proof retains an ordinary software and compiler trust boundary; it is not a proof-assistant formalization. We make no priority claim over an earlier assertion of the same value.
- 8 September 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessA Computer-Assisted Proof of the Oriented Ramsey Value k(3, 4) = 21
Let k(3, 4) be the least positive integer N such that every loopless oriented graph on N vertices contains an independent triple or a complete transitive tournament on four vertices. We give a computer-assisted proof that k(3, 4) = 21. A previously recorded cyclic graph supplies the lower bound. For the upper bound, elementary neighbourhood restrictions and an oddorder parity argument reduce a hypothetical graph on 21 vertices to 129 template cases. Eight checked classification refutations establish coverage of the local templates. A further 108 checked refutations, together with 21 explicit reversal transports, exclude every case. Acceptance of the certificates relies on a stricter LRAT checker: an independent computational audit found that the original deposited checker could accept an unsupported empty clause and replayed the entire selected corpus after correcting that defect. The proof retains an ordinary software and compiler trust boundary; it is not a proof-assistant formalization. We make no priority claim over an earlier assertion of the same value.
- Open Access
- 5 September 2026
- Published by Elsevier in SSRN Electronic Journal
A Certified Prime Factor of A 20 in the Recurrence A N +1 = A 2 N + 2
Let a0 = 1 and an+1 = a 2 n + 2. The OEIS record A102847 reports a8,. .. , a19 composite and the primality of a20 unknown. We give the exact certificate 7 795 379 | a20. The divisor is prime. Together with an elementary congruence for odd indices, this proves that every an with 5 ≤ n ≤ 21 is composite. Thus a next prime after a4 = 15131, if one exists, has index at least 22. No assertion is made for n ≥ 22.
- 5 September 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessA Certified Prime Factor of A 20 in the Recurrence A N +1 = A 2 N + 2
Let a0 = 1 and an+1 = a 2 n + 2. The OEIS record A102847 reports a8,. .. , a19 composite and the primality of a20 unknown. We give the exact certificate 7 795 379 | a20. The divisor is prime. Together with an elementary congruence for odd indices, this proves that every an with 5 ≤ n ≤ 21 is composite. Thus a next prime after a4 = 15131, if one exists, has index at least 22. No assertion is made for n ≥ 22.
- Open Access
- 5 September 2026
- Published by Elsevier in SSRN Electronic Journal
Coset and Fiber Constructions for Rainbow Trees in Finite Abelian Groups
Let a rainbow tree over a finite abelian group G mean a tree on |G| vertices whose vertices are bijectively labeled by G and whose edge sums are pairwise distinct. We give two exact composition principles. First, a rainbow tree over a subgroup K ≤ G admits a leaf extension over G for every independent choice of a permutation of K in each nonidentity coset. Within the corresponding coset-respecting model, we classify all valid attachments and encode their degree increments by a circulant permanent. Second, if G/K has odd order, a rainbow tree over G/K and independently chosen rainbow trees over K can be assembled into a rainbow tree over G. This fiber construction works for nonsplit abelian extensions and for arbitrary missing colors in the fibers. Iteration produces multilevel and linear-maximum-degree families. These conditional constructions do not prove the unrestricted Graham-Sloane conjecture or its stronger bijective cyclic form.
- 5 September 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessCoset and Fiber Constructions for Rainbow Trees in Finite Abelian Groups
Let a rainbow tree over a finite abelian group G mean a tree on |G| vertices whose vertices are bijectively labeled by G and whose edge sums are pairwise distinct. We give two exact composition principles. First, a rainbow tree over a subgroup K ≤ G admits a leaf extension over G for every independent choice of a permutation of K in each nonidentity coset. Within the corresponding coset-respecting model, we classify all valid attachments and encode their degree increments by a circulant permanent. Second, if G/K has odd order, a rainbow tree over G/K and independently chosen rainbow trees over K can be assembled into a rainbow tree over G. This fiber construction works for nonsplit abelian extensions and for arbitrary missing colors in the fibers. Iteration produces multilevel and linear-maximum-degree families. These conditional constructions do not prove the unrestricted Graham-Sloane conjecture or its stronger bijective cyclic form.
- Open Access
- 4 September 2026
- Published by Elsevier in SSRN Electronic Journal
Links-Gould Positivity for Two-Block Alternating 2-Bridge Knots
Ishii conjectured that the coefficients of the Links-Gould polynomial of an alternating knot have signs determined, up to one global sign, by total degree parity. We prove the positive normalization of this conjecture for the two-block alternating 2-bridge knots D(p, q), with p, q ≥ 1, in Kohli's notation. More precisely, we give an explicit factorization of LG(D(p, q);-x,-y) as a sum of products of Laurent polynomials with nonnegative integer coefficients. The proof is symbolic and uses Kohli's three-term skein recurrence; exact computations serve only as independent checks. The result does not assert hole-freeness or log-concavity, and the conjecture for arbitrary alternating knots remains open.
- 4 September 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessLinks-Gould Positivity for Two-Block Alternating 2-Bridge Knots
Ishii conjectured that the coefficients of the Links-Gould polynomial of an alternating knot have signs determined, up to one global sign, by total degree parity. We prove the positive normalization of this conjecture for the two-block alternating 2-bridge knots D(p, q), with p, q ≥ 1, in Kohli's notation. More precisely, we give an explicit factorization of LG(D(p, q);-x,-y) as a sum of products of Laurent polynomials with nonnegative integer coefficients. The proof is symbolic and uses Kohli's three-term skein recurrence; exact computations serve only as independent checks. The result does not assert hole-freeness or log-concavity, and the conjecture for arbitrary alternating knots remains open.
- Open Access
- 3 September 2026
- Published by Elsevier in SSRN Electronic Journal
Exact Verification of the Line-Graph Signature Inequality at Order Nine
For a connected simple graph G, let c(G) = |E(G)|-|V (G)| + 1 and let s(L(G)) denote the positive minus negative adjacency inertia of its line graph. We certify that 2s(L(G)) ≤ c(G) + 1 for every graph G of order nine. The verification exhausts all 261,080 connected isomorphism classes and uses exact rational congruence, with an independent verification by integer characteristic polynomials and Sturm root counts. There are six equality classes, all unicyclic, and the inequality is strict on the other 261,074 classes. This is a finite result; the universal inequality remains open.
- 3 September 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessExact Verification of the Line-Graph Signature Inequality at Order Nine
For a connected simple graph G, let c(G) = |E(G)|-|V (G)| + 1 and let s(L(G)) denote the positive minus negative adjacency inertia of its line graph. We certify that 2s(L(G)) ≤ c(G) + 1 for every graph G of order nine. The verification exhausts all 261,080 connected isomorphism classes and uses exact rational congruence, with an independent verification by integer characteristic polynomials and Sturm root counts. There are six equality classes, all unicyclic, and the inequality is strict on the other 261,074 classes. This is a finite result; the universal inequality remains open.
- Open Access
- 3 September 2026
- Published by Elsevier in SSRN Electronic Journal
A Nine-Unit Fiber Floor in a Full Three-Cover Branch of Frankl's Conjecture
We derive exact restrictions inside the full minimal threecover branch of the current structure theory for a smallest empty-set-free height-five counterexample to Frankl's union-closed sets conjecture. If q0 is the size of the fibre with empty private support and q2 counts the excess members in the three two-private-coordinate fibres, then q0 + q2 ≥ 9. The proof combines deletion-block injections, exact source-capacity saturation, cross-fibre complement intersection, and height-three generation. Its last case uses a new near-extremal lemma: an intersectionclosed height-three family generated by five nonempty sets and having at least fifteen members is the empty set, five pairwise-disjoint generators, and nine or ten pairwise unions. The lemma is proved by a ground-independent reduction to B5. Twenty fail-closed exact checks, implemented twice at every proof-essential finite reduction, audit the boundary-eight case split and the Boolean classification. The result is strictly conditional: it does not eliminate the full three-cover branch, the four-cover branches, or the general height-five case. At the first residual size r = 10, for t = 27, the two independent bounds collapse the fibre parameters to the unique triple (q0, u, q2) = (4, 0, 6).
- 3 September 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessA Nine-Unit Fiber Floor in a Full Three-Cover Branch of Frankl's Conjecture
We derive exact restrictions inside the full minimal threecover branch of the current structure theory for a smallest empty-set-free height-five counterexample to Frankl's union-closed sets conjecture. If q0 is the size of the fibre with empty private support and q2 counts the excess members in the three two-private-coordinate fibres, then q0 + q2 ≥ 9. The proof combines deletion-block injections, exact source-capacity saturation, cross-fibre complement intersection, and height-three generation. Its last case uses a new near-extremal lemma: an intersectionclosed height-three family generated by five nonempty sets and having at least fifteen members is the empty set, five pairwise-disjoint generators, and nine or ten pairwise unions. The lemma is proved by a ground-independent reduction to B5. Twenty fail-closed exact checks, implemented twice at every proof-essential finite reduction, audit the boundary-eight case split and the Boolean classification. The result is strictly conditional: it does not eliminate the full three-cover branch, the four-cover branches, or the general height-five case. At the first residual size r = 10, for t = 27, the two independent bounds collapse the fibre parameters to the unique triple (q0, u, q2) = (4, 0, 6).
- Open Access
- 2 September 2026
- Published by Elsevier in SSRN Electronic Journal
A Shifted-Golomb Identity for the Full-Memory Prefix of Run-Constructed Almost Golomb Sequences
For the earliest, run-constructed almost Golomb sequence ar of order r ≥ 3, we prove the stronger prefix identity ar(n) = G(n-1) for every 3 ≤ n ≤ r, where G is the classical Golomb sequence. In particular, this proves the Prefix Conjecture ar(r) = G(r-1). The proof identifies the exact conjugacy between the cumulative run endpoints of the two sequences. We also make explicit a necessary interpretive repair: the pointwise minimality sentence in the original definition is inconsistent at n = 2 if read literally as a condition on the completed sequence, so our theorem uses the run construction stated in the source's existence theorem. Exact computations with two independent implementations are reported only as diagnostics.
- 2 September 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessA Shifted-Golomb Identity for the Full-Memory Prefix of Run-Constructed Almost Golomb Sequences
For the earliest, run-constructed almost Golomb sequence ar of order r ≥ 3, we prove the stronger prefix identity ar(n) = G(n-1) for every 3 ≤ n ≤ r, where G is the classical Golomb sequence. In particular, this proves the Prefix Conjecture ar(r) = G(r-1). The proof identifies the exact conjugacy between the cumulative run endpoints of the two sequences. We also make explicit a necessary interpretive repair: the pointwise minimality sentence in the original definition is inconsistent at n = 2 if read literally as a condition on the completed sequence, so our theorem uses the run construction stated in the source's existence theorem. Exact computations with two independent implementations are reported only as diagnostics.
- Open Access
- 2 September 2026
- Published by Elsevier in SSRN Electronic Journal
A Sharp 3-Degree Erdős-Ko-Rado Theorem for 4-Uniform Families
For an intersecting family F ⊆ [n] 4 , we prove that its minimum triple degree satisfies δ3(F) ≤ 1 for every n ≥ 9. The range is sharp: an explicit intersecting family on eight vertices has minimum triple degree two. The proof is elementary and self-contained. It treats n = 9 by a five-point link argument, while two disjoint triples outside a fixed edge settle every n ≥ 10. As an independent check of the two values n = 9, 10 not covered by Huang and Zhang's theorem, we also provide no-auxiliary CNF encodings and externally verified LRAT certificates for n = 9, 10.
- 2 September 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessA Sharp 3-Degree Erdős-Ko-Rado Theorem for 4-Uniform Families
For an intersecting family F ⊆ [n] 4 , we prove that its minimum triple degree satisfies δ3(F) ≤ 1 for every n ≥ 9. The range is sharp: an explicit intersecting family on eight vertices has minimum triple degree two. The proof is elementary and self-contained. It treats n = 9 by a five-point link argument, while two disjoint triples outside a fixed edge settle every n ≥ 10. As an independent check of the two values n = 9, 10 not covered by Huang and Zhang's theorem, we also provide no-auxiliary CNF encodings and externally verified LRAT certificates for n = 9, 10.
- Open Access
- 2 September 2026
- Published by Elsevier in SSRN Electronic Journal
A Strict Certified Search Extension for Erdős Problem 647
Let τ(m) denote the number of positive divisors of m. Erdős Problem 647 asks whether there is an n > 24 for which maxm<n(m + τ(m)) ≤ n + 2. We give a reproducible finite exclusion for 9,174,471,185,880,000,000 < n ≤ 9,180,628,549,092,000,000. It reconstructs all 96 residue classes in the published theorem-grade modular reduction, expands them into 50,784 arithmetic progressions, and checks 5,078,450,784 progression cells. Exact small-prime divisor lower bounds reject all but 21 cells; those 21 are factored independently and each violates one of the shifts 1 ≤ k ≤ 6. Combined with the reported previous computation through the left endpoint, this gives a strict new computational frontier at 9,180,628,549,092,000,000. The inherited prefix was not rerun here, and the global existence problem remains open.
- 2 September 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessA Strict Certified Search Extension for Erdős Problem 647
Let τ(m) denote the number of positive divisors of m. Erdős Problem 647 asks whether there is an n > 24 for which maxm<n(m + τ(m)) ≤ n + 2. We give a reproducible finite exclusion for 9,174,471,185,880,000,000 < n ≤ 9,180,628,549,092,000,000. It reconstructs all 96 residue classes in the published theorem-grade modular reduction, expands them into 50,784 arithmetic progressions, and checks 5,078,450,784 progression cells. Exact small-prime divisor lower bounds reject all but 21 cells; those 21 are factored independently and each violates one of the shifts 1 ≤ k ≤ 6. Combined with the reported previous computation through the left endpoint, this gives a strict new computational frontier at 9,180,628,549,092,000,000. The inherited prefix was not rerun here, and the global existence problem remains open.