Results 1  10
of
164,619
Combinatorial model categories have presentations
 Adv. in Math. 164
, 2001
"... Abstract. We show that every combinatorial model category is Quillen equivalent to a localization of a diagram category (where ‘diagram category’ means diagrams of simplicial sets). This says that every combinatorial model ..."
Abstract

Cited by 93 (10 self)
 Add to MetaCart
Abstract. We show that every combinatorial model category is Quillen equivalent to a localization of a diagram category (where ‘diagram category’ means diagrams of simplicial sets). This says that every combinatorial model
Combinatorial Models for DNA Rearrangements in Ciliates
, 2009
"... Combinatorial models for DNA rearrangements in ciliates ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Combinatorial models for DNA rearrangements in ciliates
Improved algorithms for optimal winner determination in combinatorial auctions and generalizations
, 2000
"... Combinatorial auctions can be used to reach efficient resource and task allocations in multiagent systems where the items are complementary. Determining the winners is NPcomplete and inapproximable, but it was recently shown that optimal search algorithms do very well on average. This paper present ..."
Abstract

Cited by 598 (55 self)
 Add to MetaCart
Combinatorial auctions can be used to reach efficient resource and task allocations in multiagent systems where the items are complementary. Determining the winners is NPcomplete and inapproximable, but it was recently shown that optimal search algorithms do very well on average. This paper
Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
 SIAM Journal on Optimization
, 1993
"... We study the semidefinite programming problem (SDP), i.e the problem of optimization of a linear function of a symmetric matrix subject to linear equality constraints and the additional condition that the matrix be positive semidefinite. First we review the classical cone duality as specialized to S ..."
Abstract

Cited by 557 (12 self)
 Add to MetaCart
mechanical way to algorithms for SDP with proofs of convergence and polynomial time complexity also carrying over in a similar fashion. Finally we study the significance of these results in a variety of combinatorial optimization problems including the general 01 integer programs, the maximum clique
COMBINATORIAL MODELS OF CREATION–ANNIHILATION
 SÉMINAIRE LOTHARINGIEN DE COMBINATOIRE 65 (2011), ARTICLE B65C
, 2011
"... Quantum physics has revealed many interesting formal properties associated with the algebra of two operators, A and B, satisfying the partial commutation relation AB − BA = 1. This study surveys the relationships between classical combinatorial structures and the reduction to normal form of operator ..."
Abstract

Cited by 18 (3 self)
 Add to MetaCart
Quantum physics has revealed many interesting formal properties associated with the algebra of two operators, A and B, satisfying the partial commutation relation AB − BA = 1. This study surveys the relationships between classical combinatorial structures and the reduction to normal form
Combinatorial Models For Coalgebraic Structures
 Adv. Math
, 1997
"... . We introduce a convenient category of combinatorial objects, known as cellsets, on which we study the properties of the appropriate free abelian group functor. We obtain a versatile generalization of the notion of incidence coalgebra, giving rise to an abundance of coalgebras, Hopf algebras, and ..."
Abstract

Cited by 10 (5 self)
 Add to MetaCart
. We introduce a convenient category of combinatorial objects, known as cellsets, on which we study the properties of the appropriate free abelian group functor. We obtain a versatile generalization of the notion of incidence coalgebra, giving rise to an abundance of coalgebras, Hopf algebras
THE HEART OF A COMBINATORIAL MODEL CATEGORY
"... Abstract. We show that every small model category that satisfies certain size conditions can be completed to yield a combinatorial model category, and conversely, every combinatorial model category arises in this way. We will also see that these constructions preserve right properness and compatibi ..."
Abstract
 Add to MetaCart
Abstract. We show that every small model category that satisfies certain size conditions can be completed to yield a combinatorial model category, and conversely, every combinatorial model category arises in this way. We will also see that these constructions preserve right properness
Combinatorial Models for Weyl Characters
"... Contents 0. Introduction 1. Preliminaries 2. Admissible Systems 3. The Product Construction 4. Thin Systems 5. Semistandard Tableaux 6. Untangled Systems 7. Generation of Finite Systems 8. LakshmibaiSeshadri Chains Partially supported by NSF Grant DMS{0070685 and the Guggenheim Foundation ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
Contents 0. Introduction 1. Preliminaries 2. Admissible Systems 3. The Product Construction 4. Thin Systems 5. Semistandard Tableaux 6. Untangled Systems 7. Generation of Finite Systems 8. LakshmibaiSeshadri Chains Partially supported by NSF Grant DMS{0070685 and the Guggenheim Foundation. 0. Introduction In this paper, we dene an \admissible system" as a setwithoperators satisfying a certain list of axioms (see (A0){(A4) in Section 2). Our goal is to show that these axioms abstract a minimal set of properties for understanding the combinatorics of the Weyl character formula for representations of semisimple Lie groups or algebras, and more generally for symmetrizable KacMoody algebras. Axioms (A0){(A3) can be recognized as dening, although with slightly dierent notation, what is known as a \crystal" in the theory that Kashiwara has developed for bases of representations of quantized universal enveloping algebras [K2].
Combinatory Models and Symbolic Computation
 Lecture Notes in Computer Science , Springer Verlag 721
, 1992
"... Weintroduce an algebraic model of computation which is especially useful for the description of computations in analysis. On one level the model allows the representation of algebraic computation and on an other level approximate computation is represented. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Weintroduce an algebraic model of computation which is especially useful for the description of computations in analysis. On one level the model allows the representation of algebraic computation and on an other level approximate computation is represented.
Results 1  10
of
164,619