Related papers: Linear sparse differential resultant formulas
In this paper, the discriminant of homogeneous polynomials is studied in two particular cases: a single homogeneous polynomial and a collection of n-1 homogeneous polynomials in n variables. In these two cases, the discriminant is defined…
We consider linear systems of recurrence equations whose coefficients are given in terms of indefinite nested sums and products covering, e.g., the harmonic numbers, hypergeometric products, $q$-hypergeometric products or their mixed…
Diffusive representations of fractional derivatives have proven to be useful tools in the construction of fast and memory efficient numerical methods for solving fractional differential equations. A common challenge in many of the known…
Sparse spectral methods for solving partial differential equations have been derived in recent years using hierarchies of classical orthogonal polynomials on intervals, disks, and triangles. In this work we extend this methodology to a…
A second order polynomial sequence is of \emph{Fibonacci-type} (\emph{Lucas-type}) if its Binet formula has a structure similar to that for Fibonacci (Lucas) numbers. Known examples of these type of sequences are: Fibonacci polynomials,…
We revisit planar resolvents of matrix models corresponding to ${\cal N}\ge3$ Chern-Simons-matter theories with the gauge groups of the form ${\rm U}(N_1)\times{\rm U}(N_2)$ coupled to any number of bi-fundamental hypermultiplets. We find…
We prove a nonlocal, nonlinear commutator estimate concerning the transfer of derivatives onto testfunctions. For the fractional $p$-Laplace operator it implies that solutions to certain degenerate nonlocal equations are higher…
We consider linear structural equation models with explicitly modelled latent variables. In such models, observed and latent variables solve linear equations including stochastic noise terms. The goal of our work is to identify the direct…
We study a nonlinear decomposition of a positive definite matrix into two components: the inverse of another positive definite matrix and a symmetric matrix constrained to lie in a prescribed linear subspace. Equivalently, the inverse…
We give a formula for the determinant of an $n\times n$ matrix with entries from a commutative ring with unit. The formula can be evaluated by a "straight-line program" performing only additions, subtractions and multiplications of ring…
A (global) determinantal representation of hypersurface in P^n is a matrix, whose entries are linear forms in homogeneous coordinates and whose determinant defines the hypersurface. We study the properties of such representations for…
Fractional calculus is a powerful and effective tool for modelling nonlinear systems. The M derivative is the generalization of alternative fractional derivative. This M derivative obey the properties of integer calculus. In this paper, we…
One of the most significant challenges in Computing Determinant of Rectangular Matrices is high time complexity of its algorithm. Among all definitions of determinant of rectangular matrices, used definition has special features which make…
We consider the problem of estimating log-determinants of large, sparse, positive definite matrices. A key focus of our algorithm is to reduce computational cost, and it is based on sparse approximate inverses. The algorithm can be…
Graham and Winkler derived a formula for the determinant of the distance matrix of a full-dimensional set of $n + 1$ points $\{ x_{0}, x_{1}, \ldots , x_{n} \}$ in the Hamming cube $H_{n} = ( \{ 0,1 \}^{n}, \ell_{1} )$. In this article we…
In algebraic combinatorics and formal calculation, context-free grammar is defined by a formal derivative based on a set of substitution rules. In this paper, we investigate this issue from three related viewpoints. Firstly, we introduce a…
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…
Szalai et al. (SIAM J. on Sci. Comp. 28(4), 2006) gave a general construction for characteristic matrices for systems of linear delay-differential equations with periodic coefficients. First, we show that matrices constructed in this way…
We give a necessary and sufficient condition for a system of linear inhomogeneous fractional differential equations to have at least one bounded solution. We also obtain an explicit description for the set of all bounded (or decay)…
Algorithms involving Gaussian processes or determinantal point processes typically require computing the determinant of a kernel matrix. Frequently, the latter is computed from the Cholesky decomposition, an algorithm of cubic complexity in…