Results 51 to 60 of about 335 (183)
A matroid associated with a phylogenetic tree [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 Special issue PRIMA ...
Andreas Dress +2 more
doaj +1 more source
Identifiability of points and rigidity of hypergraphs under algebraic constraints
Journal of the London Mathematical Society, Volume 114, Issue 1, July 2026.Abstract The identifiability problem arises naturally in a number of contexts in mathematics and computer science. Specific instances include local or global rigidity of graphs and unique completability of partially‐filled tensors subject to rank conditions.
James Cruickshank +3 more
wiley +1 more source
The Electronic Journal of Combinatorics, 2018 Regular matroids are binary matroids with no minors isomorphic to the Fano matroid $F_7$ or its dual $F_7^*$. Seymour proved that 3-connected regular matroids are either graphs, cographs, or $R_{10}$, or else can be decomposed along a non-minimal exact 3-separation induced by $R_{12}$.
openaire +2 more sources
Discrete Mathematics, 1995 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
James G. Oxley, Haidong Wu
openaire +1 more source
Covering-Based Rough Sets on Eulerian Matroids
Journal of Applied Mathematics, 2013 Rough set theory is an efficient and essential tool for dealing with vagueness and granularity in information systems. Covering-based rough set theory is proposed as a significant generalization of classical rough sets.
Bin Yang, Ziqiong Lin, William Zhu
doaj +1 more source
The geometry of zonotopal algebras II: Orlik–Terao algebras and Schubert varieties
Proceedings of the London Mathematical Society, Volume 132, Issue 6, June 2026.Abstract Zonotopal algebras, introduced by Postnikov–Shapiro–Shapiro, Ardila–Postnikov, and Holtz–Ron, show up in many different contexts, including approximation theory, representation theory, Donaldson–Thomas theory, and hypertoric geometry. In the first half of this paper, we construct a perfect pairing between the internal zonotopal algebra of a ...
Colin Crowley, Nicholas Proudfoot
wiley +1 more source
A Miyaoka–Yau inequality for hyperplane arrangements in CPn$\mathbb {CP}^n$
Journal of the London Mathematical Society, Volume 113, Issue 4, April 2026.Abstract Let H$\mathcal {H}$ be a hyperplane arrangement in CPn$\mathbb {CP}^n$. We define a quadratic form Q$Q$ on RH$\mathbb {R}^{\mathcal {H}}$ that is entirely determined by the intersection poset of H$\mathcal {H}$. Using the Bogomolov–Gieseker inequality for parabolic bundles, we show that if a∈RH$\mathbf {a}\in \mathbb {R}^{\mathcal {H}}$ is ...
Martin de Borbon, Dmitri Panov
wiley +1 more source
Discrete Mathematics, 1979 Simoes-Pereira has defined [5,6,7] a matroidal family of graphs and has proved the existence of four matroidal families, called F"1F"2F"3and F"4 the set of polygons [@d]. Andreae [1] has shown that for every n, integer, n>=2, there is a matroidal family M"n (F"4=M"2, F"1=M"3).
openaire +2 more sources
Journal of Algebraic Combinatorics, 2001 In [Usp. Mat. Nauk 42, No. 2, 107-134 (1987; Zbl 0629.14035), Sov. Math., Dokl. 35, 63-66 (1987); translation from Dokl. Akad. Nauk SSSR 292, 524-528 (1987; Zbl 0645.22005), and Russ. Math. Surv. 42, No. 2, 133-168 (1987; Zbl 0639.14031)] \textit{I. M. Gelfand} and \textit{V. V. Serganova} generalize the notion of matroid to Coxeter matroids.
Vince, Andrew, White, Neil
openaire +1 more source
Graphs and Matroids Weighted in a Bounded Incline Algebra
The Scientific World Journal, 2014 Firstly, for a graph weighted in a bounded incline algebra (or called a dioid), a longest path problem (LPP, for short) is presented, which can be considered the uniform approach to the famous shortest path problem, the widest path problem, and the most ...
Ling-Xia Lu, Bei Zhang
doaj +1 more source