Results 21 to 30 of about 17,873 (292)
On the evolution of random integer compositions [PDF]
The Electronic Journal of CombinatoricsWe explore how the asymptotic structure of a random n-term weak integer composition of m evolves, as m increases from zero. The primary focus is on establishing thresholds for the appearance and disappearance of substructures.
Bevan, David, Threlfall, Dan
core +5 more sources
Nauka ta progres transportu, 2008 An algorithm for determination of integer solution of the task of vector optimization for convex functions is offered.
O. O. Bosov, H. M. Kodola
doaj +1 more source
Distinctness of compositions of an integer: A probabilistic analysis
Random Structures & Algorithms, 2001 Compositions of integers are used as theoretical models for many applications. The degree of distinctness of a composition is a natural and important parameter.
Louchard, Guy +3 more
core +4 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 +4 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
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
The topology of restricted partition posets [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 For each composition $\vec{c}$ we show that the order complex of the poset of pointed set partitions $Π ^• _{\vec{c}}$ is a wedge of $β\vec{c}$ spheres of the same dimensions, where $β\vec{c}$ is the number of permutations with descent composition ^$\vec{
Richard Ehrenborg, JiYoon Jung
doaj +1 more source
A Littlewood-Richardson type rule for row-strict quasisymmetric Schur functions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 We establish several properties of an algorithm defined by Mason and Remmel (2010) which inserts a positive integer into a row-strict composition tableau.
Jeffrey Ferreira
doaj +1 more source
Convex approximations for complete integer recourse models [PDF]
, 2002 We consider convex approximations of the expected value function of a two-stage integer recourse problem. The convex approximations are obtained by perturbing the distribution of the random right-hand side vector.
Vlerk, Maarten H. van der +2 more
core +1 more source