C Sequential Optimization Numbers Group

01/05/2023
by   Zile Hui, et al.
0

We define C sequential optimization numbers, where C is a k+1-tuple vector. We prove that the unsigned Stirling numbers of first kind are (0,1) sequential optimization numbers. Many achievements of the Stirling numbers of first kind can be transformed into the properties of C sequential optimization numbers. We give some examples such as the recurrence formula and an instance of C sequential optimization numbers. We also extend some properties such as an upper bounder of them.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/14/2022

Sequential Optimization Numbers and Conjecture about Edge-Symmetry and Weight-Symmetry Shortest Weight-Constrained Path

This paper defines multidimensional sequential optimization numbers and ...
research
01/24/2017

Computations with p-adic numbers

This document contains the notes of a lecture I gave at the "Journées Na...
research
07/26/2022

Searching on the boundary of abundance for odd weird numbers

Weird numbers are abundant numbers that are not pseudoperfect. Since the...
research
03/11/2020

A faster and more accurate algorithm for calculating population genetics statistics requiring sums of Stirling numbers of the first kind

Stirling numbers of the first kind are used in the derivation of several...
research
11/19/2022

Littlewood-Richardson coefficients as a signed sum of Kostka numbers

Littlewood-Richardson (LR) coefficients and Kostka Numbers appear in rep...
research
10/18/2015

Symbolic Neutrosophic Theory

Symbolic (or Literal) Neutrosophic Theory is referring to the use of abs...
research
10/14/2018

q-Stirling numbers arising from vincular patterns

The distribution of certain Mahonian statistic (called BAST) introduced ...

Please sign up or login with your details

Forgot password? Click here to reset