Generating Functions of Binary Products of Tribonacci and Tribonacci Lucas Polynomials and Special Numbers

In this paper, we introduce a new operator defined in this paper, we give some new generating functions of binary products of Tribonacci and Tribonacci Lucas polynomials and special numbers.

Generating Functions for Certain Weighted Cranks

Recently, George Beck posed many interesting partition problems considering the number of ones in partitions. In this paper, we first consider the crank generating function weighted by the number of ones and obtain analytic formulas for this weighted crank function under conditions of the crank being less than or equal to some specific integer. We connect these cumulative and point crank functions to the generating functions of partitions with certain sizes of Durfee rectangles. We then consider a generalization of the crank for $k$-colored partitions, which was first introduced by Fu and Tang, and investigate the corresponding generating function for this crank weighted by the number of parts in the first subpartition of a $k$-colored partition. We show that the cumulative generating functions are the same as the generating functions for certain unimodal sequences.

Generating functions and congruences for 9-regular and 27-regular partitions in 3 colours

Let $b_{\ell;3}(n)$ denote the number of $\ell$-regular partitions of $n$ in 3 colours. In this paper, we find some general generating functions and new infinite families of congruences modulo arbitrary powers of $3$ when $\ell\in\{9,27\}$. For instance, for positive integers $n$ and $k$, we have\begin{align*}b_{9;3}\left(3^k\cdot n+3^k-1\right)&\equiv0~\left(\textup{mod}~3^{2k}\right),\\b_{27;3}\left(3^{2k+3}\cdot n+\dfrac{3^{2k+4}-13}{4}\right)&\equiv0~\left(\textup{mod}~3^{2k+5}\right).\end{align*}

A survey on t-core partitions

$t$-core partitions have played important roles in the theory of partitions and related areas. In this survey, we briefly summarize interesting and important results on $t$-cores from classical results like how to obtain a generating function to recent results like simultaneous cores. Since there have been numerous studies on $t$-cores, it is infeasible to survey all the interesting results. Thus, we mainly focus on the roles of $t$-cores in number theoretic aspects of partition theory. This includes the modularity of $t$-core partition generating functions, the existence of $t$-core partitions, asymptotic formulas and arithmetic properties of $t$-core partitions, and combinatorial and number theoretic aspects of simultaneous core partitions. We also explain some applications of $t$-core partitions, which include relations between core partitions and self-conjugate core partitions, a $t$-core crank explaining Ramanujan's partition congruences, and relations with class numbers.

Performance reliability analysis of multi-state degraded system with improved Lz transform

Universal Generating Functions and Lz transformations have been widely used in the reliability modeling of multi-state systems. In order to solve the problem of complex calculations due to the dense random combination of multi-state performance parameters in the Lz transformation, a screening function is defined before the Lz transformation, and the screening function is combined with the performance threshold to screening the state performance parameters in advance, and the process is simplified through the screen matrix and the screen block diagram, effectively reduce the combined dimensions and quantity, improve the efficiency of reliability analysis, and combine with specific examples for application verification.

Note on $ r $-central Lah numbers and $ r $-central Lah-Bell numbers

<abstract><p>The $ r $-Lah numbers generalize the Lah numbers to the $ r $-Stirling numbers in the same sense. The Stirling numbers and the central factorial numbers are one of the important tools in enumerative combinatorics. The $ r $-Lah number counts the number of partitions of a set with $ n+r $ elements into $ k+r $ ordered blocks such that $ r $ distinguished elements have to be in distinct ordered blocks. In this paper, the $ r $-central Lah numbers and the $ r $-central Lah-Bell numbers ($ r\in \mathbb{N} $) are introduced parallel to the $ r $-extended central factorial numbers of the second kind and $ r $-extended central Bell polynomials. In addition, some identities related to these numbers including the generating functions, explicit formulas, binomial convolutions are derived. Moreover, the $ r $-central Lah numbers and the $ r $-central Lah-Bell numbers are shown to be represented by Riemann integral, respectively.</p></abstract>

Symmetry and Combinatorial Concepts for Cyclopolyarenes, Nanotubes and 2D-Sheets: Enumerations, Isomers, Structures Spectra & Properties

This review article highlights recent developments in symmetry, combinatorics, topology, entropy, chirality, spectroscopy and thermochemistry pertinent to 2D and 1D nanomaterials such as circumscribed-cyclopolyarenes and their heterocyclic analogs, carbon and heteronanotubes and heteronano wires, as well as tessellations of cyclopolyarenes, for example, kekulenes, septulenes and octulenes. We establish that the generalization of Sheehan’s modification of Pólya’s theorem to all irreducible representations of point groups yields robust generating functions for the enumeration of chiral, achiral, position isomers, NMR, multiple quantum NMR and ESR hyperfine patterns. We also show distance, degree and graph entropy based topological measures combined with techniques for distance degree vector sequences, edge and vertex partitions of nanomaterials yield robust and powerful techniques for thermochemistry, bond energies and spectroscopic computations of these species. We have demonstrated the existence of isentropic tessellations of kekulenes which were further studied using combinatorial, topological and spectral techniques. The combinatorial generating functions obtained not only enumerate the chiral and achiral isomers but also aid in the machine construction of various spectroscopic and ESR hyperfine patterns of the nanomaterials that were considered in this review. Combinatorial and topological tools can become an integral part of robust machine learning techniques for rapid computation of the combinatorial library of isomers and their properties of nanomaterials. Future applications to metal organic frameworks and fullerene polymers are pointed out.