7,055 research outputs found
The complexity of the list homomorphism problem for graphs
We completely classify the computational complexity of the list H-colouring
problem for graphs (with possible loops) in combinatorial and algebraic terms:
for every graph H the problem is either NP-complete, NL-complete, L-complete or
is first-order definable; descriptive complexity equivalents are given as well
via Datalog and its fragments. Our algebraic characterisations match important
conjectures in the study of constraint satisfaction problems.Comment: 12 pages, STACS 201
Conjunctive Bayesian networks
Conjunctive Bayesian networks (CBNs) are graphical models that describe the
accumulation of events which are constrained in the order of their occurrence.
A CBN is given by a partial order on a (finite) set of events. CBNs generalize
the oncogenetic tree models of Desper et al. by allowing the occurrence of an
event to depend on more than one predecessor event. The present paper studies
the statistical and algebraic properties of CBNs. We determine the maximum
likelihood parameters and present a combinatorial solution to the model
selection problem. Our method performs well on two datasets where the events
are HIV mutations associated with drug resistance. Concluding with a study of
the algebraic properties of CBNs, we show that CBNs are toric varieties after a
coordinate transformation and that their ideals possess a quadratic Gr\"{o}bner
basis.Comment: Published in at http://dx.doi.org/10.3150/07-BEJ6133 the Bernoulli
(http://isi.cbs.nl/bernoulli/) by the International Statistical
Institute/Bernoulli Society (http://isi.cbs.nl/BS/bshome.htm
Enumerations relating braid and commutation classes
We obtain an upper and lower bound for the number of reduced words for a
permutation in terms of the number of braid classes and the number of
commutation classes of the permutation. We classify the permutations that
achieve each of these bounds, and enumerate both cases.Comment: 19 page
Coding Theory and Algebraic Combinatorics
This chapter introduces and elaborates on the fruitful interplay of coding
theory and algebraic combinatorics, with most of the focus on the interaction
of codes with combinatorial designs, finite geometries, simple groups, sphere
packings, kissing numbers, lattices, and association schemes. In particular,
special interest is devoted to the relationship between codes and combinatorial
designs. We describe and recapitulate important results in the development of
the state of the art. In addition, we give illustrative examples and
constructions, and highlight recent advances. Finally, we provide a collection
of significant open problems and challenges concerning future research.Comment: 33 pages; handbook chapter, to appear in: "Selected Topics in
Information and Coding Theory", ed. by I. Woungang et al., World Scientific,
Singapore, 201
- …