Results 251 to 260 of about 2,606,960 (274)

Trees With Flowers: A Catalog of Integer Partition and Integer Composition Trees With Their Asymptotic Analysis

Boletin De La Sociedad Matematica Mexicana
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

Some of the next articles are maybe not open access.

Related searches:

On cyclic compositions of positive integers

Aequationes mathematicae, 2011
Say that two compositions of n into k parts are related if they differ only by a cyclic shift. This defines an equivalence relation on the set of such compositions. Let \({\left\langle \begin{array}{c}n \\ k\end{array} \right\rangle}\) denote the number of distinct corresponding equivalence classes, that is, the number of cyclic compositions of n into ...
Arnold Knopfmacher, Florian Luca, Neville Robbins   +2 more
openaire   +1 more source

Irreducibility Results for Compositions of Polynomials with Integer Coefficients

Monatshefte für Mathematik, 2006
The paper begins by a very interesting survey of results on irreducibility of composite polynomials. In this work, the authors obtain explicit upper bounds for the number of irreducible factors for a class of polynomials of the form \(f \circ g\), where \(f\) and \(g\) are polynomials with integer coefficients, in terms of the degrees of \(f\) and \(g\)
Bonciocat, Anca Iuliana, Zaharescu, Alexandru   +1 more
openaire   +2 more sources

ON THE MEAN VALUE OF THE INDEX OF COMPOSITION OF AN INTEGER II

International Journal of Number Theory, 2012
For each integer n ≥ 2, let [Formula: see text] be the index of composition of n, where γ(n) ≔ ∏p∣np. The index of composition of an integer measures the multiplicity of its prime factors. In this paper, we obtain a new asymptotic formula of the sum ∑n≤xλ-k(n). Furthermore, we improve the error term under the Riemann Hypothesis.
Zhang, Deyu, Lü, Meimei, Zhai, Wenguang
openaire   +1 more source

A Unified Approach to Algorithms Generating Unrestricted and Restricted Integer Compositions and Integer Partitions

Journal of Mathematical Modelling and Algorithms, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Fibonacci Numbers, Integer Compositions, and Nets of Antiprisms

The American Mathematical Monthly, 2019
All geometrically distinct nets (edge-unfoldings) are explicitly constructed for the infinite family of polyhedra known as uniform antiprisms.
openaire   +1 more source

Integer compositions and higher-order conjugation

J. Integer Seq., 2018
Summary: We consider the classical MacMahon conjugation of compositions or ordered partitions of positive integers. Using both algebraic and graphical methods we provide a natural extension of the standard conjugation of a composition to higher orders. The higher-order conjugates of a composition are obtained by varying the increments used in standard ...
openaire   +2 more sources

Runs of composite integers and the Chinese Remainder Theorem

The Mathematical Gazette, 1994
The distribution of the prime numbers is of course a well-trodden path. The casual enquirer, working with small numbers, soon finds that the distribution has no obvious regularities, and sees that the primes thin out. The Prime number theorem (which is not elementary) helps to firm up this ...
openaire   +2 more sources

Cloud Manufacturing Service Composition and Optimal Selection With Sustainability Considerations: A Multi-Objective Integer Bi-Level Multi-Follower Programming Approach

International Journal of Production Research, 2020
Guozhu Jia, Yang Cheng, Yanxia Wu
exaly  

On Representing Integers as Sums of Odd Composite Integers

Mathematics Magazine, 1975
openaire   +1 more source