中文
相关论文

相关论文: A generalization of Bressoud's beautiful bijection

200 篇论文

We consider combinatorial maps with fixed combinatorial knot numbered with augmenting numeration called normalized knot. We show that knot's normalization doesn't affect combinatorial map what concerns its generality. Knot's normalization…

组合数学 · 数学 2010-10-14 Dainis Zeps

Taking transposes of Standard Young Tableaux defines a natural involution on the set $I(n)$ of involutions of length $n$ via the the Robinson-Schensted correspondence. In some cases, this involution can be defined without resorting to the…

组合数学 · 数学 2019-04-05 Miklos Bona , Rebecca Smith

We present combinatorial bijections and identities between certain skew Young tableaux, Dyck paths, triangulations, and dissections.

组合数学 · 数学 2022-09-20 Su Ji Hong , George D. Nasr

In this series of articles we study connections between combinatorics of multidimensional generalizations of Cauchy identity and continuous objects such as multidimensional Brownian motions and Brownian bridges. In Part I of the series we…

组合数学 · 数学 2007-05-23 Piotr Sniady

We show that there is a reflection type bijection between the indecomposable summands of two multiplicity free tilting modules $X$ and $Y$. This bijection fixes the common indecomposable summands of $X$ and $Y$ and sends indecomposable…

表示论 · 数学 2021-06-24 Gabriella D'Este , H. Melis Tekin Akcin

We present several direct bijections between different combinatorial interpretations of the Littlewood-Richardson coefficients. The bijections are defined by explicit linear maps which have other applications.

组合数学 · 数学 2007-05-23 Igor Pak , Ernesto Vallejo

The enumeration of maps and the study of uniform random maps have been classical topics of combinatorics and statistical physics ever since the seminal work of Tutte in the sixties. Following the bijective approach initiated by Cori and…

组合数学 · 数学 2010-06-29 Guillaume Chapuy , Michel Marcus , Gilles Schaeffer

We construct a direct natural bijection between descending plane partitions without any special part and permutations. The directness is in the sense that the bijection avoids any reference to nonintersecting lattice paths. The advantage of…

组合数学 · 数学 2020-06-16 Arvind Ayyer

Combinatorial number system represents a non-negative natural numbers as sum of binomial coefficients. This paper presents an induction proof that there exists unique representation of every non-negative natural number $m$ as sum of $r$…

组合数学 · 数学 2016-01-25 Abu Bakar Siddique , Saadia Farid , Muhammad Tahir

We consider two orthogonal points of view on finite permutations, seen as pairs of linear orders (corresponding to the usual one line representation of permutations as words) or seen as bijections (corresponding to the algebraic point of…

组合数学 · 数学 2019-09-20 Michael Albert , Mathilde Bouvel , Valentin Féray

In this paper we give a bijective proof for a relation between uni- bi- and tricellular maps of certain topological genus. While this relation can formally be obtained using Matrix-theory as a result of the Schwinger-Dyson equation, we here…

组合数学 · 数学 2019-08-13 Hillary S. W. Han , Christian M. Reidys

Let $G$ be a connected finite graph. Backman, Baker, and Yuen have constructed a family of explicit and easy-to-describe bijections $g_{\sigma,\sigma^*}$ between spanning trees of $G$ and $(\sigma,\sigma^*)$-compatible orientations, where…

组合数学 · 数学 2023-06-14 Changxin Ding

Given a combinatorial structure, a ``twin'' is a pair of disjoint substructures which are isomorphic (or look the same in some sense). In recent years, there have been many problems about finding large twins in various combinatorial…

组合数学 · 数学 2023-02-28 Zach Hunter

We extend Schaeffer's bijection between rooted quadrangulations and well-labeled trees to the general case of Eulerian planar maps with prescribed face valences, to obtain a bijection with a new class of labeled trees, which we call…

组合数学 · 数学 2007-05-23 J. Bouttier , P. Di Francesco , E. Guitter

Edelman and Greene constructed a correspondence between reduced words of the reverse permutation and standard Young tableaux. We prove that for any reduced word the shape of the region of the insertion tableau containing the smallest…

组合数学 · 数学 2019-01-08 Svante Linusson , Samu Potka

In this paper, we extend the recently introduced concept of partially dual ribbon graphs to graphs. We then go on to characterize partial duality of graphs in terms of bijections between edge sets of corresponding graphs. This result…

组合数学 · 数学 2012-03-01 Iain Moffatt

We start from a parametrized system of $d$ generalized polynomial equations (with real exponents) for $d$ positive variables, involving $n$ generalized monomials with $n$ positive parameters. Existence and uniqueness of a solution for all…

代数几何 · 数学 2019-05-08 Stefan Müller , Josef Hofbauer , Georg Regensburger

We study the combinatorial equivalence of separable elements in types $A$ and $B$. A bijection is constructed from the set of separable permutations in the symmetric group $S_{n+1}$ to the set of separable signed permutations in the…

组合数学 · 数学 2025-10-15 Yong Liao , Yuping Yang , Houyi Yu

Conjugation, or Legendre transformation, is a basic tool in convex analysis, rational mechanics, economics and optimization. It maps a function on a linear topological space into another one, defined in the dual of the linear space by…

泛函分析 · 数学 2008-02-18 M. Marques Alves , B. F. Svaiter

Everyone knows that if you have a bivariant homology theory satisfying a base change formula, you get an representation of a category of correspondences. For theories in which the covariant and contravariant transfer maps are in mutual…

范畴论 · 数学 2022-12-21 Andrew W. Macpherson