On the Abstract Properties of Linear Dependence
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Similarity-projection structures: The logical geometry of quantum physics
- Minimum weakly fundamental cycle bases are hard to find
- An augmenting path algorithm for linear matroid parity
- Polyhedra of regular p-nary group problems
- Extensions and duality of finite geometric closure operators
- On a definition of connected sets of a matroid
- Oriented matroids
- Cyclic radicals in universal algebra
- Random sampling and greedy sparsification for matroid optimization problems
- Algebraic matroids and Frobenius flocks
- How many delta-matroids are there?
- Fragmentary structures in discrete optimization problems
- Enumerative combinatorics of simplicial and cell complexes: Kirchhoff and Trent type theorems
- Matroidal structure of rough sets from the viewpoint of graph theory
- Biased graphs whose matroids are special binary matroids
- Geometric properties of nonlinear networks containing capacitor-only cutsets and/or inductor-only loops. I: Conservation laws
- Some nonrealizable line diagrams
- Matroids, motives, and a conjecture of Kontsevich.
- Determinantal probability measures
- General geometric lattices and projective geometry of modules
- The fuzzy core and Shapley function for dynamic fuzzy games on matroids
- Polynomial invariants of graphs on surfaces
- \(q\)-rung orthopair fuzzy matroids with application to human trafficking
- Rank axiom of modular supermatroids: a connection with directional DR submodular functions
- Flag matroids: algebra and geometry
- Rainbow and monochromatic circuits and cocircuits in binary matroids
- A method to construct all the paving matroids over a finite set
- Generalized bijective maps between G-parking functions, spanning trees, and the Tutte polynomial
- Structure on the top homology and related algorithms
- Representation of fragmentary structures by oriented graphs
- Similarity of binary relations based on rough set theory and topology: an application for topological structures of matroids
- Fourientation activities and the Tutte polynomial
- Erdős-Szekeres ``happy end-type theorems for separoïds
- Derivation modules of orthogonal duals of hyperplane arrangements
- Buchstaber invariant theory of simplicial complexes and convex polytopes
- Geometric duality
- The Tutte polynomial
- Cores of convex games
- On subgraphs as matroid cells
- Matroid basis graphs. I
- Uniformität des Verbandes der Partitionen
- Matroid theory and Chern-Simons
- Constructing division rings as module-theoretic direct limits
- Dependence logic in pregeometries and -stable theories
- Matroid Theory for Algebraic Geometers
- Some exceptional cases in mathematics: Euler characteristic, division algebras, cross vector product and Fano matroid
- Generic and special constructions of pure O-sequences
- An Introduction to Coding Sequences of Graphs
- Reverse mathematics of matroids
- Antimatroids, betweenness, convexity
- Matroids -- the engineers' revenge
- The free product of M-fuzzifying matroids
- More undecidable lattices of Steinitz exchange systems
- Complexity of testing reachability in matroids
- Complementarity in Oriented Matroids
- SEARCH FOR A "GRAVITOID" THEORY
- scientific article; zbMATH DE number 4160671 (Why is no real title available?)
- On a Special Co-cycle Basis of Graphs
- On the Power of Linear Dependencies
- The generalized column incidence graph and a matroid base-listing algorithm
- Use of matroid theory in operations research, circuits and systems theory
- A Property Equivalent to Exchange Property in Matroids
- On Fundamental Transversal Matroids
- Complementary Trees and Independent Matchings
- Einige Aspekte in der Zuordnungstheorie
- Topology and logic as a source of algebra
- Whitney algebras and Grassmann's regressive products
- Weight Enumeration and the Geometry of Linear Codes
- Decomposing symmetric exchanges in matroid bases
- Graphic matroids and the multicommodity transportation problem
- Alternating Basis Exchanges in Matroids
- Semimodular Functions and Combinatorial Geometries
- Revised Greedy algorithm for formation of a minimal cycle basis of a graph
- Expansion and contraction functors on matriods
- Yes, the ``missing axiom of matroid theory is lost forever
- On the computational complexity of the Jones and Tutte polynomials
- Existence Theorems for Matroid Designs
- Topological representations of matroids
- Independence in computable algebra
- Torus orbit closures in flag varieties and retractions on Weyl groups
- An algorithm of the rank of a dependent fuzzy set
- Alea iacta est: auctions, persuasion, interim rules, and dice
- The connectivity and Hamiltonian properties of second-order circuit graphs of wheel cycle matroids
- Linear bounds on characteristic polynomials of matroids
- Weighted linear matroid parity
- A characterization of matroids in terms of surfaces
- List coloring of two matroids through reduction to partition matroids
- Lower bounds for strictly fundamental cycle bases in grid graphs
- Degrees of M-fuzzy families of independent L-fuzzy sets
- On the rank functions of \(\mathcal{H}\)-matroids
- \(k\)-circular matroids of graphs
- A comparative study of algorithms for minimal cycle bases for efficient force method of frame analysis
- scientific article; zbMATH DE number 3260791 (Why is no real title available?)
- Minimal dependent sets
- Comments on bases in dependence structures
- Some applications of a theorem of Rado
- Flots et tensions dans un graphe
- scientific article; zbMATH DE number 3298861 (Why is no real title available?)
- Lattice representation of general algebraic dependence
- A Combinatorial Model for Series-Parallel Networks
This page was built for publication: On the Abstract Properties of Linear Dependence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4761172)
