Related papers: Odd Entries in Pascal's Trinomial Triangle
We propose new algorithms for computing triangular decompositions of polynomial systems incrementally. With respect to previous works, our improvements are based on a {\em weakened} notion of a polynomial GCD modulo a regular chain, which…
Fibonacci numbers can be expressed in terms of multinomial coefficients as sums over integer partitions into odd parts. We use this fact to introduce a family of double inequalities involving the generating function for the number of…
In this paper one extends the binomial and trinomial coefficients to the concept of 'k-nomial' coefficients, and one obtains some properties of these. As an application one generalizes Pascal's triangle.
We establish an alternative, ``perpendicular" collection of generating functions for the coefficients of Gaussian polynomials, $\begin{bmatrix}N+m\\m\end{bmatrix}_q$. We provide a general characterization of these perpendicular generating…
Let f(x) be a polynomial with integer coefficients, let n be a positive integer, and let p be an odd prime. Then the mapping x-->f(x) sends Z/p^n into Z/p^n. We study the topological structure of this mapping.
Finding the $n$-th positive square number is easy, as it is simply $n^2$. But how do we find the complementary sequence, i.e., the $n$-th positive non-square number? For this case there is an explicit formula. However, for general…
Two new expansions for partial sums of Gauss' triangular and square numbers series are given. As a consequence, we derive a family of inequalities for the overpartition function $\bar{p}(n)$ and for the partition function $p_1(n)$ counting…
The binomial coefficients and Catalan triangle numbers appear as weight multiplicities of the finite-dimensional simple Lie algebras and affine Kac--Moody algebras. We prove that any binomial coefficient can be written as weighted sums…
In this paper we determine all possible cohomological invariants of Aut(J)-torsors in Galois cohomology with mod 2 coefficients (characteristic of the base field not 2), for J a split central simple Jordan algebra of odd degree n>=3. This…
In this paper, firstly, by a determinant of deformed Pascal's triangle, namely the normalized Hessenberg matrix determinant, to count Dyck paths, we give another combinatorial proof of the theorems which are of Catalan numbers determinant…
In this paper, we introduce a new generalization of Pascal's triangle. The new object is called the hyperbolic Pascal triangle since the mathematical background goes back to regular mosaics on the hyperbolic plane. We describe precisely the…
Anomalies are known to appear in the perturbation theory for the one-dimensional Anderson model. A systematic approach to anomalies at critical points of products of random matrices is developed, classifying and analysing their possible…
A Pythagorean n-tuple is an integer solution of x_1^2+...+x_{n-1}^2=x_n^2. For n=4 and n=6, the Pythagorean n-tuples admit a parametrization by a single n-tuple of polynomials with integer coefficients (which is impossible for n=3). For…
The Pascal rhombus is a variant of Pascal's triangle in which each term is a sum of four earlier terms. Klostermeyer et al. made four conjectures about the Pascal rhombus modulo 2. In this paper we show how exploration of the stealth shape…
Set-valued tableaux, introduced by Buch to express the tableaux-sum formula for stable Grothendieck polynomials, generalize semistandard tableaux. We provide a new recursive proof that the number of set-valued tableaux of a given shape is…
We prove a conjecture that classifies exceptional numbers. This conjecture arises in two different ways, from cryptography and from coding theory. An odd integer $t\geq 3$ is said to be exceptional if $f(x)=x^t$ is APN (Almost Perfect…
In two previous papers we have presented partition formulae for the Fibonacci numbers motivated by the appearance of the Fibonacci numbers in the representation theory of the 3-Kronecker quiver and its universal cover, the 3-regular tree.…
A linear odd Poisson bracket (antibracket) realized solely in terms of Grassmann variables is suggested. It is revealed that the bracket, which corresponds to a semi-simple Lie group, has at once three Grassmann-odd nilpotent $\Delta$-like…
In this paper we investigate some new problems in additive combinatorics. Our problems mainly involve permutations (or circular permutations) $n$ distinct numbers (or elements of an additive abelian group) $a_1,\ldots,a_n$ with adjacent…
Motivated by circle graphs, and the enumeration of Euler circuits, we define a one-variable ``interlace polynomial'' for any graph. The polynomial satisfies a beautiful and unexpected reduction relation, quite different from the cut and…