Results 131 to 140 of about 4,343 (225)

Matroid lifts and representability

, 2023
A 1965 result of Crapo shows that every elementary lift of a matroid $M$ can be constructed from a linear class of circuits of $M$. In a recent paper, Walsh generalized this construction by defining a rank-$k$ lift of a matroid $M$ given a rank-$k ...
Walsh, Zach, Bernstein, Daniel Irving
core  

Matroidal graphs

Discrete Mathematics, 1977
AbstractTwo edges of a graph are said to form a couple when their nodes can be labelled A, B, C, D so that A is adjacent to B but not to C, and D is adjacent to C but not to B. A graph is called matroidal if the binary relation “equals to or forms a couple with” among its edges is an equivalence relation. The structure of matroidal graphs is determined.
openaire   +2 more sources

The Lazy Matroid Problem

, 2017
in Springer series Lecture Notes in Computer Science, vol. 8705This article introduces the lazy matroid problem, which captures the goal of saving time or money in certain task selection scenarios.
Monnot, Jérôme, Gourvès, Laurent, Pagourtzis, Aris T.   +2 more
core   +2 more sources

Transversals and matroid partition

, 1965
In section 1, transversal matroids are associated with ""systems of distinct representatives"" (i.e., transversals) and, more generally, matching matroids are associated with matchings in graphs. The transversal matroids and a theorem of P. J. Higgins on
Edmonds, J; Fulkerso.Dr
core   +1 more source

Multi-agent learning via gradient ascent activity-based credit assignment. [PDF]

Sci Rep, 2023
Sabri O, Lehéricy L, Muzy A.
europepmc   +1 more source

Saturation and periodic self-stress in geometric auxetics. [PDF]

R Soc Open Sci, 2022
Borcea CS, Streinu I.
europepmc   +1 more source

Matroid pada suatu graph [PDF]

, 1993
Diberikan graph G(E,V) dimana E himpunan edge-edge dan .V himpunan vertex-vertex dari G. • Matroid pada E(G) yaitu dengan menentukan koleksi dari subset-subset E yang memenuhi salah satu dari tiga axioma yang akan dibahas yaitu axioma base merupakan ...
Umiyatun , Elly
core  

Elliptic arrangements of complex multiplication type

Forum of Mathematics, Sigma
We provide a natural definition of an elliptic arrangement, extending the classical framework to an elliptic curve $\mathcal {E}$ with complex multiplication.
Luca Moci, Roberto Pagaria, Maddalena Pismataro, Alejandro Vargas   +3 more
doaj   +1 more source

Tropical ideals do not realise all Bergman fans. [PDF]

Res Math Sci, 2021
Draisma J, Rincón F.
europepmc   +1 more source

Coloring matroids

Discrete Mathematics, 1997
``Good'' colorings of a matroid partition the ground set \(E=E_1\cup E_2\cup\cdots\cup E_c\) such that every transversal (\(T\subseteq E\) with \(|T\cap E_i|\leq 1\)) is independent, and such that for every line \(\ell\subseteq E\) some \(\ell\cap E_i\) is a singleton. This notion is due to Falk and Jambu [unpublished preprint, 1989]. Here it is proved
openaire   +1 more source