1,466 research outputs found
Computing Algebraic Matroids
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
Binary Matroids and Quantum Probability Distributions
We characterise the probability distributions that arise from quantum
circuits all of whose gates commute, and show when these distributions can be
classically simulated efficiently. We consider also marginal distributions and
the computation of correlation coefficients, and draw connections between the
simulation of stabiliser circuits and the combinatorics of representable
matroids, as developed in the 1990s.Comment: 24 pages (inc appendix & refs
Matroids with nine elements
We describe the computation of a catalogue containing all matroids with up to
nine elements, and present some fundamental data arising from this cataogue.
Our computation confirms and extends the results obtained in the 1960s by
Blackburn, Crapo and Higgs. The matroids and associated data are stored in an
online database, and we give three short examples of the use of this database.Comment: 22 page
Approximate F_2-Sketching of Valuation Functions
We study the problem of constructing a linear sketch of minimum dimension that allows approximation of a given real-valued function f : F_2^n - > R with small expected squared error. We develop a general theory of linear sketching for such functions through which we analyze their dimension for most commonly studied types of valuation functions: additive, budget-additive, coverage, alpha-Lipschitz submodular and matroid rank functions. This gives a characterization of how many bits of information have to be stored about the input x so that one can compute f under additive updates to its coordinates.
Our results are tight in most cases and we also give extensions to the distributional version of the problem where the input x in F_2^n is generated uniformly at random. Using known connections with dynamic streaming algorithms, both upper and lower bounds on dimension obtained in our work extend to the space complexity of algorithms evaluating f(x) under long sequences of additive updates to the input x presented as a stream. Similar results hold for simultaneous communication in a distributed setting
Mathematical Programming Decoding of Binary Linear Codes: Theory and Algorithms
Mathematical programming is a branch of applied mathematics and has recently
been used to derive new decoding approaches, challenging established but often
heuristic algorithms based on iterative message passing. Concepts from
mathematical programming used in the context of decoding include linear,
integer, and nonlinear programming, network flows, notions of duality as well
as matroid and polyhedral theory. This survey article reviews and categorizes
decoding methods based on mathematical programming approaches for binary linear
codes over binary-input memoryless symmetric channels.Comment: 17 pages, submitted to the IEEE Transactions on Information Theory.
Published July 201
- …