Results 41 to 50 of about 511 (171)

Matroid base polytope decomposition

open access: yesAdvances in Applied Mathematics, 2011
23 ...
Vanessa Chatelain   +1 more
openaire   +2 more sources

An algorithm for determining the bases of a regular matroid

open access: yesJournal of Numerical Analysis and Approximation Theory, 1988
Not available.
Dănuţ Marcu
doaj   +2 more sources

Toric amplitudes and universal adjoints

open access: yesJournal of the London Mathematical Society, Volume 113, Issue 2, February 2026.
Abstract A toric amplitude is a rational function associated with a simplicial polyhedral fan. The definition is inspired by scattering amplitudes in particle physics. We prove algebraic properties of such amplitudes and study the geometry of their zero loci. These hypersurfaces play the role of Warren's adjoint via a dual volume interpretation.
Simon Telen
wiley   +1 more source

Partitioning the bases of the union of matroids

open access: yesDiscrete Mathematics, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Csongor Gy. Csehi, András Recski
openaire   +3 more sources

On higher Jacobians, Laplace equations, and Lefschetz properties

open access: yesBulletin of the London Mathematical Society, Volume 58, Issue 1, January 2026.
Abstract Let A$A$ be a standard graded Artinian K$\mathbb {K}$‐algebra over a field of characteristic zero. We prove that the failure of strong Lefschetz property (SLP) for A$A$ is equivalent to the osculating defect of a certain rational variety.
Charles Almeida   +2 more
wiley   +1 more source

Equicovering matroids by distinct bases

open access: yesEuropean Journal of Combinatorics, 1995
Let \(M\) be a matroid on the set \(E\) of \(m\) elements and suppose that the rank \(r(E)\) divides \(m\). Then \(E\) can be partitioned into distinct bases iff \(| X|/ r(X)\leq m/r(E)\) holds for all \(X\subseteq E\). The cyclic order conjecture (see \textit{Y. Kajitani}, \textit{S. Ueno} and \textit{H. Miyano} [Discrete Math. 72, No.
Pierre Fraisse, Pavol Hell
openaire   +1 more source

Canonical forms of oriented matroids

open access: yesBulletin 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

Multidimensional Topological Measure Spaces and Their Applications in Decision‐Making Problems

open access: yesAdvances in Fuzzy Systems, Volume 2026, Issue 1, 2026.
This paper presents a generalized framework termed the multidimensional topological measure space (MDTMS), developed through multidimensional fuzzy sets, multidimensional topology, and an associated distance measure. The suggested framework enhances traditional fuzzy models by facilitating a more nuanced representation and examination of intricate ...
Jomal Josen   +3 more
wiley   +1 more source

On Some Algorithmic and Structural Results on Flames

open access: yesJournal of Graph Theory, Volume 110, Issue 4, Page 392-397, December 2025.
ABSTRACT A directed graph F with a root node r is called a flame if for every vertex v other than r the local edge‐connectivity value λ F ( r , v ) from r to v is equal to ϱ F ( v ), the in‐degree of v. It is a classic, simple and beautiful result of Lovász [4] that every digraph D with a root node r has a spanning subgraph F that is a flame and the λ (
Dávid Szeszlér
wiley   +1 more source

Rough matroids based on coverings

open access: yesCoRR, 2013
The introduction of covering-based rough sets has made a substantial contribution to the classical rough sets. However, many vital problems in rough sets, including attribution reduction, are NP-hard and therefore the algorithms for solving them are usually greedy.
Bin Yang 0004   +2 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy