Related papers: On the explicit formula for Gauss-Jordan eliminati…
The construction of a generic representation of $g\ell(n+1)$ or of the trigonomentric deformation of its enveloping algebra known as algebraic induction is conveniently formulated in term of Lax matrices. The Lax matrix of the constructed…
We give a purely combinatorial proof of the Glaisher-Crofton identity which derives from the analysis of discrete structures generated by iterated second derivative. The argument illustrates utility of symbolic and generating function…
After the language of module and theirs morphisms, this short course presents matricial calculus and determinants in a commutative ring as appliction of ``remarquable identities'' in the ring of polynomials with integer coefficients with…
We discuss a procedure to determine finite sets $\mathcal{M}$ within the commutant of an algebraic Hamiltonian in the enveloping algebra of a Lie algebra $\mathfrak{g}$ such that their generators define a quadratic algebra. Although…
In this note we mainly study the fine Jordan-Chevalley decomposition: a refinement of the classical Jordan-Chevalley decomposition of a matrix and we pay a particular attention to the field of the coefficients of the matrix. Moreover we…
This paper introduces a very fast method for the computation of the resolvent of fractional powers of operators. The analysis is kept in the continuous setting of (potentially unbounded) self adjoint positive operators in Hilbert spaces.…
For bivariate polynomials of degree $n\le 5$ we give fast numerical constructions of determinantal representations with $n\times n$ matrices. Unlike some other available constructions, our approach returns matrices of the smallest possible…
We propose and investigate a bi-infinite matrix approach to the multiplication and composition of formal Laurent series. We generalize the concept of Riordan matrix to this bi-infinite context, obtaining matrices that are not necessarily…
This paper addresses an investigation on a factorization method for difference equations. It is proved that some classes of second order linear difference operators, acting in Hilbert spaces, can be factorized using a pair of mutually…
In this paper, inexact Gauss-Newton like methods for solving injective-overdetermined systems of equations are studied. We use a majorant condition, defined by a function whose derivative is not necessarily convex, to extend and improve…
The new method of q-bosonization for quantum groups based on the Gauss decomposition of a transfer matrix of generators is suggested. The simplest example of the quantum group $GL_q(2)$ is considered in some details.
This paper investigates integer multiplication of continued fractions using geometric structures. In particular, this paper shows that integer multiplication of a continued fraction can be represented by replacing one triangulation of an…
When the Euclidean algorithm produces a symmetric sequence of quotients, we give explicit formulas for the remainders that allow the analysis of two families of quadratic forms in the remainders.
We describe a class of matrices whose determinants are trivial to compute. A nice example of such a matrix is given by considering the symmetric matrix with entries {i+j choose i} (mod 2) in {0,1}, 0 <= i,j < n the binomial coefficients…
For a prototype quadratic Hamiltonian describing a driven, dissipative system, exact matrix elements of the reduced density matrix are obtained from a generating function in terms of the normal characteristic functions. The approach is…
A new proof for adjoint systems of linear equations is presented. The argument is built on the principles of Algorithmic Differentiation. Application to scalar multiplication sets the base line. Generalization yields adjoint inner vector,…
We prove a closed formula for the derivative, of any order, of a implicit function, in terms of some binomial building blocks, and explain the combinatorics behind the coefficients appearing in the formula.
Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent calculus involving induction and co-induction. These proof principles…
We prove that any element in a matroid can be removed, by either deletion or contraction, in such a way that no tangle "splits".
We present a sequent calculus for the modal Grzegorczyk logic Grz allowing non-well-founded proofs and obtain the cut-elimination theorem for it by constructing a continuous cut-elimination mapping acting on these proofs.