English
Related papers

Related papers: Maps between higher Bruhat orders and higher Stash…

200 papers

We construct an explicit bijection between bipartite pointed maps of an arbitrary surface $\mathbb{S}$, and specific unicellular blossoming maps of the same surface. Our bijection gives access to the degrees of all the faces, and distances…

Combinatorics · Mathematics 2022-08-02 Maciej Dołęga , Mathias Lepoutre

We give a combinatorial characterization of upward planar graphs in terms of upward planar orders, which are special linear extensions of edge posets.

Combinatorics · Mathematics 2019-01-08 Xuexing Lu , Yu Ye

We prove that the ordered configuration spaces of planar graphs have the highest possible topological complexity generically, as predicted by a conjecture of Farber. Our argument establishes the same generic maximality for all higher…

Algebraic Topology · Mathematics 2021-08-03 Ben Knudsen

The fourth listed author and Hans Parshall (\cite{IosevichParshall}) proved that if $E \subset {\mathbb F}_q^d$, $d \ge 2$, and $G$ is a connected graph on $k+1$ vertices such that the largest degree of any vertex is $m$, then if $|E| \ge C…

Combinatorics · Mathematics 2023-08-21 Paige Bright , Xinyu Fang , Barrett Heritage , Alex Iosevich , Maxwell Sun

We describe some planar operads build from the higher Bruhat orders.

Combinatorics · Mathematics 2025-06-09 Gleb Koshevoy , Vadim Schechtman

A graph is called $1$-planar if it admits a drawing in the plane such that each edge is crossed at most once. Let $G$ be a bipartite 1-planar graph with $n$ ($\ge 4$) vertices and $m$ edges. Karpov showed that $m\le 3n-8$ holds for even…

Combinatorics · Mathematics 2020-07-28 Yuanqiu Huang , Zhangdong Ouyang , Fengming Dong

Graded posets frequently arise throughout combinatorics, where it is natural to try to count the number of elements of a fixed rank. These counting problems are often $\#\textbf{P}$-complete, so we consider approximation algorithms for…

Data Structures and Algorithms · Computer Science 2023-04-11 Prateek Bhakta , Ben Cousins , Matthew Fahrbach , Dana Randall

In 1920s R. L. Moore introduced \emph{upper semicontinuous} and \emph{lower semicontinuous} decompositions in studying decomposition spaces. Upper semicontinuous decompositions were studied very well by himself and later by R.H. Bing in…

Algebraic Topology · Mathematics 2020-06-23 Shoji Yokura

Motivation coming from the study of affine Weyl groups, a structure of ranked poset is defined on the set of circular permutations in $S_n$ (that is, $n$-cycles). It is isomorphic to the poset of so-called admitted vectors, and to an…

Combinatorics · Mathematics 2020-10-14 Antoine Abram , Nathan Chapelier-Laget , Christophe Reutenauer

A result of Boros and F\"uredi ($d=2$) and of B\'ar\'any (arbitrary $d$) asserts that for every $d$ there exists $c_d>0$ such that for every $n$-point set $P\subset \R^d$, some point of $\R^d$ is covered by at least $c_d{n\choose d+1}$ of…

Combinatorics · Mathematics 2016-08-14 Jiří Matoušek , Uli Wagner

This article presents unified bijective constructions for planar maps, with control on the face degrees and on the girth. Recall that the girth is the length of the smallest cycle, so that maps of girth at least $d=1,2,3$ are respectively…

Combinatorics · Mathematics 2012-06-13 Olivier Bernardi , Eric Fusy

In this note we construct a poset map from a Boolean algebra to the Bruhat order which unveils an interesting connection between subword complexes, sorting orders, and certain totally nonnegative spaces. This relationship gives a new proof…

Combinatorics · Mathematics 2010-11-05 Drew Armstrong , Patricia Hersh

The higher topological complexity of a space $X$, $\text{TC}_r(X)$, $r=2,3,\ldots$, and the topological complexity of a map $f$, $\text{TC}(f)$, have been introduced by Rudyak and Pave\v{s}i\'{c}, respectively, as natural extensions of…

Algebraic Topology · Mathematics 2023-03-24 Cesar A. Ipanaque Zapata , Jesús González

We study a configuration model on bipartite planar maps in which, given $n$ even integers, one samples a planar map with $n$ faces uniformly at random with these face degrees. We prove that when suitably rescaled, such maps always admit…

Probability · Mathematics 2022-05-12 Cyril Marzouk

There are two related poset structures, the higher Stasheff-Tamari orders, on the set of all triangulations of the cyclic $d$ polytope with $n$ vertices. In this paper it is shown that both of them have the homotopy type of a sphere of…

Combinatorics · Mathematics 2016-09-07 Paul H. Edelman , Jörg Rambau , Victor Reiner

A poset-stratified space is a pair $(S, S \xrightarrow \pi P)$ of a topological space $S$ and a continuous map $\pi: S \to P$ with a poset $P$ considered as a topological space with its associated Alexandroff topology. In this paper we show…

Algebraic Topology · Mathematics 2019-10-10 Toshihiro Yamaguchi , Shoji Yokura

B\'ar\'any's "topological Tverberg conjecture" from 1976 states that any continuous map of an $N$-simplex $\Delta_N$ to $\mathbb{R}^d$, for $N\ge(d+1)(r-1)$, maps points from $r$ disjoint faces in $\Delta_N$ to the same point in…

Combinatorics · Mathematics 2017-05-23 Pavle V. M. Blagojević , Günter M. Ziegler

We introduce bijections between families of rooted maps with unfixed genus and families of so-called blossoming trees endowed with an arbitrary forward matching of their leaves. We first focus on Eulerian maps with controlled vertex…

Combinatorics · Mathematics 2022-11-28 Éric Fusy , Emmanuel Guitter

The model theory based notion of the first order convergence unifies the notions of the left-convergence for dense structures and the Benjamini-Schramm convergence for sparse structures. It is known that every first order convergent…

Combinatorics · Mathematics 2016-08-16 Frantisek Kardos , Daniel Kral , Anita Liebenau , Lukas Mach

Let $P$ be a finite poset of width two, i.e., with no three-element antichain. We associate with $P$ a skew Young diagram $\Upsilon(P)$ and discuss some of the properties of the map $\Upsilon$. In particular, if we regard $\Upsilon(P)$ as a…

Combinatorics · Mathematics 2023-05-05 Richard P. Stanley