Results 21 to 30 of about 407,965 (310)
Enumeration of octagonal tilings [PDF]
, 2015 Random tilings are interesting as idealizations of atomistic models of quasicrystals and for their connection to problems in combinatorics and algorithms.
Hutchinson, Maxwell, Widom, Michael
core +1 more source
A simple formula for bipartite and quasi-bipartite maps with boundaries [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 We obtain a very simple formula for the generating function of bipartite (resp. quasi-bipartite) planar maps with boundaries (holes) of prescribed lengths, which generalizes certain expressions obtained by Eynard in a book to appear.
Gwendal Collet, Eric Fusy
doaj +1 more source
Foods, 2022 Probiotics are universally recognized for their health benefits, despite the fact that their effects depend on the strain. Identification and enumeration of probiotic strains are required prior to evaluating their effectiveness.
Lei Zhao +9 more
doaj +1 more source
A Comprehensive Study of the Key Enumeration Problem
Entropy, 2019 In this paper, we will study the key enumeration problem, which is connected to the key recovery problem posed in the cold boot attack setting. In this setting, an attacker with physical access to a computer may obtain noisy data of a cryptographic ...
Ricardo Villanueva-Polanco
doaj +1 more source
Unlabeled $(2+2)$-free posets, ascent sequences and pattern avoiding permutations [PDF]
Discrete Mathematics & Theoretical Computer Science, 2009 We present statistic-preserving bijections between four classes of combinatorial objects. Two of them, the class of unlabeled $(\textrm{2+2})$-free posets and a certain class of chord diagrams (or involutions), already appeared in the literature, but ...
Mireille Bousquet-Mélou +3 more
doaj +1 more source
Enumeration of the Monomials of a Polynomial and Related Complexity Classes [PDF]
, 2010 We study the problem of generating monomials of a polynomial in the context of enumeration complexity. In this setting, the complexity measure is the delay between two solutions and the total time.
Denis Diderot +2 more
core +1 more source
Improving Dispersion of Bacterial Endospores for Enumeration
KONA Powder and Particle Journal, 2015 Precise enumeration of spores is crucial for accurate evaluation of spore survival in the presence of inactivating agents or extreme environmental conditions. Bacterial endospores tend to agglomerate, leading to low estimates of spore numbers.
Vijay B. Krishna +4 more
doaj +1 more source
Enumeration of the distinct shuffles of permutations [PDF]
Discrete Mathematics & Theoretical Computer Science, 2009 A shuffle of two words is a word obtained by concatenating the two original words in either order and then sliding any letters from the second word back past letters of the first word, in such a way that the letters of each original word remain spelled ...
Camillia Smith Barnes
doaj +1 more source
The Quarterly Journal of Mathematics, 1987 This paper deals with the problem of enumerating the number f(n) of isomorphism types of groups of order n. There are three results which give upper bounds for f(n). The first bound holds for arbitrary groups, the second one deals with solvable groups, while the third one applies to groups with abelian Sylow subgroups.
Mciver, A, Neumann, P
openaire +2 more sources
Families of prudent self-avoiding walks [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 A self-avoiding walk on the square lattice is $\textit{prudent}$, if it never takes a step towards a vertex it has already visited. Préa was the first to address the enumeration of these walks, in 1997.
Mireille Bousquet-Mélou
doaj +1 more source