Related papers: Tower Diagrams and Pieri's Rule
We establish new Bombieri-Vinogradov type estimates for a wide class of multiplicative arithmetic functions and derive several applications, including: a new proof of a recent estimate by Drappeau and Topacogullari for arithmetical…
A prism tableau is a set of reverse semistandard tableaux, each positioned within an ambient grid. Prism tableaux were introduced to provide a formula for the Schubert polynomials of A. Lascoux and M.P. Sch\"utzenberger. This formula…
This work presents formulas for the Kauffman bracket and Jones polynomials of 3-bridge knots using the structure of Chebyshev knots and their billiard table diagrams. In particular, these give far fewer terms than in the Skein relation…
The aim of this article is to define some new families of the special numbers. These numbers provide some further motivation for computation of combinatorial sums involving binomial coefficients and the Euler kind numbers of negative order.…
In this paper we construct a new q-Euler numbers and polynomials. By using these numbers and polynomials, we give the interesting formulae related to alternating sums of powers of consecutive q-integers following an idea due to Euler.
We employ the generalized Remez algorithm, initially suggested by P. T. P. Tang, to perform an experimental study of Chebyshev polynomials in the complex plane. Our focus lies particularly on the examination of their norms and zeros. What…
We give a new proof that three families of polynomials coincide: the double Schubert polynomials of Lascoux and Sch\"utzenberger defined by divided difference operators, the pipe dream polynomials of Bergeron and Billey, and the equivariant…
In order to generalize the integration rules to general CHY integrands which include higher order poles, algorithms are proposed in two directions. One is to conjecture new rules, and the other is to use the cross-ratio identity method. In…
Zernike polynomials are a basis of orthogonal polynomials on the unit disk that are a natural basis for representing smooth functions. They arise in a number of applications including optics and atmospheric sciences. In this paper, we…
We give a Pieri-type formula for the sum of $K$-$k$-Schur functions $\sum_{\mu\le\lambda} g^{(k)}_{\mu}$ over a principal order ideal of the poset of $k$-bounded partitions under the strong Bruhat order, which sum we denote by…
We provide a proof of the Alpern multi-tower theorem for Z^d actions. We reformulate the theorem as a problem of measurably tiling orbits of a Z^d action by a collection of rectangles whose corresponding sides have no non-trivial common…
This paper is the third installment in a series of papers devoted to the computation of enumerative invariants of abelian surfaces through the tropical approach. We develop a pearl diagram algorithm similar to the floor diagram algorithm…
Copi, Huterer, Starkman and Schwarz introduced multipole vectors in a tensor context and used them to demonstrate that the first-year WMAP quadrupole and octopole planes align at roughly the 99.9% confidence level. In the present article…
We construct the quaternion algebra [10] "geometrically" by a three dimensional analogue of the classic two dimensional geometric description of the complex field. The algebraic description of the multiplication operation in three…
In~\cite{algorithmic} was given an algorithm that computes arithmetical structures on matrices. We use some of the ideas contained there to get an algorithm that computes arithmetical structures over dominated polynomials. A dominated…
We study Macdonald polynomials from a basic hypergeometric series point of view. In particular, we show that the Pieri formula for Macdonald polynomials and its recently discovered inverse, a recursion formula for Macdonald polynomials,…
We propose a new lifting and recombination scheme for rational bivariate polynomial factorization that takes advantage of the Newton polytope geometry. We obtain a deterministic algorithm that can be seen as a sparse version of an algorithm…
The aim of this paper is to develop foundations of umbral calculus on the space $\mathcal D'$ of distributions on $\mathbb R^d$, which leads to a general theory of Sheffer polynomial sequences on $\mathcal D'$. We define a sequence of monic…
In a recent paper, Matthew Baker and Oliver Lorscheid showed that Descartes's Rule of Signs and Newton's Polygon Rule can both be interpreted as multiplicities of polynomials over hyperfields. Hyperfields are a generalization of fields…
First, we show that Sturm algorithm and Sylvester algorithm, which compute the number of real roots of a given univariate polynomial, lead to two dual tridiagonal determinantal representations of the polynomial. Next, we show that the…