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

Stanley decompositions of multigraded modules $M$ over polynomials rings have been discussed intensively in recent years. There is a natural notion of depth that goes with a Stanley decomposition, called the Stanley depth. Stanley…

The first half of this paper is largely expository, wherein we present a systematic combinatorial approach to the theory of polynomial (semi)invariants and multilinear invariants of several vectors and covectors, for the classical groups.…

We introduce the concept of Stanley decompositions in the localized polynomial ring $S_f$ where $f$ is a product of variables, and we show that the Stanley depth does not decrease upon localization. Furthermore it is shown that for monomial…

Let $I$ be an intersection of three monomial prime ideals of a polynomial algebra $S$ over a field. We give a special Stanley decomposition of $I$ which provides a lower bound of the Stanley depth of $I$, greater than or equal to $\depth\…

We study Stanley decompositions and show that Stanley's conjecture on Stanley decompositions implies his conjecture on partitionable Cohen-Macaulay simplicial complexes. We also prove these conjectures for all Cohen-Macaulay monomial ideals…

In energy management, it is common that strategic investment decisions (storage capacity, production units) are made at a slow time scale, whereas operational decisions (storage, production) are made at a fast time scale: for such problems,…

A method for compression of large graphs and non-negative matrices to a block structure is proposed. Szemer\'edi's regularity lemma is used as heuristic motivation of the significance of stochastic block models. Another ingredient of the…

In this paper we present an algorithm for construction of minimal involutive polynomial bases which are Groebner bases of the special form. The most general involutive algorithms are based on the concept of involutive monomial division…

We propose new primal-dual decomposition algorithms for solving systems of inclusions involving sums of linearly composed maximally monotone operators. The principal innovation in these algorithms is that they are block-iterative in the…

A consistent generalization of statistical mechanics is obtained by applying the maximum entropy principle to a trace-form entropy and by requiring that physically motivated mathematical properties are preserved. The emerging…

This paper proposes an improved quasi-Newton penalty decomposition algorithm for the minimization of continuously differentiable functions, possibly nonconvex, over sparse symmetric sets. The method solves a sequence of penalty subproblems…

Let $H$ be a complex reductive group, with finite-dimensional representations $W$ and $U$. The module of covariants for $W$ of type $U$ is the space of all $H$-equivariant polynomial maps $\varphi: W \longrightarrow U$. In this paper, we…

Statistical inference for stochastic block models typically relies on the spectrum of the normalized adjacency matrix $\A^*$. In practice, the true probability matrix $\mathbf{B}$ is unknown and must be replaced by a plug-in estimator…

Let $J\subset I$ be monomial ideals. We show that the Stanley depth of $I/J$ can be computed in a finite number of steps. We also introduce the $\fdepth$ of a monomial ideal which is defined in terms of prime filtrations and show that it…

We present a bijective algorithm with which an arbitrary permutation decomposes canonically into elementary blocks which we call families, which are sets with a specified number of ascents and descents. We show that families, arranged in an…

A block decomposition method is proposed for minimizing a (possibly non-convex) continuously differentiable function subject to one linear equality constraint and simple bounds on the variables. The proposed method iteratively selects a…

We introduce a new class of "filtered" schemes for some first order non-linear Hamilton-Jacobi-Bellman equations. The work follows recent ideas of Froese and Oberman (SIAM J. Numer. Anal., Vol 51, pp.423-444, 2013). The proposed schemes are…

In this tutorial, exponentiation and factorization (decomposition) formulas are derived and discussed for common matrix operators that arise in studies of classical dynamics, linear and nonlinear optics, and special relativity. To…

This paper presents new examples of elementary and non-elementary irreducible components of the Hilbert scheme of points and its nested variants. The results are achieved via a careful analysis of the deformations of a class of finite…

A combination of block-Jacobi and deflation preconditioning is used to solve a high-order discontinuous element-based collocation discretization of the Schur complement of the Poisson-Neumann system as arises in the operator splitting of…