English
Related papers

Related papers: Schur-Concavity for Avoidance of Increasing Subseq…

200 papers

Wall's theorem on arithmetic progressions says that if $0.a_1a_2a_3\dots$ is normal, then for any $k,\ell\in \mathbb{N}$, $0.a_ka_{k+\ell}a_{k+2\ell}\dots$ is also normal. We examine a converse statement and show that if…

Number Theory · Mathematics 2019-08-14 Joseph Vandehey

In this article, we study the notion of central extension of Leibniz $n$-algebras relative to $n$-Lie algebras to study properties of Schur $\mathsf{Lie}$-multiplier and $\mathsf{Lie}$-covers on Leibniz $n$-algebras. We provide a…

Rings and Algebras · Mathematics 2020-04-29 Hesam Safa , Guy R. Biyogmam

We introduce a new family $\mathcal{A}_{n,k}$ of Schur positive symmetric functions, which are defined as sums over totally symmetric plane partitions. In the first part, we show that, for $k=1$, this family is equal to a multivariate…

Combinatorics · Mathematics 2022-02-01 Florian Aigner , Ilse Fischer

Let $\lambda$, $\mu$, $\lambda'$, $\mu'$ be partitions. The conjecture of Lam, Postnikov and Pylyavskyy states that, if $\lambda+\mu = \lambda' + \mu'$, and $\min(\lambda_i-\lambda_j, \mu_i-\mu_j) \leq \lambda'_i - \lambda'_j \leq…

Combinatorics · Mathematics 2026-05-01 David E Speyer

Let $\alpha(n)$ denote the number of perfect square permutations in the symmetric group $S_n$. The conjecture $\alpha(2n+1) = (2n+1) \alpha(2n)$, provided by Stanley[4], was proved by Blum[1] using a generating function. This paper presents…

Combinatorics · Mathematics 2024-07-11 Yuewen Luo

We establish a bijective correspondence between certain non-self-intersecting curves in an $n$-punctured disc and positive ${\mathbf c}$-vectors of acyclic cluster algebras whose quivers have multiple arrows between every pair of vertices.…

Combinatorics · Mathematics 2019-10-25 Anna Felikson , Pavel Tumarkin

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

The Schur index of a $4$ dimensional $\mathcal{N}=2$ superconformal field theory counts (with sign) bosonic and fermionic states that preserve $4$ supercharges. We consider the Schur indices of $4$d $\mathcal{N}=4$ super Yang-Mills and…

High Energy Physics - Theory · Physics 2023-03-22 Giorgos Eleftheriou

We show that for every positive integer $k$ there are positive constants $C$ and $c$ such that if $A$ is a subset of $\{1, 2, \dots, n\}$ of size at least $C n^{1/k}$, then, for some $d \leq k-1$, the set of subset sums of $A$ contains a…

Combinatorics · Mathematics 2023-11-03 David Conlon , Jacob Fox , Huy Tuan Pham

Inspired by work of McKay, Morse, and Wilf, we give an exact count of the involutions in S_n which contain a given permutation \tau in S_k as a subsequence; this number depends on the patterns of the first j values of \tau for 1<=j<=k. We…

Combinatorics · Mathematics 2007-05-23 Aaron D. Jaggard

It is known that the number of permutations in the symmetric group $S_{2n}$ with cycles of odd lengths only is equal to the number of permutations with cycles of even lengths only. We prove a refinement of this equality, involving descent…

Combinatorics · Mathematics 2025-02-07 Ron M. Adin , Pál Hegedűs , Yuval Roichman

We show that for any set $A \subset \mathbb{N}$ with positive upper density and any $\ell,m \in \mathbb{N}$, there exist an infinite set $B\subset \mathbb{N}$ and some $t\in \mathbb{N}$ so that $\{mb_1 + \ell b_2 \colon b_1,b_2\in B\…

Dynamical Systems · Mathematics 2026-01-21 Ioannis Kousek

We enumerate permutations that avoid all but one of the $k$ patterns of length $k$ starting with a monotone increasing subsequence of length $k-1$. We compare the size of such permutation classes to the size of the class of permutations…

Combinatorics · Mathematics 2022-08-23 Miklós Bóna , Jay Pantone

We introduce a sorting machine consisting of $k+1$ stacks in series: the first $k$ stacks can only contain elements in decreasing order from top to bottom, while the last one has the opposite restriction. This device generalizes \cite{SM},…

Data Structures and Algorithms · Computer Science 2019-10-10 Giulio Cerbai , Lapo Cioni , Luca Ferrari

A permutation $\pi \in S_n$ is said to {\it avoid} a permutation $\sigma \in S_k$ whenever $\pi$ contains no subsequence with all of the same pairwise comparisons as $\sigma$. For any set $R$ of permutations, we write $S_n(R)$ to denote the…

Combinatorics · Mathematics 2007-05-23 Eric S. Egge , Toufik Mansour

In this paper we show that, if an increasing sequence $\Lambda=(\lambda_k)_{k\in\mathbb{Z}}$ has gaps going to infinity $\lambda_{k+1}-\lambda_k\to +\infty$ when $k\to\pm\infty$, then for every $T>0$ and every sequence…

Classical Analysis and ODEs · Mathematics 2024-09-12 Philippe Jaming , Karim Kellay , Chadi Saba , Yunlei Wang

The question of classifying when two skew Schur functions are equal is a substantial open problem, which remains unsolved for over a century. In 2022, Aliniaeifard, Li and van Willigenburg introduced skew Schur functions in noncommuting…

Combinatorics · Mathematics 2025-02-05 Emma Yu Jin , Stephanie van Willigenburg

Let $\mathcal{SS}_k(n)$ be the family of {\it shuffle squares} in $[k]^{2n}$, words that can be partitioned into two disjoint identical subsequences. Let $\mathcal{RSS}_k(n)$ be the family of {\it reverse shuffle squares} in $[k]^{2n}$,…

Combinatorics · Mathematics 2023-11-21 Xiaoyu He , Emily Huang , Ihyun Nam , Rishubh Thaper

A sequence of positive integers $(a_1,a_2,\ldots,a_k)$ is called $\ell$-additive if $a_1+a_2+\cdots+a_k=\ell a_1$ or $\ell a_k$. In this paper, we prove that for all $k\geq3$, if $n$ is sufficiently large, then every permutation of…

Combinatorics · Mathematics 2026-05-29 Collier Gaiser , Paul Horn

For permutations x and w, let mu(x,w) be the coefficient of highest possible degree in the Kazhdan-Lusztig polynomial P_{x,w}. It is well-known that the coefficients mu(x,w) arise as the edge labels of certain graphs encoding the…

Combinatorics · Mathematics 2007-05-23 Timothy J. McLarnan , Gregory S. Warrington
‹ Prev 1 3 4 5 6 7 10 Next ›