Results 31 to 40 of about 396,999 (317)
Combinatorial families of multilabelled increasing trees and hook-length formulas [PDF]
In this work we introduce and study various generalizations of the notion of increasingly labelled trees, where the label of a child node is always larger than the label of its parent node, to multilabelled tree families, where the nodes in the tree can ...
Kuba, Markus, Panholzer, Alois
core +1 more source
Enumerations including laconic enumerators
Abstract We show that it is possible, for every machine universal for Kolmogorov complexity, to enumerate the lexicographically least description of a length n string in O ( n ) attempts. In contrast to this positive result for strings, we find that, in any Kolmogorov numbering, no enumerator of nontrivial size can generate a list containing
Jason Teutsch, Sanjay Jain
openaire +2 more sources
Many joint decisions in everyday life (e.g., Which bar is less crowded?) depend on approximate enumeration, but very little is known about the psychological characteristics of counting together. Here we systematically investigated collective approximate enumeration.
Bahador Bahrami +4 more
openaire +2 more sources
This study introduces an optimized integration of flow cytometry and fluorescence in situ hybridization (Flow-FISH) as an approach for the specific enumeration of gram-positive bacteria in probiotic products, overcoming the limitations of conventional ...
Laura Snaidr +5 more
doaj +1 more source
Formulae for the generating functions for hypergraphs, dihypergraphs, oriented hypergraphs, selfcomplementary directed hypergraphs and self complementary hypergraphs are presented here.
Hegde, M, Sridharan, MR
openaire +3 more sources
Improvements offered by viability droplet digital PCR (v-ddPCR) include increased precision, specificity and decreased time to results making for an attractive alternative method to traditional plate count enumeration of probiotic products.
Anthony Kiefer +4 more
doaj +1 more source
Enumeration of simple random walks and tridiagonal matrices
We present some old and new results in the enumeration of random walks in one dimension, mostly developed in works of enumerative combinatorics. The relation between the trace of the $n$-th power of a tridiagonal matrix and the enumeration of weighted ...
Bauer M +23 more
core +1 more source
The planar Cayley graphs are effectively enumerable I: consistently planar graphs [PDF]
We obtain an effective enumeration of the family of finitely generated groups admitting a faithful, properly discontinuous action on some 2-manifold contained in the sphere.
Georgakopoulos, Agelos, Hamann, Matthias
core +2 more sources
Formulas for the cycle index of the representation of the symmetric group of degree \(n\) acting on all subsets of the object set are derived and applied through \(n=7\). These can be used to enumerate hypergraphs with Pólya's enumeration theorem. The approach is similar to that of \textit{E. M. Palmer} [Discrete Math. 6, 377-390 (1973; Zbl 0269.05110)]
openaire +3 more sources
Enumeration of cospectral graphs [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Haemers, W.H., Spence, E.
openaire +5 more sources

