1,584 research outputs found
An algebraic framework for the greedy algorithm with applications to the core and Weber set of cooperative games
An algebraic model generalizing submodular polytopes is presented, where modular functions on partially ordered sets take over the role of vectors in . This model unifies various generalizations of combinatorial models in which the greedy algorithm and the Monge algorithm are successful and generalizations of the notions of core and Weber set in cooperative game theory. As a further application, we show that an earlier model of ours as well as the algorithmic model of Queyranne, Spieksma and Tardella for the Monge algorithm can be treated within the framework of usual matroid theory (on unordered ground-sets), which permits also the efficient algorithmic solution of the intersection problem within this model. \u
Some combinatorial problems
AbstractThere are many interesting and sophisticated problems posed in the IMO, Putnam and domestic Olympiads. Some of these problems have deep mathematical background, nice generalizations, and lead to new areas of research in combinatorics. We investigate several topics in this category and mention some results and open problems
On the Computation of Clebsch-Gordan Coefficients and the Dilation Effect
We investigate the problem of computing tensor product multiplicities for
complex semisimple Lie algebras. Even though computing these numbers is #P-hard
in general, we show that if the rank of the Lie algebra is assumed fixed, then
there is a polynomial time algorithm, based on counting the lattice points in
polytopes. In fact, for Lie algebras of type A_r, there is an algorithm, based
on the ellipsoid algorithm, to decide when the coefficients are nonzero in
polynomial time for arbitrary rank. Our experiments show that the lattice point
algorithm is superior in practice to the standard techniques for computing
multiplicities when the weights have large entries but small rank. Using an
implementation of this algorithm, we provide experimental evidence for
conjectured generalizations of the saturation property of
Littlewood--Richardson coefficients. One of these conjectures seems to be valid
for types B_n, C_n, and D_n.Comment: 21 pages, 6 table
Survivable Networks, Linear Programming Relaxations and the Parsimonious Property
We consider the survivable network design problem - the problem of designing, at minimum cost, a network with edge-connectivity requirements. As special cases, this problem encompasses the Steiner tree problem, the traveling salesman problem and the k-connected network design problem. We establish a property, referred to as the parsimonious property, of the linear programming (LP) relaxation of a classical formulation for the problem. The parsimonious property has numerous consequences. For example, we derive various structural properties of these LP relaxations, we present some algorithmic improvements and we perform tight worstcase analyses of two heuristics for the survivable network design problem
- …