Algebraic matroids are combinatorial objects defined by the set of coordinates of an algebraic variety. These objects are of interest whenever coordinates hold significance: for instance, when the variety describes solution sets for a real world problem, or is defined using some combinatorial rule. In this thesis, we discuss algebraic matroids, and explore tools for their computation. We then delve into two applications that involve algebraic matroids: probability matrices and tensors from statistics, and chemical reaction networks from biology
Matroids arise from the abstract notion of dependency. Matroids can be studied from different points...
This paper reviews matroid optimization and algorithms including applications of matroid intersectio...
This volume deals with the applications of matroid theory to a variety of topics
Algebraic matroids are combinatorial objects that can be extracted from geometric problems, describi...
In recent years, surprising connections between applications including algebraic statistics and the ...
AbstractFocusing on the interplay between properties of the Grassmann variety and properties of matr...
Abstract. Matroids were introduced by Whitney in 1935 to try to capture abstractly the essence of de...
Abstract. Matroids were introduced by Whitney in 1935 to try to capture abstractly the essence of de...
Matroids have been defined in 1935 as generalization of graphs and matrices. Starting from the 1950s...
Matroids have been defined in 1935 as generalization of graphs and matrices. Starting from the 1950s...
Matroids have been defined in 1935 as generalization of graphs and matrices. Starting from the 1950s...
This paper studies the properties of two kinds of matroids: (a) algebraic matroids and (b) finite an...
Algebraic matroids can be used to determine all the algebraic dependency relationships among a set o...
Matroids (also called combinatorial geometries) present a strong combinatorial generalization of gra...
Matroids arise from the abstract notion of dependency. Matroids can be studied from different points...
Matroids arise from the abstract notion of dependency. Matroids can be studied from different points...
This paper reviews matroid optimization and algorithms including applications of matroid intersectio...
This volume deals with the applications of matroid theory to a variety of topics
Algebraic matroids are combinatorial objects that can be extracted from geometric problems, describi...
In recent years, surprising connections between applications including algebraic statistics and the ...
AbstractFocusing on the interplay between properties of the Grassmann variety and properties of matr...
Abstract. Matroids were introduced by Whitney in 1935 to try to capture abstractly the essence of de...
Abstract. Matroids were introduced by Whitney in 1935 to try to capture abstractly the essence of de...
Matroids have been defined in 1935 as generalization of graphs and matrices. Starting from the 1950s...
Matroids have been defined in 1935 as generalization of graphs and matrices. Starting from the 1950s...
Matroids have been defined in 1935 as generalization of graphs and matrices. Starting from the 1950s...
This paper studies the properties of two kinds of matroids: (a) algebraic matroids and (b) finite an...
Algebraic matroids can be used to determine all the algebraic dependency relationships among a set o...
Matroids (also called combinatorial geometries) present a strong combinatorial generalization of gra...
Matroids arise from the abstract notion of dependency. Matroids can be studied from different points...
Matroids arise from the abstract notion of dependency. Matroids can be studied from different points...
This paper reviews matroid optimization and algorithms including applications of matroid intersectio...
This volume deals with the applications of matroid theory to a variety of topics