相关论文: The combinatorics of Jeff Remmel

Le but cette note est de tenter d'expliquer les liens \'etroits qui unissent la th\'eorie des empilements de cercles et des modules combinatoires, et de comparer les approches \`a la conjecture de J.W. Cannon qui en d\'ecoulent. ???? The…

One of the most popular and studied recursive series is the Fibonacci sequence. It is challenging to see how Fibonacci numbers can be used to generate other recursive sequences. In our article, we describe some families of integer…

I was interested in the work of Solomon Marcus in Mathematical Linguistics as a high-school student. Later, I had the opportunity to discuss with him about many topics. He was a polymath. We wrote a paper together, and I refereed an…

Heckman and Opdam introduced a non-symmetric analogue of Jack polynomials using Cherednik operators. In this paper, we derive a simple recursion formula for these polynomials and formulas relating the symmetric Jack polynomials with the…

The Frankl conjecture (called also union-closed sets conjecture) is one of the famous unsolved conjectures in combinatorics of finite sets. In this short note, we introduce and to some extent justify some variants of the Frankl conjecture.

A lemma of Micchelli's, concerning radial polynomials and weighted sums of point evaluations, is shown to hold for arbitrary linear functionals, as is Schaback's more recent extension of this lemma and Schaback's result concerning…

Multiple analogues of certain families of combinatorial numbers are recently constructed by the author in terms of well poised Macdonald functions, and some of their fundamental properties are developed. In this paper, we present…

In 1981, Andr\'e Joyal provided a combinatorial interpretation of the algebra of formal power series, a central gadget in the toolkit of enumerative combinatorics. In Joyal's theory of species of structures, combinatorial species (like…

Theory of Probability is distinguished by several high-level philosophical attitudes, some stressed by Jeffreys, some implicit. By reviewing these we may recognize the importance in this work in the historical development of statistics.…

We introduce in this section an Algebraic and Combinatorial approach to the theory of Numbers. The approach rests on the observation that numbers can be identified with familiar combinatorial objects namely rooted trees, which we shall here…

This article describes a sequence of rational functions which converges locally uniformly to the zeta function. The numerators (and denominators) of these rational functions can be expressed as characteristic polynomials of matrices that…

The concept of Central sets, introduced by Furstenberg through the framework of topological dynamics, has played a pivotal role in combinatorial number theory. Furstenberg's Central Sets Theorem highlighted their rich combinatorial…

At the end, the house always wins! This simple truth holds for all public games of chance. Nevertheless, since lotteries have existed, people have tried everything to give luck a helping hand. This article compares objective scientific…

Combinatorial games lead to several interesting, clean problems in algorithms and complexity theory, many of which remain open. The purpose of this paper is to provide an overview of the area to encourage further research. In particular, we…

We are interested in the following version of Jeffreys's law: if two predictors are predicting the same sequence of events and either is doing a satisfactory job, they will make similar predictions in the long run. We give a classification…

A vector composition of a vector $\mathbf{\ell}$ is a matrix $\mathbf{A}$ whose rows sum to $\mathbf{\ell}$. We define a weighted vector composition as a vector composition in which the column values of $\mathbf{A}$ may appear in different…

In this paper, we investigate some properties of several Sheffer sequences of several polynomials arising from umbral calculus. From our investigation, we can derive many interesting identities of several polynomials

There are two rather distinct approaches to Morse theory nowadays: smooth and discrete. We propose to study a real valued function by assembling all associated sections in a topological category. From this point of view, Reeb functions on…

This essay considers the special character of mathematical reasoning, and draws on observations from interactive theorem proving and the history of mathematics to clarify the nature of formal and informal mathematical language. It proposes…

Using methods developed by Robinson, we find a complete theory suitable for a first order description of infintesimal neighborhoods. We use this to construct a specialisation having universal properties and to find a recursively enumerable…