Related papers: A Formula for Type III Sums of Squares
Static single assignment form, or SSA, has been the dominant compiler intermediate representation for decades. In this paper, we give a type theory for a variant of SSA, including its equational theory, which are strong enough to validate a…
We prove an asymptotic formula for the number of $n$-dimensional representations of the group $\mathrm{SU}(3)$. Main tools for the proof are Wright's Circle Method and the Saddle Point Method.
In this paper we discuss how to generate inductive invariants for safety verification of hybrid systems. A hybrid symbolic-numeric method is presented to compute inequality inductive invariants of the given systems. A numerical invariant of…
We give new algorithms based on the sum-of-squares method for tensor decomposition. Our results improve the best known running times from quasi-polynomial to polynomial for several problems, including decomposing random overcomplete…
Adjoint-based sensitivity analysis methods are powerful tools for engineers who use flow simulations for design. However, the conventional adjoint method breaks down for scale-resolving simulations like large-eddy simulation (LES) or direct…
In this paper, we discuss a method that utilizes the recurrence of $A_{n,k}$ to solve summations of the form $\sum_{k=n_0}^{n} A_{n,k}$. It is observed that by repeating the procedure, the upper bound of summation is reduced and tilts…
Template abstract domains allow to express more interesting properties than classical abstract domains. However, template generation is a challenging problem when one uses template abstract domains for program analysis. In this paper, we…
We extend several celebrated methods in classical analysis for summing series of complex numbers to series of complex matrices. These include the summation methods of Abel, Borel, Ces\'aro, Euler, Lambert, N\"orlund, and Mittag-Leffler,…
In this paper we study the cones corresponding to sums of squares of $n$-ary $d$-ic forms with at most $k$ terms. We show that these are strictly nested as $k$ increases, leading to the usual sum of squares cone. We also discuss the duals…
In this paper, we derive a general formula to express the product of three theta functions as a linear combination of other products of three theta functions. Moreover, we use the main formula to deduce a general formula for the product of…
We find the minimum scale factor, for which the nonnegative B\"ottcher-Wenzel biquadratic form becomes a sum of squares (sos). To this we give the primal and dual solutions for the underlying semide finite program. Moreover, for special…
We present algorithms to evaluate two types of multiple sums, which appear in higher-order loop computations. We consider expansions of a generalized hypergeometric-type sums, $\sum_{n_1,...,n_N} [Gamma(a1.n+c1) Gamma(a2.n}+c2) ...…
Power series in which the summand satisfies a linear recurrence relation with polynomial coefficients are shown to be the solution of a linear differential or algebraic equation. Solving the associated differential or algebraic equation…
In this paper, we set up the theoretical foundations for a high-dimensional functional factor model approach in the analysis of large cross-sections (panels) of functional time series (FTS). We first establish a representation result…
We present Ca$\Sigma$oS, the first MATLAB software specifically designed for nonlinear sum-of-squares optimization. A symbolic polynomial algebra system allows to formulate parametrized sum-of-squares optimization problems and facilitates…
Let $\bar{S}$ denote the set of integers $n$ such that $n!$ cannot be written as a sum of three squares. Let $\bar{S}(n)$ denote $\bar{S} \cap [1, n]$. We establish an exact formula for $\bar{S}(2^k)$ and show that $\bar{S}(n) = 1/8*n +…
We provide a necessary and sufficient condition for $n!$ to be a sum of three squares. The condition is based on the binary representation of $n$ and can be expressed by the operation of an automaton.
We perform certain alternating binomial summations with parameters that occur in the analysis of algorithms. A combination of integral and special function and special number representations is used. The results are sufficiently general to…
A sequence of rational numbers as a generalization of the sequence of Bernoulli numbers is introduced. Sums of products involving the terms of this generalized sequence are then obtained using an application of the Fa\`a di Bruno's formula.…
For any integer $x$, let $T_x$ denote the triangular number $\frac{x(x+1)}{2}$. In this paper we give a complete characterization of all the triples of positive integers $(\alpha, \beta, \gamma)$ for which the ternary sums $\alpha x^2…