Results 21 to 30 of about 4,009 (153)
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
Optimal Matroid Bases with Intersection Constraints: Valuated Matroids, M-convex Functions, and Their Applications [PDF]
Mathematical Programming, 2020 This is a post-peer-review, pre-copyedit version of an article published in Mathematical Programming.
Yuni Iwamasa, Kenjiro Takazawa
openaire +2 more sources
Valuations for matroid polytope subdivisions
, 2008 We prove that the ranks of the subsets and the activities of the bases of a matroid define valuations for the subdivisions of a matroid polytope into smaller matroid polytopes.Comment: 19 pages.
Ardila, Federico +2 more
core +2 more sources
Matroids with many common bases
Discrete Mathematics, 2003 The notion of ``vertical \(k\)-connectivity'' of matroids, due to Oxley, is utilized to formulate a strengthened version of a previous theorem of the author's. This new statement is proven: If the symmetric difference of the collections of bases of two matroids has at most \(k\) elements, then, except in certain simply-described cases, it is possible ...
openaire +3 more sources
Matroids on the Bases of Simple Matroids
European Journal of Combinatorics, 1981 Let M be a simple matroid (= combinatorial geometry). On the bases of M we consider two matroids S(M, F) and H(M, F), which depend on a field F. S(M, F) is the simplicial matroid with coefficients in F on the bases of M considered as simplices. H(M, F) has been studied by Björner in [1].
openaire +1 more source
On the k-volume rigidity of a simplicial complex in ℝ d
Forum of Mathematics, SigmaWe define a generic rigidity matroid for k-volumes of a simplicial complex in $\mathbb {R}^d$ and prove that for $2\leq k \leq d-1$ it has the same rank as the classical generic d-rigidity matroid on the same vertex set (namely, the case
Alan Lew +3 more
doaj +1 more source
Nonlinear Matroid Optimization and Experimental Design [PDF]
, 2007 We study the problem of optimizing nonlinear objective functions over matroids presented by oracles or explicitly. Such functions can be interpreted as the balancing of multi-criteria optimization. We provide a combinatorial polynomial time algorithm for
Eva Riccomagno +7 more
core +7 more sources
SIAM Journal on Discrete MathematicsRecently, it was proved by Bérczi and Schwarcz that the problem of factorizing a matroid into rainbow bases with respect to a given partition of its ground set is algorithmically intractable. On the other hand, many special cases were left open. We first show that the problem remains hard if the matroid is graphic, answering a question of Bérczi and ...
Hörsch, Florian +2 more
openaire +2 more sources
On Some Properties of Base-matroids
Electronic Notes in Discrete Mathematics, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
MAFFIOLI, FRANCESCO, ZAGAGLIA, NORMA
openaire +4 more sources
Oriented Matroids -- Combinatorial Structures Underlying Loop Quantum Gravity [PDF]
, 2010 We analyze combinatorial structures which play a central role in determining spectral properties of the volume operator in loop quantum gravity (LQG).
Arnowitt R +48 more
core +1 more source