English
Related papers

Related papers: Refined restricted inversion sequences

200 papers

We investigate Mahonian and Eulerian probability distributions given by inversions and descents in general finite Coxeter groups. We provide uniform formulas for the means and variances in terms of Coxeter group data in both cases. We also…

Combinatorics · Mathematics 2019-08-23 Thomas Kahle , Christian Stump

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

We provide asymptotic theory for the joint distribution of $X_{\mathrm{inv}}$ and $X_{\mathrm{des}}$, the numbers of inversions and descents of random permutations. Recently, D\"orr & Kahle (2022) proved that $X_{\mathrm{inv}}$,…

Probability · Mathematics 2024-08-27 Philip Dörr , Johannes Heiny

The number of sequences of odd length in strict partitions (denoted as $\mathrm{sol}$), which plays a pivotal role in the first paper of this series, is investigated in different contexts, both new and old. Namely, we first note a direct…

Combinatorics · Mathematics 2024-10-23 Shishuo Fu , Haijun Li

In 2000 Babson and Steingr{\'\i}msson introduced the notion of vincular patterns in permutations. They shown that essentially all well-known Mahonian permutation statistics can be written as combinations of such patterns. Also, they proved…

Combinatorics · Mathematics 2012-03-20 Vincent Vajnovszki

Vincular and covincular patterns are generalizations of classical patterns allowing restrictions on the indices and values of the occurrences in a permutation. In this paper we study the integer sequences arising as the enumerations of…

Combinatorics · Mathematics 2017-06-12 Christian Bean , Anders Claesson , Henning Ulfarsson

We present a bijection between 321- and 132-avoiding permutations that preserves the number of fixed points and the number of excedances. This gives a simple combinatorial proof of recent results of Robertson, Saracino and Zeilberger, and…

Combinatorics · Mathematics 2007-05-23 Sergi Elizalde , Igor Pak

The randomized Gauss--Seidel method and its extension have attracted much attention recently and their convergence rates have been considered extensively. However, the convergence rates are usually determined by upper bounds, which cannot…

Numerical Analysis · Mathematics 2021-05-25 Yanjun Zhang , Hanyu Li

In this paper we prove the equidistribution of bounded sequences of special subvarieties in a general mixed Shimura varieties, a notion adapted from the pure case treated by Clozel, Ullmo, and Yafaev in the study of the Andre-Oort…

Number Theory · Mathematics 2015-03-26 Ke Chen

The study of pattern avoidance in permutations, and specifically in flattened partitions is an active area of current research. In this paper, we count the number of distinct flattened partitions over [n] avoiding a single pattern, as well…

Combinatorics · Mathematics 2020-11-17 Olivia Nabawanda , Fanja Rakotondrajao

We study matrix models in the beta ensemble by building on the refined recursion relation proposed by Chekhov and Eynard. We present explicit results for the first beta-deformed corrections in the one-cut and the two-cut cases, as well as…

High Energy Physics - Theory · Physics 2014-06-12 Andrea Brini , Marcos Marino , Sebastien Stevan

Strong convergence rates for time-discrete numerical approximations of semilinear stochastic evolution equations (SEEs) with smooth and regular nonlinearities are well understood in the literature. Weak convergence rates for time-discrete…

Probability · Mathematics 2021-11-02 Arnulf Jentzen , Ryan Kurniawan

The 1987 Bourgain-Tzafriri Restricted Invertibility Theorem is one of the most celebrated theorems in analysis. At the time of their work, the authors raised the question of a possible infinite dimensional version of the theorem. In this…

Functional Analysis · Mathematics 2009-05-06 Peter G. Casazza , Goetz E. Pfander

It is a classical result that the parity-balance of the number of weak excedances of all permutations (derangements, respectively) of length $n$ is the Euler number $E_n$, alternating in sign, if $n$ is odd (even, respectively).…

Combinatorics · Mathematics 2018-02-06 Sen-Peng Eu , Tung-Shan Fu , Hsiang-Chun Hsu , Hsin-Chieh Liao

This paper formalizes a latent variable inference problem we call {\em supervised pattern discovery}, the goal of which is to find sets of observations that belong to a single ``pattern.'' We discuss two versions of the problem and prove…

Machine Learning · Statistics 2014-02-10 Jonathan H. Huggins , Cynthia Rudin

We consider the two permutation statistics which count the distinct pairs obtained from the last two terms of occurrences of patterns t_1...t_{m-2}m(m-1) and t_1...t_{m-2}(m-1)m in a permutation, respectively. By a simple involution in…

Combinatorics · Mathematics 2007-05-23 Astrid Reifegerste

It is shown that the Truncated Euler Equations, i.e. a finite set of ordinary differential equations for the amplitude of the large-scale modes, can correctly describe the complex transitional dynamics that occur within the turbulent regime…

Chaotic Dynamics · Physics 2016-12-07 Vishwanath Shukla , Stephan Fauve , Marc Brachet

We prove new equidistribution results for Galois orbits of Heegner points with respect to reduction maps at inert primes. The arguments are based on two different techniques: primitive representations of integers by quadratic forms and…

Number Theory · Mathematics 2011-04-19 Dimitar Jetchev , Ben Kane

This paper develops techniques to study the number of descents in random permutations via martingales. We relax an assumption in the Berry-Esseen theorem of Bolthausen (1982) to extend the theorem's scope to martingale differences of…

Probability · Mathematics 2021-03-16 Alperen Y. Özdemir

Corner trees, introduced in "Even-Zohar and Leng, 2021, Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms", allow for the efficient counting of certain permutation patterns. Here we identify corner trees as a subset of…

Combinatorics · Mathematics 2025-05-12 Joscha Diehl , Emanuele Verri