Results 71 to 80 of about 74,505 (227)
On the Enumeration of Minimal Dominating Sets and Related Notions [PDF]
arXiv, 2014 A dominating set $D$ in a graph is a subset of its vertex set such that each vertex is either in $D$ or has a neighbour in $D$. In this paper, we are interested in the enumeration of (inclusion-wise) minimal dominating sets in graphs, called the Dom-Enum problem.
arxiv
Spectral Decomposition of Discrepancy Kernels on the Euclidean Ball, the Special Orthogonal Group, and the Grassmannian Manifold. [PDF]
Constr Approx, 2023 Dick J +3 more
europepmc +1 more source
Enumeration of binary trees compatible with a perfect phylogeny. [PDF]
J Math Biol, 2022 Palacios JA +3 more
europepmc +1 more source
Enumeration of curves via floor diagrams [PDF]
arXiv, 2007 In this note we compute some enumerative invariants of real and complex projective spaces by means of some enriched graphs called floor diagrams.
arxiv
Bijections for Dyck paths with colored hills [PDF]
Enumerative Combinatorics and Applications, 2022 Kostas Manes, Ioannis Tasoulas
doaj +1 more source
A note on enumerating colored integer partitions [PDF]
arXiv, 2015 In this short note, we give basic enumerative results on colored integer partitions.
arxiv
Computing the Tutte polynomial of a hyperplane arrangement [PDF]
arXiv, 2004 We define and study the Tutte polynomial of a hyperplane arrangement. We introduce a method for computing it by solving an enumerative problem in a finite field. For specific arrangements, the computation of Tutte polynomials is then reduced to certain related enumerative questions.
arxiv
Geometries enumeratives complexe, reelle et tropicale [PDF]
arXiv, 2008 This text is an introduction to algebraic enumerative geometry and to applications of tropical geometry to classical geometry, based on a course given during the X-UPS mathematical days, 2008 May 14th and 15th. The aim of this text is to be understandable by a first year master student.
arxiv
Convex Neural Codes in Dimension 1 [PDF]
arXiv, 2017 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 ...
arxiv