Search arXivSearch

arXiv · 2609.15665

Algebraic Structures on Sets of Partitions

Abstract

Motivated by Robert Schneider's trailblazing work toward developing a unifying algebraic theory of integer partitions, we explore various binary operations on partitions to identify algebraic structures on sets of partitions. In particular, we discover that several sets of restricted partitions form abelian groups under reduced versions of concatenation, component-wise addition, and component-wise multiplication. One type of restricted partition from a group structure also enjoys a bijection with ordinary partitions of any given size. We extend two partition groups to vector spaces over the finite field $\mathbb{Z}_p$, where $p$ is a prime. We further discover that partitions are equipped with a commutative ring structure. Finally, we consider subgroups, subspaces, and ideals of our algebraic partition structures to investigate properties of related types of restricted partitions. The new examples of algebraic structures described in this paper open the door to partition analysis via algebraic tools, decompositions, extensions, and geometry.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Madeline L. Dawsey, Megan du Preez, Rachel Van Surksum. 2026-09-14. Algebraic Structures on Sets of Partitions. https://arxiv.org/abs/2609.15665

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

KEEP EXPLORING

Related papers

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

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