Related papers: Computation of Dilated Kronecker Coefficients
We present a method for the explicit diagonalization of some Hankel operators. This method allows us to recover classical results on the diagonalization of Hankel operators with the absolutely continuous spectrum. It leads also to new…
In this paper we present a new approach to computing homology (with field coefficients) and persistent homology. We use concepts from discrete Morse theory, to provide an algorithm which can be expressed solely in terms of simple graph…
We consider the numerical reconstruction of the spatially dependent conductivity coefficient and the source term in elliptic partial differential equations in a two-dimensional convex polygonal domain, with the homogeneous Dirichlet…
Let $p$ be an odd prime number. We propose an algorithm for computing rational representations of isogenies between Jacobians of hyperelliptic curves via-adic differential equations with a sharp analysis of the loss of precision.…
We study the iterative algorithm proposed by S. Armstrong, A. Hannukainen, T. Kuusi, J.-C. Mourrat to solve elliptic equations in divergence form with stochastic stationary coefficients. Such equations display rapidly oscillating…
An axiomatic approach to the representation theory of Coxeter groups and their Hecke algebras was presented in [1]. Combinatorial aspects of this construction are studied in this paper. In particular, the symmetric group case is…
We present new computational results for symplectic monodromy groups of hypergeometric differential equations. In particular, we compute the arithmetic closure of each group, sometimes justifying arithmeticity. The results are obtained by…
In this note we make explicit a stability property for Kronecker coefficients that is implicit in a theorem of Y. Dvir. Even in the simplest nontrivial case this property was overlooked despite of the work of several authors. As an…
Let E be a real quadratic field with discriminant d and let p be an odd prime not dividing d. For \rho=1 or -1, we determine $\prod_{0<c<d, (d/c)=\rho} binomial coeff.{p-1}{\lfloor pc/d\rfloor}$ modulo p^2 in terms of Lucas numbers, the…
We consider the numerical approximation of $f({\cal A})b$ where $b\in{\mathbb R}^{N}$ and $\cal A$ is the sum of Kronecker products, that is ${\cal A}=M_2 \otimes I + I \otimes M_1\in{\mathbb R}^{N\times N}$. Here $f$ is a regular function…
A three term recurrence relation is derived for a basis consisting of polynomials multiplied by sines and cosines with large, but fixed frequencies. A numerical method for computing the coefficients of the three term recurrence relation is…
Stable computational algorithms for the approximate solution of the Cauchy problem for nonstationary problems are based on implicit time approximations. Computational costs for boundary value problems for systems of coupled multidimensional…
Generalizations of the complex number system underlying the mathematical formulation of quantum mechanics have been known for some time, but the use of the commutative ring of bicomplex numbers for that purpose is relatively new. This paper…
Consider an elliptic curve defined over an imaginary quadratic field $K$ with good reduction at the primes above $p\geq 5$ and has complex multiplication by the full ring of integers $\mathcal{O}_K$ of $K$. In this paper, we construct…
A Hadamard-Hitchcock decomposition of a multidimensional array is a decomposition that expresses the latter as a Hadamard product of several tensor rank decompositions. Such decompositions can encode probability distributions that arise…
Recently found all the fundamental solutions of a multidimensional singular elliptic equation are expressed in terms of the well-known Lauricella hypergeometric function in many variables. In this paper, we find a unique solution of the…
We propose an algorithm for computing the proximity operator of a sum of composite convex functions in Hilbert spaces and investigate its asymptotic behavior. Applications to best approximation and image recovery are described.
This document is a companion for the Maple program : Discrete series and K-types for U(p,q) available on:http://www.math.jussieu.fr/~vergne We explain an algorithm to compute the multiplicities of an irreducible representation of U(p)x U(q)…
We show how the Riemann-Hilbert problem can be used to compute correlation kernels for determinantal point processes arising in different models of asymptotic combinatorics and representation theory. The Whittaker kernel and the discrete…
We present quadrature schemes to calculate matrices, where the so-called modified Hilbert transformation is involved. These matrices occur as temporal parts of Galerkin finite element discretizations of parabolic or hyperbolic problems when…