Neural codes are collections of binary strings motivated by patterns of neural activity. In this paper, we study algorithmic and enumerative aspects of convex neural codes in dimension 1 (i.e. on a line or a circle). We use the theory of consecutive-ones matrices to obtain some structural and algorithmic results; we use generating functions to obtain enumerative results.

Some enumerative aspects of the fans, called generalized associahedra, introduced by S. Fomin and A. Zelevinsky in their theory of cluster algebras are considered, in relation with a bicomplex and its two spectral sequences. A precise enumerative relation with the lattices of generalized noncrossing partitions is conjectured and some evidence is given.

1.1. Abstract and summary. A series of recent results solving classical enumerative problems for curves on rational surfaces is described. Impulse to the subject came from recent ideas from quantum field theory leading to the definition of quantum cohomology. As a by-product, formulas enumerating rational curves on certain varieties were derived from the properties of certain generating functio...

Enumerative Combinatorics focusses on the exact and asymptotic counting of combinatorial objects. It is strongly connected to the probabilistic analysis of large combinatorial structures and has fruitful connections to several disciplines, including statistical physics, algebraic combinatorics, graph theory and computer science. This workshop brought together experts from all these various fiel...

graph theory based methods are powerful means for representing structural systems so that their geometry and topology can be understood clearly. the combination of graph theory based methods and some metaheuristics can offer effective solutions for complex engineering optimization problems. this paper presents a charged system search (css) algorithm for the free shape optimizations of thin-wall...

Some enumerative aspects of the fans called generalized associahedra, introduced by S. Fomin and A. Zelevinsky in their theory of cluster algebras, are considered in relation with a bicomplex and its two spectral sequences. A precise enumerative relation with the lattices of generalized noncrossing partitions is conjectured and some evidence is given.