Results 1 to 10 of about 2,606,960 (274)
Integer composition, connection Appell constants and Bell polynomials [PDF]
Journal of Numerical Analysis and Approximation Theory, 2021 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
Ω-Result for the index of composition of an integer
International Journal of Number Theory, 2018 For each integer [Formula: see text], let [Formula: see text] be the index of composition of [Formula: see text], where [Formula: see text]. The index of composition of an integer measures the multiplicity of its prime factors. In this paper, we obtain an [Formula: see text]-result for the error term of the sum [Formula: see text]
Sui, Yankun, Zhai, Wenguang, Zhang, Deyu
openaire +2 more sources
Aperiodic compositions and classical integer sequences
J. Integer Seq., 2017 Summary: In this paper we define the notion of singular composition of a positive integer. We provide a characterization of these compositions, together with methods for decomposing and also extending a singular composition in terms of other singular compositions.
FERRARI, MARGHERITA MARIA +1 more
openaire +4 more sources
Binary positive semidefinite matrices and associated integer polytopes [PDF]
, 2010 We consider the positive semidefinite (psd) matrices with binary entries, along with the corresponding integer polytopes.We begin by establishing some basic properties of these matrices and polytopes.
Sorensen, M M +3 more
core +5 more sources
Cutting plane methods for general integer programming [PDF]
, 1993 Integer programming (IP) problems are difficult to solve due to the integer restrictions imposed on them. A technique for solving these problems is the cutting plane method.
Mitra, G, Hamid, FA, Darby-Dowman, K
core +5 more sources
Integer factoring and compositeness witnesses [PDF]
Journal of Mathematical Cryptology, 2020 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 +5 more sources
ON MULTIPLICATIVE COMPOSITIONS OF INTEGERS [PDF]
Mathematika, 2017 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
A Note on the Compositions of an Integer [PDF]
Canadian Mathematical Bulletin, 1958 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 +2 more sources
S-Restricted Compositions Revisited [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 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]
Discrete Mathematics & Theoretical Computer Science, 2006 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