Results 61 to 70 of about 4,003 (147)
Matroidal structure of generalized rough sets based on symmetric and transitive relations [PDF]
, 2012 Rough sets are efficient for data pre-process in data mining. Lower and upper approximations are two core concepts of rough sets. This paper studies generalized rough sets based on symmetric and transitive relations from the operator-oriented view by ...
Yang, Bin, Zhu, William
core
On Binary Matroid Minors and Applications to Data Storage over Small Fields
, 2017 Locally repairable codes for distributed storage systems have gained a lot of interest recently, and various constructions can be found in the literature.
A Dimakis +13 more
core +1 more source
Minimally 3-connected binary matroids
European Journal of Combinatorics, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Anderson, Joe, Wu, Haidong
openaire +2 more sources
Discrete Mathematics, 1988 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Cycle covering of binary matroids
Journal of Combinatorial Theory, Series B, 1989 AbstractMotivated by some problems which had been left open in a previous paper [M. Tarsi, J. Combin. Theory Ser. B 39 (1985), 346–352], we present the following results: 1.1. Every bridgeless binary matroid with no F7∗ minor (in particular every regular matroid) had a cycle in which every element is covered exactly 4 times.2.2.
Jamshy, Ury, Tarsi, Michael
openaire +1 more source
A construction for binary matroids
Discrete Mathematics, 1987 A family of subsets of a ground set closed under the operation of taking symmetric differences is the family of cycles of a binary matroid, whose circuits are the minimal members of this collection. Using this fact two binary matroids are derived from graphic and ergodic matroids. Cocycles of the first one are cutsets or balancing sets. Cocycles of the
Barahona, F., CONFORTI, MICHELANGELO
openaire +2 more sources
Binary Matroids and Quantum Probability Distributions [PDF]
, 2010 We characterise the probability distributions that arise from quantum circuits all of whose gates commute, and show when these distributions can be classically simulated efficiently.
Shepherd, Dan
core
Turán's Triangle Theorem and Binary Matroids
European Journal of Combinatorics, 1989 A special case of a theorem of Turán is that a graph on v vertices, with no loops, parallel edges, or triangles, has no more than \(\lfloor v/2\rfloor \lceil v/2\rceil\) edges. This bound is achieved by a graph G if and only if \(G\cong K_{\lfloor v/2\rfloor,\lceil v/2\rceil}\). We generalize this result to binary maroids.
openaire +2 more sources
Connected hyperplanes in binary matroids
Linear Algebra and its Applications, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lemos, Manoel, Melo, T.R.B.
openaire +2 more sources
Odd circuits in dense binary matroids [PDF]
, 2014 We show that, for each real number $\alpha > 0$ and odd integer $k\ge 5$ there is an integer $c$ such that, if $M$ is a simple binary matroid with $|M| \ge \alpha 2^{r(M)}$ and with no $k$-element circuit, then $M$ has critical number at most $c$.
Geelen, Jim, Nelson, Peter
core