Results 1  10
of
5,176
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 91 (9 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
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 16 (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 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].
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 9 (4 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
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.
Combinatorial Models for Cooperation Networks
"... Abstract. We analyze special random network models – socalled thickened trees – which are constructed by random trees where the nodes are replaced by local clusters. These objects serve as model for random real world networks. It is shown that under a symmetry condition for the cluster sets a local ..."
Abstract
 Add to MetaCart
Abstract. We analyze special random network models – socalled thickened trees – which are constructed by random trees where the nodes are replaced by local clusters. These objects serve as model for random real world networks. It is shown that under a symmetry condition for the cluster sets a
COMBINATORIAL MODELS OF RIGIDITY AND RENORMALIZATION
, 2012
"... Abstract. We first introduce the percolation problems associated with the graph theoretical concepts of (k, l)sparsity, and make contact with the physical concepts of ordinary and rigidity percolation. We then devise a renormalization transformation for (k, l)percolation problems, and investigate ..."
Abstract
 Add to MetaCart
its domain of validity. In particular, we show that it allows an exact solution of (k, l)percolation problems on hierarchical graphs, for k ≤ l < 2k. We introduce and solve by renormalization such a model, which has the interesting feature of showing both ordinary percolation and rigidity
Results 1  10
of
5,176