English
Related papers

Related papers: Extremal examples of collapsible complexes and ran…

200 papers

In the maximum independent set of convex polygons problem, we are given a set of $n$ convex polygons in the plane with the objective of selecting a maximum cardinality subset of non-overlapping polygons. Here we study a special case of the…

Computational Geometry · Computer Science 2024-02-13 Fabrizio Grandoni , Edin Husić , Mathieu Mari , Antoine Tinguely

The purpose of this work is to develop a version of Forman's discrete Morse theory for simplicial complexes, based on internal strong collapses. Classical discrete Morse theory can be viewed as a generalization of Whitehead's collapses,…

Algebraic Topology · Mathematics 2025-06-24 Ximena L. Fernández

In their paper proving the Hirsch bound for flag normal simplicial complexes (Math. Oper.~Res.~2014) Adiprasito and Benedetti define the notion of~\emph{combinatorial segment}. The study of the maximal length of these objects provides the…

Combinatorics · Mathematics 2017-10-10 Jean-Philippe Labbé , Thibault Manneville , Francisco Santos

We provide a simple characterization of simplicial complexes on few vertices that embed into the $d$-sphere. Namely, a simplicial complex on $d+3$ vertices embeds into the $d$-sphere if and only if its non-faces do not form an intersecting…

Combinatorics · Mathematics 2023-11-10 Florian Frick , Mirabel Hu , Verity Scheel , Steven Simon

We show that if a simplicial complex is a near-cone of sufficiently high depth, then the only maximum families of small pairwise intersecting faces are those with a common intersection. Thus, near-cones of sufficiently high depth satisfy…

Combinatorics · Mathematics 2025-07-02 Denys Bulavka , Russ Woodroofe

We present a discrete Morse-theoretic method for proving that a regular CW complex is homeomorphic to a sphere. We use this method to define bisimplices, the cells of a class of regular CW complexes we call bisimplicial complexes. The…

Group Theory · Mathematics 2019-04-16 Nima Hoda

We describe a provably complete algorithm for the generation of a tight, possibly exact superset of all combinatorially distinct simple n-facet polytopes in R^d, along with their graphs, f-vectors, and face lattices. The technique applies…

Combinatorics · Mathematics 2009-08-13 Sandeep Koranne , Anand Kulkarni

Through tropical normal idempotent matrices, we introduce isocanted alcoved polytopes, computing their $f$--vectors and checking the validity of the following five conjectures: B\'{a}r\'{a}ny, unimodality, $3^d$, flag and cubical lower…

Combinatorics · Mathematics 2020-09-30 María Jesús de la Puente , Pedro Luis Clavería

We introduce a version of discrete Morse theory for posets. This theory studies the topology of the order complexes K(X) of h-regular posets X from the critical points of admissible matchings on X. Our approach is related to R. Forman's…

Algebraic Topology · Mathematics 2012-05-11 Elias Gabriel Minian

In this paper, we present a unified analysis of both convergence and optimality of adaptive mixed finite element methods for a class of problems when the finite element spaces and corresponding a posteriori error estimates under…

Numerical Analysis · Mathematics 2016-01-05 Jun Hu , Guozhu Yu

We consider codimension-one defects in the theory of $d$ compact scalars on a two-dimensional worldsheet, acting linearly by mixing the scalars and their duals. By requiring that the defects are topological, we find that they correspond to…

High Energy Physics - Theory · Physics 2024-08-28 Sriram Bharadwaj , Pierluigi Niro , Konstantinos Roumpedakis

A soft random graph $G(n,r,p)$ can be obtained from the random geometric graph $G(n,r)$ by keeping every edge in $G(n,r)$ with probability $p$. The soft random simplicial complexes is a model for random simplicial complexes built over the…

Probability · Mathematics 2025-07-15 Julián David Candela

New constructions in group homology allow us to manufacture high-dimensional manifolds with controlled simplicial volume. We prove that for every dimension bigger than 3 the set of simplicial volumes of orientable closed connected manifolds…

Geometric Topology · Mathematics 2020-07-08 Nicolaus Heuer , Clara Loeh

We search for faces of the convex set consisting of all separable states, which are affinely isomorphic to simplices, to get separable states with unique decompositions. In the two-qutrit case, we found that six product vectors spanning a…

Quantum Physics · Physics 2014-07-22 Kil-Chan Ha , Seung-Hyeok Kye

Let $f_i(P)$ denote the number of $i$-dimensional faces of a convex polytope $P$. Furthermore, let $S(n,d)$ and $C(n,d)$ denote, respectively, the stacked and the cyclic $d$-dimensional polytopes on $n$ vertices. Our main result is that for…

Combinatorics · Mathematics 2007-05-23 Anders Björner

Using the concept of $d$-collapsibility from combinatorial topology, we define chordal simplicial complexes and show that their Stanley-Reisner ideals are componentwise linear. Our construction is inspired by and an extension of "chordal…

Commutative Algebra · Mathematics 2018-07-26 Mina Bigdeli , Sara Faridi

For each strongly connected finite-dimensional (pure) simplicial complex we construct a finite group, the group of projectivities of the complex, which is a combinatorial but not a topological invariant. This group is studied for…

Combinatorics · Mathematics 2007-05-23 Michael Joswig

We prove that a complete intersection of $c$ very general hypersurfaces of degree at least two in $N$-dimensional complex projective space is not ruled (and therefore not rational) provided that the sum of the degrees of the hypersurfaces…

Algebraic Geometry · Mathematics 2019-09-13 Lucas Braune

By making use of the classification of real simple Lie algebra, we get the maximum of the squared length of restricted roots case by case, thus we get the upper bounds of sectional curvature for irreducible Riemannian symmetric spaces of…

Differential Geometry · Mathematics 2007-05-23 Xusheng Liu

We present explicit constructions of centrally symmetric polytopes with many faces: first, we construct a d-dimensional centrally symmetric polytope P with about (1.316)^d vertices such that every pair of non-antipodal vertices of P spans…

Metric Geometry · Mathematics 2011-11-21 Alexander Barvinok , Seung Jin Lee , Isabella Novik
‹ Prev 1 4 5 6 7 8 10 Next ›