Results 41 to 50 of about 104 (81)
Randomized Algorithms over Finite Fields for the Exact Parity Base Problem
, 1999 We present three randomized pseudo-polynomial algorithms for the problem of finding a base of specified value in a weighted represented matroid subject to parity conditions.
Galbiati, Giulia +4 more
core +1 more source
The h-vectors of matroids and the arithmetic degree of squarefree strongly stable ideals
, 2008 Making use of algebraic and combinatorial techniques, we study two topics: the arithmetic degree of squarefree strongly stable ideals and the h-vectors of matroid complexes.
Erik Stokes, Stokes, Erik
core
On the complexity of Chow and Hurwitz forms
We consider the bit complexity of computing Chow forms and their generalization to multiprojective spaces. We develop a deterministic algorithm using resultants and obtain a single exponential complexity upper bound.
Doğan, Mahmut Levent +4 more
core +1 more source
Real Algebraic Geometry in Convex Optimization [PDF]
, 2011 In the past twenty years, a strong interplay has developed between convex optimization and algebraic geometry. Algebraic geometry provides necessary tools to analyze the behavior of solutions, the geometry of feasible sets, and to develop new relaxations
Vinzant, Cynthia Leslie
core
Biequivalence vector spaces in the alternative set theory [PDF]
, 1991 summary:As a counterpart to classical topological vector spaces in the alternative set theory, biequivalence vector spaces (over the field $Q$ of all rational numbers) are introduced and their basic properties are listed.
Šmíd, Miroslav, Zlatoš, Pavol
core
Global optimal eBURST analysis of multilocus typing data using a graphic matroid approach. [PDF]
BMC Bioinformatics, 2009 Francisco AP +3 more
europepmc +1 more source
Betti numbers of holomorphic symplectic quotients via arithmetic Fourier transform. [PDF]
Proc Natl Acad Sci U S A, 2006 Hausel T.
europepmc +1 more source
Microbial sequence typing in the genomic era. [PDF]
Infect Genet Evol, 2018 Pérez-Losada M +2 more
europepmc +1 more source
Sparsification of Rectangular Matrices
, 1996 Given a rectangular matrix with more columns than rows, find a base of linear combinations of the row vectors such that these contain as many zero entries as possible. This process is called "sparsification" (of the matrix).
Sebastian Egner, Torsten Minkwitz
core