相关论文: The Boson Normal Ordering Problem and Generalized …
We introduce a large family of combinatorial objects, called standard puzzles, defined by very simple rules. We focus on the standard puzzles for which the enumeration problems can be solved by explicit formulas or by classical numbers,…
One of the most common problems of scientific applications is computation of the derivative of a function specified by possibly noisy or imprecise experimental data. Application of conventional techniques for numerically calculating…
A novel representation of functions, called generalized Taylor form, is applied to the filtering of white noise processes. It is shown that every Gaussian colored noise can be expressed as the output of a set of linear fractional stochastic…
We introduce the theory of normal ordered grammars, which gives a natural generalization of the normal ordering problem. To illustrate the main idea, we explore normal ordered grammars associated with the Eulerian polynomials and the…
Computers are good at evaluating finite sums in closed form, but there are finite sums which do not have closed forms. Summands which do not produce a closed form can often be ``fixed'' by multiplying them by a suitable polynomial. We…
We consider compositions of natural numbers when there are different types of each natural number. Several recursions as well as some closed formulas for the number of compositions is derived. We also find its relationships with some known…
In the present work we are concerned with the existence of normalized solutions to the following Schr\"odinger-Poisson System $$ \left\{ \begin{array}{ll} -\Delta u + \lambda u + \mu (\ln|\cdot|\ast |u|^{2})u = f(u) \textrm{ \ in \ }…
Let $\bx_j = \btheta +\bep_j, j=1,...,n$, be observations of an unknown parameter $\btheta$ in a Euclidean or separable Hilbert space $\scrH$, where $\bep_j$ are noises as random elements in $\scrH$ from a general distribution. We study the…
Normally ordered forms of functions of boson operators are important in many contexts in particular concerning Quantum Field Theory and Quantum Optics. Beginning with the seminal work of Katriel [Lett. Nuovo Cimento, 10(13):565--567, 1974],…
A combinatorial methods are used to investigate some properties of certain generalized Stirling numbers, including explicit formula and recurrence relations. Furthermore, an expression of these numbers with symmetric function is deduced.
Based on the combinatorial interpretation of the ordered Bell numbers, which count all the ordered partitions of the set $[n]=\{1,2,\dots,n\}$, we introduce the Fibonacci partition as a Fibonacci permutation of its blocks. Then we define…
In [arXiv:1006.4939] the enumeration order reducibility is defined on natural numbers. For a c.e. set A, [A] denoted the class of all subsets of natural numbers which are co-order with A. In definition 5 we redefine co-ordering for rational…
A well-known generalisation of positional numeration systems is the case where the base is the residue class of $x$ modulo a given polynomial $f(x)$ with coefficients in (for example) the integers, and where we try to construct finite…
We use discrete Morse theory to determine the M\"obius function of generalized factor order. Ordinary factor order on the Kleene closure A* of a set A is the partial order defined by letting u\leq w if w contains u as a subsequence of…
Babson and Steingr\`imsson introduced generalized permutation patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. Subsequently, Claesson presented a complete solution for the…
We investigate compositions of a positive integer with a fixed number of parts, when there are several types of each natural number. These compositions produce new relationships among binomial coefficients, Catalan numbers, and numbers of…
In this work, we extend the analytic treatment of Bessel functions of large order and/or argument. We examine uniform asymptotic Bessel function expansions and show their accuracy and range of validity. Such situations arise in a variety of…
A solution is proposed for the problem of composition of ordinary generating functions. A new class of functions that provides a composition of ordinary generating functions is introduced; main theorems are presented; compositae are written…
This paper makes a combinatorial study of the two monoids and the two types of tableaux that arise from the two possible generalizations of the Patience Sorting algorithm from permutations (or standard words) to words. For both types of…
For the Stirling numbers of the second kind $S(n,k)$ and the ordered Bell numbers $B(n)$, we prove the identity $\sum_{k=1}^{n/2} S(n,2k)(2k-1)! = B(n-1)$. An analogous identity holds for the sum over odd $k$'s.