English
Related papers

Related papers: Lenart's bijection via bumpless pipe dreams

200 papers

Plane increasing trees are rooted labeled trees embedded into the plane such that the sequence of labels is increasing on any branch starting at the root. Relaxed binary trees are a subclass of unlabeled directed acyclic graphs. We…

Combinatorics · Mathematics 2018-07-12 Michael Wallner

We answer four questions from a recent paper of Rao and Shinkar on Lipschitz bijections between functions from $\{0,1\}^n$ to $\{0,1\}$. (1) We show that there is no $O(1)$-bi-Lipschitz bijection from $\mathrm{Dictator}$ to $\mathrm{XOR}$…

Combinatorics · Mathematics 2021-12-13 Tom Johnston , Alex Scott

Advancing the sparse regularity method, we prove one-sided and two-sided regularity inheritance lemmas for subgraphs of bijumbled graphs, improving on results of Conlon, Fox and Zhao [Adv. Math. 256 (2014), 206--290]. These inheritance…

Combinatorics · Mathematics 2019-02-08 Peter Allen , Julia Böttcher , Jozef Skokan , Maya Stein

Let $n$ be a positive integer and $H$ a Hilbert space. The description of the general form of bijective maps on the set of $n$-dimensional subspaces of $H$ preserving the maximal principal angle has been obtained recently. This is a…

Functional Analysis · Mathematics 2023-06-21 Peter Semrl

We give a bijective proof of Macdonald's reduced word identity using pipe dreams and Little's bumping algorithm. This proof extends to a principal specialization due to Fomin and Stanley. Such a proof has been sought for over 20 years. Our…

Combinatorics · Mathematics 2017-02-10 Sara C. Billey , Alexander E. Holroyd , Benjamin Young

In this paper first we give a partial answer to a question of L. Moln\'ar and W. Timmermann. Namely, we will describe those linear (not necessarily bijective) transformations on the set of self-adjoint matrices which preserve a unitarily…

Functional Analysis · Mathematics 2015-07-13 György Pál Gehér , Gergő Nagy

Learning vectorized embeddings is fundamental to many recommender systems for user-item matching. To enable efficient online inference, representation binarization, which embeds latent features into compact binary sequences, has recently…

Information Retrieval · Computer Science 2025-06-04 Yankai Chen , Yue Que , Xinni Zhang , Chen Ma , Irwin King

Let $M$ be a holomorphically symplectic complex manifold, not necessarily compact or quasiprojective, and $X \subset M$ a compact Lagrangian submanifold. We construct a deformation to the normal cone, showing that a neighbourhood of $X$ can…

Algebraic Geometry · Mathematics 2024-05-24 Ekaterina Amerik , Misha Verbitsky

Working over a field of characteristic other than $2$, we examine a relationship between quadrilaterals and the pencil of conics passing through their vertices. Asymptotically, such a pencil of conics is what we call a bisector field, a set…

Combinatorics · Mathematics 2023-05-22 Bruce Olberding , Elaine A. Walker

Alternating sign matrices and totally symmetric self-complementary plane partitions are equinumerous sets of objects for which no explicit bijection is known. In this paper, we identify a subset of totally symmetric self-complementary plane…

Combinatorics · Mathematics 2019-05-22 Jessica Striker

The purpose of this note is to attract attention to the following conjecture (metastable $r$-fold Whitney trick) by clarifying its status as not having a complete proof, in the sense described in the paper. Assume that…

Geometric Topology · Mathematics 2017-02-15 A. Skopenkov

We define bidual bounded $uo$-convergence in vector lattices and investigate relations between this convergence and $b$-property. We prove that for a regular Riesz dual system $\langle X,X^{\sim}\rangle$, $X$ has $b$-property if and only if…

Functional Analysis · Mathematics 2020-09-17 Safak Alpay , Eduard Emelyanov , Svetlana Gorokhova

A sub-problem of the open problem of finding an explicit bijection between alternating sign matrices and totally symmetric self-complementary plane partitions consists in finding an explicit bijection between so-called $(n,k)$ Gog…

Combinatorics · Mathematics 2016-04-12 Jérémie Bettinelli

Let $G = (V,E)$ be a simple finite graph. The corresponding bunkbed graph $G^\pm$ consists of two copies $G^+ = (V^+,E^+),G^- = (V^-,E^-)$ of $G$ and additional edges connecting any two vertices $v_+ \in V_+,v_- \in V_-$ that are the copies…

Probability · Mathematics 2025-03-25 Thomas Richthammer

In 2019, P. Higgins formulated [1] a question about bipartite graphs (see Conjecture 1 below); this question arises in the study of regular finite semigroups. F. V. Petrov formulated [2] another combinatorial conjecture (Conjecture 3);…

Combinatorics · Mathematics 2026-03-20 Ilya I. Bogdanov , Fedor Petrov , Anton Sadovnichiy , Fedor Ushakov

We investigate the problem of constructing planar drawings with few bends for two related problems, the partially embedded graph problem---to extend a straight-line planar drawing of a subgraph to a planar drawing of the whole graph---and…

Computational Geometry · Computer Science 2014-10-31 Timothy M. Chan , Fabrizio Frati , Carsten Gutwenger , Anna Lubiw , Petra Mutzel , Marcus Schaefer

Phylogenetic trees are binary nonplanar trees with labelled leaves, and plane oriented recursive trees are planar trees with an increasing labelling. Both families are enumerated by double factorials. A bijection is constructed, using the…

Combinatorics · Mathematics 2017-09-19 Helmut Prodinger

Let $X$ be a closed semialgebraic set of dimension $k.$ If $n\ge 2k+1$, then there is a bi-Lipschitz and semialgebraic embedding of $X$ into $\Bbb R^n.$ Moreover, if $n \ge 2k+2$, then this embedding is unique (up to a bi-Lipschitz and…

Geometric Topology · Mathematics 2020-01-06 Lev Birbrair , Alexandre Fernandes , Zbigniew Jelonek

We define bileptons to be bosons coupling to a pair of leptons and construct the most general dimension four lagrangian involving scalar and vector bileptons. We concentrate on fields with lepton number 2, and derive model independent…

High Energy Physics - Phenomenology · Physics 2011-09-13 Frank Cuypers , Sacha Davidson

We construct a bijection from permutations to some weighted Motzkin paths known as Laguerre histories. As one application of our bijection, a neat $q$-$\gamma$-positivity expansion of the $(\inv,\exc)$-$q$-Eulerian polynomials is obtained.

Combinatorics · Mathematics 2019-02-06 Sherry H. F. Yan , Hao Zhou , Zhicong Lin