English
Related papers

Related papers: Topology of unavoidable complexes

200 papers

We relate the embeddability of the simplicial complex $[3]*K$ into $\mathbb{R}^{n+2}$ to that of $K$ into $\mathbb{R}^n$. In brief, the embeddability of $K$ into $\mathbb{R}^n$, in the metastable range $2n\geq 3(d+1)$, is equivalent to the…

Geometric Topology · Mathematics 2020-07-08 Salman Parsa

Let $K$ be a finite simplicial complex. We prove that the normalized expected Betti numbers of a random subcomplex in its $d$-th barycentric subdivision $\text{Sd}^d (K)$ converge to universal limits as $d$ grows to $+ \infty$. In…

Probability · Mathematics 2018-06-14 Nermin Salepci , Jean-Yves Welschinger

Let $\mathcal{G}$ be a minor-closed graph class. We say that a graph $G$ is a $k$-apex of $\mathcal{G}$ if $G$ contains a set $S$ of at most $k$ vertices such that $G\setminus S$ belongs to $\mathcal{G}.$ We denote by $\mathcal{A}_k…

Combinatorics · Mathematics 2023-03-17 Ignasi Sau , Giannos Stamoulis , Dimitrios M. Thilikos

We consider 2-dimensional random simplicial complexes $Y$ in the multi-parameter model. We establish the multi-parameter threshold for the property that every 2-dimensional simplicial complex $S$ admits a topological embedding into $Y$…

Geometric Topology · Mathematics 2020-01-08 Michael Farber , Tahl Nowik

We call a finite undirected graph minimally k-matchable if it has at least k distinct perfect matchings but deleting any edge results in a graph which has not. An odd subdivision of some graph G is any graph obtained by replacing every edge…

Combinatorics · Mathematics 2016-08-05 Gasper Fijavz , Matthias Kriesell

Let $F$ be a non-archimedean local field of odd residue characteristic $p$. Let $G$ be the unramified unitary group $U(2, 1)(E/F)$, and $K$ be a maximal compact open subgroup of $G$. For an $\overline{\mathbf{F}}_p$-smooth representation…

Representation Theory · Mathematics 2018-03-08 Peng Xu

We introduce $k$-robust clique complexes, a family of simplicial complexes that generalizes the traditional clique complex. Here, a subset of vertices forms a simplex provided it does not contain an independent set of size $k$. We…

Combinatorics · Mathematics 2026-04-02 Marek Filakovský

Let $P$ be a finite simplicial comple with underlying space (union of simplices in $P$) $|P|$. Let $Q$ be a subcomplex of $P$. Let $a \geq 0$. Then there exists $K < \infty$, \emph{depending only on $a$ and $Q$,} with the following…

General Topology · Mathematics 2015-03-17 Steven P. Ellis

This note is purely expository. In the course of the Kolmogorov-Arnold solution of Hilbert's 13th problem on superpositions there appeared the notion of basic embedding. A subset K of R^2 is basic if for each continuous function f:K->R…

Functional Analysis · Mathematics 2010-03-09 A. Skopenkov

Let $\mathbb{S}_n$ denote the symmetric group on $[n]=\{1,\ldots,n\}$ with the uniform probability measure. For a permutation $\pi \in \mathbb{S}_n$ let $X_{\pi}$ denote the simplicial complex on the vertex set $[n]$ whose simplices are all…

Combinatorics · Mathematics 2024-06-28 Roy Meshulam , Omer Moyal

This paper concerns fractional $K_s$-decompositions of multipartite graphs. For integers $r\ge s\ge 3$, we consider balanced $r$-partite graphs $G$ on $rn$ vertices. We establish necessary conditions for $G$ to admit a fractional…

Combinatorics · Mathematics 2026-04-29 Tao Feng , Hengrui Liu , Shikang Yu

We find the minimum number $k=\mu'(\Sigma)$ for any surface $\Sigma$, such that every $\Sigma$-embeddable non-bipartite graph is not $k$-extendable. In particular, we construct the so-called bow-tie graphs $C_6\bowtie P_n$, and show that…

Combinatorics · Mathematics 2015-01-23 Hongliang Lu , David G. L. Wang

We consider a finite simplicial complex $K$ together with its successive barycentric subdivisions $Sd^d(K), d\geq0,$ and study the expected topology of a random subcomplex in $Sd^d(K), d\gg0$. We get asymptotic upper and lower bounds for…

Probability · Mathematics 2017-06-08 Nermin Salepci , Jean-Yves Welschinger

For a generic degree d smooth map f: N^n -> M^n we introduce its "transverse fundamental group" \pi(f), which reduces to \pi_1(M) in the case where f is a covering, and in general admits a monodromy homomorphism \pi(f) -> S_{|d|};…

Geometric Topology · Mathematics 2016-02-02 Sergey A. Melikhov

In this paper we study the Buchstaber invariant of simplicial complexes, which comes from toric topology. With each simplicial complex $K$ on $m$ vertices we can associate a moment-angle complex $\mathcal Z_K$ with a canonical action of the…

Algebraic Topology · Mathematics 2012-12-18 Nickolai Erokhovets

A set X of partial words over a finite alphabet A is called unavoidable if every two-sided infinite word over A has a factor compatible with an element of X. Unlike the case of a set of words without holes, the problem of deciding whether…

Formal Languages and Automata Theory · Computer Science 2017-08-23 Joey Becker , F. Blanchet-Sadri , Laure Flapan , Stephen Watkins

We prove that any geometrically connected curve $X$ over a field $k$ is an algebraic $K(\pi,1)$, as soon as its geometric irreducible components have nonzero genus. This means that the cohomology of any locally constant constructible…

Algebraic Geometry · Mathematics 2024-09-25 Christophe Levrat

The Euclidean minimum $M(K)$ of a number field $K$ is an important numerical invariant that indicates whether $K$ is norm-Euclidean. When $K$ is a non-CM field of unit rank 2 or higher, Cerri showed $M(K)$, as the supremum in the Euclidean…

Number Theory · Mathematics 2012-07-24 Uri Shapira , Zhiren Wang

We study $d$-dimensional simplicial complexes that are PL embeddable in $\mathbb{R}^{d+1}$. It is shown that such a complex must satisfy a certain homological condition. The existence of this obstruction allows us to provide a systematic…

Geometric Topology · Mathematics 2017-03-06 Anders Björner , Afshin Goodarzi

A fundamental question for simplicial complexes is to find the lowest dimensional Euclidean space in which they can be embedded. We investigate this question for order complexes of posets. We show that order complexes of thick geometric…

Combinatorics · Mathematics 2012-11-13 Martin Tancer , Kathrin Vorwerk