Related papers: The trinomial transform triangle
In this paper, a new triangular decomposition algorithm is proposed for ordinary differential polynomial systems, which has triple exponential computational complexity. The key idea is to eliminate one algebraic variable from a set of…
We study Hankel transforms of sequences, where the transform elements are members of the set {-1,0,1}. We relate these Hankel transforms to special continued fraction expansions. In particular, we posit a conjecture relating the…
General concept of ternary algebras is introduced in this article, along with several examples of its realization. Universal envelope of such algebras is defined, as well as the concept of tri-modules over ternary algebras. The universal…
Combinatorial transgressions are secondary invariants of a space admitting triangulations. They arise from subdivisions and are analogous to transgressive forms such as those arising in Chern-Weil theory. Unlike combinatorial characteristic…
We consider the complexities of substitutive sequences over a binary alphabet. By studying various types of special words, we show that, knowing some initial values, its complexity can be completely formulated via a recurrence formula…
Given a combinatorial triangulation of an $n$-gon, we study (a) the space of all possible drawings in the plane such the edges are straight line segments and the boundary has a fixed shape, and (b) the algebraic variety of possibilities for…
Magic squares are well-known arrangements of integers with common row, column, and diagonal sums. Various other magic shapes have been proposed, but triangles have been somewhat overlooked. We introduce certain triangular arrangements of…
The main purpose of this note is to provide an elementary discussion of some simple triangles of integer numbers in particular through their connections with representation theory of $sl_2$. The triangles under consideration are the Catalan…
A simple graph is called triangular if every edge of it belongs to a triangle. We conjecture that any graphical degree sequence all terms of which are greater than or equal to 4 has a triangular realisation, and establish this conjecture…
We give a combinatorial proof of a formula giving the partial sums of the $k$-bonacci sequence as alternating sums of powers of two multiplied by binomial coefficients. As a corollary we obtain a formula for the $k$-bonacci numbers.
We study a one-parameter family of binomial-convolution operators acting on sequences. These operators form an additive semigroup with an explicit inverse, and they subsume iterated classical binomial transforms as a special case. We…
Any permutation-invariant function of data points $\vec{r}_i$ can be written in the form $\rho(\sum_i\phi(\vec{r}_i))$ for suitable functions $\rho$ and $\phi$. This form - known in the machine-learning literature as Deep Sets - also…
In this expository paper we collect some simple facts about analogues of Pascals triangle where the entries count subsets of the integers with an even or odd sum and show that they are related to Rogers-Szego polynomials. In particular we…
We study the Hankel transforms of sequences whose generating function can be expressed as a C-fraction. In particular, we relate the index sequence of the non-zero terms of the Hankel transform to the powers appearing in the monomials…
The triad refers to embedding the Macdonald polynomials into the Noumi-Shiraishi functions and their reduction to solutions of simple linear equations at particular values of $t$. It provides an alternative definition of Macdonald theory.…
In this paper we study the action of the Binomial and Invert (interpolated) operators on the set of linear recurrent sequences. We prove that these operators preserve this set, and we determine how they change the characteristic…
In this manuscript, we introduce (symmetric) Tetranacci polynomials $\xi_j$ as a twofold generalization of ordinary Tetranacci numbers, by considering both non unity coefficients and generic initial values in their recursive definition. The…
The central component of a polygon triangulation is defined as the triangle or diameter that contain its geometric center. More generally, every polygon dissection contains a central component. Using this notion, we derive new recurrences…
A binary triangle of size $n$ is a triangle of zeroes and ones, with $n$ rows, built with the same local rule as the standard Pascal triangle modulo $2$. A binary triangle is said to be balanced if the absolute difference between the…
We introduce a class of sequences, defined by means of partial Bell polynomials, that contains a basis for the space of linear recurrence sequences with constant coefficients as well as other well-known sequences like Catalan and Motzkin.…