English
Related papers

Related papers: Bijections for restricted inversion sequences and …

200 papers

Inspired by the definition of modified ascent sequences, we introduce a new class of integer sequences called revised ascent sequences. These sequences are defined as Cayley permutations where each entry is a leftmost occurrence if and only…

Combinatorics · Mathematics 2025-05-09 Robin D. P. Zhou

We give some results about a bijection associating each permutation with a subexcedant function. This function is related to a particular decomposition of the permutation as a product of transpositions and therefore it has been called…

Combinatorics · Mathematics 2022-08-17 Fufa Beyene , Roberto Mantaci

In this paper we study the inverse of so-called unfair permutations, and explore various properties of them. Our investigation begins with comparing this class of permutations with uniformly random permutations, and showing that they behave…

Probability · Mathematics 2018-06-01 İlker Arslan , Ümit Işlak , Cihan Pehlivan

Let $A(n,m)$ denote the Eulerian numbers, which count the number of permutations on $[n]$ with exactly $m$ descents. It is well known that $A(n,m)$ also counts the number of permutations on $[n]$ with exactly $m$ excedances. In this report,…

Combinatorics · Mathematics 2023-06-22 David Dong

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

We combinatorially prove that the number $R(n,k)$ of permutations of length $n$ having $k$ runs is a log-concave sequence in $k$, for all $n$. We also give a new combinatorial proof for the log-concavity of the Eulerian numbers.

Combinatorics · Mathematics 2007-05-23 Miklós Bóna , Richard Ehrenborg

Baxter permutations are known to be in bijection with a wide number of combinatorial objects. Previously, it was shown that each of these objects had a natural involution which was carried equivariantly by the known bijections, and the…

Combinatorics · Mathematics 2017-10-20 Kevin Dilks

In this paper we construct inverse bijections between two sequences of finite sets. One sequence is defined by planar diagrams and the other by lattice walks. G. Kuperberg has shown that the number of elements in these two sets are equal.…

Combinatorics · Mathematics 2011-04-08 Bruce W. Westbury

In a uniform random permutation \Pi of [n] := {1,2,...,n}, the set of elements k in [n-1] such that \Pi(k+1) = \Pi(k) + 1 has the same distribution as the set of fixed points of \Pi that lie in [n-1]. We give three different proofs of this…

Probability · Mathematics 2014-04-29 Persi Diaconis , Steven N. Evans , Ron Graham

In this paper using Sperner's lemma for modified partition of a simplex we will constructively prove Brouwer's fixed point theorem for sequentially locally non-constant and uniformly sequentially continuous functions.

Logic · Mathematics 2011-04-26 Yasuhito Tanaka

In this paper we introduce {\em weak ascent sequences}, a class of number sequences that properly contains ascent sequences. We show how these sequences uniquely encode each of the following objects: permutations avoiding a particular…

Combinatorics · Mathematics 2022-10-11 Beáta Bényi , Anders Claesson , Mark Dukes

We count permutations avoiding a nonconsecutive instance of a two- or three-letter pattern, that is, the pattern may occur but only as consecutive entries in the permutation. Two-letter patterns give rise to the Fibonacci numbers. The…

Combinatorics · Mathematics 2007-05-23 David Callan

In this paper, we confirm conjectures of Laborde-Zubieta on the enumeration of corners in tree-like tableaux and in symmetric tree-like tableaux. In the process, we also enumerate corners in (type $B$) permutation tableaux and (symmetric)…

Combinatorics · Mathematics 2023-06-22 Alice L. L. Gao , Emily X. L. Gao , Patxi Laborde-Zubieta , Brian Y. Sun

A symmetry of $(t,q)$-Eulerian numbers of type $B$ is combinatorially proved by defining an involution preserving many important statistics on the set of permutation tableaux of type $B$. This involution also proves a symmetry of the…

Combinatorics · Mathematics 2015-12-18 Soojin Cho , Kyoungsuk Park

In this article, we study (102,000)-avoiding inversion sequences with a fixed number of distinct elements. By introducing simple H-paths, we derive the trivariate generating function for these inversion sequences with respect to their…

Combinatorics · Mathematics 2025-11-11 Sangwook Kim , Seunghyun Seo , Heesung Shin

We prove the precise inversion of adjunction formula for quotient singularities. As an application, we prove the semi-continuity of minimal log discrepancies for hyperquotient singularities. This paper is a continuation of arXiv:2011.07300,…

Algebraic Geometry · Mathematics 2024-08-19 Yusuke Nakamura , Kohsuke Shibata

We construct a new bijection between the set of $n\times k$ $0$-$1$ matrices with no three $1$'s forming a $\Gamma$ configuration and the set of $(n,k)$-Callan sequences, a simple structure counted by poly-Bernoulli numbers. We give two…

Combinatorics · Mathematics 2019-11-28 Beáta Bényi , Gábor V. Nagy

We exhibit invariants of smooth projective algebraic varieties with integer values, whose nonvanishing modulo p prevents the existence of an action without fixed points of certain finite p-groups. The case of base fields of characteristic p…

Algebraic Geometry · Mathematics 2019-02-20 Olivier Haution

In this paper we introduce the definition of marked permutations. We first present a bijection between Stirling permutations and marked permutations. We then present an involution on Stirling derangements. Furthermore, we present a…

Combinatorics · Mathematics 2016-12-23 Guan-Huei Duh , Yen-chi Roger Lin , Shi-Mei Ma , Yeong-Nan Yeh

We prove a multiple recurrence result for arbitrary measure-preserving transformations along polynomials in two variables of the form $m+p_i(n)$, with rationally independent $p_i$'s with zero constant term. This is in contrast to the single…

Dynamical Systems · Mathematics 2019-02-20 Nikos Frantzikinakis , Pavel Zorin-Kranich
‹ Prev 1 4 5 6 7 8 10 Next ›