New degenerate Bernoulli, Euler, and Genocchi polynomials

We introduce new generalizations of the Bernoulli, Euler, and Genocchi polynomials and numbers based on the Carlitz-Tsallis degenerate exponential function. Also, we present generalizations of some familiar identities and connection between these types of Bernoulli, Euler, and Genocchi polynomials. Moreover, we establish new analogues of the Euler identity for degenerate Bernoulli polynomials and numbers.

Counting Stirling permutations by number of pushes

Let 𝒯(k)n denote the set of k-Stirling permutations having n distinct letters. Here, we consider the number of steps required (i.e., pushes) to rearrange the letters of a member of 𝒯(k)n so that they occur in non-decreasing order. We find recurrences for the joint distribution on 𝒯(k)n for the statistics recording the number of levels (i.e., occurrences of equal adjacent letters) and pushes. When k = 2, an explicit formula for the ordinary generating function of this distribution is also found. In order to do so, we determine the LU-decomposition of a certain infinite matrix having polynomial entries which enables one to compute explicitly the inverse matrix.

Enumeration of S-Motzkin paths from left to right and from right to left: a kernel method approach

The area of S-Motzkin paths (bijective to ternary trees) is calculated using the kernel method by enumerating these (partial) paths with fixed end-point resp. starting point.

An actuarial mathematical model for a new pension philosophy. An application to the accountant pension fund

This paper adapts an actuarial mathematical model, built for the Italian public pension system, based on the law proposal 3035/2009 to the Accountant Pension Fund (CNPADC). The aim is to introduce a new philosophy pension highly correlated with the concept of adequacy for an ambitious social welfare; using the logic of the 3035/2009 proposal, which guarantees a minimum threshold for the replacement rate of the direct pension, this study provides a rigorous actuarial mathematical model that explains a sort of rate of contribution at a tendential equilibrium, in a pay-as-you-go pension system. This model reveals for which parameters it is possible to intervene to maintain the standard of living in retirement.

Colourability and word-representability of near-triangulations

A graph G = (V;E) is word-representable if there is a word w over the alphabet V such that x and y alternate in w if and only if the edge (x; y) is in G. It is known [6] that all 3-colourable graphs are word-representable, while among those with a higher chromatic number some are word-representable while others are not. There has been some recent research on the word-representability of polyomino triangulations. Akrobotu et al. [1] showed that a triangulation of a convex polyomino is word-representable if and only if it is 3-colourable; and Glen and Kitaev [5] extended this result to the case of a rectangular polyomino triangulation when a single domino tile is allowed. It was shown in [4] that a near-triangulation is 3-colourable if and only if it is internally even. This paper provides a much shorter and more elegant proof of this fact, and also shows that near-triangulations are in fact a generalization of the polyomino triangulations studied in [1] and [5], and so we generalize the results of these two papers, and solve all open problems stated in [5].

On the exhaustive generation of generalized ballot sequences in lexicographic and Gray code order

A generalized (resp. p-ary) ballot sequence is a sequence over the set of non-negative integers (resp. integers less than p) where in any of its prefixes each positive integer i occurs at most as often as any integer less than i. We show that the Reected Gray Code order induces a cyclic 3-adjacent Gray code on both, the set of fixed length generalized ballot sequences and p-ary ballot sequences when p is even, that is, ordered list where consecutive sequences (regarding the list cyclically) differ in at most 3 adjacent positions. Non-trivial efficient generating algorithms for these ballot sequences, in lexicographic order and for the obtained Gray codes, are also presented.

On the largest part size and its multiplicity of a random integer partition

Let λ be a partition of the positive integer n chosen uniformly at random among all such partitions. Let Ln = Ln(λ) and Mn = Mn(λ) be the largest part size and its multiplicity, respectively. For large n, we focus on a comparison between the partition statistics Ln and LnMn. In terms of convergence in distribution, we show that they behave in the same way. However, it turns out that the expectation of LnMn – Ln grows as fast as {1 \over 2}\log n . We obtain a precise asymptotic expansion for this expectation and conclude with an open problem arising from this study.

The Deletion-Insertion model applied to the genome rearrangement problem

Permutations are frequently used in solving the genome rearrangement problem, whose goal is finding the shortest sequence of mutations transforming one genome into another. We introduce the Deletion-Insertion model (DI) to model small-scale mutations in species with linear chromosomes, such as humans. Applying one restriction to this model, we obtain the transposition model for genome rearrangement, which was shown to be NP-hard in [4]. We use combinatorial reasoning and permutation statistics to develop a polynomial-time algorithm to approximate the minimum number of transpositions required in the transposition model and to analyze the sharpness of several bounds on transpositions between genomes.

Generalized Jacobsthal numbers and restricted k-ary words

We consider a generalization of the problem of counting ternary words of a given length which was recently investigated by Koshy and Grimaldi [10]. In particular, we use finite automata and ordinary generating functions in deriving a k-ary generalization. This approach allows us to obtain a general setting in which to study this problem over a k-ary language. The corresponding class of n-letter k-ary words is seen to be equinumerous with the closed walks of length n − 1 on the complete graph for k vertices as well as a restricted subset of colored square-and-domino tilings of the same length. A further polynomial extension of the k-ary case is introduced and its basic properties deduced. As a consequence, one obtains some apparently new binomial-type identities via a combinatorial argument.

Enumeration of permutations avoiding a triple of 4-letter patterns is almost all done

This paper basically completes a project to enumerate permutations avoiding a triple T of 4-letter patterns, in the sense of classical pattern avoidance, for every T. There are 317 symmetry classes of such triples T and previous papers have enumerated avoiders for all but 14 of them. One of these 14 is conjectured not to have an algebraic generating function. Here, we find the generating function for each of the remaining 13, and it is algebraic in each case.