中文
相关论文

相关论文: $n$-Colour self-inverse compositions

200 篇论文

A composition of $n\in\NN$ is an ordered collection of one or more positive integers whose sum is $n$. The number of summands is called the number of parts of the composition. A palindromic composition of $n$ is a composition of $n$ in…

组合数学 · 数学 2007-05-23 Silvia Heubach , Toufik Mansour

In this study, we define a new type of Fibonacci and Lucas num- bers which are called bicomplex Fibonacci and bicomplex Lucas numbers. We obtain the well-known properties e.g. Docagnes, Cassini, Catalan for these new types. We also give the…

数论 · 数学 2015-08-18 Semra Kaya Nurkan , İlkay Arslan Güven

Binomial coefficients have been used for centuries in a variety of fields and have accumulated numerous definitions. In this paper, we introduce a new way of defining binomial coefficients as repeated sums of ones. A multitude of binomial…

综合数学 · 数学 2021-09-10 Roudy El Haddad

Finite graphs that have a common chromatic polynomial have the same number of regular $n$-colorings. A natural question is whether there exists a natural bijection between regular $n$-colorings. We address this question using a functorial…

组合数学 · 数学 2015-08-12 Masahiko Yoshinaga

In this paper, by presenting bi-periodic Lucas numbers as a binomial sum, we introduce the bi-periodic incomplete Lucas numbers. After that, by using the bi-periodic incomplete Lucas numbers, we derive the recurrence relation and the…

数论 · 数学 2016-01-19 Nazmiye Yilmaz , Yasin Yazlik , Necati Taskara

Integer compositions with certain colored parts were introduced by Andrews in 2007 to address a number-theoretic problem. Integer compositions allowing zero as some parts were introduced by Ouvry and Polychronakos in 2019. We give a…

组合数学 · 数学 2021-08-31 Brian Hopkins , Stéphane Ouvry

Two new generalized Fibonacci number summation identities are stated and proved, and two other new generalized Fibonacci number summation identities are derived from these, of which two special cases are already known in literature.

数论 · 数学 2018-08-30 M. J. Kronenburg

In this paper we determine a number of meaningful compositions of higher order of a set of functions, which is considered in Malesevic (1998), in implicit and explicit form. Results which are obtained are applied to the vector analysis in…

组合数学 · 数学 2007-05-23 Branko J. Malesevic

This note begins with an introduction to the inverse isospectral problem popularized by M. Kac's 1966 article in the American Mathematical Monthly, "Can one hear the shape of a drum?" Although the answer has been known for some twenty years…

谱理论 · 数学 2020-12-11 Zhiqin Lu , Julie Rowlett

The initial non-repetitive complexity function of an infinite word x (first defined by Moothathu) is the function of n that counts the number of distinct factors of length n that appear at the beginning of x prior to the first repetition of…

组合数学 · 数学 2016-01-15 Jeremy Nicholson , Narad Rampersad

An integer composition of a nonnegative integer $n$ is a tuple $(\pi_1,\ldots,\pi_k)$ of nonnegative integers whose sum is $n$; the $\pi_i$'s are called the parts of the composition. For fixed number $k$ of parts, the number of $f$-weighted…

组合数学 · 数学 2015-04-03 Steffen Eger

This paper examines the completion of an w-ordered sequence of recursive definitions which on the one hand defines an increasing sequence of nested set and on the other redefines successively a numeric variable as the cardinal of the…

综合数学 · 数学 2012-01-30 Antonio Leon

We obtain new recurrence relations, an explicit formula, and convolution identities for higher order geometric polynomials. These relations generalize known results for geometric polynomials, and lead to congruences for higher order…

数论 · 数学 2021-06-08 Levent Kargın , Mehmet Cenkci

Dictionaries are inherently circular in nature. A given word is linked to a set of alternative words (the definition) which in turn point to further descendants. Iterating through definitions in this way, one typically finds that…

计算与语言 · 计算机科学 2011-03-14 David Levary , Jean-Pierre Eckmann , Elisha Moses , Tsvi Tlusty

Let s and t be variables. Define polynomials {n} in s, t by {0}=0, {1}=1, and {n}=s{n-1}+t{n-2} for n >= 2. If s, t are integers then the corresponding sequence of integers is called a Lucas sequence. Define an analogue of the binomial…

组合数学 · 数学 2009-11-18 Bruce Sagan , Carla Savage

We obtain explicit upper bounds for the number of irreducible factors for a class of compositions of polynomials in several variables over a given field. In particular, some irreducibility criteria are given for this class of compositions…

数论 · 数学 2007-05-23 Anca Iuliana Bonciocat , Alexandru Zaharescu

We show the existence of several infinite monochromatic patterns in the integers obtained as values of suitable symmetric polynomials. The simplest example is the following. For every finite coloring of the natural numbers…

组合数学 · 数学 2022-02-16 Mauro Di Nasso

Inverse scattering and spectral one-dimensional problems are discussed systematically in a self-contained way. Many novel results, due to the author are presented. The classical results are often presented in a new way. Several highlights…

数学物理 · 物理学 2007-05-23 Alexander G. Ramm

Prawitz formulated the so-called inversion principle as one of the characteristic features of Gentzen's intuitionistic natural deduction. In the literature on proof-theoretic semantics, this principle is often coupled with another that is…

计算机科学中的逻辑 · 计算机科学 2022-01-03 Alberto Naibo , Yuta Takahashi

In this paper we present a recurrent relation for counting meaningful compositions of the higher-order differential operations on the space $R^{n}$ (n=3,4,...) and extract the non-trivial compositions of order higher than two.

微分几何 · 数学 2007-05-23 Branko J. Malesevic