1,434 research outputs found

    Computing Algebraic Matroids

    Full text link
    An affine variety induces the structure of an algebraic matroid on the set of coordinates of the ambient space. The matroid has two natural decorations: a circuit polynomial attached to each circuit, and the degree of the projection map to each base, called the base degree. Decorated algebraic matroids can be computed via symbolic computation using Groebner bases, or through linear algebra in the space of differentials (with decorations calculated using numerical algebraic geometry). Both algorithms are developed here. Failure of the second algorithm occurs on a subvariety called the non-matroidal or NM- locus. Decorated algebraic matroids have widespread relevance anywhere that coordinates have combinatorial significance. Examples are computed from applied algebra, in algebraic statistics and chemical reaction network theory, as well as more theoretical examples from algebraic geometry and matroid theory.Comment: 15 pages; added link to references, note on page 1, and small formatting fixe

    A Family of matroid intersection algorithms for the computation of approximated symbolic network functions

    Get PDF
    In recent years, the technique of simplification during generation has turned out to be very promising for the efficient computation of approximate symbolic network functions for large transistor circuits. In this paper it is shown how symbolic network functions can be simplified during their generation with any well-known symbolic network analysis method. The underlying algorithm for the different techniques is always a matroid intersection algorithm. It is shown that the most efficient technique is the two-graph method. An implementation of the simplification during generation technique with the two-graph method illustrates its benefits for the symbolic analysis of large analog circuits

    The Lattice of Cyclic Flats of a Matroid

    Full text link
    A flat of a matroid is cyclic if it is a union of circuits. The cyclic flats of a matroid form a lattice under inclusion. We study these lattices and explore matroids from the perspective of cyclic flats. In particular, we show that every lattice is isomorphic to the lattice of cyclic flats of a matroid. We give a necessary and sufficient condition for a lattice Z of sets and a function r on Z to be the lattice of cyclic flats of a matroid and the restriction of the corresponding rank function to Z. We define cyclic width and show that this concept gives rise to minor-closed, dual-closed classes of matroids, two of which contain only transversal matroids.Comment: 15 pages, 1 figure. The new version addresses earlier work by Julie Sims that the authors learned of after submitting the first versio

    Comparison of matroid intersection algorithms for large circuit analysis

    Get PDF
    This paper presents two approaches to symbolic analysis of large analog integrated circuits via simplification during the generation of the symbolic expressions. Both techniques are examined from the point of view of matroid theory. Finally, a new approach which combines the positive features of both approaches is introduced

    Branch-depth: Generalizing tree-depth of graphs

    Get PDF
    We present a concept called the branch-depth of a connectivity function, that generalizes the tree-depth of graphs. Then we prove two theorems showing that this concept aligns closely with the notions of tree-depth and shrub-depth of graphs as follows. For a graph G=(V,E)G = (V,E) and a subset AA of EE we let λG(A)\lambda_G (A) be the number of vertices incident with an edge in AA and an edge in EAE \setminus A. For a subset XX of VV, let ρG(X)\rho_G(X) be the rank of the adjacency matrix between XX and VXV \setminus X over the binary field. We prove that a class of graphs has bounded tree-depth if and only if the corresponding class of functions λG\lambda_G has bounded branch-depth and similarly a class of graphs has bounded shrub-depth if and only if the corresponding class of functions ρG\rho_G has bounded branch-depth, which we call the rank-depth of graphs. Furthermore we investigate various potential generalizations of tree-depth to matroids and prove that matroids representable over a fixed finite field having no large circuits are well-quasi-ordered by the restriction.Comment: 34 pages, 2 figure
    corecore