Results 11 to 20 of about 1,313 (102)

The dual of number sequences, Riordan polynomials, and Sheffer polynomials

open access: yesSpecial Matrices, 2021
In this paper we introduce different families of numerical and polynomial sequences by using Riordan pseudo involutions and Sheffer polynomial sequences.
He Tian-Xiao, Ramírez José L.
doaj   +1 more source

Flip-sort and combinatorial aspects of pop-stack sorting [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2021
Flip-sort is a natural sorting procedure which raises fascinating combinatorial questions. It finds its roots in the seminal work of Knuth on stack-based sorting algorithms and leads to many links with permutation patterns. We present several structural,
Andrei Asinowski   +2 more
doaj   +1 more source

Fully degenerate Bell polynomials associated with degenerate Poisson random variables

open access: yesOpen Mathematics, 2021
Many mathematicians have studied degenerate versions of quite a few special polynomials and numbers since Carlitz’s work (Utilitas Math. 15 (1979), 51–88). Recently, Kim et al.
Kim Hye Kyung
doaj   +1 more source

Down-step statistics in generalized Dyck paths [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2022
The number of down-steps between pairs of up-steps in $k_t$-Dyck paths, a generalization of Dyck paths consisting of steps $\{(1, k), (1, -1)\}$ such that the path stays (weakly) above the line $y=-t$, is studied.
Andrei Asinowski   +2 more
doaj   +1 more source

Simultaneous generation for zeta values by the Markov-WZ method [PDF]

open access: yes, 2008
By application of the Markov-WZ method, we prove a more general form of a bivariate generating function identity containing, as particular cases, Koecher's and Almkvist-Granville's Ap\'ery-like formulae for odd zeta values. As a consequence, we get a new
Kh. Hessami   +2 more
core   +7 more sources

1974 conjecture of Andrews on partitions

open access: yesInternational Journal of Mathematics and Mathematical Sciences, Volume 2004, Issue 21, Page 1097-1104, 2004., 2004
The case k = a of the 1974 conjecture of Andrews on two partition functions Aλ,k,a(n) and Bλ,k,a(n) was proved by the first author and Sudha (1993) and the case k = a + 1 was established by the authors (2000). In this paper, we prove that the conjecture is false and give a revised conjecture for a particular case when λ is even.
Padmavathamma, M. R. Salestina
wiley   +1 more source

MacMahon’s statistics on higher-dimensional partitions

open access: yesForum of Mathematics, Sigma, 2023
We study some combinatorial properties of higher-dimensional partitions which generalize plane partitions. We present a natural bijection between d-dimensional partitions and d-dimensional arrays of nonnegative integers.
Alimzhan Amanov, Damir Yeliussizov
doaj   +1 more source

A quantum field theoretical representation of Euler‐Zagier sums

open access: yesInternational Journal of Mathematics and Mathematical Sciences, Volume 31, Issue 3, Page 127-148, 2002., 2002
We establish a novel representation of arbitrary Euler‐Zagier sums in terms of weighted vacuum graphs. This representation uses a toy quantum field theory with infinitely many propagators and interaction vertices. The propagators involve Bernoulli polynomials and Clausen functions to arbitrary orders.
Uwe Müller, Christian Schubert
wiley   +1 more source

Some combinatorial matrices and their LU-decomposition

open access: yesSpecial Matrices, 2020
Three combinatorial matrices were considered and their LU-decompositions were found. This is typically done by (creative) guessing, and the proofs are more or less routine calculations.
Prodinger Helmut
doaj   +1 more source

Free monoids and forests of rational numbers [PDF]

open access: yes, 2015
The Calkin-Wilf tree is an infinite binary tree whose vertices are the positive rational numbers. Each such number occurs in the tree exactly once and in the form $a/b$, where are $a$ and $b$ are relatively prime positive integers.
Nathanson, Melvyn B.
core   +1 more source

Home - About - Disclaimer - Privacy