相关论文: Compounding Doubly Affine Matrices

We develop a general finite-alphabet framework for Euler-type sums based on the notion of a monoidal alphabet. An alphabet of summand letters is called monoidal when it is closed under pointwise multiplication, thereby inducing the usual…

In the past we have considered Gaussian random matrix ensembles in the presence of an external matrix source. The reason was that it allowed, through an appropriate tuning of the eigenvalues of the source, to obtain results on non-trivial…

We discuss a numerical package, named ORTHOCUB, for the computation of linear functionals of both integral and differential type on multivariate polynomial spaces. The weighted sums corresponding to such integral and differential cubatures…

Nested sums containing binomial coefficients occur in the computation of massive operator matrix elements. Their associated iterated integrals lead to alphabets including radicals, for which we determined a suitable basis. We discuss…

We construct a full strongly exceptional collection in the triangulated category of graded matrix factorizations of a polynomial associated to a non-degenerate regular system of weights whose smallest exponents are equal to -1. In the…

We give integrable quad equations which are multi-quadratic (degree-two) counterparts of the well-known multi-affine (degree-one) equations classified by Adler, Bobenko and Suris (ABS). These multi-quadratic equations define multi-valued…

The classical Gindikin-Karpelevich formula appears in Langlands' calculation of the constant terms of Eisenstein series on reductive groups and in Macdonald's work on p-adic groups and affine Hecke algebras. The formula has been generalized…

Commutative complex numbers of the form u=x+\alpha y+\beta z+\gamma t in 4 dimensions are studied, the variables x, y, z and t being real numbers. Four distinct types of multiplication rules for the complex bases \alpha, \beta and \gamma…

The iterative method of Sinkhorn allows, starting from an arbitrary real matrix with non-negative entries, to find a so-called 'scaled matrix' which is doubly stochastic, i.e. a matrix with all entries in the interval (0, 1) and with all…

Two integral quadratic unit forms are called strongly Gram congruent if their upper triangular Gram matrices are Z-congruent. The paper gives a combinatorial strong Gram invariant for those unit forms that are non-negative of Dynkin type A,…

Higher order data is modeled using matrices whose entries are numerical arrays of a fixed size. These arrays, called t-scalars, form a commutative ring under the convolution product. Matrices with elements in the ring of t-scalars are…

A linear mapping upon real n-dimensional space, where the dimension n is odd, has a real eigenvalue-eigenvector pair. The corresponding statement for complex vector spaces holds true for any dimension n, but should be easy to demonstrate…

In a recent article, Apagodu and Zeilberger (http://arxiv.org/abs/1606.03351)discuss some applications of an algorithm for finding and proving congruence identities (modulo primes) of indefinite sums of many combinatorial sequence. At the…

We define a magic square to be a square matrix whose entries are nonnegative integers and whose rows, columns, and main diagonals sum up to the same number. We prove structural results for the number of such squares as a function of the…

Using recent results on string on $AdS_{3}\times N^d$, where N is a d-dimensional compact manifold, we re-examine the derivation of the non trivial extension of the (1+2) dimensional-Poincar\'e algebra obtained by Rausch de Traubenberg and…

In this paper, we develop a method of evaluating general exponential sums with rational amplitude functions for multiple variables which complements works by T. Cochrane and Z. Zheng on the single variable case. As an application, for…

The alternate row and column scaling algorithm applied to a positive $n\times n$ matrix $A$ converges to a doubly stochastic matrix $S(A)$, sometimes called the \emph{Sinkhorn limit} of $A$. For every positive integer $n$, a two parameter…

Recursive blocked algorithms have proven to be highly efficient at the numerical solution of the Sylvester matrix equation and its generalizations. In this work, we show that these algorithms extend in a seamless fashion to…

In this paper, exact Hausdorff dimension formulas for a class of self-affine attractors generated by affine Iterated Function Systems are derived. We consider systems containing an affine map whose $n$-th iterate is a similarity…

A matrix completion problem is to recover the missing entries in a partially observed matrix. Most of the existing matrix completion methods assume a low rank structure of the underlying complete matrix. In this paper, we introduce an…