Block Stanley decompositions. II: Greedy algorithms, applications, and open problems
type: Item
instance of: scholarly article
title: Block Stanley decompositions. II: Greedy algorithms, applications, and open problems
zbMATH Open document ID: 1408.13074
author: Theodore Murdock
author: James A. Murdock
published in: Bulletin of the Iranian Mathematical Society
publication date: 2019-03-22T00:00:00Z
Mathematics Subject Classification ID: 13P10
zbMATH DE Number: 7040767
zbMATH Keywords: geometry of monomial ideals
zbMATH Keywords: simplest Stanley decompositions
zbMATH Keywords: incompressible block decompositions
zbMATH Keywords: algorithms
zbMATH Keywords: organized decompositions
zbMATH Keywords: stacked decompositions
zbMATH Keywords: subalgebras
zbMATH Keywords: Hilbert bases
zbMATH Keywords: algebraic relations
zbMATH Keywords: classical invariant theory
zbMATH Keywords: equivariants
zbMATH Keywords: normal forms for dynamical systems
zbMATH Keywords: prime filtrations
zbMATH Keywords: Soleyman-Jahan condition
zbMATH Keywords: Janet decompositions
MaRDI profile type: Publication
full work available at URL: s41980-018-0123-9
OpenAlex ID: W2648849068
cites work: Janet's Algorithm
cites work: Q3822317
cites work: A complete set of covariants of the four qubit system
cites work: Q4023642
cites work: Q3776265
cites work: Q3197042
cites work: Normal form for the (2;n)-nilpotent vector field, using invariant theory
cites work: A non-partitionable Cohen-Macaulay simplicial complex
cites work: Computer algebra methods for equivariant dynamical systems
cites work: Stanley depth and the lcm-lattice
cites work: Normal Forms for Coupled Takens-Bogdanov Systems
cites work: Uniform bounds on multigraded regularity
cites work: On the structure of nilpotent normal form modules
cites work: Normal Forms and Unfoldings for Local Dynamical Systems
cites work: Box products in nilpotent normal form theory: the factoring method
cites work: An improved theory of asymptotic unfoldings
cites work: Block Stanley decompositions. I: Elementary and gnomon decompositions
cites work: A new transvectant algorithm for nilpotent normal forms
cites work: Janet's approach to presentations and resolutions for polynomials and linear PDEs
cites work: Averaging methods in nonlinear dynamical systems
cites work: Stanley decomposition of the joint covariants of three quadratics
cites work: Loewy decomposition of linear differential equations
cites work: Prime filtrations of monomial ideals and polarizations
cites work: Computing combinatorial decompositions of rings
DOI: 10.1007/S41980-018-0123-9
Recommended article: Block Stanley decompositions. I: Elementary and gnomon decompositions
Recommended article: A decomposition procedure for one class of block programming problems
Recommended article: Q3728912
Recommended article: Certain block problems of discrete optimization. I: A general approach to forming decomposition solution schemes
Recommended article: Lean Tree-Cut Decompositions: Obstructions and Algorithms
Recommended article: Faster Algorithms for Integer Programs with Block Structure
Recommended article: On Block-Structured Integer Programming and Its Applications
Recommended article: Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
Recommended article: Q5142540
Recommended article: Q4549155
description: scientific article; zbMATH DE number 7040767