中文
相关论文

相关论文: Unimodality of the Rank on Strongly Unimodal Seque…

200 篇论文

Let $N(m,n)$ denote the number of partitions of $n$ with rank $m$, and let $M(m,n)$ denote the number of partitions of $n$ with crank $m$. Chan and Mao proved that for any nonnegative integers $m$ and $n$, $N(m,n)\geq N(m+2,n)$ and for any…

组合数学 · 数学 2018-11-27 Wenston J. T. Zang , Helen W. J. Zhang

Let $Q_n(z)$ be the polynomials associated with the Nekrasov-Okounkov formula $$\sum_{n\geq 1} Q_n(z) q^n := \prod_{m = 1}^\infty (1 - q^m)^{-z - 1}.$$ In this paper we partially answer a conjecture of Heim and Neuhauser, which asks if…

组合数学 · 数学 2021-04-07 Letong Hong , Shengtong Zhang

Let $(u_n)_{n \geq 0}$ be a non-degenerate Lucas sequence, given by the relation $u_n=a_1 u_{n-1}+a_2 u_{n-2}$. Let $\ell_u(m)=lcm(m, z_u(m))$, for $(m,a_2)=1$, where $z_u(m)$ is the rank of appearance of $m$ in $u_n$. We prove that…

数论 · 数学 2019-01-08 Daniele Mastrostefano

We analyse the logical complexity and absoluteness of natural statements about Ulam sequences, with particular emphasis on the rigidity phenomena introduced by Hinman, Kuca, Schlesinger and Sheydvasser for the family $U(1,n)$. For each pair…

逻辑 · 数学 2025-12-03 Frank Gilson

Let $A(p,n,k)$ be the number of $p$-tuples of commuting permutations of $n$ elements whose permutation action results in exactly $k$ orbits or connected components. We formulate the conjecture that, for every fixed $p$ and $n$, the…

组合数学 · 数学 2024-01-12 Abdelmalek Abdesselam

In this paper we study generating functions resembling the rank of strongly unimodal sequences. We give combinatorial interpretations, identities in terms of mock modular forms, asymptotics, and a parity result. Our functions imitate a…

数论 · 数学 2019-06-24 Kathrin Bringmann , Chris Jennings-Shaffer

We prove that $\det A\leq 6^\frac{n}{6}$ whenever $A\in\{0,1\}^{n\times n}$ contains at most $2n$ ones. We also prove an upper bound on the determinant of matrices with the $k$-consecutive ones property, a generalisation of the consecutive…

组合数学 · 数学 2017-11-29 Henning Bruhn , Dieter Rautenbach

Let alpha = (a,b,...) be a composition. Consider the associated poset F(alpha), called a fence, whose covering relations are x_1 < x_2 < ... < x_{a+1} > x_{a+2} > ... > x_{a+b+1} < x_{a+b+2} < ... . We study the associated distributive…

组合数学 · 数学 2020-09-01 Thomas McConville , Bruce E. Sagan , Clifford Smyth

We give a birational description of the reduced schemes underlying the irreducible components of the nilpotent cone and the $\CC^\times$-fixed point locus of length two in the moduli space of Higgs bundles. Using these results, we prove…

代数几何 · 数学 2026-02-03 Ana Peón-Nieto

We prove the reverse ultra log-concavity of the Boros-Moll polynomials. We further establish an inequality which implies the log-concavity of the sequence $\{i!d_i(m)\}$ for any $m\geq 2$, where $d_i(m)$ are the coefficients of the…

组合数学 · 数学 2009-04-24 William Y. C. Chen , Cindy C. Y. Gu

The main objective of this paper is to investigate the distribution of the Andrews-Garvan-Dyson crank of a partition. Let $M(m,n)$ denote the number of partitions of $n$ with the Andrews-Garvan-Dyson crank $m$, we show that the sequence…

组合数学 · 数学 2021-10-13 Kathy Q. Ji , Wenston J. T. Zang

We provide a nontrivial upper bound for the nonnegative rank of rank-three matrices, which allows us to prove that [6(n+1)/7] linear inequalities suffice to describe a convex n-gon up to a linear projection.

组合数学 · 数学 2013-03-11 Yaroslav Shitov

A sequence $\Big(u_n\Big)_{n=0}^{\infty}$ is said to be convex if it satisfies the following inequality $$ 2u_n\leq u_{n-1}+u_{n+1}\qquad \mbox{for all}\qquad n\in\mathbb{N}. $$ We present several characterizations of convex sequences and…

综合数学 · 数学 2025-05-30 Angshuman Robin Goswami

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.

组合数学 · 数学 2007-05-23 Miklós Bóna , Richard Ehrenborg

Let $\mathcal{A}=(a_n)_{n\in\mathbb{N}_+}$ be a sequence of positive integers. Let $p_\mathcal{A}(n,k)$ denote the number of multi-color partitions of $n$ into parts in $\{a_1,\ldots,a_k\}$. We examine several arithmetic properties of the…

数论 · 数学 2021-04-12 Krystian Gajdzica

Using earlier results we prove a formula for the number $W_{(n,k)}$ of 2-stack sortable permutations of length $n$ with $k$ runs, or in other words, $k-1$ descents. This formula will yield the suprising fact that there are as many 2-stack…

组合数学 · 数学 2009-09-25 Miklós Bóna

Let $A_{s,k}(m)$ be the maximum number of distinct letters in any sequence which can be partitioned into $m$ contiguous blocks of pairwise distinct letters, has at least $k$ occurrences of every letter, and has no subsequence forming an…

组合数学 · 数学 2014-09-23 Jesse Geneson

We compute an asymptotic estimate for odd balanced unimodal sequences for ranks congruent to $a \pmod{c}$ for $c\neq 1$ odd. We find the interesting result that the odd balanced unimodal sequences are asymptotically related to the…

数论 · 数学 2022-02-07 Taylor Garnowski

The rank of partitions play an important role in the combinatorial interpretations of several Ramanujan's famous congruence formulas. In 2005 and 2008, the $D$-rank and $M_2$-rank of an overpartition were introduced by Lovejoy,…

组合数学 · 数学 2019-03-06 Huan Xiong , Wenston J. T. Zang

We prove a conjecture of Morier-Genoud and Ovsienko that says that rank polynomials of the distributive lattices of lower ideals of fence posets are unimodal. We do this by introducing a related class of circular fence posets and proving a…

组合数学 · 数学 2025-04-08 Ezgi Kantarcı Oğuz , Mohan Ravichandran