Related papers: Geometric vertex decomposition and liaison

Consider a Leibniz superalgebra $\mathfrak L$ additionally graded by an arbitrary set $I$ (set grading). We show that $\mathfrak L$ decomposes as the sum of well-described graded ideals plus (maybe) a suitable linear subspace. In the case…

We investigate families of two-dimensional simplicial complexes defined in terms of vertex decompositions. They include nonevasive complexes, strongly collapsible complexes of Barmak and Miniam and analogues of 2-trees of Harary and Palmer.…

Vertical decomposition is a widely used general technique for decomposing the cells of arrangements of semi-algebraic sets in ${{\mathbb R}}^d$ into constant-complexity subcells. In this paper, we settle in the affirmative a few…

We study a family of determinantal ideals whose decompositions encode the structural zeros in conditional independence models with hidden variables. We provide explicit decompositions of these ideals and, for certain subclasses of models,…

It is well known that for a subscheme $V$ in ${\mathbb P}^{n}$ of codimension two, the conditions (1) $V$ is ACM, and (2) $V$ is "licci" (i.e. $V$ is in the liaison class of a complete intersection) are equivalent. In higher codimension,…

We study three invariants of geometrically vertex decomposable ideals: the Castelnuovo-Mumford regularity, the multiplicity, and the $a$-invariant. We show that these invariants can be computed recursively using the ideals that appear in…

Geometric vertex algebras are a simplified version of Huang's geometric vertex operator algebras. We give a self-contained account of the equivalence of geometric vertex algebras with Z-graded vertex algebras.

A vertex set $X$ of a graph $G$ is an association set if each component of $G - X$ is a clique, or a dissociation set if each component of $G - X$ is a single vertex or a single edge. Interestingly, $G - X$ is then precisely a graph…

The symmetries described by Pin groups are the result of combining a finite number of discrete reflections in (hyper)planes. The current work shows how an analysis using geometric algebra provides a picture complementary to that of the…

Suppose a finitely generated group $G$ is hyperbolic relative to $\mathcal P$ a set of proper finitely generated subgroups of $G$. Established results in the literature imply that a "visual" metric on $\partial (G,\mathcal P)$ is "linearly…

In this paper we build an abstract description of vertex algebras from their basic axioms. Starting with Borcherds' notion of a vertex group, we naturally construct a family of multilinear singular maps parameterised by trees. These…

We create a framework for studying symmetric chain decompositions of families of finite posets based on the geometry of polytopes. Our framework unifies almost all known results regarding symmetric chain decompositions of the Young posets…

Associated to a simple undirected graph $G$ is a simplicial complex $\Delta_G$ whose faces correspond to the independent sets of $G$. A graph $G$ is called vertex decomposable if $\Delta_G$ is a vertex decomposable simplicial complex. We…

We introduce a graph decomposition which exists for all simple, connected graphs $G=(V,E)$. The decomposition $V = A \cup B \cup C$ is such that each vertex in $A$ has more neighbors in $B$ than in $A$ and vice versa. $C$ is `balanced':…

The author has previously shown that solvable Lie A-algebras and complemented solvable Lie algebras decompose as a vector space direct sum of abelian subalgebras, and their ideals relate nicely to this decomposition. However, neither of…

Massive networks have shown that the determination of dense subgraphs, where vertices interact a lot, is necessary in order to visualize groups of common interest, and therefore be able to decompose a big graph into smaller structures. Many…

We introduce and study strongly vertex dismissible, vertex dismissible, and scalable simplicial complexes as non-pure extensions of vertex decomposability and shellability. Strong vertex dismissibility is defined recursively by relaxing the…

The vanishing ideal I of a subspace arrangement is an intersection of linear ideals. We give a formula for the Hilbert polynomial of I if the subspaces meet transversally. We also give a formula for the Hilbert series of a product J of the…

This paper studies certain relations among vertex algebras, vertex Lie algebras and vertex Poisson algebras. In this paper, the notions of vertex Lie algebra (conformal algebra) and vertex Poisson algebra are revisited and certain general…

We show how one can associate to a given class of finite type G-structures a classifying Lie algebroid. The corresponding Lie groupoid gives models for the different geometries that one can find in the class, and encodes also the different…