相关论文: A three-factor product construction for mutually o…
Mutually orthogonal frequency squares (MOFS) of type $F(m\lambda;\lambda)$ generalize the structure of mutually orthogonal Latin squares: rather than each of $m$ symbols appearing exactly once in each row and in each column of each square,…
We show that some of the main structural constants for symmetric functions (Littlewood-Richardson coefficients, Kronecker coefficients, plethysm coefficients, and the Kostka--Foulkes polynomials) share symmetries related to the operations…
An algorithm is developed for efficiently constructing the Lorentz covariant effective three-point vertices of the decay of a particle into two daughter particles in which all the masses and spins of the three particles can be arbitrary.…
Choi Seok-Jeong studied Latin squares at least 60 years earlier than Euler although this was less known. He introduced a pair of orthogonal Latin squares of order 9 in his book. Interestingly, his two orthogonal non-double-diagonal Latin…
A novel factorization for the sum of two single-pair matrices is established as product of lower-triangular, tridiagonal, and upper-triangular matrices, leading to semi-closed-form formulas for tridiagonal matrix inversion. Subsequent…
The toric fiber product is a general procedure for gluing two ideals, homogeneous with respect to the same multigrading, to produce a new homogeneous ideal. Toric fiber products generalize familiar constructions in commutative algebra like…
In this paper we introduce generalizations of diagonal crossed products, two-sided crossed products and two-sided smash products, for a quasi-Hopf algebra H. The results we obtain may be applied to H^*-Hopf bimodules and generalized…
Commonly the direct construction and the description of mutually orthogonal Latin squares (MOLS) makes use of difference or quasi-difference matrices. Now there exists a correspondence between MOLS and separable permutation codes. We like…
We investigate a semigroup construction related to the two-sided wreath product. It encompasses a range of known constructions and gives a slightly finer version of the decomposition in the Krohn-Rhodes Theorem, in which the three-element…
The purpose of this paper is to improve the known estimates for Mockenhaupt's square function in $\mathbb R^3$ and for Sogge's local smoothing in $\mathbb R^{2+1}$ spacetime. For this we use the trilinear approach of S. Lee and A. Vargas…
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 some results in classical differential geometry, we give a constructive procedure for building up a connection over a (twisted) tensor product of two algebras, starting from connections defined on the factors. The curvature for…
Bruinier and Ono recently developed the theory of generalized Borcherds products, which uses coefficients of certain Maass forms as exponents in infinite product expansions of meromorphic modular forms. Using this, one can use classical…
We provide direct proofs of product and coproduct formulae for Schur functions where the coefficients (Littlewood--Richardson coefficients) are defined as counting puzzles. The product formula includes a second alphabet for the Schur…
We observe that the linearization coefficients for ultraspherical polynomials are the orthogonality weights for Racah polynomials with special parameters. Then it turns out that the linearization sum with such a Racah polynomial as extra…
Nonnegative least squares problems with multiple right-hand sides (MNNLS) arise in models that rely on additive linear combinations. In particular, they are at the core of most nonnegative matrix factorization algorithms and have many…
We establish operator-valued versions of the earlier foundational factorization results for noncommutative polynomials due to Helton (Ann.~Math., 2002) and one of the authors (Linear Alg.~Appl., 2001). Specifically, we show that every…
A latin square of order $n$ is an $n\times n$ array of $n$ symbols in which each symbol occurs exactly once in each row and column. A transversal of such a square is a set of $n$ entries such that no two entries share the same row, column…
We prove recursive formulas for sums of squares and sums of triangular numbers in terms of sums of divisors functions and we give a variety of consequences of these formulas. Intermediate applications include statements about positivity of…
In Chapter 3 of his Notes on constructive mathematics, Martin-L{\"o}f describes recursively constructed ordinals. He gives a constructively acceptable version of Kleene's computable ordinals. In fact, the Turing definition of computable…