Related papers: Some identities involving derangement polynomials …
Most integers are composite and most univariate polynomials over a finite field are reducible. The Prime Number Theorem and a classical result of Gau{\ss} count the remaining ones, approximately and exactly. For polynomials in two or more…
The descent polynomial of a finite $I\subseteq \mathbb{Z}^+$ is the polynomial $d(I,n)$, for which the evaluation at $n>\max(I)$ is the number of permutations on $n$ elements, such that $I$ is the set of indices where the permutation is…
We study discrete orderings in the real spectrum of a commutative ring by defining discrete prime cones and give an algebro-geometric meaning to some kind of diophantine problems over discretely ordered rings. Also for a discretely ordered…
The starting point of this paper are the Mittag-Leffler polynomials introduced by H. Bateman [1]. Based on generalized integer powers of real numbers and deformed exponential function, we introduce deformed Mittag-Leffler polynomials…
We investigate the count of meromorphic differentials on the Riemann sphere possessing a single zero, multiple poles with prescribed orders, and fixed residues at each pole. Gendron and Tahar previously examined this problem with respect to…
Recently, the degenerate harmonic and the degenerate hyperharmonic numbers are introduced respectively as degenerate versions of the harmonic and the hyperharmonic numbers. The aim of this paper is to introduce the degenerate…
Here we consider the degenerate Bernstein polynomials as a degenerate version of Bernstein polynomials, which are motivated by Simsek's recent work 'Generating functions for unification of the multidimensional Bernstein polynomials and…
It is argued that, if a regular Hamiltonian is perturbed by a term that produces chaos, the onset of chaos is shifted towards larger values of the perturbation parameter if the unperturbed spectrum is degenerate and the lifting of the…
The problem of genealogy of permutations has been solved partially by Stefan (odd order) and Acosta-Hum\'anez \& Bernhardt (power of two). It is well known that Sharkovskii's theorem shows the relationship between the cardinal of the set of…
Adding a column of numbers produces "carries" along the way. We show that random digits produce a pattern of carries with a neat probabilistic description: the carries form a one-dependent determinantal point process. This makes it easy to…
Shannon information (SI) and its special case, divergence, are defined for a DNA sequence in terms of probabilities of chemical words in the sequence and are computed for a set of complete genomes highly diverse in length and composition.…
Addition chains are a classical construction for fast exponentiation and related computation problems. In this paper, we study a chain for a fixed integer $n$ by decomposing each generator into a \emph{determiner} and a \emph{regulator}…
A decomposition of a natural number n is a sequence of consecutive natural numbers that sums to n. We construct a one-to-one correspondence between the odd factors of a natural number and its decompositions. We study the decompositions by…
The denominators $d_n$ of the harmonic number $1+\frac12+\frac13+\cdots+\frac1n$ do not increase monotonically with~$n$. It is conjectured that $d_n=D_n={\rm LCM}(1,2,\ldots,n)$ infinitely often. For an odd prime $p$, the set…
Multiple orthogonal polynomials are a generalization of orthogonal polynomials in which the orthogonality is distributed among a number of orthogonality weights. They appear in random matrix theory in the form of special determinantal point…
The study of degenerate versions of certain special polynomials and numbers, which was initiated by Carlitz's work on degenerate Euler and degenerate Bernoulli polynomials, has recently seen renewed interest among mathematicians. The aim of…
Genome rearrangements are events where large blocks of DNA exchange places during evolution. The analysis of these events is a promising tool for understanding evolutionary genomics, providing data for phylogenetic reconstruction based on…
Given any two sequences of complex numbers, we establish simple relations between their binomial convolution and the binomial convolution of their individual binomial transforms. We employ these relations to derive new identities involving…
The aim of this paper is to study degenerate Eulerian polynomials and degenerate Eulerian numbers, respectively as degenerate versions of the Eulerian polynomials and the Eulerian numbers, and to derive some of their properties.…
The meander problem is a combinatorial problem which provides a toy model of the compact folding of polymer chains. In this paper we study various questions relating to the enumeration of meander diagrams, using diagrammatical methods. By…