Related papers: Block Stanley decompositions I. Elementary and gno…

Low-rank approximations are essential in modern data science. The interpolative decomposition provides one such approximation. Its distinguishing feature is that it reuses columns from the original matrix. This enables it to preserve matrix…

Given a set of integers with no three in arithmetic progression, we construct a Stanley sequence by adding integers greedily so that no arithmetic progression is formed. This paper offers two main contributions to the theory of Stanley…

For general complex or real 1-parameter matrix flows $A(t)_{n,n}$ and for time-invariant static matrices $A \in \CC_{n,n}$ alike, this paper considers ways to decompose matrix flows and single matrices globally via one constant matrix…

Let $S=K[x_1,\ldots,x_n]$ be the ring of polynomials in $n$ variables over an arbitrary field $K$. Given a finitely generated multigraded module $M$, its Stanley length, denoted by $\operatorname{slength}(M)$, is the minimal length of a…

Homology decomposition techniques are a powerful tool used in the analysis of the homotopy theory of (classifying) spaces. The associated Bousfield-Kan spectral sequences involve higher derived limits of the inverse limit functor. We study…

This work explores and develops elements of Stein's method of approximation, in the infinitely divisible setting, and its connections to functional analysis. It is mainly concerned with multivariate self-decomposable laws without finite…

This work proposes block-coordinate fixed point algorithms with applications to nonlinear analysis and optimization in Hilbert spaces. The asymptotic analysis relies on a notion of stochastic quasi-Fej\'er monotonicity, which is thoroughly…

Let S=K[x_1,x_2,...,x_n] be a polynomial ring in n variables over a field K. Stanley's conjecture holds for the modules I and S/I, when I is a critical monomial ideal. We calculate the Stanley depth of S/I when I is a canonical critical…

Square-root Kalman filters propagate state covariances in Cholesky-factor form for numerical stability, and are a natural target for gradient-based parameter learning in state-space models. Their core operation, triangularization of a…

We present the Multi-Block DC (BDC) class, a rich class of structured nonconvex functions that admit a DC ("difference-of-convex") decomposition across parameter blocks. This multi-block class not only subsumes the usual DC programming, but…

A construction of big convolutional codes from short codes called block Markov superposition transmission (BMST) is proposed. The BMST is very similar to superposition blockMarkov encoding (SBME), which has been widely used to prove…

We study primary submodules and primary decompositions from a differential and computational point of view. Our main theoretical contribution is a general structure theory and a representation theorem for primary submodules of an arbitrary…

In 1993 Stanley showed that if a simplicial complex is acyclic over some field, then its face poset can be decomposed into disjoint rank $1$ boolean intervals whose minimal faces together form a subcomplex. Stanley further conjectured that…

In 1954, Alston S. Householder published Principles of Numerical Analysis, one of the first modern treatments on matrix decomposition that favored a (block) LU decomposition-the factorization of a matrix into the product of lower and upper…

Let $G$ be a finite group and $N$ be a normal subgroup of $G$. Let $J=J(F[N])$ denote the Jacboson radical of $F[N]$ and $I={\rm Ann}(J)=\{\alpha \in F[G]|J\alpha =0\}$. We have another algebra $F[G]/I$. We study the decomposition of Cartan…

Multistage stochastic optimization problems are, by essence, complex as their solutions are indexed both by stages and by uncertainties. Their large scale nature makes decomposition methods appealing, like dynamic programming which is a…

We develop a block-activated decomposition algorithm for multi-stage stochastic variational inequalities with nonanticipativity constraints, which features two computational novelties: (i) At each iteration, our method activates only a…

Decompositional theories describe the ways in which a global physical system can be split into subsystems, facilitating the study of how different possible partitions of a same system interplay, e.g. in terms of inclusions or signalling. In…

Let $N$ be a nilpotent matrix and consider vector fields $\dot\bx=N\bx+\bv(\bx)$ in normal form. Then $\bv$ is equivariant under the flow $e^{N^*t}$ for the inner product normal form or $e^{Mt}$ for the $\ssl_2$ normal form. These vector…

In this paper we consider an algorithmic technique more general than that proposed by Zharkov and Blinkov for the involutive analysis of polynomial ideals. It is based on a new concept of involutive monomial division which is defined for a…