Related papers: Computation of Dilated Kronecker Coefficients

In the case of Dynkin quivers we establish a formula for the Grothendieck class of a quiver cycle as the iterated residue of a certain rational function, for which we provide an explicit combinatorial construction. Moreover, we utilize a…

In this short note, we reformulate the task of calculating the pair correlation statistics of a Kronecker sequence as a lattice point counting problem. This can be done analogously to the lattice based approach which was used to (re-)prove…

We investigate the problem of computing tensor product multiplicities for complex semisimple Lie algebras. Even though computing these numbers is #P-hard in general, we show that if the rank of the Lie algebra is assumed fixed, then there…

A theory of Clebsch-Gordan coefficients for $SL(2, C)$ is given using only rational numbers. Features include orthogonality relations, recurrence relations, and Regge's symmetry group. Results follow from elementary representation theory…

Context. Many algorithms to solve Kepler's equations require the evaluation of trigonometric or root functions. Aims. We present an algorithm to compute the eccentric anomaly and even its cosine and sine terms without usage of other…

We present a polynomial time algorithm to compute any fixed number of the highest coefficients of the Ehrhart quasi-polynomial of a rational simplex. Previously such algorithms were known for integer simplices and for rational polytopes of…

We exhibit algorithms to compute systems of Hecke eigenvalues for spaces of Hilbert modular forms over a totally real field. We provide many explicit examples as well as applications to modularity and Galois representations.

We present a computational approach to general hyperelliptic Riemann surfaces in Weierstrass normal form. The surface is either given by a list of the branch points, the coefficients of the defining polynomial or a system of cuts for the…

This paper reports on a new algorithm to compute the asymptotic solutions of a linear differential system. A feature of the algorithm is the ability to accommodate periodic coefficients.

We propose a recursive method for the computation of the cumulants of self-exciting point processes of Hawkes type, based on standard combinatorial tools such as Bell polynomials. This closed-form approach is easier to implement on…

We show that rectangular Kronecker coefficients stabilize when the lengths of the sides of the rectangle grow, and we give an explicit formula for the limit values in terms of invariants of $\fsl_n$.

The cohomology ring of a finite group, with coefficients in a finite field, can be computed by a machine, as Carlson has showed. Here "compute" means to find a presentation in terms of generators and relations, and involves only the…

In this rather brief note we present and discuss techniques for solving Kronecker matrix product least squares problems. Our main contribution is an iterative approach that uses the efficient Kronecker matrix-vector multiplication strategy…

Motivated by questions on the ranges of commutators of dilated floor functions and one posed in Problem 27327 from Gazeta Matematic\u{a}, we investigate the precise ranges of certain generalized polynomials depending on a real parameter and…

In two papers, B\"urgisser and Ikenmeyer (STOC 2011, STOC 2013) used an adaption of the geometric complexity theory (GCT) approach by Mulmuley and Sohoni (Siam J Comput 2001, 2008) to prove lower bounds on the border rank of the matrix…

We develop the Littlewood-Richardson homotopy algorithm, which uses numerical continuation to compute solutions to Schubert problems on Grassmannians and is based on the geometric Littlewood-Richardson rule. One key ingredient of this…

A novel high-order numerical scheme is proposed to compute the covariant derivative, particularly for divergence and curl, on any curved surface. The proposed scheme does not require the construction of a curved axis or metric tensor, which…

Let K/F be a quadratic extension of number fields. After developing a theory of the Eisenstein series over F, we prove a formula which expresses a partial zeta function of K as a certain integral of the Eisenstein series. As an application,…

We present several upper and lower bounds on the Kronecker coefficients of the symmetric group. We prove $k$-stability of the Kronecker coefficients generalizing the (usual) stability, and giving a new upper bound. We prove a lower bound…

Algorithms for the symbolic computation of conserved densities, fluxes, generalized symmetries, and recursion operators for systems of nonlinear differential-difference equations are presented. In the algorithms we use discrete versions of…