Results 71 to 80 of about 4,343 (225)
The Base-Matroid and Inverse Combinatorial Optimization [PDF]
, 2003 A new kind of matroid is introduced: this matroid is defined starting from any matroid and one of its bases, hence we call it Base-Matroid. Besides some properties of the base-matroid, a non trivial algorithm for the solution of the related matroid ...
DELL'AMICO, Mauro +5 more
core +1 more source
Canonical forms of oriented matroids
Bulletin of the London Mathematical Society, Volume 58, Issue 1, January 2026.Abstract Positive geometries are semialgebraic sets equipped with a canonical differential form whose residues mirror the boundary structure of the geometry. Every full‐dimensional projective polytope is a positive geometry. Motivated by the canonical forms of polytopes, we construct a canonical form for any tope of an oriented matroid inside the Orlik–
Christopher Eur, Thomas Lam
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
Matroid base polytope decomposition
, 2011 Let P(M) be the matroid base polytope of a matroid M. A matroid base polytope decomposition of P(M) is a decomposition of the form P(M) =\cup_i=1P(Mi) where each P(Mi) is also a matroid base polytope for some matroid Mi, and for each 1\le i \neq j\le t ...
Chatelain, Vanessa +1 more
core +3 more sources
Elementary lift and single element coextension of a binary gammoid
AKCE International Journal of Graphs and CombinatoricsIt is known that every binary elementary lift of a binary matroid is a matroid obtained by applying the splitting operation on that matroid. An elementary lift of a binary gammoid need not be a binary gammoid.
Shital Dilip Solanki +2 more
doaj +1 more source
Interpolation, box splines, and lattice points in zonotopes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 Given a finite list of vectors $X \subseteq \mathbb{R}^d$, one can define the box spline $B_X$. Box splines are piecewise polynomial functions that are used in approximation theory. They are also interesting from a combinatorial point of view and many of
Matthias Lenz
doaj +1 more source
Journal of the London Mathematical Society, Volume 113, Issue 1, January 2026.Abstract In 1935, Philip Hall published what is often referred to as ‘Hall's marriage theorem’ in a short paper (P. Hall, J. Lond. Math. Soc. (1) 10 (1935), no. 1, 26–30.) This paper has been very influential. I state the theorem and outline Hall's proof, together with some equivalent (or stronger) earlier results, and proceed to discuss some the many ...
Peter J. Cameron
wiley +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
Bijections for lattice paths between two boundaries [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 We prove that on the set of lattice paths with steps $N=(0,1)$ and $E=(1,0)$ that lie between two boundaries $B$ and $T$, the two statistics `number of $E$ steps shared with $B$' and `number of $E$ steps shared with $T$' have a symmetric joint ...
Sergi Elizalde, Martin Rubey
doaj +1 more source
, 1992 This paper introduces a linear relaxation of the matroid matching problem, called the fractional matroid matching problem. When the matroid matching problem is in fact a matroid intersection problem, the fractional matroid matching polytope and the ...
Vande Vate, John H
core +1 more source