English
Related papers

Related papers: Derivatives and Integrals of Polynomials Associate…

200 papers

A class of random discrete distributions $P$ is introduced by means of a recursive splitting of unity. Assuming supercritical branching, we show that for partitions induced by sampling from such $P$ a power growth of the number of blocks is…

Probability · Mathematics 2007-05-23 Alexander V. Gnedin , Yuri Yakubovich

The degenerate Stirling numbers of the second kind and of the first kind, which are respectively degenerate versions of the Stirling numbers of the second kind and of the first kind, appear frequently when we study various degenerate…

Number Theory · Mathematics 2022-06-10 Taekyun Kim , Dae san Kim , Hye Kyung Kim

We study the computational complexity of decomposing finite discrete dynamical systems (FDDSs) in terms of the semiring operations of alternative and synchronous execution, which is useful for the analysis of discrete phenomena in science…

Discrete Mathematics · Computer Science 2026-04-10 Antonio E. Porreca , Marius Rolland

Given a way to evaluate an unknown polynomial with integer coefficients, we present new algorithms to recover its nonzero coefficients and corresponding exponents. As an application, we adapt this interpolation algorithm to the problem of…

Symbolic Computation · Computer Science 2022-05-19 Pascal Giorgi , Bruno Grenet , Armelle Perret du Cray , Daniel S. Roche

Derivative polynomials in two variables are defined by repeated differentiation of the tangent and secant functions. We establish the connections between the coefficients of these derivative polynomials and the numbers of interior and left…

Combinatorics · Mathematics 2011-11-28 Shi-Mei Ma

A finite set of integers $A$ tiles the integers by translations if $\mathbb{Z}$ can be covered by pairwise disjoint translated copies of $A$. Restricting attention to one tiling period, we have $A\oplus B=\mathbb{Z}_M$ for some…

Combinatorics · Mathematics 2022-03-09 Izabella Laba , Itay Londner

In [CaballeroHooleyDelta], we associated a Dyck word $\langle\! \langle n \rangle\! \rangle_{\lambda}$ to any pair $(n, \lambda)$ consisting of an integer $n \geq 1$ and a real number $\lambda > 1$. The goal of the present paper is to show…

Number Theory · Mathematics 2023-05-03 José Manuel Rodríguez Caballero

Recently, Blecher and Knopfmacher explored the notion of fixed points in integer partitions. Here, we distinguish partitions with a fixed point by which value is fixed and analyze the resulting triangle of integers. In particular, we…

Combinatorics · Mathematics 2024-05-21 Brian Hopkins

In this paper, we consider the degenerate poly-Bernoulli polynomials and present new and explicit formulas for computing them in terms of the degenerate Bernoulli polynomials and Stirling numbers of the second kind.

Number Theory · Mathematics 2015-03-31 Dae San Kim , Taekyun Kim

We study the uniform distribution of the polynomial sequence $\lambda(P)=(\lfloor P(k) \rfloor )_{k\geq 1}$ modulo integers, where $P(x)$ is a polynomial with real coefficients. In the nonlinear case, we show that $\lambda(P)$ is uniformly…

Number Theory · Mathematics 2018-12-18 Mohammad Javaheri

The partitions of the integers can be expressed exactly in an iterative and closed-form expression. This equation is derived from distributing the partitions of a number in a network that locates each partition in a unique and orderly…

Number Theory · Mathematics 2021-10-11 Romulo L. Cruz-Simbron

In this article, we define and study a geometry and an order on the set of partitions of an even number of objects. One of the definitions involves the partition algebra, a structure of algebra on the set of such partitions depending on an…

Combinatorics · Mathematics 2016-11-01 Franck Gabriel

In this work we continue to study the properties of polynomials of binomial type and their canonical continuations to the complex index by exploring the properties of transformation T:=1/dlog which acts on formal power series $f(x)$ of the…

Number Theory · Mathematics 2019-07-10 Danil Krotkov

Based on the combinatorial interpretation of the ordered Bell numbers, which count all the ordered partitions of the set $[n]=\{1,2,\dots,n\}$, we introduce the Fibonacci partition as a Fibonacci permutation of its blocks. Then we define…

Combinatorics · Mathematics 2024-07-08 Yahia Djemmada , Abdelghani Mehdaoui , László Németh , László Szalay

The reversal of a positive integer $A$ is the number obtained by reading $A$ backwards in its decimal representation. A pair $(A,B)$ of positive integers is said to be palindromic if the reversal of the product $A \times B$ is equal to the…

Number Theory · Mathematics 2016-04-18 Martianus Frederic Ezerman , Bertrand Meyer , Patrick Sole

We introduce a novel logical notion--partial entailment--to propositional logic. In contrast with classical entailment, that a formula P partially entails another formula Q with respect to a background formula set \Gamma intuitively means…

Logic in Computer Science · Computer Science 2014-01-17 Yi Zhou , Yan Zhang

We introduce several statistics on ordered partitions of sets, that is, set partitions where the blocks are permuted arbitrarily. The distribution of these statistics is closely related to the q-Stirling numbers of the second kind. Some of…

Combinatorics · Mathematics 2019-04-26 Einar Steingrimsson

In this paper, we study the partition theory over totally real number fields. Let $K$ be a totally real number field. A partition of a totally positive algebraic integer $\delta$ over $K$ is $\lambda=(\lambda_1,\lambda_2,\ldots,\lambda_r)$…

Number Theory · Mathematics 2023-12-01 Se Wook Jang , Byeong Moon Kim , Kwang Hoon Kim

A partition of a finite abelian group gives rise to a dual partition on the character group via the Fourier transform. Properties of the dual partitions are investigated and a convenient test is given for the case that the bidual partition…

Information Theory · Computer Science 2013-04-05 Heide Gluesing-Luerssen

In his classic text, \emph{Combinatory Analysis}, MacMahon defined a perfect partition of a positive integer $n$ as a partition whose parts contain exactly one partition of every positive integer not exceeding $n$. In this paper we apply…

Combinatorics · Mathematics 2025-10-21 Augustine O. Munagi