Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2606.13274

Monotonicity of the rank functions for concave compositions

Nian Hong Zhou
View original source ↗Read source document ↗Export metadata ↓

Abstract

A (strongly) concave composition of an integer $n$ is a sequence of positive integers that is (strictly) decreasing to a point and then (strictly) increasing thereafter, such that the sum of the entries equals $n$. The value at the low point is called the center part. The difference between the number of entries before and after the low point of the sequence is referred to as the rank of the (strongly) concave composition. The rank functions $V_d(m,n)$ and $V(m,n)$ are defined as the number of concave compositions and strongly concave compositions, respectively, of $n$ with rank $m$. By constructing the difference systems that characterize the rank generating functions, we establish monotonicity properties for the rank functions of both strongly concave compositions and concave compositions for all positive integers $n$. Moreover, we also study the monotonicity properties for the rank functions of (strongly) concave compositions with fixed center parts.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nian Hong Zhou. 2026-06-11. Monotonicity of the rank functions for concave compositions. https://arxiv.org/abs/2606.13274

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗