Grothendieck polynomials G w of permutations w∈ S n were introduced by Lascoux and
Schützenberger (CR Acad Sci Paris Sér I Math 295 (11): 629–633, 1982) as a set of …

We unify the study of quotients of matroids, polymatroids, valuated matroids and strong
maps of submodular functions in the framework of Murota's discrete convex analysis. As a …

Already for bivariate tropical polynomials, factorization is an NP-Complete problem. In this
paper, we give an efficient algorithm for factorization and rational factorization of a rich class …

K\H {o} nig's edge-coloring theorem for bipartite graphs and Vizing's edge-coloring theorem
for general graphs are celebrated results in graph theory and combinatorial optimization …

In 1995, Galvin provided an elegant proof for the list edge coloring conjecture for bipartite
graphs, utilizing the stable matching theorem of Gale and Shapley. In this paper, we …

Polyhedra are beautiful objects with broad applications beyond geometry. They are the main
tool of combinatorial optimization as evidenced by the subtitle of Schrijver's combinatorial …

An obstacle to using market mechanisms to allocate indivisible goods is the nonexistence of
competitive equilibria (CE). To surmount this Arrow and Hahn proposed the notion of social …

An integer polyhedron P ⊆ R^ n P⊆ R n has the linking property if for any f ∈ Z^ nf∈ Z n
and g ∈ Z^ ng∈ Z n with f ≤ gf≤ g, P has an integer point between f and g if and only if it …

Vektorok egy véges halmaza Hilbert-bázis, ha az általuk generált kúp minden egész eleme
eloáll nemnegatív egész együtthatós kombinációjukként is. 1990-ben Papadimitriou és …