Searcharxiv⌕ Search

arXiv subjects

Feihu Liu

Publications and source records attributed to Feihu Liu.

At least 37 records · Page 2Linked to original sources

The Frobenius problem for a class of quotients of numerical semigroups

Given a numerical semigroup $S$ and a positive integer $p$, the quotient $\frac{S}{p}=\{x\in \mathbb{N} \mid px\in S\}$ also forms a numerical semigroup. In this paper, we first characterize the Apéry set for a class of quotients of numerical semigroups. Under certain conditions, we then derive half-closed form formulas for their Frobenius number and genus. Furthermore, for specific values of part parameters, we obtain explicit formulas for the Frobenius number of certain quotients of numerical semigroups.

math.CO↗

Unimodular Equivalence of Integral Simplices

Testing the unimodular equivalence of two full-dimensional integral simplices can be reduced to testing unimodular permutation (UP) equivalence of two nonsingular matrices. We conduct a systematic study of UP-equivalence, which leads to the first average-case quasi-polynomial time algorithm, called \texttt{HEM}, for deciding the unimodular equivalence of $d$-dimensional integral simplices, as well as achieving a polynomial-time complexity with a failure probability less than $2.5 \times 10^{-7}$. A key ingredient is the introduction of the \emph{permuted Hermite normal form} and its associated \emph{pattern group}, which streamlines the UP-equivalence test by comparing canonical forms derived from induced coset representatives. We also present an acceleration strategy based on Smith normal forms. As a theoretical by-product, we prove that two full-dimensional integral simplices are unimodularly equivalent if and only if their $n$-dimensional pyramids are unimodularly equivalent. This resolves an open question posed by Abney-McPeek et al.

math.CO↗

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

MacMahon introduced partition analysis in his book ``Combinatory Analysis'' as a computational technique for solving problems related to systems of linear Diophantine equations and inequalities. This paper aims to develop a fundamental computational method for MacMahon's partition analysis. As applications, we present simplified computations for ``Han's formula'', the ``$k$-gon partitions problem'', and the ``two-dimensional problem''. Moreover, we apply our method to solve a challenging problem.

math.CO↗

Proof of a conjecture on graph polytope

Graph polytopes arising from vertex-weighted graphs were first introduced by Bóna, Ju, and Yoshida. We prove a conjecture stating that for any simple connected graph, the numerator polynomial of the Ehrhart series of its graph polytope is palindromic, using Stanley's reciprocity theorem. Furthermore, we introduce hypergraph polytopes and establish that every simple, connected, unimodular hypergraph polytope is an integer polytope. Additionally, for simple connected uniform hypergraph polytopes, we demonstrate that the numerator polynomial of their Ehrhart series is palindromic.

math.CO↗

The Sign Pattern Problem for Ehrhart Polynomials

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]^n$. This investigation yields partial results on the sign pattern problem for Ehrhart polynomials. Moreover, we show that for each dimension $d \geq 4$, there exists a $d$-dimensional integral polytope $\mathcal{P}$ such that arbitrarily many of the low-degree coefficients in the Ehrhart polynomial $i(\mathcal{P}, t)$ are negative, while all higher-degree coefficients are positive. Finally, we establish five embedding theorems that enable the sign pattern of a lower-dimensional integral polytope to be embedded into a higher-dimensional integral polytope in various ways. As an application, we completely resolve the Ehrhart coefficient sign pattern problem for dimensions $d = 7, 8, 9$.

math.CO↗

Electron correlations in kagome metals $AV_3Sb_5$ (A= K, Rb, Cs)

The investigation of electronic order-quantum phase interplay in kagome lattices commonly employs the extended Kagome-Hubbard model, where the critical parameters comprise on-site $(U)$ and intersite $(V)$ Coulomb interactions. In prototypical kagome metals \ch{AV3Sb5} (A = K, Rb, Cs), the geometrically frustrated quasi-2D architecture induces pressure-dependent complexity in vanadium d-electron correlations, necessitating systematic theoretical scrutiny. Utilizing the $d-dp$ model within constrained random phase approximation (cRPA), we quantified $U$, $V$, and Hund's coupling $J$ under hydrostatic pressure (0-9 GPa). While \ch{KV3Sb5} and \ch{RbV3Sb5} exhibit pressure-insensitive interaction parameters, \ch{CsV3Sb5} manifests anomalous discontinuities in $U$ and $V$ near $0.2$ GPa, suggesting a first-order electronic phase transition. This work establishes cRPA-derived interaction landscapes as critical predictors for pressure-tunable quantum phenomena in correlated kagome systems, offers a new insight into the understanding of the interplay between the CDW transition and the double superconductivity dome in \ch{CsV3Sb5} at low pressure.

cond-mat.str-el↗

On Frobenius Numbers of Shifted Power Sequences

We resolve the open problem of characterizing the Frobenius number $g(A)$ for shifted square sequences $A = (a, a+1^2, \ldots, a+k^2)$, confirming a conjecture of Einstein et al. (2007). By combining a combinatorial reduction to an optimization problem with Lagrange's Four-Square Theorem and generating function techniques, we derive an explicit formula for $g(A)$: a piecewise quadratic polynomial in $a$, classified by residue classes modulo $k^2$.

math.CO↗

Enumeration of Corona for Lozenge Tilings

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 [A380416] on the OEIS. We prove this conjecture by using the weighted adjacency matrix. Furthermore, we extend this result to a more general setting.

math.CO↗

Hankel Determinants for Convolution of Power Series: An Extension of Cigler's Results

Cigler considered certain shifted Hankel determinants of convolution powers of Catalan numbers and conjectured identities for these determinants. Recently, Fulmek gave a bijective proof of Cigler's conjecture. Cigler then provided a computational proof. We extend Cigler's determinant identities to the convolution of general power series $F(x)$, where $F(x)$ satisfies a certain type of quadratic equation. As an application, we present the Hankel determinant identities of convolution powers of Motzkin numbers.

math.CO↗

On the Frobenius Number and Genus of a Collection of Semigroups Generalizing Repunit Numerical Semigroups

Let $A=(a_1, a_2, \ldots, a_n)$ be a sequence of relative prime positive integers with $a_i\geq 2$. The Frobenius number $F(A)$ is the largest integer not belonging to the numerical semigroup $\langle A\rangle$ generated by $A$. The genus $g(A)$ is the number of positive integer elements not in $\langle A\rangle$. The Frobenius problem is to determine $F(A)$ and $g(A)$ for a given sequence $A$. In this paper, we study the Frobenius problem of $A=\left(a,h_1a+b_1d,h_2a+b_2d,\ldots,h_ka+b_kd\right)$ with some restrictions. An innovation is that $d$ can be a negative integer. In particular, when $A=\left(a,ba+d,b^2a+\frac{b^2-1}{b-1}d,\ldots,b^ka+\frac{b^k-1}{b-1}d\right)$, we obtain formulas for $F(A)$ and $g(A)$ when $a\geq k-1-\frac{d-1}{b-1}$. Our formulas simplify further for some special cases, such as Mersenne, Thabit, and repunit numerical semigroups. Finally, we partially solve an open problem for the Proth numerical semigroup.

math.NT↗

Ehrhart Polynomials of Order Polytopes: Interpreting Combinatorial Sequences on the OEIS

In this paper, we provide an overview of Ehrhart polynomials associated with order polytopes of finite posets, a concept first introduced by Stanley. We focus on their combinatorial interpretations for many sequences listed on the OEIS. We begin by exploring the Ehrhart series of order polytopes resulting from various poset operations, specifically the ordinal sum and direct sum. We then concentrate on the poset $P_λ$ associated with the Ferrers diagram of a partition $λ= (λ_1, λ_2, \ldots, λ_t)$. When $λ= (k, k-1, \ldots, 1)$, the Ehrhart polynomial is a shifted Hankel determinant of the well-known Catalan numbers; when $λ= (k, k, \ldots, k)$, the Ehrhart polynomial is solved by Stanley's hook content formula and is used to prove conjectures for the sequence [A140934] on the OEIS. When solving these problems, we rediscover Kreweras' determinant formula for the Ehrhart polynomial $\mathrm{ehr}(\mathcal{O}(P_λ), n)$ through the application of the Lindström-Gessel-Viennot lemma on non-intersecting lattice paths.

math.CO↗

Order Polytopes of Dimension $\leq 13$ are Ehrhart Positive

The order polytopes arising from the finite poset were first introduced and studied by Stanley. For any positive integer $d\geq 14$, Liu and Tsuchiya proved that there exists a non-Ehrhart positive order polytope of dimension $d$. They also proved that any order polytope of dimension $d\leq 11$ is Ehrhart positive. We confirm that any order polytope of dimension $12$ or $13$ is Ehrhart positive. This solves an open problem proposed by Liu and Tsuchiya. Besides, we also verify that any $h^{*}$-polynomial of order polytope of dimension $d\leq 13$ is real-rooted.

math.CO↗

On $P$-partitions Extended by Two-Rowed Plane Partitions

Inspired by Gansner's elegant $k$-trace generating function for rectangular plane partitions, we introduce two novel operators, $φ_{z}$ and $ψ_{z}$, along with their combinatorial interpretations. Through these operators, we derive a new formula for $P$-partitions of posets extended by two-rowed plane partitions. This formula allows us to compute explicit enumerative generating functions for various classes of $P$-partitions. Our findings encompass skew plane partitions, diamond-related two-rowed plane partitions, an extended $V$-poset, and ladder poset extensions, enriching the theory of $P$-partitions.

math.CO↗

A Fast Algorithm for Denumerants with Three Variables

Let $a,b,c$ be distinct positive integers such that $a<b<c$ and $\gcd(a,b,c)=1$. For any non-negative integer $n$, the denumerant function $d(n;a,b,c)$ denotes the number of solutions of the equation $ax_1+bx_2+cx_3=n$ in non-negative integers $x_1,x_2,x_3$. We present an algorithm that computes $d(n;a,b,c)$ with a time complexity of $O(\log b)$.

math.CO↗

Three Simple Reduction Formulas for the Denumerant Functions

Let $A$ be a nonempty set of positive integers. The restricted partition function $p_A(n)$ denotes the number of partitions of $n$ with parts in $A$. When the elements in $A$ are pairwise relatively prime positive integers, Ehrhart, Sertöz-Özlük, and Brown-Chou-Shiue derived three reduction formulas for $p_A(n)$ for $A$ with three parameters. We extend their findings for general $A$ using the Bernoulli-Barnes polynomials.

math.CO↗

Simple Generating Functions for Certain Young Tableaux with Periodic Walls

Recently, Banderier et. al. considered Young tableaux with walls, which are similar to standard Young tableaux, except that local decreases are allowed at some walls. We count the numbers $\overline{f}_m(n)$ of Young tableaux of shape $2\times mn$ with walls, that allow local decreases at the $(jm+i)$-th columns for all $j=0,\dots, n-1$ and $i=2,\dots, m$. We find that they have nice generating functions (thanks to the OEIS) as follows. $$\overline{F}_m(x)=\sum_{n\geq 0}\overline{f}_m(n)x^n=\prod_{k=1}^{m}C(e^{k\frac{2πi}{m}} x^\frac{1}{m})=\exp \left(\sum_{n\geq 1}\binom{2mn-1}{mn-1}\frac{x^n}{n}\right),$$ where $C(x)=\frac{1-\sqrt{1-4x}}{2x}$ is the well-known Catalan generating function. We prove generalizations of this result. Firstly, we use the Yamanouchi word to transform Young tableaux with horizontal walls into lattice paths. This results in a determinant formula. Then by lattice path counting theory, we obtain the generating functions $F_r(x)$ for the number of lattice paths from $(0,0)$ to $(\ell n-r,kn)$ that never go above the path $(N^kE^{\ell})^{n-1}N^kE^{\ell-r}$, where $N,E$ stand for north and east steps, respectively. We also obtain exponential formulas for $F_1(x)$ and $F_\ell(x)$. The formula for $\overline{F}_m(x)$ is thus proved since it is just $F_1(x)$ specializes at $k=\ell=m$.

math.CO↗

Generating functions for the quotients of numerical semigroups

We propose a class of generating functions denoted by $\textrm{RGF}_p(x)$, which is related to the Sylvester denumerant for the quotients of numerical semigroups. Using MacMahon's partition analysis, we can obtain $\textrm{RGF}_p(x)$ by extracting the constant term of a rational function. We use $\textrm{RGF}_p(x)$ to give a system of generators of the quotient of the numerical semigroup $\langle a_1,a_2,a_3\rangle$ by $p$ for a small positive integer $p$ and we characterise the generators for $\frac{\langle A\rangle}{p}$ for a general numerical semigroup $A$ and any positive integer $p$.

math.CO↗

On quotients of numerical semigroups for almost arithmetic progressions

Let $\langle A\rangle$ be the numerical semigroup generated by relatively prime positive integers $\{a_1,a_2,...,a_n\}$. The quotient of $\langle A\rangle$ with respect to a positive integer $p$ is defined by $\frac{\langle A\rangle}{p}=\{x\in \mathbb{N} \mid px\in \langle A\rangle\}$. The quotient $\frac{\langle A\rangle}{p}$ is known to be a semigroup but is hard to study. When $p$ is a positive divisor of $a_1$, we reduce the computation of the Apéry set of $\frac{a_1}{p}$ in $\frac{\langle A\rangle}{p}$ to a simple minimization problem. This allow us to obtain closed formulas of the Frobenius number of the quotient for some special numerical semigroups. These includes the cases when $\langle A\rangle$ is the almost arithmetic progressions, the almost arithmetic progressions with initial gaps, etc. In particular, we partially solve an open problem proposed by A. Adeniran et al.

math.NT↗