English
Related papers

Related papers: Counting genus one partitions and permutations

200 papers

We consider sequences of integers defined by a system of linear inequalities with integer coefficients. We show that when the constraints are strong enough to guarantee that all the entries are nonnegative, the generating function for the…

Combinatorics · Mathematics 2007-05-23 S. Corteel , C. D. Savage

We exhibit, for any positive integer parameter $s$, an involution on the set of integer partitions of $n$. These involutions show the joint symmetry of the distributions of the following two statistics. The first counts the number of parts…

Let $G$ be a cyclic $p$-group for some prime number $p>0$ and let $R$ be a complete discrete valuation ring in mixed characteristic. In this paper, we present a generalization of two results that characterize $RG$-permutation modules,…

Representation Theory · Mathematics 2025-10-29 Marlon Estanislau

In this paper we study combinatorial aspects of permutations of $\{1,\ldots,n\}$ and related topics. In particular, we prove that there is a unique permutation $\pi$ of $\{1,\ldots,n\}$ such that all the numbers $k+\pi(k)$ ($k=1,\ldots,n$)…

Combinatorics · Mathematics 2021-03-25 Zhi-Wei Sun

An asymptotic formula for the number of partitions into p-cores is derived. As a byproduct some integer valued trigonometric sums are found

Number Theory · Mathematics 2008-06-20 Gert Almkvist

We find the exponential generating function for permutations with all valleys even and all peaks odd, and use it to determine the asymptotics for its coefficients, answering a question posed by Liviu Nicolaescu. The generating function can…

Combinatorics · Mathematics 2014-08-11 Ira M. Gessel , Yan Zhuang

In this Ph.D dissertation (University of Virginia, 2022), we prove results about the coefficients of partition-theoretic generating functions and of coefficients of integer weight modular forms. Using various forms of the circle method, we…

Number Theory · Mathematics 2023-10-13 William Craig

A cubic partition is an integer partition wherein the even parts can appear in two colors. In this paper, we introduce the notion of generalized cubic partitions and prove a number of new congruences akin to the classical Ramanujan-type. We…

Number Theory · Mathematics 2025-05-19 Tewodros Amdeberhan , James A. Sellers , Ajit Singh

We describe a method for counting maps of curves of given genus (and variable moduli) to $\Bbb P^2$, essentially by splitting the $\Bbb P^2$ in two; then specialising to the case of genus 0 we show that the method of quantum cohomology may…

alg-geom · Mathematics 2008-02-03 Ziv Ran

We apply ideas from the cluster method to q-count the permutations of a multiset according to the number of occurrences of certain generalized patterns, as defined by Babson and Steingrimsson. In particular, we consider those patterns with…

Combinatorics · Mathematics 2009-06-01 Andrew M. Baxter

We offer a new proof that a certain q-analogue of multinomial coeffi- cients furnishes a q-counting of the set of permutations of an associated multiset of positive integers, according to the number of inversions in such arrangements. Our…

Combinatorics · Mathematics 2018-08-28 Shashikant Mulay , Carl Wagner

For a prime number p, we construct a generating set for the ring of invariants for the p+1 dimensional indecomposable modular representation of a cyclic group of order p^2. We then use the constructed invariants to describe the…

Commutative Algebra · Mathematics 2007-06-13 R. J. Shank , D. L. Wehlau

Let $\Phi$ be an irreducible crystallographic root system and $\mathcal P$ its root polytope, i.e., its convex hull. We provide a uniform construction, for all root types, of a triangulation of the facets of $\mathcal P$. We also prove…

Combinatorics · Mathematics 2016-12-20 Paola Cellini

The equidistribution of many crossing and nesting statistics exists in several combinatorial objects like matchings, set partitions, permutations, and embedded labelled graphs. The involutions switching nesting and crossing numbers for set…

Combinatorics · Mathematics 2014-01-03 Lily Yen

This note introduces some bijections relating core partitions and tuples of integers. We apply these bijections to count the number of cores with various types of restriction, including fixed number of parts, limited size of parts, parts…

Combinatorics · Mathematics 2019-11-20 Hao Zhong

We consider the well-studied pattern counting problem: given a permutation $\pi \in \mathbb{S}_n$ and an integer $k > 1$, count the number of order-isomorphic occurrences of every pattern $\tau \in \mathbb{S}_k$ in $\pi$. Our first result…

Data Structures and Algorithms · Computer Science 2024-07-09 Gal Beniamini , Nir Lavee

In this series of papers, we propose a theory of enumerative invariants counting self-dual objects in self-dual categories. Ordinary enumerative invariants in abelian categories can be seen as invariants for the structure group $\mathrm{GL}…

Algebraic Geometry · Mathematics 2025-04-01 Chenjing Bu

We show that for every finite colouring of the natural numbers there exists $a,b >1$ such that the triple $\{a,b,a^b\}$ is monochromatic. We go on to show the partition regularity of a much richer class of patterns involving exponentiation.…

Combinatorics · Mathematics 2016-10-24 Julian Sahasrabudhe

In this paper, we consider representations of integers as sums of at most four distinct $m$-gonal numbers (allowing a fixed number of repeats of each polygonal number occurring in the sum). We show that the number of such representations…

Number Theory · Mathematics 2026-03-23 Kathrin Bringmann , Min-Joo Jang , Ben Kane , Cheuk Hin Alvin Tse

Integer partitions are one of the most fundamental objects of combinatorics (and number theory), and so is enumerating objects avoiding patterns. In the present paper we describe two approaches for the systematic counting of classes of…

Combinatorics · Mathematics 2019-10-29 Mingjia Yang , Doron Zeilberger