Exact Localisations of Feedback Sets

The feedback arc (vertex) set problem, shortened FASP (FVSP), is to transform a given multi digraph $G=(V,E)$ into an acyclic graph by deleting as few arcs (vertices) as possible. Due to the results of Richard M. Karp in 1972 it is one of the classic NP-complete problems. An important contribution of this paper is that the subgraphs $G_{\mathrm{el}}(e)$, $G_{\mathrm{si}}(e)$ of all elementary cycles or simple cycles running through some arc $e \in E$, can be computed in $\mathcal{O}\big(|E|^2\big)$ and $\mathcal{O}(|E|^4)$, respectively. We use this fact and introduce the notion of the essential minor and isolated cycles, which yield a priori problem size reductions and in the special case of so called resolvable graphs an exact solution in $\mathcal{O}(|V||E|^3)$. We show that weighted versions of the FASP and FVSP possess a Bellman decomposition, which yields exact solutions using a dynamic programming technique in times $\mathcal{O}\big(2^{m}|E|^4\log(|V|)\big)$ and $\mathcal{O}\big(2^{n}\Delta(G)^4|V|^4\log(|E|)\big)$, where $m \leq |E|-|V| +1$, $n \leq (\Delta(G)-1)|V|-|E| +1$, respectively. The parameters $m,n$ can be computed in $\mathcal{O}(|E|^3)$, $\mathcal{O}(\Delta(G)^3|V|^3)$, respectively and denote the maximal dimension of the cycle space of all appearing meta graphs, decoding the intersection behavior of the cycles. Consequently, $m,n$ equal zero if all meta graphs are trees. Moreover, we deliver several heuristics and discuss how to control their variation from the optimum. Summarizing, the presented results allow us to suggest a strategy for an implementation of a fast and accurate FASP/FVSP-SOLVER

Essential edges in Poisson random hypergraphs

Consider a random hypergraph on a set of N vertices in which, for k between 1 and N, a Poisson(N beta_k) number of hyperedges is scattered randomly over all subsets of size k. We collapse the hypergraph by running the following algorithm to exhaustion: pick a vertex having a 1-edge and remove it; collapse the hyperedges over that vertex onto their remaining vertices; repeat until there are no 1-edges left. We call the vertices removed in this process "identifiable". Also any hyperedge all of whose vertices are removed is called "identifiable". We say that a hyperedge is "essential" if its removal prior to collapse would have reduced the number of identifiable vertices. The limiting proportions, as N tends to infinity, of identifiable vertices and hyperedges were obtained by Darling and Norris. In this paper, we establish the limiting proportion of essential hyperedges. We also discuss, in the case of a random graph, the relation of essential edges to the 2-core of the graph, the maximal sub-graph with minimal vertex degree 2.Comment: 12 pages, 3 figures. Revised version with minor corrections/clarifications and slightly expanded introductio

Mutation of Arabidopsis SPLICEOSOMAL TIMEKEEPER LOCUS1 Causes Circadian Clock Defects

The circadian clock plays a crucial role in coordinating plant metabolic and physiological functions with predictable environmental variables, such as dusk and dawn, while also modulating responses to biotic and abiotic challenges. Much of the initial characterization of the circadian system has focused on transcriptional initiation, but it is now apparent that considerable regulation is exerted after this key regulatory step. Transcript processing, protein stability, and cofactor availability have all been reported to influence circadian rhythms in a variety of species. We used a genetic screen to identify a mutation within a putative RNA binding protein (SPLICEOSOMAL TIMEKEEPER LOCUS1 [STIPL1]) that induces a long circadian period phenotype under constant conditions. STIPL1 is a homolog of the spliceosomal proteins TFP11 (Homo sapiens) and Ntr1p (Saccharomyces cerevisiae) involved in spliceosome disassembly. Analysis of general and alternative splicing using a high-resolution RT-PCR system revealed that mutation of this protein causes less efficient splicing of most but not all of the introns analyzed. In particular, the altered accumulation of circadian-associated transcripts may contribute to the observed mutant phenotype. Interestingly, mutation of a close homolog of STIPL1, STIP-LIKE2, does not cause a circadian phenotype, which suggests divergence in function between these family members. Our work highlights the importance of posttranscriptional control within the clock mechanism. © 2012 American Society of Plant Biologists. All rights reserved

Random curves on surfaces induced from the Laplacian determinant

We define natural probability measures on cycle-rooted spanning forests (CRSFs) on graphs embedded on a surface with a Riemannian metric. These measures arise from the Laplacian determinant and depend on the choice of a unitary connection on the tangent bundle to the surface. We show that, for a sequence of graphs $(G_n)$ conformally approximating the surface, the measures on CRSFs of $G_n$ converge and give a limiting probability measure on finite multicurves (finite collections of pairwise disjoint simple closed curves) on the surface, independent of the approximating sequence. Wilson's algorithm for generating spanning trees on a graph generalizes to a cycle-popping algorithm for generating CRSFs for a general family of weights on the cycles. We use this to sample the above measures. The sampling algorithm, which relates these measures to the loop-erased random walk, is also used to prove tightness of the sequence of measures, a key step in the proof of their convergence. We set the framework for the study of these probability measures and their scaling limits and state some of their properties

Prediction of photoperiodic regulators from quantitative gene circuit models

Photoperiod sensors allow physiological adaptation to the changing seasons. The external coincidence hypothesis postulates that a light-responsive regulator is modulated by a circadian rhythm. Sufficient data are available to test this quantitatively in plants, though not yet in animals. In Arabidopsis, the clock-regulated genes CONSTANS (CO) and FLAVIN, KELCH, F-BOX (FKF1) and their lightsensitive proteins are thought to form an external coincidence sensor. We use 40 timeseries of molecular data to model the integration of light and timing information by CO, its target gene FLOWERING LOCUS T (FT), and the circadian clock. Among other predictions, the models show that FKF1 activates FT. We demonstrate experimentally that this effect is independent of the known activation of CO by FKF1, thus we locate a major, novel controller of photoperiodism. External coincidence is part of a complex photoperiod sensor: modelling makes this complexity explicit and may thus contribute to crop improvement

On implicational bases of closure systems with unique critical sets

We show that every optimum basis of a finite closure system, in D.Maier's sense, is also right-side optimum, which is a parameter of a minimum CNF representation of a Horn Boolean function. New parameters for the size of the binary part are also established. We introduce a K-basis of a general closure system, which is a refinement of the canonical basis of Duquenne and Guigues, and discuss a polynomial algorithm to obtain it. We study closure systems with the unique criticals and some of its subclasses, where the K-basis is unique. A further refinement in the form of the E-basis is possible for closure systems without D-cycles. There is a polynomial algorithm to recognize the D-relation from a K-basis. Thus, closure systems without D-cycles can be effectively recognized. While E-basis achieves an optimum in one of its parts, the optimization of the others is an NP-complete problem.Comment: Presented on International Symposium of Artificial Intelligence and Mathematics (ISAIM-2012), Ft. Lauderdale, FL, USA Results are included into plenary talk on conference Universal Algebra and Lattice Theory, June 2012, Szeged, Hungary 29 pages and 2 figure