English
Related papers

Related papers: Structural properties of nested set complexes

200 papers

We consider deformations of bounded complexes of modules for a profinite group G over a field of positive characteristic. We prove a finiteness theorem which provides some sufficient conditions for the versal deformation of such a complex…

Number Theory · Mathematics 2013-09-03 Frauke M. Bleher , Ted Chinburg

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

We study orthogonal decompositions of symmetric and ordinary tensors using methods from linear algebra. For the field of real numbers we show that the sets of decomposable tensors can be defined be equations of degree 2. This gives a new…

Rings and Algebras · Mathematics 2019-10-01 Pascal Koiran

We extend the results of Deligne and Illusie on liftings modulo $p^2$ and decompositions of the de Rham complex in several ways. We show that for a smooth scheme $X$ over a perfect field $k$ of characteristic $p>0$, the truncations of the…

Algebraic Geometry · Mathematics 2023-03-29 Piotr Achinger , Junecue Suh

Suppose $\Delta$ is a pure simplicial complex on $n$ vertices having dimension $d$ and let $c = n-d-1$ be its codimension in the simplex. Terai and Yoshida proved that if the number of facets of $\Delta$ is at least $\binom{n}{c}-2c+1$,…

Combinatorics · Mathematics 2024-12-06 Anton Dochtermann , Ritika Nair , Jay Schweig , Adam Van Tuyl , Russ Woodroofe

Low rank tensor decompositions are a powerful tool for learning generative models, and uniqueness results give them a significant advantage over matrix decomposition methods. However, tensors pose significant algorithmic challenges and…

Data Structures and Algorithms · Computer Science 2014-01-21 Aditya Bhaskara , Moses Charikar , Ankur Moitra , Aravindan Vijayaraghavan

A theory of matchings for finite subsets of an abelian group, introduced in connection with a conjecture of Wakeford on canonical forms for homogeneous polynomials, has since been extended to the setting of field extensions and to that of…

Combinatorics · Mathematics 2026-02-03 Mohsen Aliabadi , Jozsef Losonczy

Structure monoids and groups are algebraic invariants of equational varieties. We show how to construct presentations of these objects from coherent categorifications of equational varieties, generalising several results of Dehornoy. We…

Category Theory · Mathematics 2008-02-26 Jonathan A. Cohen

We introduce structured decompositions, category-theoretic structures which simultaneously generalize notions from graph theory (including treewidth, layered treewidth, co-treewidth, graph decomposition width, tree independence number,…

Category Theory · Mathematics 2025-05-21 Benjamin Merlin Bumpus , Zoltan A. Kocsis , Jade Edenstar Master , Emilio Minichiello

The model theory based notion of the first order convergence unifies the notions of the left-convergence for dense structures and the Benjamini-Schramm convergence for sparse structures. It is known that every first order convergent…

Combinatorics · Mathematics 2016-08-16 Frantisek Kardos , Daniel Kral , Anita Liebenau , Lukas Mach

We investigate the structure of join tensors, which may be regarded as the multivariable extension of lattice-theoretic join matrices. Explicit formulae for a polyadic decomposition (i.e., a linear combination of rank-1 tensors) and a…

Rings and Algebras · Mathematics 2017-05-19 Vesa Kaarnioja

Nested set complexes appear as the combinatorial core of De Concini-Procesi arrangement models. We show that nested set complexes are homotopy equivalent to the order complexes of the underlying meet-semilattices without their minimal…

Combinatorics · Mathematics 2007-05-23 Eva Maria Feichtner , Irene Mueller

Many combinatorial properties of a point set in the plane are determined by the set of possible partitions of the point set by a line. Their essential combinatorial properties are well captured by the axioms of oriented matroids. In fact,…

Combinatorics · Mathematics 2021-11-08 Hiroyuki Miyata

We say that a pure $d$-dimensional simplicial complex $\Delta$ on $n$ vertices is \emph{shelling completable} if $\Delta$ can be realized as the initial sequence of some shelling of $\Delta_{n-1}^{(d)}$, the $d$-skeleton of the…

Combinatorics · Mathematics 2023-08-11 Michaela Coleman , Anton Dochtermann , Nathan Geist , Suho Oh

While every matrix admits a singular value decomposition, in which the terms are pairwise orthogonal in a strong sense, higher-order tensors typically do not admit such an orthogonal decomposition. Those that do have attracted attention…

Algebraic Geometry · Mathematics 2015-12-29 Ada Boralevi , Jan Draisma , Emil Horobet , Elina Robeva

Generalizing a well known theorem for finite matroids, we prove that for every (infinite) connected matroid M there is a unique tree T such that the nodes of T correspond to minors of M that are either 3-connected or circuits or cocircuits,…

Combinatorics · Mathematics 2015-06-08 Elad Aigner-Horev , Reinhard Diestel , Luke Postle

The augmented Bergman complex of a matroid is a simplicial complex introduced recently in work of Braden, Huh, Matherne, Proudfoot and Wang. It may be viewed as a hybrid of two well-studied pure shellable simplicial complexes associated to…

Given a finite group G and a natural number n, we study the structure of the complex of nested sets of the associated Dowling lattice Q(G) and of its subposet of the G-symmetric partitions Q_G which was recently introduced by Hultman…

Combinatorics · Mathematics 2007-05-23 Emanuele Delucchi

We utilize the coherent-constructible correspondence to construct full strongly exceptional collections of nef line bundles in the derived category of a toric variety through the combinatorics of constructible sheaves built from polytopes.…

Algebraic Geometry · Mathematics 2023-11-08 Mario Sanchez

Seymour's decomposition theorem is a hallmark result in matroid theory presenting a structural characterization of the class of regular matroids. Formalization of matroid theory faces many challenges, most importantly that only a limited…