Related papers: Combinatorial Solutions to Normal Ordering of Boso…
We introduce a class of $f(t)$-factorials, or $f(t)$-Pochhammer symbols, that includes many, if not most, well-known factorial and multiple factorial function variants as special cases. We consider the combinatorial properties of the…
We consider a general concept of composition and decomposition of objects, and discuss a few natural properties one may expect from a reasonable choice thereof. It will be demonstrated how this leads to multiplication and co- multiplication…
Classical Gon\v{c}arov polynomials arose in numerical analysis as a basis for the solutions of the Gon\v{c}arov interpolation problem. These polynomials provide a natural algebraic tool in the enumerative theory of parking functions. By…
This paper focuses on the existence and multiplicity of normalized solutions for the coupled Schrodinger system with Sobolev critical coupling term. We present several existence and multiplicity results under some explicit conditions.…
Methods of solving big Boolean equations can be broadly classified as algebraic, tabular, numerical and map methods. The most prominent among these classes are the algebraic and map methods. This paper surveys and compares these two types…
We study the commutation relations and normal ordering between families of operators on symmetric functions. These operators can be naturally defined by the operations of multiplication, Kronecker product, and their adjoints. As…
In [1] a new bosonization procedure has been illustrated, which allows to express a fermionic gaussian system in terms of commuting variables at the price of introducing an extra dimension. The Fermi-Bose duality principle established in…
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…
This paper surveys the recent attempts, both from the machine learning and operations research communities, at leveraging machine learning to solve combinatorial optimization problems. Given the hard nature of these problems,…
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…
Two general methods for establishing the logarithmic behavior of recursively defined sequences of real numbers are presented. One is the interlacing method, and the other one is based on calculus. Both methods are used to prove logarithmic…
This article introduces a pedagogical method for {\it solving combinatorial problems} that frequently involve structures that are unfamiliar or less familiar. Indeed, an indirect method has been proposed in order to evade any possible…
The distribution of a given sequence in the set of all sequences with n ones and m = M - n zeros are found by relating the problem to the partitions of a natural number in m natural summands, taking into account the order. The formulas…
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…
We study set partitions with $r$ distinguished elements and block sizes found in an arbitrary index set $S$. The enumeration of these $(S,r)$-partitions leads to the introduction of $(S,r)$-Stirling numbers, an extremely wide-ranging…
Algebraic and analytic aspects of self-adjoint operators of order four or more with polynomial coefficients are investigated. As a consequence, a systematic way of constructing such operators is given. The procedure is applied to obtain…
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…
In this paper, we consider the problem of representing any polynomial in terms of the ordered Bell and degenerate ordered Bell polynomials, and more generally of the higher-order ordered Bell and higher-order degenerate ordered Bell…
In this work, we introduce a novel numerical method for solving initial value problems associated with a given differential. Our approach utilizes a spline approximation of the theoretical solution alongside the integral formulation of the…
We present a simple yet powerful technique for forming iterative methods of various convergence orders. Methods of various convergence orders (four, six, eight and ten) are formed through a modest modification of the classical Newton…