相关论文: Bessel polynomials, double factorials and context-…

We construct a state model for the two-variable Kauffman polynomial using planar trivalent graphs. We also use this model to obtain a polynomial invariant for a certain type of trivalent graphs embedded in three-dimensional space.

In a recent paper (M. Barash, A. Okhotin, "Defining contexts in context-free grammars", LATA 2012), the authors introduced an extension of the context-free grammars equipped with an operator for referring to the left context of the…

We exhibit new biorthogonal sequences generated by index integrals of the squares of the modified Bessel functions and gamma functions. The composition orthogonality, involving differential operators is employed. Generalized Wilson…

The origin of this study is based on not only explicit formulas of finite sums involving higher powers of binomial coefficients, but also explicit evaluations of generating functions for this sums. It should be emphasized that this study…

A multivariable generalisation of the Bessel polynomials is introduced and studied. In particular, we deduce their series expansion in Jack polynomials, a limit transition from multivariable Jacobi polynomials, a sequence of algebraically…

In the present article, we study Bell based Euler polynomial of order {\alpha} and investigate some useful correlation formula, summation formula and derivative formula. Also, we introduce some relation of string number of the second kind.…

In this paper, we introduce a new concept namely degree polynomial for vertices of a simple graph. This notion leads to a concept namely degree polynomial sequence which is stronger than the concept of degree sequence. After obtaining the…

A number of new definite integrals involving Bessel functions are presented. These have been derived by finding new integral representations for the product of two Bessel functions of different order and argument in terms of the generalized…

The problem of identifying a probabilistic context free grammar has two aspects: the first is determining the grammar's topology (the rules of the grammar) and the second is estimating probabilistic weights for each rule. Given the hardness…

Using the theory of orthogonal polynomials, their associated recursion relations and differential formulas we develop a method for evaluating new integrals. The method is illustrated by obtaining a closed-form expression for the value of an…

String diagrams provide an intuitive language for expressing networks of interacting processes graphically. A discrete representation of string diagrams, called string graphs, allows for mechanised equational reasoning by double-pushout…

We propose a scalable framework for deciding, proving, and explaining (in-)equivalence of context-free grammars. We present an implementation of the framework and evaluate it on large data sets collected within educational support systems.…

In this note, we provide bijective proofs of some identities involving the Bell number, as previously requested. Our arguments may be extended to yield a generalization in terms of complete Bell polynomials. We also provide a further…

We show that slight modifications of the Kontorovich-Lebedev transform lead to an automorphism of the vector space of polynomials. This circumstance along with the Mellin transformation property of the modified Bessel functions perform the…

The definition of the binomial coefficient in terms of gamma functions also allows non-integer arguments. For nonnegative integer arguments the gamma functions reduce to factorials, leading to the well-known Pascal triangle. Using a…

Some general criteria to produce explicit free algebras inside the division ring of fractions of skew polynomial rings are presented. These criteria are applied to some special cases of division rings with natural involutions, yielding, for…

We develop a nonstandard approach to exploring polynomials associated with peaks and runs of permutations. With the aid of a context-free grammar, or a set of substitution rules, one can perform a symbolic calculus, and the computation…

This paper has a threefold aim. On the one hand, we provide a complete description of Laguerre-Hahn forms of class zero. This fills a gap in the literature: more precisely, up to an affine change of variables, there are ten families,…

Probabilistic context-free grammars (PCFGs) with neural parameterization have been shown to be effective in unsupervised phrase-structure grammar induction. However, due to the cubic computational complexity of PCFG representation and…

We study a formalization of the grammar induction problem that models sentences as being generated by a compound probabilistic context-free grammar. In contrast to traditional formulations which learn a single stochastic grammar, our…