Results 1 to 10 of about 17,966 (292)
The largest missing value in a composition of an integer [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Margaret Archibald, Arnold Knopfmacher
exaly +4 more sources
Integer composition, connection Appell constants and Bell polynomials [PDF]
We introduce an explicit form of the connection coefficients for Appell polynomial sequences via Toeplitz-Hessenberg matrix determinants. Generalizing, we give an explicit form of the connection coefficients for arbitrary polynomial sequences and ...
Nataliia Luno
doaj +11 more sources
A Note on the Compositions of an Integer [PDF]
Given an integer n, we define an r-composition of n as follows:An r-composition of n, (t1, ... , tr), is a set of ti where ti ≥ 1 is an integer for i = 1, ... , r such thatIf r is an integer such that 1 ≤ r ≤ n, we have, obviously, distinct r - compositions of n.
Narayana, T. V., Fulton, G. E.
openaire +4 more sources
The Tantawy technique for modeling fractional KdV and mKdV positron-acoustic solitary waves in an electron-positron-ion plasma with regularized $$\kappa -$$ distribution [PDF]
This work investigates the dynamical behavior of both the integer and fractional-order positron-acoustic solitary waves (PASWs) in a collisionless, unmagnetized electron-positron-ion plasma composed of stationary positive ions, inertial cold positrons ...
Samir A. El-Tantawy +4 more
doaj +2 more sources
Longest run of equal parts in a random integer composition
15 pages, 3 ...
Ayla Gafni
exaly +3 more sources
We present families of combinatorial classes described as trees with nodes that can carry one of two types of "flowers": integer partitions or integer compositions. Two parameters on the flowers of trees will be considered: the number of "petals" in all the flowers (petals' weight) and the number of edges in the petals of all the flowers (flowers ...
Yongjian Yang
exaly +4 more sources
Integer factoring and compositeness witnesses [PDF]
Abstract We describe a reduction of the problem of factorization of integers n ≤ x in polynomial-time (log x ) M +
Jacek Pomykala, Maciej Radziejewski
openaire +4 more sources
ON MULTIPLICATIVE COMPOSITIONS OF INTEGERS [PDF]
We consider an arithmetic function defined independently by John G. Thompson andGreg Simay, with particular attention to its mean value, and its maximal size, and the analyticnature of its Dirichlet series generating function.
Montgomery, Hugh, Tenenbaum, Gerald
openaire +3 more sources
S-Restricted Compositions Revisited [PDF]
An S-restricted composition of a positive integer n is an ordered partition of n where each summand is drawn from a given subset S of positive integers. There are various problems regarding such compositions which have received attention in recent years.
Behrouz Zolfaghari +2 more
doaj +1 more source
The first ascent of size $d$ or more in compositions [PDF]
A composition of a positive integer $n$ is a finite sequence of positive integers $a_1, a_2, \ldots, a_k$ such that $a_1+a_2+ \cdots +a_k=n$. Let $d$ be a fixed nonnegative integer.
Charlotte Brennan, Arnold Knopfmacher
doaj +1 more source

