相关论文: Set-decomposition of normal rectifiable G-chains v…

In this note we extend White's deformation theorem for G-flat chains to the setting of G-flat tensor chains. As a corollary we obtain that the groups of normal tensor chains identify with some subgroups of normal chains. Moreover the…

In a previous article by the author and P. Wesolek, it was shown that a compactly generated locally compact group $G$ admits a finite normal series $(G_i)$ in which the factors are compact, discrete or irreducible in the sense that no…

We present an effective method for computing parametric primary decomposition via comprehensive Gr\"obner systems. In general, it is very difficult to compute a parametric primary decomposition of a given ideal in the polynomial ring with…

The current article continues a series of papers on decomposition of unipotents and its applications. Let $G(\Phi,R)$ be a Chevalley group with a reduced irreducible root system $\Phi$ over a commutative ring $R$. Fix $h\in G(\Phi,R)$. Call…

For a continuous flow on a compact metric space, the aim of this paper is to prove a Conley-type decomposition of the strong chain recurrent set. We first discuss in details the main properties of strong chain recurrent sets. We then…

Every finite graph $G$ can be decomposed in a canonical way that displays its local connectivity-structure [DJKK26]. These decompositions are defined via a suitable more tree-like covering of $G$, whose tangle-tree structure is projected…

We establish a structure theorem for minimizing sequences for the isoperimetric problem on noncompact $\mathsf{RCD}(K,N)$ spaces $(X,\mathsf{d},\mathcal{H}^N)$. Under the sole (necessary) assumption that the measure of unit balls is…

Using the theory of equitable decompositions it is possible to decompose a matrix $M$ appropriately associated with a given graph. The result is a collection of smaller matrices whose collective eigenvalues are the same as the eigenvalues…

A rigidity result for normal rectifiable $k$-chains in $\mathbb{R}^n$ with coefficients in an Abelian normed group is established. Given some decompositions $k=k_1+k_2$, $n=n_1+n_2$ and some rectifiable $k$-chain $A$ in $\mathbb{R}^n$, we…

We study the tensor-triangular geometry of the category of rational $G$-spectra for a compact Lie group $G$. In particular, we prove that this category can be naturally decomposed into local factors supported on individual subgroups, each…

We prove that a set of finite perimeter is indecomposable if and only if it is, up to a choice of suitable representative, connected in the 1-fine topology. This gives a topological characterization of indecomposability which is new even in…

We construct canonical semi-orthogonal decompositions for derived categories of smooth projective surfaces. These decompositions are compatible with the operations in the minimal model program, such as blow-ups and conic bundles. Therefore…

We establish a genericity property in the representation theory of a flat family of finite-dimensional algebras in the sense of Cline-Parshal-Scott. More precisely, we show that the decomposition matrices as introduced by Geck and Rouquier…

Let G be the group of rational points of a connected reductive group over a finite field. Based on work of Lusztig and Yun, we make the Jordan decomposition for irreducible G-representations canonical. It comes in the form of an equivalence…

We describe a recursive algorithm that decomposes an algebraic set into locally closed equidimensional sets, i.e. sets which each have irreducible components of the same dimension. At the core of this algorithm, we combine ideas from the…

We introduce decomposition complexes of posets, which generalize order complexes. The main advantage of our construction is that decomposition complexes are closed under taking products. Other special instances of this theory include nested…

A new general decomposition theory inspired from modular graph decomposition is presented. This helps unifying modular decomposition on different structures, including (but not restricted to) graphs. Moreover, even in the case of graphs,…

The aim of this work is to reduce the complexity of the available algorithms for computing the generator sets of a semigroup ideal by using the Hermite normal form. In order to achieve it we introduce the concept of decomposable semigroup.…

A {\em $(d,h)$-decomposition} of a graph $G$ is an order pair $(D,H)$ such that $H$ is a subgraph of $G$ where $H$ has the maximum degree at most $h$ and $D$ is an acyclic orientation of $G-E(H)$ of maximum out-degree at most $d$. A graph…

We show that the stable module $\infty$-category of a finite group $G$ decomposes in three different ways as a limit of the stable module $\infty$-categories of certain subgroups of $G$. Analogously to Dwyer's terminology for homology…