Related papers: Decomposable forms generated by linear recurrences
We consider the problem of enumerating hypermatrices of format $2 \times (k + 1) \times k$ over a finite field that have nonzero hyperdeterminant and whose nonzero entries are restricted to a plane partition. We conjecture an attractive…
A finite form of de Finetti's representation theorem is established using elementary information-theoretic tools: The distribution of the first $k$ random variables in an exchangeable binary vector of length $n\geq k$ is close to a mixture…
Motivated by a connection with the factorization of multivariate polynomials, we study integral convex polytopes and their integral decompositions in the sense of the Minkowski sum. We first show that deciding decomposability of integral…
The solution of many physical evolution equations can be expressed as an exponential of two or more operators acting on initial data. Accurate solutions can be systematically derived by decomposing the exponential in a product form. For…
We derive generalizations of the Cherednik-Macdonald constant term identities associated to root systems which depend, besides on the usual multiplicity function, symmetrically on two quasi-periods. They are natural analogues of the…
Let $\{u_{n}\}_{n \geq 0}$ be a non-degenerate binary recurrence sequence with positive discriminant. In this paper, we consider the Diophantine equation $u_m + u_n = a_1 n_1! + \cdots + a_k n_k!$ and prove that there are only finitely many…
The term fractal describes a class of complex structures exhibiting self-similarity across different scales. Fractal patterns can be created by using various techniques such as finite subdivision rules and iterated function systems. In this…
This article examines matrices whose entries are determined by recursive relations of the form $A_{i, j} = x A_{i, j-1} + y A_{i-1, j-1} + z A_{i-1, j}$, where $x, y, z$ are constants, and the initial conditions are defined along the first…
Let $f$ be a homogeneous polynomial of even degree $d$. We study the decompositions $f=\sum_{i=1}^r f_i^2$ where $\mathrm{deg} f_i=d/2$. The minimal number of summands $r$ is called the $2$-rank of $f$, so that the polynomials having…
We investigate the coefficients generated by expressing the falling factorial $(xy)_k$ as a linear combination of falling factorial products $(x)_l (y)_m$ for $l,m =1,...,k$. Algebraic and combinatoric properties of these coefficients are…
Some identities that involve the elliptic version of the Cauchy matrices are presented and proved. They include the determinant formula, the formula for the inverse matrix, the matrix product identity and the factorization formula.
We introduce a notion of elliptic differential graded Lie algebra. The class of elliptic algebras contains such examples as the algebra of differential forms with values in endomorphisms of a flat vector bundle over a compact manifold, etc.…
Explicit formulas for the Gauss decomposition of elliptic Cauchy type matrices are derived in a very simple way. The elliptic Cauchy identity is an immediate corollary.
A recurrent formula is presented, for the enumeration of the compositions of positive integers as sums over multisets of positive integers, that closely resembles Euler's recurrence based on the pentagonal numbers, but where the…
Some new formulas for the KP hierarchy are derived from the differential Fay identity. They proved to be useful for the $k$-constrained hierarchies providing a series of determinant identities for them. A differential equation is introduced…
We give a formula for matrix exponentials and partial fraction decompositions.
Irrespective of whether n is prime, prime power with exponent >1, or composite, the group U_n of units of Z_n can sometimes be obtained as the direct product of cyclic groups generated by x, x+k and x+2k, for x, k in Z_n. Indeed, for many…
We define an enumerative function F(n,k,P,m) which is a generalization of binomial coefficients. Special cases of this function are also power function, factorials, rising factorials and falling factorials. The first section of the paper is…
The concern of this paper is a famous combinatorial formula known under the name "exponential formula". It occurs quite naturally in many contexts (physics, mathematics, computer science). Roughly speaking, it expresses that the exponential…
A decomposition of a natural number n is a sequence of consecutive natural numbers that sums to n. We construct a one-to-one correspondence between the odd factors of a natural number and its decompositions. We study the decompositions by…