Related papers: Binomial determinants: some closed formulae

In this paper we present a theorem concerning an equivalent statement of the Jacobian Conjecture in terms of Picard-Vessiot extensions. Our theorem completes the earlier work of T. Crespo and Z. Hajto which suggested an effective criterion…

We unify Linear Algebra by proposing a definition of determinants via one equation that implies all known properties of them:\\ 1. Cramer's Rule,\\ 2. Cofactor expansion,\\ 3. Antisymmetry of determinants,\\ 4. Linearity of determinants,\\…

Using continued fraction expansions of certain polygamma functions as a main tool, we find orthogonal polynomials with respect to the odd-index Bernoulli polynomials $B_{2k+1}(x)$ and the Euler polynomials $E_{2k+\nu}(x)$, for $\nu=0, 1,…

In this paper, we clarified the relationship between continued fractions, determinants, and identities, making it easier to apply these methods systematically in other settings. In particular, we studied finite continued fractions from the…

In this note, a criterion for a class of binomials to be permutation polynomials is proposed. As a consequence, many classes of binomial permutation polynomials and monomial complete permutation polynomials are obtained. The exponents in…

We find that fermion determinants are not generally positive in a recent class of constructions with explicit lattice supersymmetry. These involve an orbifold of supersymmetric matrix models, and have as their target (continuum) theory…

We generalize Sylvester single sums to multisets (sets with repeated elements), and show that these sums compute subresultants of two univariate polyomials as a function of their roots independently of their multiplicity structure. This is…

A linear map between two vector spaces has a very important characteristic: a determinant. In modern theory two generalizations of linear maps are intensively used: to linear complexes (the nilpotent chains of linear maps) and to non-linear…

Our paper deals about identities involving Bell polynomials. Some identities on Bell polynomials derived using generating function and successive derivatives of binomial type sequences. We give some relations between Bell polynomials and…

Finite dimensional matrices having more columns than rows have no left inverses while those having more rows than columns have no right inverses. We give generalizations of these simple facts to bi--infinite matrices and use those to obtain…

Let $I$ be an arbitrary ideal generated by binomials. We show that certain equivalence classes of fibers are associated to any minimal binomial generating set of $I$. We provide a simple and efficient algorithm to compute the indispensable…

In the space of square matrices, we characterize row-generated subspaces, on which the determinant is an irreducible polynomial. As a corollary, we characterize square systems of polynomial equations with indeterminate coefficients, whose…

In this article, we give a formula for the generalization of the binomial coefficient to the complex numbers as a linear combination of $\sinc$ functions. We then give a general formula to compute the integral on the real line of the…

We deal with the algebraicity of an iterated Puiseux series in several variables in terms of the properties of its coefficients. Our aim is to generalize to several variables the results from [HM15]. We show that the algebraicity of such a…

We present determinant formulae for the number of tilings of various domains in relation with Alternating Sign Matrix and Fully Packed Loop enumeration.

Recently, in weighted automata theory the weight structure of strong bimonoids has found much interest; they form a generalization of semirings and are closely related to near-semirings studied in algebra. Here, we define polynomials over a…

Commutative analogues of Clifford algebras are algebras defined in the same way as Clifford algebras except that their generators commute with each other, in contrast to Clifford algebras in which the generators anticommute. In this paper,…

The problem of expressing a specific polynomial as the determinant of a square matrix of affine-linear forms arises from algebraic geometry, optimisation, complexity theory, and scientific computing. Motivated by recent developments in this…

Decomposable models and Bayesian networks can be defined as sequences of oligo-dimensional probability measures connected with operators of composition. The preliminary results suggest that the probabilistic models allowing for effective…

The generalized sequence of numbers is defined by W_{n}=pW_{n-1}+qW_{n-2} with initial conditions W_{0}=a and W_{1}=b for a,b,p,q\inZ and n\geq2, respectively. Let W_{n}=circ(W_{1},W_{2},...,W_{n}). The aim of this paper is to establish…