Results 31 to 40 of about 9,755 (179)
Invariant Theory-like Theorems for Matroids and Oriented Matroids
Advances in Mathematics, 1994 This paper continues the discussion of the authors and \textit{J. Richter- Gebert} [Adv. Math. 87, No. 2, 160-185 (1991; Zbl 0762.05030)], exploiting that the varieties of all \(n\)-element matroids (over GF(2)) and all \(n\)-element oriented matroids (over GF(3)) can be defined by the same family of polynomials, which are constructed via elementary ...
Bokowski, Jürgen +1 more
openaire +2 more sources
Toric and tropical compactifications of hyperplane complements [PDF]
, 2013 These lecture notes are based on lectures given by the author at the summer school "Arrangements in Pyr\'en\'ees" in June 2012. We survey and compare various compactifications of complex hyperplane arrangement complements.
Denham, Graham
core +2 more sources
Matroidizing set systems: a new approach to matroid theory
Applied Mathematics Letters, 1990 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dress, Andreas W.M., Wenzel, Walter
openaire +2 more sources
The matroid secretary problem for minor-closed classes and random matroids
, 2019 We prove that for every proper minor-closed class $M$ of matroids representable over a prime field, there exists a constant-competitive matroid secretary algorithm for the matroids in $M$.
Huynh, Tony, Nelson, Peter
core +1 more source
Modeling of Complex Systems by Means of Partial Algebras
Mendel, 2019 Complex systems are very hard to describe by some unified language and calculus. In cases when their nature is very heterogeneous is possible to use with advantage state description.
Jiri Bila +2 more
doaj +1 more source
Fast Flux Module Detection Using Matroid Theory [PDF]
Journal of Computational Biology, 2014 Flux balance analysis (FBA) is one of the most often applied methods on genome-scale metabolic networks. Although FBA uniquely determines the optimal yield, the pathway that achieves this is usually not unique. The analysis of the optimal-yield flux space has been an open challenge.
Reimers, Arne C. +3 more
openaire +4 more sources
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
Some characteristics of matroids through rough sets [PDF]
, 2012 At present, practical application and theoretical discussion of rough sets are two hot problems in computer science. The core concepts of rough set theory are upper and lower approximation operators based on equivalence relations. Matroid, as a branch of
Su, Lirun, Zhu, William
core
Osculating geometry and higher‐order distance Loci
Journal of the London Mathematical Society, Volume 113, Issue 3, March 2026.Abstract We discuss the problem of optimizing the distance function from a given point, subject to polynomial constraints. A key algebraic invariant that governs its complexity is the Euclidean distance degree, which pertains to first‐order tangency. We focus on the data locus of points possessing at least one critical point of the distance function ...
Sandra Di Rocco +2 more
wiley +1 more source
Orthogonal matroids over tracts
Forum of Mathematics, SigmaWe generalize Baker–Bowler’s theory of matroids over tracts to orthogonal matroids, define orthogonal matroids with coefficients in tracts in terms of Wick functions, orthogonal signatures, circuit sets and orthogonal vector sets, and establish basic ...
Tong Jin, Donggyu Kim
doaj +1 more source