Results 1 to 10 of about 35,860 (197)
Fourier series of functions involving higher-order ordered Bell polynomials
Open Mathematics, 2017 In 1859, Cayley introduced the ordered Bell numbers which have been used in many problems in number theory and enumerative combinatorics. The ordered Bell polynomials were defined as a natural companion to the ordered Bell numbers (also known as the ...
Kim Taekyun +3 more
doaj +1 more source
Mathematics, 2018 In this paper, we justify by the use of Enumerative Combinatorics, the applicability of an asymptotic stability result on Discrete-Time Epidemics in Complex Networks, where the complex dynamics of an epidemic model to identify the nodes that contribute ...
Carlos Rodríguez Lucatero +1 more
doaj +1 more source
Bayer noise quasisymmetric functions and some combinatorial algebraic structures [PDF]
Categories and General Algebraic Structures with ApplicationsRecently, quasisymmetric functions have been widely studied due to their big connection to enumerative combinatorics, combinatorial Hopf algebra and number theory.
Adnan Abdulwahid
doaj +1 more source
Enumerative Combinatorics of Intervals in the Dyck Pattern Poset [PDF]
Order, 2021 AbstractWe initiate the study of the enumerative combinatorics of the intervals in the Dyck pattern poset. More specifically, we find some closed formulas to express the size of some specific intervals, as well as the number of their covering relations. In most of the cases, we are also able to refine our formulas by rank.
Bernini A. +3 more
openaire +5 more sources
Tangency quantum cohomology and characteristic numbers
Anais da Academia Brasileira de Ciências, 2001 This work establishes a connection between gravitational quantum cohomology and enumerative geometry of rational curves (in a projective homogeneous variety) subject to conditions of infinitesimal nature like, for example, tangency.
JOACHIM KOCK
doaj +1 more source
COMBINATORIAL ANALYSIS OF THE DOMINOES SCHEME AND THE CASE OF FIXED MINIMAL FIGURE ON A DOMINO TILE
Transactions of the Karelian Research Centre of the Russian Academy of Sciences, 2017 The dominoes scheme is defined as a scheme of random tiling with poliomino tiles with $r$ ends and $n$ figures from 0 to $(n-1)$ on the ends of tiles of all possible compositions with repetitions, regardless of their order.
Natalia Enatskaya
doaj +1 more source
An Extension of the Exponential Formula in Enumerative Combinatorics [PDF]
The Electronic Journal of Combinatorics, 1995 Let $\alpha$ be a formal variable and $F_w$ be a weighted species of structures (class of structures closed under weight-preserving isomorphisms) of the form ${F}_{w} = E({F}_{w}^{c})$, where $E$ and $F_w^c$ respectively denote the species of sets and of connected $F_w$-structures.
Gilbert Labelle, Pierre Leroux
openaire +2 more sources
Computer Algebra in the Service of Enumerative Combinatorics [PDF]
Proceedings of the 2021 International Symposium on Symbolic and Algebraic Computation, 2021 Classifying lattice walks in restricted lattices is an important problem in enumerative combinatorics. Recently, computer algebra has been used to explore and to solve a number of difficult questions related to lattice walks. We give an overview of recent results on structural properties (e.g., algebraicity versus transcendence) and on explicit ...
openaire +3 more sources
Business Strategy and the Environment, EarlyView.ABSTRACT Little is known about consumer preferences for combinations of circular business model patterns, despite their potential to benefit the design of product services. This study examines consumer preferences for product‐as‐a‐service offers, combined with circular product attributes, across Sweden and the Netherlands.
Steven Sarasini +5 more
wiley +1 more source
Mixed Steiner Triple Systems With Shortest Length
Journal of Combinatorial Designs, EarlyView.ABSTRACT A mixed Steiner triple system is a 3‐GDD which is viewed as a code with minimum Hamming distance 3. These codes are the minimum weight codewords of a 1‐perfect code over a mixed alphabet, when the related codes exist, and provide the connection between 3‐GDDs and coding theory.
Tuvi Etzion
wiley +1 more source