Related papers: Reciprocals of Subsum Polynomials

To any Schur polynomial $s_{\lambda}$ one can associated its derived polynomials $s_{\lambda}{(i)}$ $i=0,\ldots,|\lambda|$ by the rule $$s_{\lambda}(x_1+t,\ldots,x_n+t) = \sum_i s_{\lambda}^{(i)}(x_1,\ldots,x_n) t^i.$$ We conjecture that…

We define tensors, corresponding to cubic polynomials, which have the same exponent $\omega$ as the matrix multiplication tensor. In particular, we study the symmetrized matrix multiplication tensor $sM_n$ defined on an $n\times n$ matrix…

The Fibonacci polynomials are defined recursively as $f_{n}(x)=xf_{n-1}(x)+f_{n-2}(x)$, where $f_0(x) = 0$ and $f_1(x)= 1$. We generalize these polynomials to an arbitrary number of variables with the $r$-Fibonacci polynomial. We extend…

The triangle of sorted binomial coefficients $\left\langle {n \atop k} \right\rangle = \binom{n}{\lfloor \frac{n - k}{2} \rfloor}$ for $0 \leq k \leq n$ has appeared several times in recent combinatorial works but has evaded dedicated…

We study rational homology groups of one-point compactifications of spaces of complex monic polynomials with multiple roots. These spaces are indexed by number partitions. A standard reformulation in terms of quotients of orbit arrangements…

Let $\overline{\mathrm{spt}}k(n)$ denote the number of overpartitions of $n$ where the smallest non-overlined part, say $s(\pi)$, appears $k$ times and every overlined part is bigger than $s(\pi)$. Let $\overline{\mathrm{spt}}k_o(n)$ denote…

This work is about a partition problem which is an instance of the distance magic graph labeling problem. Given positive integers $n,k$ and $p_1\le p_2\le \cdots\le p_k$ such that $p_1+\cdots+p_k=n$ and $k$ divides $\sum_{i=1}^ni$, we study…

We consider partitions of n-dimensional boxes in R^n, n>1, into a finite number of boxes with pairwise disjoint interiors. We study sets X \subseteq (0,\infty) with the Property (W_n): for every n-dimensional box P and every partition of P,…

A sharp asymptotic formula for the sum of reciprocals of $\pi(n)$ is derived, where $\pi(x)$ is the number of primes not exceeding $x$. This result improves the previous results of De Koninck--Ivi\'c and L. Panaitopol.

Recently, the properties of a binomial sum related to the multi-link inverted pendulum enumeration problem have been studied. In this note, we establish bounds for this binomial sum.

$\lambda\upsilon$ is an extension of the $\lambda$-calculus which internalises the calculus of substitutions. In the current paper, we investigate the combinatorial properties of $\lambda\upsilon$ focusing on the quantitative aspects of…

We give formulas for the products of classes of Schubert varieties in the quantum cohomology rings of Grassmannians, in terms of the combinatorics of partitions and tableaux.

In the first part of this expository paper, we present and discuss the interplay of Dirichlet polynomials in some classical problems of number theory, notably the Lindel\"of Hypothesis. We review some typical properties of their means and…

By applying the Euler--Rayleigh methods to a specific representation of the Jacobi polynomials as hypergeometric functions, we obtain new bounds for their largest zeros. In particular, we derive upper and lower bound for…

The binomial interpolated transform of a sequence is a generalization of the well-known binomial transform. We examine a Pascal-like triangle, on which a binomial interpolated transform works between the left and right diagonals, focusing…

We estimate the number of solutions of certain diagonal congruences involving factorials. We use these results to bound exponential sums with products of two factorials $n!m!$ and also derive asymptotic formulas for the number of solutions…

We introduce an object that has obvious similarity to the classical one - the algebra of supersymmetric polynomials. Despite the similarity, the known structure theorems on supersymmetric polynomials do not help in the study of the new…

This paper examines the recursive sequence of polynomials $p_n(x)$, defined by $p_0(x) = x^2 - 2$ and $p_n(x) = p_{n-1}(x)^2 - 2$ for $n \geq 1$. It describes the field-theoretic motivations behind this sequence, derives a recursive formula…

We present a theorem about irreducibility of a polynomial that is the resultant of two others polynomials. The proof of this fact is based on the field theory. We also consider the converse theorem and some examples.

We introduce a class of permutation polynomial over $\mathbb F_{q^n}$ that can be written in the form $\frac{L(x)}{x^{q+1}}$ or $\frac{L(x^{q+1})}x$ for some $q$-linear polynomial $L$ over $\mathbb F_{q^n}$. Specifically, we present those…