Related papers: The balancing index over the alternating group
For a permutation $\pi$ the major index of $\pi$ is the sum of all indices $i$ such that $\pi_i > \pi_{i+1}$. It is well known that the major index is equidistributed with the number of inversions over all permutations of length $n$. In…
For a Gaussian process $X$ and smooth function $f$, we consider a Stratonovich integral of $f(X)$, defined as the weak limit, if it exists, of a sequence of Riemann sums. We give covariance conditions on $X$ such that the sequence converges…
Polynomials whose zeros are symmetric either to the real line or to the unit circle are very important in mathematics and physics. We can classify them into three main classes: the self-conjugate polynomials, whose zeros are symmetric to…
An inverse polynomial has a Chebyshev series expansion 1/\sum(j=0..k)b_j*T_j(x)=\sum'(n=0..oo) a_n*T_n(x) if the polynomial has no roots in [-1,1]. If the inverse polynomial is decomposed into partial fractions, the a_n are linear…
The sequence $(\operatorname{Ass}(R/I^n))_{n\in\mathbb{N}}$ of associated primes of powers of a monomial ideal $I$ in a polynomial ring $R$ eventually stabilizes by a known result by Markus Brodmann. L\^e Tu\^an Hoa gives an upper bound for…
Under what circumstances might every extension of a combinatorial structure contain more copies of another one than the original did? This property, which we call prolificity, holds universally in some cases (e.g., finite linear orders) and…
Consider S_n, the symmetric group on n letters, and let maj pi denote the major index of a permutation pi in S_n. Given positive integers k,l and nonnegative integers i,j, define m_n^{k,l}(i,j) := number of pi in S_n such that maj pi = i…
The purpose of this note is to extend in a simple and unified way the known results on interlacing of zeros of paraorthogonal polynomials on the unit circle. These polynomials can be regarded as the characteristic polynomials of any matrix…
The polynomial coefficient $\binom {n,q}{k}$ is defined to be the coefficient of $x^{k}$ in the expansion of $(1+x+x^2+... +x^{q-1})^n$. In this note we give an asymptotic estimate for $\binom {n,q}{cn}$ as $n$ tends to infinity, where $c$…
We generalize the polynomial Szemer\'{e}di theorem to intersective polynomials over the ring of integers of an algebraic number field, by which we mean polynomials having a common root modulo every ideal. This leads to the existence of new…
Harmonic numbers arise from the truncation of the harmonic series. The $n^\text{th}$ harmonic number is the sum of the reciprocals of each positive integer up to $n$. In addition to briefly introducing the properties of harmonic numbers, we…
A vertex subset $W\subseteq V$ of the graph $G=(V,E)$ is an independent dominating set if every vertex in $V\backslash W$ is adjacent to at least one vertex in $W$ and the vertices of $W$ are pairwise non-adjacent. The independent…
We define recursive harmonic numbers as a generalization of harmonic numbers. The table of recursive harmonic numbers, which is like Pascal's triangle, is constructed. A formula for recursive harmonic numbers containing binomial…
A generic polynomial f(x,y,z) with a prescribed Newton polytope defines a symmetric spatial curve f(x,y,z)=f(y,x,z)=0. We study its geometry: the number, degree and genus of its irreducible components, the number and type of singularities,…
We revisit and generalize the concept of composite likelihood as a method to make a probabilistic inference by aggregation of multiple Bayesian agents, thereby defining a class of predictive models which we call composite Bayesian. This…
The Wiener index of a finite graph G is the sum over all pairs (p, q) of vertices of G of the distance between p and q. When P is a finite poset, we define its Wiener index as the Wiener index of the graph of its Hasse diagram. In this…
Consider a semi-algebraic set A in R^d constructed from the sets which are determined by inequalities p_i(x)>0, p_i(x)\ge 0, or p_i(x)=0 for a given list of polynomials p_1,...,p_m. We prove several statements that fit into the following…
The matching polynomial of a graph is the generating function of the numbers of its matchings with respect to their cardinality. A graph polynomial is polynomial reconstructible, if its value for a graph can be determined from its values…
Balancing and Lucas-balancing numbers are solutions of a Diophantine equation and satisfy a second order homogeneous recurrence relation. Interestingly, these numbers can be seen as numerators and denominators in the steady state…
Consider the general scalar balance law $\partial_t u + \Div f(t, x,u) = F(t,x,u)$ in several space dimensions. The aim of this note is to estimate the dependence of its solutions from the flow $f$ and from the source $F$. To this aim, a…