199 research outputs found

    The explicit molecular expansion of the combinatorial logarithm

    Get PDF
    Just as the power series of log(1+X)\log (1+X) is the analytical substitutional inverse of the series of exp(X)1\exp (X)-1, the (virtual) combinatorial species, Lg(1+X)\mathrm{Lg} (1+X), is the combinatorial substitutional inverse of the combinatorial species, E(X)1E(X)-1, of non-empty finite sets. This combinatorial logarithm\textit{combinatorial logarithm}, Lg(1+X)\mathrm{Lg} (1+X), has been introduced by A. Joyal in 1986 by making use of an iterative scheme. Given a species F(X)F(X) (with F(0)=1F(0)=1), one of its main applications is to express the species, Fc(X)F^{\mathrm{c}}(X), of connected\textit{connected} FF-structures through the formula Fc=Lg(F)=Lg(1+F+)F{\mathrm{c}} = \mathrm{Lg} (F) = \mathrm{Lg} (1+F_+) where F+F_+ denotes the species of non-empty FF-structures. Since its creation, equivalent descriptions of the combinatorial logarithm have been given by other combinatorialists (G. L., I. Gessel, J. Li), but its exact decomposition into irreducible components (molecular expansion) remained unclear. The main goal of the present work is to fill this gap by computing explicitly the molecular expansion of the combinatorial logarithm and of Lg(1X)-\mathrm{Lg}(1-X), a "cousin'' of the tensorial species, Lie(X)\mathrm{Lie}(X), of free Lie algebras

    On extensions of the Newton-Raphson iterative scheme to arbitrary orders

    Get PDF
    Abstract. The classical quadratically convergent Newton-Raphson iterative scheme for successive approximations of a root of an equation f (t) = 0 has been extended in various ways by different authors, going from cubical convergence to convergence of arbitrary orders. We introduce two such extensions, using appropriate differential operators as well as combinatorial arguments. We conclude with some applications including special series expansions for functions of the root and enumeration of classes of tree-like structures according to their number of leaves. Résumé. Le schéma itératif classiqueà convergence quadratique de Newton-Raphson pour engendrer des approximations successives d'une racine d'uneéquation f (t) = 0 aétéétendu de plusieurs façons par divers auteurs, allant de la convergence cubiqueà des convergences d'ordres arbitraires. Nous introduisons deux telles extensions en utilisant des opérateurs différentiels appropriés ainsi que des arguments combinatoires. Nous terminons avec quelques applications incluant des développements en séries exprimant des fonctions de la racine et l'énumération de classes de structures arborescentes selon leur nombre de feuilles

    New combinatorial computational methods arising from pseudo-singletons

    Get PDF
    Since singletons are the connected sets, the species XX of singletons can be considered as the combinatorial logarithm of the species E(X)E(X) of finite sets. In a previous work, we introduced the (rational) species X^\widehat{X} of pseudo-singletons as the analytical logarithm of the species of finite sets. It follows that E(X)=exp(X^)E(X) = \exp (\widehat{X}) in the context of rational species, where exp(T)\exp (T) denotes the classical analytical power series for the exponential function in the variable TT. In the present work, we use the species X^\widehat{X} to create new efficient recursive schemes for the computation of molecular expansions of species of rooted trees, of species of assemblies of structures, of the combinatorial logarithm species, of species of connected structures, and of species of structures with weighted connected components

    Closed paths whose steps are roots of unity

    Get PDF
    We give explicit formulas for the number Un(N)U_n(N) of closed polygonal paths of length NN (starting from the origin) whose steps are nthn^{\textrm{th}} roots of unity, as well as asymptotic expressions for these numbers when NN \rightarrow \infty. We also prove that the sequences (Un(N))N0(U_n(N))_{N \geq 0} are PP-recursive for each fixed n1n \geq 1 and leave open the problem of determining the values of NN for which the dual\textit{dual} sequences (Un(N))n1(U_n(N))_{n \geq 1} are PP-recursive

    Abundance and Distribution of Enteric Bacteria and Viruses in Coastal and Estuarine Sediments—a Review

    Get PDF
    The long term survival of fecal indicator organisms (FIOs) and human pathogenic microorganisms in sediments is important from a water quality, human health and ecological perspective. Typically, both bacteria and viruses strongly associate with particulate matter present in freshwater, estuarine and marine environments. This association tends to be stronger in finer textured sediments and is strongly influenced by the type and quantity of clay minerals and organic matter present. Binding to particle surfaces promotes the persistence of bacteria in the environment by offering physical and chemical protection from biotic and abiotic stresses. How bacterial and viral viability and pathogenicity is influenced by surface attachment requires further study. Typically, long-term association with surfaces including sediments induces bacteria to enter a viable-but-non-culturable (VBNC) state. Inherent methodological challenges of quantifying VBNC bacteria may lead to the frequent under-reporting of their abundance in sediments. The implications of this in a quantitative risk assessment context remain unclear. Similarly, sediments can harbor significant amounts of enteric viruses, however, the factors regulating their persistence remains poorly understood. Quantification of viruses in sediment remains problematic due to our poor ability to recover intact viral particles from sediment surfaces (typically <10%), our inability to distinguish between infective and damaged (non-infective) viral particles, aggregation of viral particles, and inhibition during qPCR. This suggests that the true viral titre in sediments may be being vastly underestimated. In turn, this is limiting our ability to understand the fate and transport of viruses in sediments. Model systems (e.g., human cell culture) are also lacking for some key viruses, preventing our ability to evaluate the infectivity of viruses recovered from sediments (e.g., norovirus). The release of particle-bound bacteria and viruses into the water column during sediment resuspension also represents a risk to water quality. In conclusion, our poor process level understanding of viral/bacterial-sediment interactions combined with methodological challenges is limiting the accurate source apportionment and quantitative microbial risk assessment for pathogenic organisms associated with sediments in aquatic environments

    Exhaustive generation of atomic combinatorial differential operators

    Get PDF
    Labelle and Lamathe introduced in 2009 a generalization of the standard combinatorial differential species operator D, by giving a combinatorial interpretation to Ω(X, D)F(X), where Ω(X, T) and F(X) are two-sort and one-sort species respectively. One can show that such operators can be decomposed as sums of products of simpler operators called atomic combinatorial differential operators. In their paper, Labelle and Lamathe presented a list of the first atomic differential operators. In this paper, we describe an algorithm that allows to generate (and enumerate) all of them, subject to available computer resources. We also give a detailed analysis of how to compute the molecular components of Ω(X, D)F(X)
    corecore