Related papers: Algebraic matroids in action

In this paper, we give a new axioms system based on nonseparable flats with their ranks to define a matroid. We deduce a polynomial time algorithm for deciding if a given matroid (respectively, arbitrary structure) is an uniform matroid.…

In this short note we make a few remarks on a class of generalized incidence matrices whose matroids do not depend on the orientation of the underlying graph and natural commutative algebras associated to such matrices.

We introduce the notion of an arithmetic matroid, whose main example is given by a list of elements of a finitely generated abelian group. In particular we study the representability of its dual, providing an extension of the Gale duality…

In this paper, for a given finitely generated algebra (an algebraic structure with arbitrary operations and no predicates) A we study finitely generated limit algebras of A, approaching them via model theory and algebraic geometry. Along…

Let k be a field of characteristic zero. We consider graded subalgebras A of k[x_1,...,x_m]/(x_1^2,...,x_m^2) generated by d linearly independant linear forms. Representations of matroids over k provide a natural description of the…

This dissertation presents new results on three different themes all related to matroid polytopes. First we investigate properties of Ehrhart polynomials of matroid polytopes, independence matroid polytopes, and polymatroids. We prove that…

Subobject independence as morphism co-possibility has recently been defined in [2] and studied in the context of algebraic quantum field theory. This notion of independence is handy when it comes to systems coming from physics, but when…

This short expository paper outlines applications of computer algebra to the implication problem of conditional independence for Gaussian random variables. We touch on certificates for validity and invalidity of inference rules from the…

We establish rigidity for partial transformation groupoids associated with algebraic actions of semigroups: If two such groupoids (satisfying appropriate conditions) are isomorphic, then the globalizations of the initial algebraic actions…

A bar-joint framework $(G,p)$ is the combination of a graph $G$ and a map $p$ assigning positions, in some space, to the vertices of $G$. The framework is rigid if every edge-length-preserving continuous motion of the vertices arises from…

We show that the algebraic rank of divisors on certain graphs is related to the realizability problem of matroids. As a consequence, we produce a series of examples in which the algebraic rank depends on the ground field. We use the theory…

Curve singularities are classical objects of study in algebraic geometry. The key player in their combinatorial structure is the {\it value semigroup}, or its compactification, the {\it value semiring}. One natural problem is to explicitly…

The survey is devoted to the combinatorial and metric theory of filtrations, i.\,e., decreasing sequences of $\sigma$-algebras in measure spaces or decreasing sequences of subalgebras of certain algebras. One of the key notions, that of…

We construct a complex entire function with arbitrary number of variables which has the following property: The infinite set consisting of all the values of all its partial derivatives of any orders at all algebraic points, including zero…

The theory of matroids or combinatorial geometries originated in linear algebra and graph theory, and has deep connections with many other areas, including field theory, matching theory, submodular optimization, Lie combinatorics, and total…

Algebraic statistics uses tools from algebra (especially from multilinear algebra, commutative algebra and computational algebra), geometry and combinatorics to provide insight into knotty problems in mathematical statistics. In this survey…

A toric variety is constructed from a lattice polytope. It is common in algebraic combinatorics to carry this way a notion of an algebraic property from the variety to the polytope. From the combinatorial point of view, one of the most…

Let $R$ denote a 2-fir. The notions of F-independence and algebraic subsets of R are defined. The decomposition of an algebraic subset into similarity classes gives a simple way of translating the F-independence in terms of dimension of…

A Lie groupoid, called \textit{material Lie groupoid}, is associated in a natural way to any elastic material. The corresponding Lie algebroid, called \textit{material algebroid}, is used to characterize the uniformity and the homogeneity…

A matroid is a notion of independence in combinatorial optimization which is closely related to computational efficiency. In particular, it is well known that the maximum of a constrained modular function can be found greedily if and only…