Results 181 to 190 of about 10,447 (245)

DNA Methylation Shapes Seed‐Borne Microbiome and Proteome Responses During Early Maize‐Beneficial Bacteria Interactions

open access: yesPlant, Cell &Environment, Volume 49, Issue 8, Page 5477-5496, August 2026.
ABSTRACT Microorganism and plant interactions are crucial for development and environmental adaptation. Plant growth promoting bacteria enhance agricultural productivity in a sustainable manner, while epigenetic modifications such as DNA methylation regulate gene expression and adaptive responses.
Pedro Igor Zocateli   +12 more
wiley   +1 more source

Fine multidegrees, universal Gröbner bases, and matrix Schubert varieties

open access: yesJournal of the London Mathematical Society, Volume 114, Issue 2, August 2026.
Abstract We give a criterion for a collection of polynomials to be a universal Gröbner basis for an ideal in terms of the multidegree of the closure of the corresponding affine variety in (P1)N$(\mathbb {P}^1)^N$. This criterion can be used to give simple proofs of several existing results on universal Gröbner bases.
Daoji Huang, Matt Larson
wiley   +1 more source

Finding an almost perfect matching in a hypergraph avoiding forbidden submatchings

open access: yesJournal of the London Mathematical Society, Volume 114, Issue 2, August 2026.
Abstract In 1973, Erdős conjectured the existence of high girth (n,3,2)$(n,3,2)$‐Steiner systems. Recently, Glock, Kühn, Lo, and Osthus and independently Bohman and Warnke proved the approximate version of Erdős' conjecture. Recently, Kwan, Sah, Sawhney, and Simkin proved Erdős' conjecture.
Michelle Delcourt, Luke Postle
wiley   +1 more source

How to see the forest despite the trees

open access: yesJournal of the London Mathematical Society, Volume 114, Issue 2, August 2026.
Abstract One of the major starting points of discrete optimization is the theorem of Nash‐Williams and Tutte on the existence of k$k$ disjoint spanning trees of a graph, along with its counterpart on the existence of k$k$ forests covering all edges of the graph.
Erika Bérczi‐Kovács, András Frank
wiley   +1 more source

Lower bounds for cube‐ideal set‐systems

open access: yesProceedings of the London Mathematical Society, Volume 133, Issue 2, August 2026.
Abstract A set‐system S⊆{0,1}n$S\subseteq \lbrace 0,1\rbrace ^n$ is cube‐ideal if its convex hull can be described by capacity and generalized set covering inequalities. In this paper, we use combinatorics, convex geometry, and polyhedral theory to give exponential lower bounds on the size of cube‐ideal set‐systems, and linear lower bounds on their ...
Ahmad Abdi   +3 more
wiley   +1 more source

Maximal subgroups of free projection‐ and idempotent‐generated semigroups with applications to partition monoids

open access: yesProceedings of the London Mathematical Society, Volume 133, Issue 2, August 2026.
Abstract This paper investigates the maximal subgroups of a free projection‐generated regular ∗$*$‐semigroup PG(P)${{\textsf {PG}}}(P)$ over a projection algebra P$P$, and their relationship to the maximal subgroups of the free idempotent‐generated semigroup IG(E)${{\textsf {IG}}}(E)$ over the corresponding biordered set E=E(P)$E = {{\textsf {E}}}(P)$.
James East   +3 more
wiley   +1 more source

A Problem on Bipartite Graphs

open access: yesThe American Mathematical Monthly, 1975
openaire   +1 more source

Home - About - Disclaimer - Privacy