Classes of wiring diagrams and their invariants

代数实验设计：理论与计算

Algebraic Experimental Design: Theory and Computation

本文利用多项式动力系统和Stanley-Reisner理论，构建了保证唯一最小布线图识别的算法，揭示了布线图唯一性与约化Gröbner基的联系，并提供了启发式数据生成方法。

A unified approach to reverse engineering and data selection for unique network identification

Due to cost concerns, it is optimal to gain insight into the connectivity of biological and other networks using as few experiments as possible. Data selection for unique network connectivity identification has been an open problem since the introduction of algebraic methods for reverse engineering for almost two decades. In this manuscript we determine what data sets uniquely identify the unsigned wiring diagram corresponding to a system that is discrete in time and space. Furthermore, we answer the question of uniqueness for signed wiring diagrams for Boolean networks. Computationally, unsig…

Algebraic network reconstruction of discrete dynamical systems

We present a computational algebra solution to reverse engineering the network structure of discrete dynamical systems from data. We use monomial ideals to determine dependencies between variables that encode constraints on the possible wiring diagrams underlying the process generating the discrete-time, continuous-space data. Our work assumes that each variable is either monotone increasing or decreasing. We prove that with enough data, even in the presence of small noise, our method can reconstruct the correct unique wiring diagram.

$π_1$-classification of real arrangements with up to eight lines

One of the open questions in the geometry of line arrangements is to what extent does the incidence lattice of an arrangement determine its fundamental group. Line arrangements of up to 6 lines were recently classified by K.M. Fan, and it turns out that the incidence lattice of such arrangements determines the projective fundamental group. We use actions on the set of wiring diagrams, introduced in [GTV] (math.AG/0107178), to classify real arrangements of up to 8 lines. In particular, we show that the incidence lattice of such arrangements determines both the affine and the projective fundamen…

Cohomology classes of interval positroid varieties and a conjecture of Liu

To each finite subset of $\mathbb{Z}^2$ (a diagram), one can associate a subvariety of a complex Grassmannian (a diagram variety), and a representation of a symmetric group (a Specht module). Liu has conjectured that the cohomology class of a diagram variety is represented by the Frobenius characteristic of the corresponding Specht module. We give a counterexample to this conjecture. However, we show that for the diagram variety of a permutation diagram, Liu's conjectured cohomology class $σ$ is at least an upper bound on the actual class $τ$, in the sense that $σ- τ$ is a nonnegative linear c…

Refined floor diagrams from higher genera and lambda classes

We show that, after the change of variables $q=e^{iu}$, refined floor diagrams for $\mathbb{P}^2$ and Hirzebruch surfaces compute generating series of higher genus relative Gromov-Witten invariants with insertion of a lambda class. The proof uses an inductive application of the degeneration formula in relative Gromov-Witten theory and an explicit result in relative Gromov-Witten theory of $\mathbb{P}^1$. Combining this result with the similar looking refined tropical correspondence theorem for log Gromov-Witten invariants, we obtain some non-trivial relation between relative and log Gromov-Wit…