English
Related papers

Related papers: Set-decomposition of normal rectifiable G-chains v…

200 papers

We prove that every flat chain with finite mass in $\mathbb{R}^d$ with coefficients in a normed abelian group $G$ is the restriction of a normal $G$-current to a Borel set. We deduce a characterization of real flat chains with finite mass…

Classical Analysis and ODEs · Mathematics 2023-11-13 Giovanni Alberti , Andrea Marchese

We prove a general decomposition theorem for the modal $\mu$-calculus $L_\mu$ in the spirit of Feferman and Vaught's theorem for disjoint unions. In particular, we show that if a structure (i.e., transition system) is composed of two…

Logic · Mathematics 2014-05-12 Mikolaj Bojanczyk , Christoph Dittmann , Stephan Kreutzer

Let G be a bipartite graph with edge ideal I(G) whose quotient ring R/I(G) is sequentially Cohen-Macaulay. We prove: (1) the independence complex of G must be vertex decomposable, and (2) the Castelnuovo-Mumford regularity of R/I(G) can be…

Commutative Algebra · Mathematics 2009-06-02 Adam Van Tuyl

We introduce the notion of regular finite decomposition complexity of a metric family. This generalizes Gromov's finite asymptotic dimension and is motivated by the concept of finite decomposition complexity (FDC) due to Guentner, Tessera…

Metric Geometry · Mathematics 2020-01-22 Daniel Kasprowski , Andrew Nicas , David Rosenthal

Let G be a reductive linear algebraic group over an algebraically closed field of characteristic p > 0. A subgroup of G is said to be separable in G if its global and infinitesimal centralizers have the same dimension. We study the…

Group Theory · Mathematics 2008-08-12 Michael Bate , Benjamin Martin , Gerhard Roehrle , Rudolf Tange

This paper studies a class of binomial ideals associated to graphs with finite vertex sets. They generalize the binomial edge ideals, and they arise in the study of conditional independence ideals. A Gr\"obner basis can be computed by…

Commutative Algebra · Mathematics 2014-06-18 Johannes Rauh

We show that some common and important global constraints like ALL-DIFFERENT and GCC can be decomposed into simple arithmetic constraints on which we achieve bound or range consistency, and in some cases even greater pruning. These…

Artificial Intelligence · Computer Science 2009-05-26 Christian Bessiere , George Katsirelos , Nina Narodytska , Claude-Guy Quimper , Toby Walsh

We study the decomposability and the subdifferential of the tensor nuclear norm. Both concepts are well understood and widely applied in matrices but remain unclear for higher-order tensors. We show that the tensor nuclear norm admits a…

Optimization and Control · Mathematics 2026-03-17 Jiewen Guan , Bo Jiang , Zhening Li

As service to the community, we provide - for Euclidean space - a basic treatment of locally rectifiable chains and of the complex of locally integral chains. In this setting, we may beneficially develop the idea of a complete normed…

Differential Geometry · Mathematics 2024-11-20 Ulrich Menne , Christian Scharrer

In the present paper we introduce a notion of $G-$decompositions of matrices. Main result of the paper is that a symmetric matrix $A_m$ has a $G-$decomposition in the class of stochastic (resp. substochastic) matrices if and only if $A_m$…

Combinatorics · Mathematics 2015-02-10 Rasul Ganikhodjaev , Farrukh Mukhamedov , Mansoor Saburov

Let F be a non Archimedean locally compact field of residue characteristic different from 2, let G be a connected reductive group defined over F, let s be an involutive F-automorphism of G and H an open F-subgroup of the fixed points group…

Representation Theory · Mathematics 2007-05-23 Patrick Delorme , Vincent Secherre

Let K be an Abstract Elementary Class. Under the asusmptions that K has a nicely behaved forking-like notion, regular types and existence of some prime models we establish a decomposition theorem for such classes. The decomposition implies…

Logic · Mathematics 2007-05-23 Rami Grossberg , Olivier Lessmann

Let $G$ be a finite connected simple graph with $d$ vertices and let $\Pc_G \subset \RR^d$ be the edge polytope of $G$. We call $\Pc_G$ \emph{decomposable} if $\Pc_G$ decomposes into integral polytopes $\Pc_{G^+}$ and $\Pc_{G^-}$ via a…

Combinatorics · Mathematics 2012-08-10 Takayuki Hibi , Nan Li , Yan X. Zhang

In this paper decomposition of periodic orbits in bifurcation diagrams are derived in unidimensional dynamics system $x_{n+1}=f(x_{n};r)$, being $f$ an unimodal function. We proof a theorem which states the necessary and sufficient…

For a morphism f in a category C with sufficiently many finite limits and colimits, we discuss an elementary construction of a decomposition of f through objects P and N which, if C happens to have a zero object, amounts to the standard…

Category Theory · Mathematics 2024-11-06 Renier Jansen , Muhammad Qasim , Walter Tholen

Bonicatto--Pasqualetto--Rajala (2020) proved that a decomposition theorem for sets of finite perimeter into indecomposable sets, known to hold in Euclidean spaces, holds also in complete metric spaces equipped with a doubling measure,…

Metric Geometry · Mathematics 2021-03-29 Panu Lahti

The LYM inequality is a fundamental result concerning the sizes of subsets in a Sperner family. Subsequent studies on the LYM inequality have been generalized to families of $r$-decompositions, where all components are required to avoid…

Combinatorics · Mathematics 2026-03-17 Zihao Huang , Weikang Liang , Yujiao Ma , Suijie Wang

We give a framework to produce constructible functions from natural functors between categories, without need of a morphism of moduli spaces to model the functor. We show using the Riemann-Hilbert correspondence that any natural (derived)…

Algebraic Geometry · Mathematics 2021-10-18 Nero Budur , Botong Wang

Reductive G-structures on a principal bundle Q are considered. It is shown that these structures, i.e. reductive G-subbundles P of Q, admit a canonical decomposition of the pull-back vector bundle $i_P^*(TQ) = P \times_Q TQ$ over P. For…

Differential Geometry · Mathematics 2015-06-26 Marco Godina , Paolo Matteucci

Given a symmetric monoidal category $C$ with product $\sqcup$, where the neutral element for the product is an initial object, we consider the poset of $\sqcup$-complemented subobjects of a given object $X$. When this poset has finite…

Combinatorics · Mathematics 2025-07-30 Kevin Ivan Piterman , Volkmar Welker