Related papers: A generating algorithm for ribbon tableaux and spi…

This paper describes a suite of algorithms for constructing low-rank approximations of an input matrix from a random linear image of the matrix, called a sketch. These methods can preserve structural properties of the input matrix, such as…

In "Square partitions and Catalan numbers" (arXiv0912.4983), Bennett et al. presented a recursive algorithm to create a family of partitions from one or several partitions. They were mainly interested in the cases when we begin with a…

A method of fast linear transform algorithm synthesis for an arbitrary tensor, matrix, or vector is proposed. The method is based on factorization of a tensor and using the factors for building computational structures performing fast…

The "2-variable general-$\lambda$-matrix polynomials (2VG$\lambda$MP)" is a new family of matrix polynomials, introduced and studied in this article. These matrix polynomials are constructed using umbral and symbolic methods. We delve into…

In the prequel to this paper, we presented a systematic framework for processing spline spaces. In this paper, we take the results of that framework and provide a code generation pipeline that automatically generates efficient…

We consider a large-scale matrix multiplication problem where the computation is carried out using a distributed system with a master node and multiple worker nodes, where each worker can store parts of the input matrices. We propose a…

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…

In this note, we intend to produce all latin squares from one of them using suitable move which is defined by small trades and do the similar work on 4-cycle systems. These problems, reformulate as finding basis for the kernel of special…

In this work, we introduce a framework to study the effect of random operations on the combinatorial list-decodability of a code. The operations we consider correspond to row and column operations on the matrix obtained from the code by…

We present a multiplication algorithm to recursively construct vertices for the Schroedinger functional in the abelian background field case. The algorithm is suited for automatic perturbative calculations with a variety of actions. As…

A new method for the construction of classical integrable systems, that we call loop coproduct formulation, is presented. We show that the linear r-matrix formulation, the Sklyanin algebras and the reflection algebras can be obtained as…

In this paper we give a fast algorithm to generate all partitions of a positive integer $n$. Integer partitions may be encoded as either ascending or descending compositions for the purposes of systematic generation. It is known that the…

The celebrated Robinson-Schensted algorithm and each of its variants that have attracted substantial attention can be constructed using Fomin's "growth diagram" construction from a modular lattice that is also a weighted-differential poset.…

We propose a general method for automated word puzzle generation. Contrary to previous approaches in this novel field, the presented method does not rely on highly structured datasets obtained with serious human annotation effort: it only…

The histogram is an analysis tool in widespread use within many sciences, with high energy physics as a prime example. However, there exists an inherent bias in the choice of binning for the histogram, with different choices potentially…

We propose a construction of lattices from (skew-) polynomial codes, by endowing quotients of some ideals in both number fields and cyclic algebras with a suitable trace form. We give criteria for unimodularity. This yields integral and…

This paper presents a new algorithm "A" for constructing Seifert surfaces from n-bridge projections of links. The algorithm produces minimal complexity surfaces for large classes of braids and alternating links. In addition, we consider a…

In this paper, we introduce a certain method to construct polynomials producing many absolute pseudoprimes. By this method, we give new polynomials producing absolute pseudoprimes with any fixed number of prime factors which can be viewed…

In this paper we study scalar multivariate subdivision schemes with general integer expanding dilation matrix. Our main result yields simple algebraic conditions on the symbols of such schemes that characterize their polynomial…

We propose a method to efficiently compute tomographic projections of a 3D volume represented by a linear combination of shifted B-splines. To do so, we propose a ray-tracing algorithm that computes 3D line integrals with arbitrary…