Catalogue Search | MBRL
Are you sure you want to remove the book from the shelf?
{{itemTitle}}
41,167
result(s) for
"Combinatorial analysis."
Sort by:
The combinatory systems theory : understanding, modeling and simulating collective phenomena
This study adopts the logic of systems thinking and control systems, presenting a simple but complete theory called the theory of combinatory systems. This new theory is able to describe, interpret, explain, simulate and control collective phenomena and their observable effects. Despite specific differences among these phenomena - many of which are 'one way', non-repeatable or reproducible - they can all be described or explained, and thus understood, using the model, as simple as it is general, of combinatory systems.
Book
Hierarchical structures and plane sections of generalized Pascal’s pyramid
We research mathematical combinatorial objects of pyramidal structure. Hierarchical structures are constructed based on the sums of the generalized Pascal’s pyramid plane sections elements. Enumerative interpretations of these structures constituent objects are obtained, the recurrence relations that these objects satisfy are proved, and some of the most important special cases of the obtained results are considered using the known combinatorial numbers as an example.
Journal Article
The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary
We solve the existence problem for
Our main result concerns decompositions of hypergraphs whose clique distribution fulfills certain regularity
constraints. Our argument allows us to employ a ‘regularity boosting’ process which frequently enables us to satisfy these constraints
even if the clique distribution of the original hypergraph does not satisfy them. This enables us to go significantly beyond the setting
of quasirandom hypergraphs considered by Keevash. In particular, we obtain a resilience version and a decomposition result for
hypergraphs of large minimum degree.
eBook
A Short Note on an Identity of Spivey for Bell Numbers
Spivey obtained an identity for Bell numbers, here we give an elementary proof of it and we show that it gives a recurrence relation for Yio jr st I which shows that these quantities involving the Stirling numbers of the second kind are linear combination of the B(k).
Journal Article
COMBINATORIAL PROPERTIES OF THE DIFFERENCE SET WITH RESPECT TO CPHMs OF ROW SUM 0 AND 2
This article investigates the combinatorial properties of difference sets within the cyclic group Zn, specifically in the context of circulant partial Hadamard matrices (CPHMs). We examine the structural characteristics and establish relationships between difference sets associated with 2-H(m×n) and 0-H(m×n) matrices. Our results provide insights into the interplay between these matrix classes and their corresponding difference sets, contributing to the broader understanding of their applications in combinatorial design theory.
Journal Article
