We study Balanced labellings of diagrams representing the inversions in a permutation .
On subword decomposition and balanced polynomials
✍ Scribed by Yossi Moshe
- Publisher
- Elsevier Science
- Year
- 2007
- Tongue
- English
- Weight
- 207 KB
- Volume
- 123
- Category
- Article
- ISSN
- 0022-314X
No coin nor oath required. For personal study only.
✦ Synopsis
Let H (x) be a monic polynomial over a finite field F = GF(q). Denote by N a (n) the number of coefficients in H n which are equal to an element a ∈ F, and by G the set of elements a ∈ F × such that N a (n) > 0 for some n. We study the relationship between the numbers (N a (n)) a∈G and the patterns in the base q representation of n. This enables us to prove that for "most" n's we have
Considering the case H = x + 1, we provide new results on Pascal's triangle modulo a prime. We also provide analogous results for the triangle of Stirling numbers of the first kind.
📜 SIMILAR VOLUMES
We present a new polynomial decomposition which generalizes the functional and homogeneous bivariate decomposition of irreducible monic polynomials in one variable over the rationals. With these decompositions it is possible to calculate the roots of an imprimitive polynomial by solving polynomial e
In this paper, we propose a new method for primary decomposition of a polynomial ideal, not necessarily zero-dimensional, and report on a detailed study for its practical implementation. In our method, we introduce two key techniques, effective localization and fast elimination of redundant componen
## Abstract We introduce a Littlewood–Paley decomposition related to any sub‐Laplacian on a Lie group __G__ of polynomial volume growth; this allows us to prove a Littlewood–Paley theorem in this general setting and to provide a dyadic characterization of Besov spaces __B__ ^__s,q__^ ~__p__~ (__G_