The Legendre–Stirling numbers

The Legendre–Stirling numbers are the coefficients in the integral Lagrangian symmetric powers of the classical Legendre second-order differential expression. In many ways, these numbers mimic the classical Stirling numbers of the second kind which play a similar role in the integral powers of the classical second-order Laguerre differential expression. In a recent paper, Andrews and Littlejohn gave a combinatorial interpretation of the Legendre–Stirling numbers. In this paper, we establish several properties of the Legendre–Stirling numbers; as with the Stirling numbers of the second kind, they have interesting generating functions and recurrence relations. Moreover, there are some surprising and intriguing results relating these numbers to some classical results in algebraic number theory.     

Controlling Orthogonal Series with Irrational Rotations

We compute covering numbers associated to the set of partial sums of orthogonal series by means of irrational rotations. The device is a new metric inequality linking the increment's norm of partial sums to the one of ergodic averages of rotations acting on a suitable L ²-element of the torus. This allows to compute the number of balls covering the whole set of partial sums, by means of rotations.     

The chromatic numbers of double coverings of a graph

If we fix a spanning subgraph H of a graph G, we can define a chromatic number of H with respect to G and we show that it coincides with the chromatic number of a double covering of G with co-support H. We also find a few estimations for the chromatic numbers of H with respect to G.     

Enumeration via ballot numbers

Several interesting combinatorial coefficients such as the Catalan numbers and the Bell numbers can be described either via a 3-term recurrence or as sums of (weighted) ballot numbers. This paper gives some general results connecting 3-term recurrences with ballot sequences with several applications to the enumeration of various combinatorial instances.     

Trapezoidal approximations of fuzzy numbers preserving the expected interval — Algorithms and properties

Fuzzy number approximation by trapezoidal fuzzy numbers which preserves the expected interval is discussed. Algorithms for calculating the proper approximations are proposed and some properties of the approximation operators are discussed. It is shown that an adequate approximation operator might be chosen through the comparisons of some characteristics of the fuzzy number, like its ambiguity, width, its value and weighted expected value.     

Hybrid fuzzy least-squares regression analysis in claims reserving with geometric separation method

Claims reserving is obviously necessary for representing future obligations of an insurance company and selection of an accurate method is a major component of the overall claims reserving process. However, the wide range of unquantifiable factors which increase the uncertainty should be considered when using any method to estimate the amount of outstanding claims based on past data. Unlike traditional methods in claims analysis, fuzzy set approaches can tolerate imprecision and uncertainty without loss of performance and effectiveness. In this paper, hybrid fuzzy least-squares regression, which is proposed by Chang (2001), is used to predict future claim costs by utilizing the concept of a geometric separation method. We use probabilistic confidence limits for designing triangular fuzzy numbers. Thus, it allows us to reflect variability measures contained in a data set in the prediction of future claim costs. We also propose weighted functions of fuzzy numbers as a defuzzification procedure in order to transform estimated fuzzy claim costs into a crisp real equivalent.     

A generalization of the formula for the triangular number of the sum and product of natural numbers

This note generalizes the formula for the triangular number of the sum and product of two natural numbers to similar results for the triangular number of the sum and product of r natural numbers. The formula is applied to derive formula for the sum of an odd and an even number of consecutive triangular numbers.     

Eulerian numbers: A spline perspective

In this paper, the spline interpretations of Eulerian numbers and refined Eulerian numbers are presented. Many classical results about Eulerian numbers can follow from the properties of B-splines directly, and some new results about the refined Eulerian numbers and descent polynomials are also derived. Specifically, the explicit and recurrence formulas for the refined Eulerian numbers and descent polynomials are obtained. This paper also provides a new approach to study Eulerian numbers.     

The Euler and Springer numbers as moment sequences

I study the sequences of Euler and Springer numbers from the point of view of the classical moment problem.     

Forecasting portfolio returns using weighted fuzzy time series methods

We propose using weighted fuzzy time series (FTS) methods to forecast the future performance of returns on portfolios. We model the uncertain parameters of the fuzzy portfolio selection models using a possibilistic interval-valued mean approach, and approximate the uncertain future return on a given portfolio by means of a trapezoidal fuzzy number. Introducing some modifications into the classical models of fuzzy time series, based on weighted operators, enables us to generate trapezoidal numbers as forecasts of the future performance of the portfolio returns. This fuzzy forecast makes it possible to approximate both the expected return and the risk of the investment through the value and ambiguity of a fuzzy number.We incorporate our proposals into classical fuzzy time series methods and analyze their effectiveness compared with classical weighted fuzzy time series models, using historical returns on assets from the Spanish stock market. When our weighted FTS proposals are used to point-wise forecast portfolio returns the one-step ahead accuracy is improved, also with respect to non-fuzzy forecasting methods.     

Pattern-restricted permutations composed of 3-cycles

In this paper, we characterize and enumerate pattern-avoiding permutations composed of only 3-cycles. In particular, we answer the question for the six patterns of length 3. We find that the number of permutations composed of n 3-cycles that avoid the pattern 231 (equivalently 312) is given by $3^{n?1}$, while the generating function for the number of those that avoid the pattern 132 (equivalently 213) is given by a formula involving the generating functions for the well-known Motzkin numbers and Catalan numbers. The number of permutations composed of n 3-cycles that avoid the pattern 321 is characterized by a weighted sum involving statistics on Dyck paths of semilength n.     

高阶Bernoulli多项式和高阶Euler多项式的关系

利用发生函数的方法，讨论了高阶Bernoulli数和高阶Euler数，高阶Bernoulli多项式和高阶Euler多项式之间的关系，得到了经典Bernoulli数和Euler数，经典Bernoulli多项式和Euler多项式之间的新型关系。     

On the distribution of inversive congruential pseudorandom numbers in parts of the period

The inversive congruential method is an attractive alternative to the classical linear congruential method for pseudorandom number generation. In this paper we present the first nontrivial bounds on the discrepancy of individual sequences of inversive congruential pseudorandom numbers in parts of the period. The proof is based on a new bound for certain incomplete exponential sums.

     

Nonsymmetric party problems

The classical Ramsey problem is considered for antisymmetric digraphs and for tournaments. Three small Ramsey-type numbers are determined with some remarks concerning the general case. © 1998 John Wiley & Sons, Inc. J Graph Theory 28: 43–47, 1998     

Shortened recurrence relations for Bernoulli numbers

Starting with two little-known results of Saalschütz, we derive a number of general recurrence relations for Bernoulli numbers. These relations involve an arbitrarily small number of terms and have Stirling numbers of both kinds as coefficients. As special cases we obtain explicit formulas for Bernoulli numbers, as well as several known identities.     

The Remak height for units

We investigate the values of the Remak height, which is a weighted product of the conjugates of an algebraic number. We prove that the ratio of logarithms of the Remak height and of the Mahler measure for units αof degree d is everywhere dense in the maximal interval [d/2(d-1),1] allowed for this ratio. To do this, a “large” set of totally positive Pisot units is constructed. We also give a lower bound on the Remak height for non-cyclotomic algebraic numbers in terms of their degrees. In passing, we prove some results about some algebraic numbers which are a product of two conjugates of a reciprocal algebraic number. This revised version was published online in June 2006 with corrections to the Cover Date.     

Group decision making with expertons and uncertain generalized probabilistic weighted aggregation operators

Expertons and uncertain aggregation operators are tools for dealing with imprecise information that can be assessed with interval numbers. This paper introduces the uncertain generalized probabilistic weighted averaging (UGPWA) operator. It is an aggregation operator that unifies the probability and the weighted average in the same formulation considering the degree of importance that each concept has in the aggregation. Moreover, it is able to assess uncertain environments that cannot be assessed with exact numbers but it is possible to use interval numbers. Thus, we can analyze imprecise information considering the minimum and the maximum result that may occur. Further extensions to this approach are presented including the quasi-arithmetic uncertain probabilistic weighted averaging operator and the uncertain generalized probabilistic weighted moving average. We analyze the applicability of this new approach in a group decision making problem by using the theory of expertons in strategic management.     

Gelfand and Kolmogorov numbers of Sobolev embeddings of weighted function spaces

In this paper we study the Gelfand and Kolmogorov numbers of Sobolev embeddings between weighted function spaces of Besov and Triebel–Lizorkin type with polynomial weights. The sharp asymptotic estimates are determined in the so-called non-limiting case.     

The chromatic covering number of a graph

Following [1], we investigate the problem of covering a graph G with induced subgraphs G₁,…, G_k of possibly smaller chromatic number, but such that for every vertex u of G, the sum of reciprocals of the chromatic numbers of the G_i's containing u is at least 1. The existence of such “chromatic coverings” provides some bounds on the chromatic number of G. © 2005 Wiley Periodicals, Inc.