arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2006.02622math.COmath.AGmath.DS
收藏

代数约束下多项式偏序集的线性扩张计算

Computing linear extensions for polynomial posets subject to algebraic constraints

Shane Kepley, Konstantin Mischaikow, Lun Zhang

摘要:

在本文中,我们考虑的经典问题的计算线性扩张的一个给定的偏序集,这是众所周知的困难问题。然而,在我们的设置偏序集的元素是多元多项式,只有一个小的“可接受”的子集,这些线性扩展,确定隐含的评价地图,是感兴趣的。这个看似新颖的问题出现在基因调控网络的全局动力学研究中,在这种情况下,偏序集是一个布尔格。我们提供了一个算法来解决这个问题,使用线性规划的线性多项式的任意偏序。该算法利用从多项式继承的这种额外的代数结构来有效地计算容许线性扩展。生物相关的问题涉及多线性多项式,我们提供了一个建设嵌入到一个实例的线性问题。

英文摘要:

In this paper we consider the classical problem of computing linear extensions of a given poset which is well known to be a difficult problem. However, in our setting the elements of the poset are multivariate polynomials, and only a small "admissible" subset of these linear extensions, determined implicitly by the evaluation map, are of interest. This seemingly novel problem arises in the study of global dynamics of gene regulatory networks in which case the poset is a Boolean lattice. We provide an algorithm for solving this problem using linear programming for arbitrary partial orders of linear polynomials. This algorithm exploits this additional algebraic structure inherited from the polynomials to efficiently compute the admissible linear extensions. The biologically relevant problem involves multilinear polynomials and we provide a construction for embedding it into an instance of the linear problem.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑