Exploring the Phytochemical Landscape of the Early-Diverging Flowering Plant Amborella trichopoda Baill.

Although the evolutionary significance of the early-diverging flowering plant Amborella (Amborella trichopoda Baill.) is widely recognized, its metabolic landscape, particularly specialized metabolites, is currently underexplored. In this work, we analyzed the metabolomes of Amborella tissues using liquid chromatography high-resolution electrospray ionization mass spectrometry (LC-HR-ESI-MS). By matching the mass spectra of Amborella metabolites with those of authentic phytochemical standards in the publicly accessible libraries, 63, 39, and 21 compounds were tentatively identified in leaves, stems, and roots, respectively. Free amino acids, organic acids, simple sugars, cofactors, as well as abundant glycosylated and/or methylated phenolic specialized metabolites were observed in Amborella leaves. Diverse metabolites were also detected in stems and roots, including those that were not identified in leaves. To understand the biosynthesis of specialized metabolites with glycosyl and methyl modifications, families of small molecule UDP-dependent glycosyltransferases (UGTs) and O-methyltransferases (OMTs) were identified in the Amborella genome and the InterPro database based on conserved functional domains. Of the 17 phylogenetic groups of plant UGTs (A-Q) defined to date, Amborella UGTs are absent from groups B, N, and P, but they are highly abundant in group L. Among the 25 Amborella OMTs, 7 cluster with caffeoyl-coenzyme A (CCoA) OMTs involved in lignin and phenolic metabolism, whereas 18 form a clade with plant OMTs that methylate hydroxycinnamic acids, flavonoids, or alkaloids. Overall, this first report of metabolomes and candidate metabolic genes in Amborella provides a starting point to a better understanding of specialized metabolites and biosynthetic enzymes in this basal lineage of flowering plants

Rainbow Ramsey problems for the Boolean lattice

We address the following rainbow Ramsey problem: For posets $P,Q$ what is the smallest number $n$ such that any coloring of the elements of the Boolean lattice $B_n$ either admits a monochromatic copy of $P$ or a rainbow copy of $Q$. We consider both weak and strong (non-induced and induced) versions of this problem. We also investigate related problems on (partial) $k$-colorings of $B_n$ that do not admit rainbow antichains of size $k$