3,667,888 research outputs found

    Restricted Stirling permutations

    Full text link
    In this paper, we study the generating functions for the number of pattern restricted Stirling permutations with a given number of plateaus, descents and ascents. Properties of the generating functions, including symmetric properties and explicit formulas are studied. Combinatorial explanations are given for some equidistributions.Comment: 14 pages in Taiwanese Journal of Mathematics, 201

    Restricted Successive Minima

    Full text link
    We give bounds on the successive minima of an oo-symmetric convex body under the restriction that the lattice points realizing the successive minima are not contained in a collection of forbidden sublattices. Our investigations extend former results to forbidden full-dimensional lattices, to all successive minima and complement former results in the lower dimensional case.Comment: 11 pages, Abstract and Introduction revised in view of new added reference

    Weakly Restricted Stochastic Grammars

    Get PDF
    A new type of stochastic grammars is introduced for investigation: weakly restricted stochastic grammars. In this paper we will concentrate on the consistency problem. To find conditions for stochastic grammars to be consistent, the theory of multitype Galton-Watson branching processes and generating functions is of central importance.\ud The unrestricted stochastic grammar formalism generates the same class of languages as the weakly restricted formalism. The inside-outside algorithm is adapted for use with weakly restricted grammars

    Restricted Global Grammar Constraints

    Full text link
    We investigate the global GRAMMAR constraint over restricted classes of context free grammars like deterministic and unambiguous context-free grammars. We show that detecting disentailment for the GRAMMAR constraint in these cases is as hard as parsing an unrestricted context free grammar.We also consider the class of linear grammars and give a propagator that runs in quadratic time. Finally, to demonstrate the use of linear grammars, we show that a weighted linear GRAMMAR constraint can efficiently encode the EDITDISTANCE constraint, and a conjunction of the EDITDISTANCE constraint and the REGULAR constraintComment: Proceedings of the 15th International Conference on Principles and Practice of Constraint Programming, Lisbon, Portugal. September 200
    corecore