Related papers: Partially Ordinal Sums and $P$-partitions
We prove upper and lower bounds for certain sums of products of fractional parts by using majoring and minorizing functions from Fourier analysis. In special cases the upper bounds are sharp if there exist counterexamples to the Littlewood…
In the present investigation our main aim is to give lower bounds for the ratio of some normalized $q$-Bessel functions and their sequences of partial sums. Especially, we consider Jackson's second and third $q$-Bessel functions and we…
A vector partition function is the number of ways to write a vector as a non-negative integer-coefficient sum of the elements of a finite set of vectors $\Delta$. We present a new algorithm for computing closed-form formulas for vector…
This note deals with the computation of the factorization number $F_2(G)$ of a finite group $G$. By using the M\"{o}bius inversion formula, explicit expressions of $F_2(G)$ are obtained for two classes of finite abelian groups, improving…
We consider two fractional versions of a family of nonnegative integer valued processes. We prove that their probability mass functions solve fractional Kolmogorov forward equations, and we show the overdispersion of these processes. As…
We consider some possible approaches to the fractional-order generalization of definition of variation (functional) derivative. Some problems of formulation of a fractional-order variational derivative are discussed. To give a consistent…
For a finite partially ordered set we calculate the dimension of the variety of its subspace representations having fixed dimension vector. The dimension is given in terms of the Euler quadratic form associated with a partially ordered set,…
The idea of generating integrals analogous to generating functions is first introduced in this paper. A new proof of the well-known Finite Harmonic Series Theorem in Analysis and Analytical Number Theory is then obtained by the method of…
The purpose of this paper is to find an explicit formula and asymptotic estimate for the total number of sum of weighted records over set partitions of $[n]$ in terms of Bell numbers. For that we study the generating function for the number…
We introduce the package Posets for Macaulay2. This package provides a data structure and the necessary methods for working with partially ordered sets, also called posets. In particular, the package implements methods to enumerate many…
A plane poset is a finite set with two partial orders, satisfying a certain incompatibility condition. The set PP of isoclasses of plane posets owns two products, and an infinitesimal Hopf algebra structure is defined on the vector space…
We investigate the partitioning of partial orders into a minimal number of heapable subsets. We prove a characterization result reminiscent of the proof of Dilworth's theorem, which yields as a byproduct a flow-based algorithm for computing…
The prime-counting function $\pi(x)$ which returns the number of primes smaller or equal to a given number is a topic of interest in number theory. An algorithm based on a cyclic group isomorphic to $Z/nZ$, the so-called $Z$-functions, was…
Convolution powers of $1/x$ are transformed into functions $f_n$, which satisfy a simple recurrence relation. Solutions are characterized and analyzed.
Two algorithms for computing $P(n,m)$, the number of integer partitions of $n$ into exactly $m$ parts, are described, and using a combination of these two algorithms, the resulting algorithm is $O(n^{3/2})$. The second algorithm uses a list…
The $M$-triangle of a ranked locally finite poset $P$ is the generating function $\sum_{u,w\in P} ^{}\mu(u,w) x^{\rk u}y^{\rk w}$, where $\mu(.,.)$ is the M\"obius function of $P$. We compute the $M$-triangle of Armstrong's poset of…
Using integration by parts relations, Feynman integrals can be represented in terms of coupled systems of differential equations. In the following we suppose that the unknown Feynman integrals can be given in power series representations,…
We prove an explicit formula to count the partitions of $n$ whose product of the summands is at most $n$. In the process, we also deduce a result to count the multiplicative partitions of $n$.
We describe here an experimental method that permits to compute a good candidate for the closed form of a generating function if we know the first few terms of a series. The method is based on integer relations algorithms and uses either…
Probabilistic graphical models are a key tool in machine learning applications. Computing the partition function, i.e., normalizing constant, is a fundamental task of statistical inference but it is generally computationally intractable,…