Black Box Low Tensor-Rank Approximation Using Fiber-Crosses

In this article we introduce a black box type algorithm for the approximation of tensors A in high dimension d. The algorithm adaptively determines the positions of entries of the tensor that have to be computed or read, and using these (few) entries it constructs a low rank tensor approximation X that minimizes the ? ₂-distance between A and X at the chosen positions. The full tensor A is not required, only the evaluation of A at a few positions. The minimization problem is solved by Newton’s method, which requires the computation and evaluation of the Hessian. For efficiency reasons the positions are located on fiber-crosses of the tensor so that the Hessian can be assembled and evaluated in a data-sparse form requiring a complexity of $\mathcal{O}(Pd)$ , where P is the number of fiber-crosses and d the order of the tensor.     

Convergence of goal‐oriented adaptive finite element methods for nonsymmetric problems

In this article, we develop convergence theory for a class of goal‐oriented adaptive finite element algorithms for second‐order nonsymmetric linear elliptic equations. In particular, we establish contraction results for a method of this type for Dirichlet problems involving the elliptic operator with A Lipschitz, symmetric positive definite, with b divergence‐free, and with . We first describe the problem class and review some standard facts concerning conforming finite element discretization and error‐estimate‐driven adaptive finite element methods (AFEM). We then describe a goal‐oriented variation of standard AFEM. Following the recent work of Mommer and Stevenson for symmetric problems, we establish contraction and convergence of the goal‐oriented method in the sense of the goal function. Our analysis approach is signficantly different from that of Mommer and Stevenson, combining the recent contraction frameworks developed by Cascon, Kreuzer, Nochetto, and Siebert; by Nochetto, Siebert, and Veeser; and by Holst, Tsogtgerel, and Zhu. We include numerical results, demonstrating performance of our method with standard goal‐oriented strategies on a convection problem. © 2015 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 32: 479–509, 2016     

Inference of an oscillating model for the yeast cell cycle

High-throughput techniques allow measurement of hundreds of cell components simultaneously. The inference of interactions between cell components from these experimental data facilitates the understanding of complex regulatory processes. Differential equations have been established to model the dynamic behavior of these regulatory networks quantitatively. Usually traditional regression methods for estimating model parameters fail in this setting, since they overfit the data. This is even the case, if the focus is on modeling subnetworks of, at most, a few tens of components. In a Bayesian learning approach, this problem is avoided by a restriction of the search space with prior probability distributions over model parameters.This paper combines both differential equation models and a Bayesian approach. We model the periodic behavior of proteins involved in the cell cycle of the budding yeast Saccharomyces cerevisiae, with differential equations, which are based on chemical reaction kinetics. One property of these systems is that they usually converge to a steady state, and lots of efforts have been made to explain the observed periodic behavior. We introduce an approach to infer an oscillating network from experimental data. First, an oscillating core network is learned. This is extended by further components by using a Bayesian approach in a second step. A specifically designed hierarchical prior distribution over interaction strengths prevents overfitting, and drives the solutions to sparse networks with only a few significant interactions.We apply our method to a simulated and a real world dataset and reveal main regulatory interactions. Moreover, we are able to reconstruct the dynamic behavior of the network.     

On the classification of all self-dual additive codes over GF(4) of length up to 12

We consider additive codes over GF(4) that are self-dual with respect to the Hermitian trace inner product. Such codes have a well-known interpretation as quantum codes and correspond to isotropic systems. It has also been shown that these codes can be represented as graphs, and that two codes are equivalent if and only if the corresponding graphs are equivalent with respect to local complementation and graph isomorphism. We use these facts to classify all codes of length up to 12, where previously only all codes of length up to 9 were known. We also classify all extremal Type II codes of length 14. Finally, we find that the smallest Type I and Type II codes with trivial automorphism group have length 9 and 12, respectively.     

Odd H-depth and H-separable extensions

Let C _n (A,B) be the relative Hochschild bar resolution groups of a subring B ⊆ A. The subring pair has right depth 2n if C _n+1(A,B) is isomorphic to a direct summand of a multiple of C _n (A,B) as A-B-bimodules; depth 2n + 1 if the same condition holds only as B-B-bimodules. It is then natural to ask what is defined if this same condition should hold as A-A-bimodules, the so-called H-depth 2n − 1 condition. In particular, the H-depth 1 condition coincides with A being an H-separable extension of B. In this paper the H-depth of semisimple subalgebra pairs is derived from the transpose inclusion matrix, and for QF extensions it is derived from the odd depth of the endomorphism ring extension. For general extensions characterizations of H-depth are possible using the H-equivalence generalization of Morita theory.     

Chern classes of tropical vector bundles

We introduce tropical vector bundles, morphisms and rational sections of these bundles and define the pull-back of a tropical vector bundle and of a rational section along a morphism. Most of the definitions presented here for tropical vector bundles will be contained in Torchiani, C., Line Bundles on Tropical Varieties, Diploma thesis, Technische Universität Kaiserslautern, Kaiserslautern, 2010, for the case of line bundles. Afterwards we use the bounded rational sections of a tropical vector bundle to define the Chern classes of this bundle and prove some basic properties of Chern classes. Finally we give a complete classification of all vector bundles on an elliptic curve up to isomorphisms.     

A note on records in a random sequence

In an infinite sequence of independent identically distributed continuous random variables we study the number of strings of two subsequent records interrupted by a given number of non-records. By embedding in a marked Poisson process we prove that these counts are independent and Poisson distributed. Also the distribution of the number of uninterrupted strings of records is considered.     

Symmetric invariant cocycles on the duals of q-deformations

We prove that for q∈C^? not a nontrivial root of unity any symmetric invariant 2-cocycle for a completion of Uqg is the coboundary of a central element. Equivalently, a Drinfeld twist relating the coproducts on completions of Uqg and Ug is unique up to coboundary of a central element. As an application we show that the spectral triple we defined in an earlier paper for the q-deformation of a simply connected semisimple compact Lie group G does not depend on any choices up to unitary equivalence.