English
Related papers

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

200 papers

We unify and extend previous bijections on plane quadrangulations to bipartite and quasibipartite plane maps. Starting from a bipartite plane map with a distinguished edge and two distinguished corners (in the same face or in two different…

Combinatorics · Mathematics 2018-12-21 Jérémie Bettinelli

Optimal higher-order Sobolev type embeddings are shown to follow via isoperimetric inequalities. This establishes a higher-order analogue of a well-known link between first-order Sobolev embeddings and isoperimetric inequalities. Sobolev…

Functional Analysis · Mathematics 2013-11-04 Andrea Cianchi , Luboš Pick , Lenka Slavíková

Inspired by a width invariant defined on permutations by Guillemot and Marx [SODA '14], we introduce the notion of twin-width on graphs and on matrices. Proper minor-closed classes, bounded rank-width graphs, map graphs, $K_t$-free unit…

Data Structures and Algorithms · Computer Science 2021-10-26 Édouard Bonnet , Eun Jung Kim , Stéphan Thomassé , Rémi Watrigant

Let $k$ be a perfect field. Assume that the characteristic of $k$ satisfies certain tameness assumptions \eqref{tameness}. Let $\mathcal O_{_n} := k\llbracket z_{_1}, \ldots, z_{_n}\rrbracket$ and set $K_{_n} := \text{Fract}~\cO_{_n}$. Let…

Algebraic Geometry · Mathematics 2026-05-27 Vikraman Balaji , Yashonidhi Pandey

Bj\"orner-Ekedahl prove that general intervals $[e,w]$ in Bruhat order are "top-heavy", with at least as many elements in the $i$-th corank as the $i$-th rank. Well-known results of Carrell and of Lakshmibai-Sandhya give the equality case:…

Combinatorics · Mathematics 2020-12-15 Christian Gaetz , Yibo Gao

The poset of maximal tubings of a graph generalizes several well-known and remarkable partial orders. Notable examples include the weak Bruhat order and the Tamari lattice, posets of maximal tubings for the complete graph and the path…

We present a sharp extension of a result of Bourgain on finding configurations of $k+1$ points in general position in measurable subset of $\mathbb{R}^d$ of positive upper density whenever $d\geq k+1$ to all proper $k$-degenerate distance…

Classical Analysis and ODEs · Mathematics 2020-04-22 Neil Lyall , Akos Magyar

We study conformal mappings in the Grushin plane and provide a number of their characterizations in terms of the Sobolev mappings and their geometry. Furthermore, we connect conformality on the Grushin plane with conformality on the complex…

Complex Variables · Mathematics 2024-05-28 Marcin Walicki

We show that plane bipolar posets (i.e., plane bipolar orientations with no transitive edge) and transversal structures can be set in correspondence to certain (weighted) models of quadrant walks, via suitable specializations of a bijection…

Combinatorics · Mathematics 2023-10-03 Éric Fusy , Erkan Narmanli , Gilles Schaeffer

One of possible cryptomorphic definitions of a partially ordered set (= a poset) $P$ on a non-empty finite basic set $N$ is in terms of the set ${\cal L}(P)$ of all its linear extensions, that is, in terms of the set of total orders of $N$…

Combinatorics · Mathematics 2025-11-25 Milan Studený , Václav Kratochvíl

In this manuscript we show that two partial orders defined on the set of standard Young tableaux of shape $\alpha$ are equivalent. In fact, we give two proofs for the equivalence of the box order and the dominance order for {tableaux}. Both…

Representation Theory · Mathematics 2025-10-01 Justyna Kosakowska , Markus Schmidmeier , Hugh Thomas

If $C_n(\mathbb{R}^d)$ denotes the configuration space of $n$ distinct points in $\mathbb{R}^d$, we construct a sequence of maps $(f_m),$ $m \geq 1$, where \[f_m: C_n(\mathbb{R}^d) \times \mathbb{R}^d \to \mathbb{R}^d\] is real analytic,…

Metric Geometry · Mathematics 2020-07-09 Joseph Malkoun

Rotary maps (orientably regular maps) are highly symmetric graph embeddings on orientable surfaces. This paper classifies all rotary maps whose underlying graphs are Praeger-Xu graphs, denoted $\operatorname{C}(p,r,s)$, for any odd prime…

Combinatorics · Mathematics 2025-07-03 Zhaochen Ding , Zheng Guo , Luyi Liu

Let $B(H)$ be the algebra of all bounded linear operators on an infinite-dimensional complex Hilbert space $H$. For $T \in B(H)$ and $\lambda \in \mathbb{C}$, let $H_{T}(\{\lambda\})$ denotes the local spectral subspace of $T$ associated…

Functional Analysis · Mathematics 2022-07-20 Rohollah Parvinianzadeh

Picture-valued invariants are the main achievement of parity theory by V.O. Manturov. In the paper we give a general description of such invariants which can be assigned to a parity (in general, a trait) on diagram crossings. We distinguish…

Geometric Topology · Mathematics 2023-02-01 Igor Nikonov

A combinatorial neural code $\mathscr C\subseteq 2^{[n]}$ is convex if it arises as the intersection pattern of convex open subsets of $\mathbb R^d$. We relate the emerging theory of convex neural codes to the established theory of oriented…

Combinatorics · Mathematics 2026-03-12 Alexander Kunin , Caitlin Lienkaemper , Zvi Rosen

Let $S^r(n)$ be the $r$-graph on $n$ vertices with parts $A$ and $B$, where the edges consist of all $r$-tuples with $1$ vertex in $A$ and $r-1$ vertices in $B$, and the sizes of $A$ and $B$ are chosen to maximise the number of edges. Let…

Combinatorics · Mathematics 2017-02-03 Biao Wu , Yuejian Peng , Pingge Chen

In this paper we continue investigations that we began in our previous works, where we proved, that the phase diagram of Toda system on special linear groups can be identified with the Bruhat order on symmetric group, when all the…

Exactly Solvable and Integrable Systems · Physics 2015-12-21 Yu. B. Chernyakov , G. I Sharygin , A. S. Sorin

Many (if not most) of convex polytopes, important for combinatorial and algebraic geometry, are closely related to secondary polytopes of point configurations, or base polytopes of submodular functions, or their numerous variations and…

Combinatorics · Mathematics 2024-11-05 Alexander Esterov , Arina Voorhaar

Let (W, S) be a Coxeter system. We investigate combinatorially certain partial orders, called extended Bruhat orders, on a (W x W)-set W(N,C), which depends on W, a subset N of S, and a component C of N. We determine the length of the…

Combinatorics · Mathematics 2007-05-23 Claus Mokler