Concept
Element (mathematics)
Related publications (26)
Circadian dynamics of RNA localisation in the mammalian liver
Gene expression in eukaryotes is a complex multi-step process. It starts in the nucleus with transcription, the synthesis of a mRNA copy from a DNA template. While in the nucleus, the RNA transcript is subject to multiple co- and post-transcriptional modif ...
EPFL2021Packing the Boolean lattice with copies of a poset
The Boolean lattice (2[n],subset of) is the family of all subsets of [n]={1,MIDLINE HORIZONTAL ELLIPSIS,n}, ordered by inclusion. Let P be a partially ordered set. We prove that if n is sufficiently large, then there exists a packing P of copies of P in (2 ...
WILEY2020Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma
We consider integer programming problems in standard form max{c(T)x : Ax = b, x >= 0, x is an element of Z(n)} where A is an element of Z(mxn), b is an element of Z(m), and c is an element of Z(n). We show that such an integer program can be solved in time ...
ASSOC COMPUTING MACHINERY2020Learning Non-Parametric Models with Guarantees: A Smooth Lipschitz Interpolation Approach
Colin Neil Jones, Emilio Maddalena
We propose a non-parametric regression method that does not rely on the structure of the ground-truth, but only on its regularity properties. The methodology can be readily used for learning surrogate models of nonlinear dynamical systems from data, while ...
2019Minimal Polynomials Of Unipotent Elements Of Non-Prime Order In Irreducible Representations Of The Exceptional Algebraic Groups In Some Good Characteristics
In a number of cases the minimal polynomials of the images of unipotent elements of non-prime order in irreducible representations of the exceptional algebraic groups in good characteristics are found. It is proved that if p > 5 for a group of type E-8 and ...
2019Proximity results and faster algorithms for Integer Programming using the Steinitz Lemma
We consider integer programming problems in standard form max{c(T)x : Ax = b; x >= 0, x is an element of Z(n)} where A is an element of Z(mxn), b is an element of Z(m) and c is an element of Z(n). We show that such an integer program can be solved in time ...
ASSOC COMPUTING MACHINERY2018Signalling strength determines proapoptotic functions of STING
Freddy Radtke, Andrea Ablasser, Ute Koch, Muhammet Fatih Gülen
Mammalian cells use cytosolic nucleic acid receptors to detect pathogens and other stress signals. In innate immune cells the presence of cytosolic DNA is sensed by the cGAS-STING signalling pathway, which initiates a gene expression programme linked to ce ...
Springer Nature2017Exchange anisotropy in the skyrmion host GaV4S8
Using ferromagnetic resonance spectroscopy at 34 GHz we explored the magnetic anisotropy of single-crystalline GaV4S8 in the field-polarized magnetic state. We describe the data in terms of an easy-axis type uniaxial anisotropy with an anisotropy constant ...
Institute of Physics2017Distinct distances on regular varieties over finite fields
In this paper we study some generalized versions of a recent result due to Covert, Koh, and Pi (2015). More precisely, we prove that if a subset in a regular variety satisfies vertical bar epsilon vertical bar >> q(d-1/2 + 1/k-1), then Delta(k,F)(epsilon) ...
Elsevier2017Small subset sums
Let parallel to.parallel to be a norm in R-d whose unit ball is B. Assume that V subset of B is a finite set of cardinality n, with Sigma(v is an element of V) v = 0. We show that for every integer k with 0
Elsevier Science Inc2016