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

We present the new combinatorial class of product-coproduct prographs which are planar assemblies of two types of operators: products having two inputs and a single output and coproducts having a single input and two outputs. We show that…

The aim of this paper is to give two new algorithms, which are elimination free, to find polynomial and rational solutions for a given holonomic system associated to a set of linear differential operators in the Weyl algebra D = k<x_1, ...,…

Computer science students often struggle with abstract theoretical concepts, particularly in introductory courses on theoretical computer science. One such challenge is understanding context-free languages and their various representations.…

The aim of this paper is to construct general forms of ordinary generating functions for special numbers and polynomials involving Fibonacci type numbers and polynomials, Lucas numbers and polynomials, Chebyshev polynomials, Sextet…

Partial ordinary Bell polynomials are used to formulate and prove a version of the Fa\`{a} di Bruno's formula which is convenient for handling nonlinear terms in the differential transformation. Applicability of the result is shown in two…

To cater to the needs of (Zero Knowledge) proofs for (mathematical) proofs, we describe a method to transform formal sentences in 2x2-matrices over multivariate polynomials with integer coefficients, such that usual proof-steps like…

We prove exact asymptotic expansions for the partial sums of the sequences of central binomial coefficients and Catalan numbers, $\sum_{k=0}^n \binom{2k}{k}$ and $\sum_{k=0}^n C_n$. We also obtain closed forms for the polynomials…

We present an algorithm for the following problem: given a context-free grammar for the word problem of a virtually free group $G$, compute a finite graph of groups $\mathcal{G}$ with finite vertex groups and fundamental group $G$. Our…

Binet formulae for three versions of third-order Pell polynomials are derived.

Equation discovery, also known as symbolic regression, is a type of automated modeling that discovers scientific laws, expressed in the form of equations, from observed data and expert knowledge. Deterministic grammars, such as context-free…

Similar to the associated Legendre functions, the differential equation for the associated Bessel functions $B_{l,m}(x)$ is introduced so that its form remains invariant under the transformation $l\rightarrow -l-1$. A Rodrigues formula for…

This paper develops a deeper understanding of the structure and combinatorial significance of the partition function for Hermitian random matrices. The coefficients of the large N expansion of the logarithm of this partition function,also…

Motivated by independent results of Bizley and Duchon, we study rational Dyck paths and their subset of factor-free elements. On the one hand, we give a bijection between rational Dyck paths and regular Dyck paths with ascents colored by…

We use Riordan array theory to give characterizations of the Borel triangle and its associated polynomial sequence. We show that the Borel polynomials are the moment sequence for a family of orthogonal polynomials whose coefficient array is…

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…

Let $\mathcal S$ be a set of monic degree $2$ polynomials over a finite field and let $C$ be the compositional semigroup generated by $\mathcal S$. In this paper we establish a necessary and sufficient condition for $C$ to be consisting…

Matrix congruence can be used to mimic linear maps between homogeneous quadratic polynomials in $n$ variables. We introduce a generalization, called standard-form congruence, which mimics affine maps between non-homogeneous quadratic…

In this paper, we introduce the notions of quasi-triangular and factorizable Poisson bialgebras. A factorizable Poisson bialgebra induces a factorization of the underlying Poisson algebra. We prove that the Drinfeld classical double of a…

The paper describes a parser for Categorial Grammar which provides fully word by word incremental interpretation. The parser does not require fragments of sentences to form constituents, and thereby avoids problems of spurious ambiguity.…

In this paper, we introduce a new class of polynomials, called probabilistic q-Bernstein polynomials, alongside their generating function. Assuming Y is a random variable satisfying moment conditions, we use the generating function of these…