English
Related papers

Related papers: Leray numbers of tolerance complexes

200 papers

Inflation of a simplicial complex $K$ is a construction well known in combinatorial topology. It replaces each vertex $i$ of $K$ with a finite number $n_i$ of its copies, and each simplex $\{i_0,\ldots,i_k\}$ with $n_{i_0}n_{i_1}\cdots…

Algebraic Topology · Mathematics 2026-02-10 Anton Ayzenberg , Nadya Khoroshavkina

In [GHKK18], Gross-Hacking-Keel-Kontsevich discuss compactifications of cluster varieties from "positive subsets" in the real tropicalization of the mirror. To be more precise, let $\mathfrak{D}$ be the scattering diagram of a cluster…

Algebraic Geometry · Mathematics 2021-01-29 Man-Wai Cheung , Timothy Magee , Alfredo Nájera Chávez

We prove a no-dimensional version of Carath\'edory's theorem: given an $n$-element set $P\subset \Re^d$, a point $a \in \conv P$, and an integer $r\le d$, $r \le n$, there is a subset $Q\subset P$ of $r$ elements such that the distance…

Metric Geometry · Mathematics 2019-08-29 Karim Adiprasito , Imre Bárány , Nabil H. Mustafa , Tamás Terpai

Helly's theorem and its variants show that for a family of convex sets in Euclidean space, local intersection patterns influence global intersection patterns. A classical result of Eckhoff in 1988 provided an optimal fractional Helly…

Combinatorics · Mathematics 2024-02-09 Debsoumya Chakraborti , Jaehoon Kim , Jinha Kim , Minki Kim , Hong Liu

Reay's relaxed Tverberg conjecture and Conway's thrackle conjecture are open problems about the geometry of pairwise intersections. Reay asked for the minimum number of points in Euclidean d-space that guarantees any such point set admits a…

Let $K$ be any field, and let $E$ be any graph. We explicitly construct the projective resolution of simple left modules over the Leavitt path algebra $L_K(E)$ associated to cycles and irreducible polynomials. Then we study the dimension of…

Rings and Algebras · Mathematics 2026-05-22 Francesca Mantese , Alberto Tonolo

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…

Commutative Algebra · Mathematics 2026-04-06 Mohammed Rafiq Namiq

An $r$-uniform hypergraph $H$ is semi-algebraic of complexity $\mathbf{t}=(d,D,m)$ if the vertices of $H$ correspond to points in $\mathbb{R}^{d}$, and the edges of $H$ are determined by the sign-pattern of $m$ degree-$D$ polynomials.…

Combinatorics · Mathematics 2023-08-08 Zhihan Jin , István Tomon

Let $H=(V,E)$ be a hypergraph, where $V$ is a set of vertices and $E$ is a set of non-empty subsets of $V$ called edges. If all edges of $H$ have the same cardinality $r$, then $H$ is a $r$-uniform hypergraph; if $E$ consists of all…

Combinatorics · Mathematics 2018-08-03 Yingzhi Tian , Hong-Jian Lai , Jixiang Meng

We show a new reduction method on a simplicial complex. This reduction works well with relations and Dowker complexes. The idea is to add a dummy vertex $ z $ to the simplicial complex $K$. We add the simplicial cone $ z * L $ to $K$ where…

Combinatorics · Mathematics 2024-01-17 Dominic Desjardins Côté

For a graph $G$ and a parameter $k$, we call a vertex $k$-enabling if it belongs both to a clique of size $k$ and to an independent set of size $k$, and we call it $k$-excluding otherwise. Motivated by issues that arise in secret sharing…

Data Structures and Algorithms · Computer Science 2025-09-03 Uriel Feige , Ilia Pauzner

We construct a higher level analogue of Dorey's rule, which describe certain surjective morphisms between Kirillov--Reshetikhin (KR) modules over quantum affine algebras. Building on this, we establish a generalized T-system of short exact…

Quantum Algebra · Mathematics 2026-01-21 Se-jin Oh , Travis Scrimshaw

Let $G$ be a simple linear algebraic group over an algebraically closed field $K$ of characteristic $p \geqslant 0$, let $H$ be a proper closed subgroup of $G$ and let $V$ be a nontrivial finite dimensional irreducible rational $KG$-module.…

Group Theory · Mathematics 2018-10-08 Timothy C. Burness , Donna M. Testerman

We prove that for every $d\geq 2$, deciding if a pure, $d$-dimensional, simplicial complex is shellable is NP-hard, hence NP-complete. This resolves a question raised, e.g., by Danaraj and Klee in 1978. Our reduction also yields that for…

Combinatorics · Mathematics 2018-01-26 Xavier Goaoc , Pavel Paták , Zuzana Patáková , Martin Tancer , Uli Wagner

Let Y be a random d-dimensional subcomplex of the (n-1)-dimensional simplex S obtained by starting with the full (d-1)-dimensional skeleton of S and then adding each d-simplex independently with probability p=c/n. We compute an explicit…

Combinatorics · Mathematics 2011-08-04 L. Aronshtam , N. Linial , T. Luczak , R. Meshulam

Suppose $M^{n+1}$ is a complex manifold and K is a hypersurface with isolated singularities. Let $\omega$ be a holomorphic form on $M\setminus K$ with the first order pole on K. The Leray residue of such form gives an element in the n-th…

alg-geom · Mathematics 2008-02-03 Andrzej Weber

Let $G$ be a simple algebraic group over an algebraically closed field $K$ of characteristic $p\geqslant 0$, let $H$ be a proper closed subgroup of $G$ and let $V$ be a nontrivial irreducible $KG$-module, which is $p$-restricted, tensor…

Group Theory · Mathematics 2016-05-23 Timothy C. Burness , Claude Marion , Donna M. Testerman

The theory of $k$-regular graphs is closely related to group theory. Every $k$-regular, bipartite graph is a Schreier graph with respect to some group $G$, a set of generators $S$ (depending only on $k$) and a subgroup $H$. The goal of this…

Combinatorics · Mathematics 2016-07-27 Alexander Lubotzky , Zur Luria , Ron Rosenthal

The $k$-flex locus of a projective hypersurface $V\subset \mathbb P^n$ is the locus of points $p\in V$ such that there is a line with order of contact at least $k$ with $V$ at $p$. Unexpected contact orders occur when $k\ge n+1$. The case…

Algebraic Geometry · Mathematics 2025-02-05 Cristina Bertone , Martin Weimann

In this paper we extend the works of Tancer and of Malgouyres and Franc\'es, showing that $(d,k)$-collapsibility is NP-complete for $d\geq k+2$ except $(2,0)$. By $(d,k)$-collapsibility we mean the following problem: determine whether a…

Computational Geometry · Computer Science 2019-04-08 Giovanni Paolini
‹ Prev 1 4 5 6 7 8 10 Next ›