English
Related papers

Related papers: A probabilistic bijection between twenty-vertex co…

200 papers

A discrete Gelfand-Tsetlin pattern is a configuration of particles in Z^2. The particles are arranged in a finite number of consecutive rows, numbered from the bottom. There is one particle on the first row, two particles on the second row,…

Probability · Mathematics 2015-07-24 Erik Duse , Anthony Metcalfe

We shall present a ``linear algebraic'' proof (involving some calculations in the algebra of linear operators on a vector space of polynomials and some manipulations of determinants) of the formula for the enumeration of symmetric…

Combinatorics · Mathematics 2020-01-01 Markus Fulmek

Extending the notion of pattern avoidance in permutations, we study matchings and set partitions whose arc diagram representation avoids a given configuration of three arcs. These configurations, which generalize 3-crossings and 3-nestings,…

Combinatorics · Mathematics 2012-11-16 Jonathan Bloom , Sergi Elizalde

Arrowed Gelfand-Tsetlin patterns have recently been introduced to study alternating sign matrices. In this paper, we show that a $(-1)$-enumeration of arrowed Gelfand-Tsetlin patterns can be expressed by a simple product formula. The…

Combinatorics · Mathematics 2024-04-09 Ilse Fischer , Florian Schreier-Aigner

By rewriting the famous hook-content formula it easily follows that there are $\prod\limits_{1 \le i < j \le n} \frac{k_j - k_i + j -i}{j-i}$ semistandard tableaux of shape $(k_n,k_{n-1},...,k_1)$ with entries in $\{1,2,...,n\}$ or,…

Combinatorics · Mathematics 2011-04-05 Ilse Fischer

A Gelfand-Tsetlin scheme of depth N is a triangular array with m integers at level m, m=1,...,N, subject to certain interlacing constraints. We study the ensemble of uniformly random Gelfand-Tsetlin schemes with arbitrary fixed N-th row. We…

Probability · Mathematics 2013-05-29 Leonid Petrov

We describe a combinatorial approach for investigating properties of rational numbers. The overall approach rests on structural bijections between rational numbers and familiar combinatorial objects, namely rooted trees. We emphasize that…

Combinatorics · Mathematics 2012-01-13 Edinah K. Gnang , Chetan Tonde

We show that the number of configurations of the 20 Vertex model on certain domains with domain wall type boundary conditions is equal to the number of domino tilings of Aztec-like triangles, proving a conjecture from [P. Di Francesco and…

Combinatorics · Mathematics 2021-02-08 Philippe Di Francesco

We construct a bijection between $321$- and $213$-avoiding permutations that preserves the property of $t$-stack-sortability. Our bijection transforms natural statistics between these two classes of permutations and proves a refinement of…

Combinatorics · Mathematics 2025-07-15 Yang Li , Sergey Kitaev , Zhicong Lin , Jing Liu

Valid hook configurations are combinatorial objects used to understand West's stack-sorting map. We extend existing bijections corresponding valid hook configurations to intervals in partial orders on Motzkin paths. To enumerate valid hook…

Combinatorics · Mathematics 2019-10-22 Maya Sankar

We present bijections between four classes of combinatorial objects. Two of them, the class of unlabeled (2+2)-free posets and a certain class of involutions (or chord diagrams), already appeared in the literature, but were apparently not…

Combinatorics · Mathematics 2025-09-26 Mireille Bousquet-Mélou , Anders Claesson , Mark Dukes , Sergey Kitaev

This paper considers the enumeration of ternary trees (i.e. rooted ordered trees in which each vertex has 0 or 3 children) avoiding a contiguous ternary tree pattern. We begin by finding recurrence relations for several simple tree…

Combinatorics · Mathematics 2011-12-30 Nathan Gabriel , Katherine Peske , Lara Pudwell , Samuel Tay

The subject of pattern avoiding permutations has its roots in computer science, namely in the problem of sorting a permutation through a stack. A formula for the number of permutations of length n that can be sorted by passing it twice…

Combinatorics · Mathematics 2010-03-26 Anders Claesson , Sergey Kitaev , Einar Steingrimsson

The number of inversion sequences avoiding two patterns $101$ and $102$ is known to be the same as the number of permutations avoiding three patterns $2341$, $2431$, and $3241$. This sequence also counts the number of Schr\"{o}der paths…

Combinatorics · Mathematics 2024-04-08 JiSun Huh , Sangwook Kim , Seunghyun Seo , Heesung Shin

Bordered and framed Toeplitz/Hankel determinants have the same structure as Toeplitz/Hankel determinants except in small number of matrix rows and/or columns. We review these structured determinants and their connections to orthogonal…

Classical Analysis and ODEs · Mathematics 2024-06-10 Roozbeh Gharakhloo , Karl Liechty

A floorplan is a tiling of a rectangle by rectangles. There are natural ways to order the elements---rectangles and segments---of a floorplan. Ackerman, Barequet and Pinter studied a pair of orders induced by neighborhood relations between…

Combinatorics · Mathematics 2025-04-11 Andrei Asinowski , Gill Barequet , Mireille Bousquet-Mélou , Toufik Mansour , Ron Pinter

A skew shape is the difference of two top-left justified Ferrers shapes sharing the same top-left corner. We study integer fillings of skew shapes. As our first main result, we show that for a specific hereditary class of skew shapes, which…

Combinatorics · Mathematics 2023-06-22 Vít Jelínek , Mark Karpilovskij

Hetyei introduced in 2019 the homogenized Linial arrangement and showed that its regions are counted by the median Genocchi numbers. In the course of devising a different proof of Hetyei's result, Lazar and Wachs considered another…

Combinatorics · Mathematics 2025-10-16 Quan Yuan , Qi Fang , Shishuo Fu , Haijun Li

This paper presents a bijection between ascent sequences and upper triangular matrices whose non-negative entries are such that all rows and columns contain at least one non-zero entry. We show the equivalence of several natural statistics…

Combinatorics · Mathematics 2009-09-21 Mark Dukes , Robert Parviainen

Set partitions avoiding $k$-crossing and $k$-nesting have been extensively studied from the aspects of both combinatorics and mathematical biology. By using the generating tree technique, the obstinate kernel method and Zeilberger's…

Combinatorics · Mathematics 2017-07-11 Sherry H. F. Yan
‹ Prev 1 2 3 10 Next ›