Results 81 to 90 of about 4,003 (147)
Matroid connectivity and singularities of configuration hypersurfaces. [PDF]
Lett Math Phys, 2021 Denham G, Schulze M, Walther U.
europepmc +1 more source
Matroid bases with cardinality constraints on the intersection. [PDF]
Math Program, 2022 Lendl S, Peis B, Timmermans V.
europepmc +1 more source
Powerful Sets: a Generalisation of Binary Matroids
The Electronic Journal of Combinatorics, 2018 A set $S\subseteq\{0,1\}^E$ of binary vectors, with positions indexed by $E$, is said to be a powerful code if, for all $X\subseteq E$, the number of vectors in $S$ that are zero in the positions indexed by $X$ is a power of 2. By treating binary vectors as characteristic vectors of subsets of $E$, we say that a set $S\subseteq2^E$ of subsets of $E ...
Farr, Graham E., Wang, Andrew Y. Z.
openaire +3 more sources
Algebras, Graphs and Ordered Sets - ALGOS 2020 & the Mathematical Contributions of Maurice Pouzet. [PDF]
Order (Dordr), 2023 Couceiro M, Duffus D.
europepmc +1 more source
Smoothing of Binary Codes, Uniform Distributions, and Applications. [PDF]
Entropy (Basel), 2023 Pathegama M, Barg A.
europepmc +1 more source
Generation of all randomizations using circuits. [PDF]
Ann Inst Stat Math, 2023 Pesce E +3 more
europepmc +1 more source
Separating cocircuits in binary matroids
Linear Algebra and its Applications, 1982 AbstractA cocircuit of a matroid is separating if deleting it leaves a separable matroid. We give an effecient algorithm which finds a separating cocircuit or a Fano minor in a binary matroid, thus proving constructively a theorem of Tutte. Using this algorithm and a new recursive characterization of bond matroids, we give a new method for testing ...
openaire +2 more sources
On the firefighter problem with spreading vaccination for maximizing the number of saved nodes: the IP model and LP rounding algorithms. [PDF]
Optim Lett, 2022 Yang Y, Chen PA, Lee YC, Fanchiang YY.
europepmc +1 more source
Note on binary simplicial matroids
Discrete Mathematics, 1984 Binary simplicial matroids are characterized among binary matroids. Using lemma 2: ''A binary simplicial matroid has a base whose associated fundamental hypergraph is isomorphic to a simplicial hypergraph.'', and a previous characterization of simplicial hypergraphs.
openaire +1 more source
Flip Distances Between Graph Orientations. [PDF]
Algorithmica, 2021 Aichholzer O +6 more
europepmc +1 more source