相关论文: A three-factor product construction for mutually o…

We show there is a natural connection between Latin squares and commutative sets of monomials defining geometric structures in finite phase-space of prime power dimensions. A complete set of such monomials defines a mutually unbiased basis…

We propose a two-stage penalized least squares method to build large systems of structural equations based on the instrumental variables view of the classical two-stage least squares method. We show that, with large numbers of endogenous…

A threefold isogenous to a product of curves $X$ is a quotient of a product of three compact Riemann surfaces of genus at least two by the free action of a finite group. In this paper we study these threefolds under the assumption that the…

Finding the product of two polynomials is an essential and basic problem in computer algebra. While most previous results have focused on the worst-case complexity, we instead employ the technique of adaptive analysis to give an improvement…

In this paper we discuss the problem of numerically computing Petersson inner products of modular forms, given their $q$-expansion at $\infty$. A formula of Nelson reduces this to obtaining $q$-expansions at all cusps, and we describe two…

In the multicentric calculus one takes a polynomial with simple roots as a new global variable and replaces scalar functions {\varphi} by functions f taking values in C^d with d the degree of the polynomial leading to an efficient…

In this note, we reconcile two approaches that have been used to construct stringy multiplications. The pushing forward after pulling back that has been used to give a global stringy extension of the functors K_0,K^{top},A^*,H^* [CR, FG,…

We show that the tensor product of two random linear codes is robustly testable with high probability. This implies that one can obtain pairs of linear codes such that their product and the product of their dual codes are simultaneously…

Compound matrices play an important role in many fields of mathematics and have recently found new applications in systems and control theory. However, the explicit formulas for these compounds are non-trivial and not always easy to use.…

We discuss the folklore construction of the Gray tensor product of 2-categories as obtained by factoring the map from the funny tensor product to the cartesian product. We show that this factorisation can be obtained without using a…

Let $P$ be a partial latin square of prime order $p>7$ consisting of three cyclically generated transversals. Specifically, let $P$ be a partial latin square of the form: \[ P=\{(i,c+i,s+i),(i,c'+i,s'+i),(i,c''+i,s''+i)\mid 0 \leq i< p\} \]…

Let $H_n(t)$ denote the classical Rogers-Szeg\"o polynomial, and let $\tH_n(t_1, \ldots, t_l)$ denote the homogeneous Rogers-Szeg\"o polynomial in $l$ variables, with indeterminate $q$. There is a classical product formula for…

In this paper we consider four basic multidimensional matrix operations (outer product, Kronecker product, contraction, and projection) and two derivative operations (dot and circle products). We start with the interrelations between these…

Composite minimization involves a collection of smooth functions which are aggregated in a nonsmooth manner. In the convex setting, we design an algorithm by linearizing each smooth component in accordance with its main curvature. The…

We present formulas of Rodrigues type giving the Macdonald polynomials for arbitrary partitions through the repeated application of creation operators on the constant 1. Three expressions for the creation operators are derived one from the…

A real quadratic matrix is generalized doubly stochastic (g.d.s.) if all of its row sums and column sums equal one. We propose numerically stable methods for generating such matrices having possibly orthogonality property or/and satisfying…

In this paper, we present four constructions of {general} self-orthogonal matrix-product codes associated with Toeplitz matrices. The first one relies on the {dual} of a known {general} dual-containing matrix-product code; the second one is…

The popular Alternating Least Squares (ALS) algorithm for tensor decomposition is efficient and easy to implement, but often converges to poor local optima---particularly when the weights of the factors are non-uniform. We propose a…

The surface reconstruction problem from sets of planar parallel slices representing cross sections through 3D objects is presented. The final result of surface reconstruction is always based on the correct estimation of the structure of the…

In the present paper we construct plans orthogonal through the block factor (POTBs). We describe procedures for adding blocks as well as factors to an initial plan and thus generate a bigger plan. Using these procedures we construct POTBs…