Results 31 to 40 of about 104 (81)
Sublinear circuits for polyhedral sets
, 2021 Sublinear circuits are generalizations of the affine circuits in matroid theory, and they arise as the convex-combinatorial core underlying constrained non-negativity certificates of exponential sums and of polynomials based on the arithmetic-geometric ...
Naumann, Helen, Theobald, Thorsten
core +1 more source
Universal Tutte characters via combinatorial coalgebras [PDF]
, 2018 International audienceThis work discusses the extraction of meaningful invariants of combinatorial objects from coalgebra or bialgebra structures. The Tutte polynomial is an invariant of graphs well known for the formula which computes it recursively by ...
Moci, Luca +5 more
core +3 more sources
Arithmetic matroids, Tutte polynomial, and toric arrangements
, 2011 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 to this setting.
D'Adderio, Michele, Moci, Luca
openaire +2 more sources
Matroids : h-vectors, zonotopes, and Lawrence polytopes [PDF]
, 2015 The main objects of study in this thesis are matroids. In particular we are interested in three particular classes matroids: regular matroids, arithmetic matroids, and internally perfect matroids.
Dall, Aaron Matthew
core +1 more source
Colorings and flows on CW complexes, Tutte quasi-polynomials and arithmetic matroids
, 2016 9 pages; proof of Theorem 1 ...
Delucchi, Emanuele, Moci, Luca
openaire +2 more sources
, 2016 In this note we generalize the convolution formula for the Tutte polynomial of Kook-Reiner-Stanton and Etienne-Las Vergnas to a more general setting that includes both arithmetic matroids and delta-matroids. As corollaries, we obtain new proofs of two positivity results for pseudo-arithmetic matroids and a combinatorial interpretation of the arithmetic
Backman, Spencer, Lenz, Matthias
openaire +3 more sources
The Central Curve in Linear Programming [PDF]
, 2012 The central curve of a linear program is an algebraic curve specified by linear and quadratic constraints arising from complementary slackness. It is the union of the various central paths for minimizing or maximizing the cost function over any region in
Sturmfels, Bernd +2 more
core +1 more source
Two examples of toric arrangements
, 2019 We show that the integral cohomology algebra of the complement of a toric arrangement is not determined by the poset of layers. Moreover, the rational cohomology algebra is not determine by the arithmetic matroid (however it is determine by the poset of ...
Pagaria R., Roberto Pagaria
core +1 more source
, 2023 Thesis (Ph.D.)--University of Washington, 2023Submodular functions have recently shown utility for a number of machine learning applications such as information gathering, document summarization, image segmentation, and string alignment, since they are ...
Bai, Wenruo
core
Modular properties and decompositions of arithmetic matroids
, 2016 In this thesis, we introduce the concepts of Z-closure operators and Z-flat lattices of arithmetic matroids, and show that for a representable arithmetic matroid, the characteristic polynomial of the associated toric arrangement is equal to the ...
Zhou, Fengwei
core