Related papers: Squeezed Complexes

The independence complex of a graph G is a simplicial complex whose simplices are the independent sets in G. In the last couple of decades, the independence complexes of square grids (with various boundary conditions) have gained much…

Subword complexes were defined by A.Knutson and E.Miller in 2004 for describing Gr\"obner degenerations of matrix Schubert varieties. The facets of such a complex are indexed by pipe dreams, or, equivalently, by the monomials in the…

We study structural and enumerative aspects of pure simplicial complexes and clique complexes. We prove a necessary and sufficient condition for any simplicial complex to be a clique complex that depends only on the list of facets. We also…

We show how multiplier ideals can be used to obtain uniform multiplicative bounds for certain families of ideals on a smooth complex algebraic variety. In particular we prove a quick but rather surprising result about symbolic powers of…

Using the random complexes of Linial and Meshulam, we exhibit a large family of simplicial complexes for which, whenever affinely embedded into Euclidean space, the filling areas of simplicial cycles is greatly distorted. This phenomenon…

In this paper we discuss a couple of observations related to polynomial convexity. More precisely, (i) We observe that the union of finitely many disjoint closed balls with centres in $\cup_{\theta\in[0,\pi/2]}e^{i\theta}V$ is polynomially…

The terms "whiskering", and more generally "grafting", refer to adding generators to any monomial ideal to make the resulting ideal Cohen-Macaulay. We investigate the independence complexes of simplicial complexes that are constructed…

We introduce the theory of strong homotopy types of simplicial complexes. Similarly to classical simple homotopy theory, the strong homotopy types can be described by elementary moves. An elementary move in this setting is called a strong…

We provide necessary and sufficient conditions for simplicial complexes whose determinantal facet ideals admit reduced Grobner bases under diagonal term orders. Building on and extending foundational results for binomial edge ideals and…

We study d-dimensional generalizations of three mutually related topics in graph theory: Hamiltonian paths, (unit) interval graphs, and binomial edge ideals. We provide partial high-dimensional generalizations of Ore and Posa's sufficient…

Using graph of groups decompositions of finitely generated groups, we define Euler characteristic type invariants which are non-zero in many interesting classes of finitely presented, hyperbolic, limit and CSA groups, including elementarily…

We define an invariant, which we call surface-complexity, of compact 3-manifolds by means of Dehn surfaces. The surface-complexity is a natural number measuring how much the manifold is complicated. We prove that it fulfils interesting…

The Golodness of a simplicial complex is defined algebraically in terms of the Stanley-Reisner ring, and it has been a long-standing problem to find its combinatorial characterization. The tightness of a simplicial complex is a…

This article is concerned with the approximation of unbounded convex sets by polyhedra. While there is an abundance of literature investigating this task for compact sets, results on the unbounded case are scarce. We first point out the…

We investigate simplicial complexes deterministically growing from a single vertex. In the first step, a vertex and an edge connecting it to the primordial vertex are added. The resulting simplicial complex has a 1-dimensional simplex and…

For a graph $G$ and partition $\mathcal{U}$ of its vertex set, an independent transversal of $(G, \mathcal{U})$ is an independent set of $G$ that contains one vertex from each block of $\mathcal{U}$. Buys, Kang, and Ozeki studied when a…

A prism is the product space $\Delta \times I$ where $\Delta$ is a 2-simplex and $I$ is a closed interval. As an analogue of simplicial complexes, we introduce prism complexes and show that every compact $3$-manifold has a prism complex…

We revisit the classical concept of near-decomposability in complex systems, introduced by Herbert Simon in his foundational article The Architecture of Complexity, by developing an explicit quantitative analysis based on singular…

We determine putative optimal packings of regular spherical polygons via optimization on smooth manifolds. For several cases, we establish maximality by extending the Lov\'asz theta number to Cayley graphs on the special orthogonal group…

A subvariety of a quasi-projective complex variety $X$ is called ``universally irreducible'' if its preimage inside the universal cover of $X$ is irreducible. In this paper we investigate sufficient conditions for universal irreducibility.…