SearcharxivSearch

arXiv subjects

Pyuyi Chufeng Huang

Publications and source records attributed to Pyuyi Chufeng Huang.

3 recordsLinked to original sources

Cycle-Decorated Ribbon Complexes: Cut Coproducts and Alternating-Fence Positivity

Let $\alpha\models n$. We define a two-variable specialization $Z_\alpha(t,q)$ of the ribbon basis of noncommutative symmetric functions from cycle enumerators of an ordinary permutation and a rooted permutation, with $q$ recording reflection length. We realize $n!Z_\alpha(t,q)$ as the shifted bigraded Euler characteristic of an $\mathfrak S_n$-equivariant ordered-set-partition complex. When $\alpha$ has at most one odd part, each total decoration determines a set of simultaneous factorization cuts, and its fiber is the classical ribbon complex indexed by that cut set. This gives explicit nonnegative ribbon expansions for every bigraded homology representation. Organizing the complexes on labelled finite sets yields a counital differential graded comonoid in the Cauchy monoidal category of species, whose cut coproduct is compatible with the fiber decomposition. At a factorization cut, the induced map on top homology is injective; its cokernel has the near-concatenation ribbon character, and the kernel of the aggregate reduced cut coproduct on homology is $H_1$. For the zigzag compositions $\delta_n$, $Z_{\delta_n}(t,-1)$ is the order polynomial of the alternating fence. We prove \[ n!Z_{\delta_n}(t,-u)\in\mathbb N[t,u] \] using coefficientwise nonnegative recurrences derived from a Riccati equation. The same cut data define a nonnegative factorization defect $d=\lceil n/2\rceil-k-j$, which controls the homological support and makes the Euler sign constant on each defect layer. We also determine the full defect-zero edge by explicit Frobenius-character formulas.

math.CO

Bernstein Transfers and Greedy Records for Fence and Circular-Fence Order Polynomials

Let \(P_\eps\) be the fence poset associated with an orientation \(\eps\in\{+,-\}^{n-1}\) of a path. We define a greedy right-to-left record statistic \(\rec_\eps\) on \(S_n\) and prove \[ \sum_{\pi\in S_n}t^{\rec_\eps(\pi)}=n!\Omega(P_\eps;t), \] by a Bernstein-basis transfer between a continuous threshold recurrence and endpoint-refined order-preserving maps. Under reflection, this statistic agrees pointwise with Kahane's independently obtained greedy block statistic; the alternating specialization gives the zig-zag case posed by Ferroni, Morales, and Panova. A finite form of the transfer yields a direct recursive bijection for \(m\le n\), extended algorithmically to arbitrary alphabets. Refining by record set, direction, and terminal value identifies fixed fibers with decorated endpoint paths and pointed linear extensions of posets whose cover graphs are caterpillars. We also define cyclic records for every nonconstant orientation \(\eta\) of a cycle and prove \[ \sum_{\pi\in S_n}t^{\operatorname{crec}_\eta(\pi)} =n!\Omega(C_\eta;t). \] When the Hasse diagram is a cycle, reflection identifies these records with Kahane's circular blocks and establishes his circular-fence conjecture.

math.CO

Horizon-Uniform Sensitivity and Decay of Terminal Reward Perturbations in Discrete-Time Pontryagin Systems

We study local stationary solutions of finite-horizon discrete-time Pontryagin systems near a steady extremal. Suppose that the stationarity equation for the control is regular, the reduced state--costate map is hyperbolic, and the endpoint conditions satisfy a scaled transversality condition with respect to the stable and unstable subspaces. Then the linearized boundary-value problem admits an inverse whose Green estimate is uniform in the horizon. The Green kernel separates interior decay from the two reflections induced by the endpoint conditions. For $x_0=x_{\rm in}$ and $p_T=r_x(x_T,y)$, a contraction argument in a weighted norm proves existence and uniqueness in a neighborhood independent of $T$, together with uniform Lipschitz estimates and a pointwise quadratic remainder. We also derive an explicit admissible data radius and an a posteriori criterion for existence and local uniqueness near an approximate trajectory. For these graph boundary conditions, a one-sided Green estimate shows that a perturbation of the terminal reward changes the initial control and the gradient with respect to the initial state of the stationary objective by $O(e^{-\alpha_{\rm ter} T})$ for every $\alpha_{\rm ter}$ below the dichotomy rate. For linear-quadratic systems with invertible $A$, stabilizable $(A,B)$, $Q\succ0$, $R\succ0$, and a nonpositive terminal Hessian, a symplectic graph condition verifies the assumptions, and the finite-horizon Riccati matrix and initial feedback gain converge at rate $O(e^{-2\gamma T})$. Numerical experiments verify the certificates and the predicted decay rates.

math.OC