scholarly journals Group Actions on Partitions

10.37236/6673 ◽  
2017 ◽  
Vol 24 (3) ◽  
Author(s):  
Byungchan Kim
Keyword(s):  
Generating Functions ◽  
Group Actions ◽  
Integer Partitions ◽  
Arithmetic Properties ◽  
Counting Functions ◽  
Burnside's Lemma ◽  
Burnside’S Lemma

We introduce group actions on the integer partitions and their variances. Using generating functions and Burnside's lemma, we study arithmetic properties of the counting functions arising from group actions. In particular, we find a modulo 4 congruence involving the number of ordinary partitions and the number of partitions into distinct parts.

Applying Burnside's Lemma to a One-Dimensional Escher Problem

2006 ◽  
Vol 79 (3) ◽  
pp. 167 ◽  
Author(s):  
Tomaz̆ Pisanski ◽  
Doris Schattschneider ◽  
Brigitte Servatius
Keyword(s):  
One Dimensional ◽  
Burnside's Lemma ◽  
Burnside’S Lemma

scholarly journals The ‘Burnside Process’ Converges Slowly

2002 ◽  
Vol 11 (1) ◽  
pp. 21-34 ◽  
Author(s):  
LESLIE ANN GOLDBERG ◽  
MARK JERRUM
Keyword(s):  
Markov Chain ◽  
Mixing Time ◽  
Significant Proportion ◽  
Main Tool ◽  
Infinite Family ◽  
Combinatorial Structures ◽  
Special Groups ◽  
Sampling Problem ◽  
Burnside's Lemma ◽  
Burnside’S Lemma

We consider the problem of sampling ‘unlabelled structures’, i.e., sampling combinatorial structures modulo a group of symmetries. The main tool which has been used for this sampling problem is Burnside’s lemma. In situations where a significant proportion of the structures have no nontrivial symmetries, it is already fairly well understood how to apply this tool. More generally, it is possible to obtain nearly uniform samples by simulating a Markov chain that we call the Burnside process: this is a random walk on a bipartite graph which essentially implements Burnside’s lemma. For this approach to be feasible, the Markov chain ought to be ‘rapidly mixing’, i.e., converge rapidly to equilibrium. The Burnside process was known to be rapidly mixing for some special groups, and it has even been implemented in some computational group theory algorithms. In this paper, we show that the Burnside process is not rapidly mixing in general. In particular, we construct an infinite family of permutation groups for which we show that the mixing time is exponential in the degree of the group.

Applying Burnside's Lemma to a One-Dimensional Escher Problem

2006 ◽  
Vol 79 (3) ◽  
pp. 167-180
Author(s):  
Tomaž Pisanski ◽  
Doris Schattschneider ◽  
Brigitte Servatius
Keyword(s):  
One Dimensional ◽  
Burnside's Lemma ◽  
Burnside’S Lemma

A General Asymptotic Scheme for the Analysis of Partition Statistics

2014 ◽  
Vol 23 (6) ◽  
pp. 1057-1086 ◽  
Author(s):  
PETER J. GRABNER ◽  
ARNOLD KNOPFMACHER ◽  
STEPHAN WAGNER
Keyword(s):  
Generating Function ◽  
Asymptotic Expansions ◽  
Generating Functions ◽  
Singularity Analysis ◽  
Higher Moments ◽  
Integer Partitions ◽  
Classical Singularity ◽  
Random Integer ◽  
Partition Statistics ◽  
New Statistics

We consider statistical properties of random integer partitions. In order to compute means, variances and higher moments of various partition statistics, one often has to study generating functions of the form P(x)F(x), where P(x) is the generating function for the number of partitions. In this paper, we show how asymptotic expansions can be obtained in a quasi-automatic way from expansions of F(x) around x = 1, which parallels the classical singularity analysis of Flajolet and Odlyzko in many ways. Numerous examples from the literature, as well as some new statistics, are treated via this methodology. In addition, we show how to compute further terms in the asymptotic expansions of previously studied partition statistics.

4. A combinatorial zoo

2016 ◽  
pp. 50-71
Author(s):  
Robin Wilson
Keyword(s):  
Fibonacci Numbers ◽  
Exclusion Principle ◽  
Pigeonhole Principle ◽  
Tower Of Hanoi ◽  
Wide Range ◽  
The World ◽  
Burnside's Lemma ◽  
Burnside’S Lemma

‘A combinatorial zoo’ presents a menagerie of combinatorial topics, ranging from the box (or pigeonhole) principle, the inclusion–exclusion principle, the derangement problem, and the Tower of Hanoi problem that uses combinatorics to determine how soon the world will end to Fibonacci numbers, the marriage theorem, generators and enumerators, and counting chessboards, which involves symmetry. The method used to average the numbers of colourings that remain unchanged by each symmetry in this latter problem is often called ‘Burnside’s lemma’. This concept has since been developed into a much more powerful result, which has been used to count a wide range of objects with a degree of symmetry, such as graphs and chemical molecules.

scholarly journals A PROOF OF ANDREWS’ CONJECTURE ON PARTITIONS WITH NO SHORT SEQUENCES

2019 ◽  
Vol 7 ◽  
Author(s):  
DANIEL M. KANE ◽  
ROBERT C. RHOADES
Keyword(s):  
Asymptotic Behavior ◽  
Modular Form ◽  
Generating Function ◽  
Generating Functions ◽  
Asymptotic Properties ◽  
Bootstrap Percolation ◽  
Asymptotic Result ◽  
Integer Partitions ◽  
Mock Modular Form ◽  
Precise Asymptotic

Our main result establishes Andrews’ conjecture for the asymptotic of the generating function for the number of integer partitions of$n$without$k$consecutive parts. The methods we develop are applicable in obtaining asymptotics for stochastic processes that avoid patterns; as a result they yield asymptotics for the number of partitions that avoid patterns.Holroyd, Liggett, and Romik, in connection with certain bootstrap percolation models, introduced the study of partitions without$k$consecutive parts. Andrews showed that when$k=2$, the generating function for these partitions is a mixed-mock modular form and, thus, has modularity properties which can be utilized in the study of this generating function. For$k>2$, the asymptotic properties of the generating functions have proved more difficult to obtain. Using$q$-series identities and the$k=2$case as evidence, Andrews stated a conjecture for the asymptotic behavior. Extensive computational evidence for the conjecture in the case$k=3$was given by Zagier.This paper improved upon early approaches to this problem by identifying and overcoming two sources of error. Since the writing of this paper, a more precise asymptotic result was established by Bringmann, Kane, Parry, and Rhoades. That approach uses very different methods.

Arithmetic properties for Fu's 9 dots bracelet partitions

2015 ◽  
Vol 11 (04) ◽  
pp. 1063-1072
Author(s):  
Olivia X. M. Yao
Keyword(s):  
Positive Integer ◽  
Generating Functions ◽  
Arithmetic Properties ◽  
Powers Of 2

The notion of Fu's k dots bracelet partitions was introduced by Shishuo Fu. For any positive integer k, let 𝔅k(n) denote the number of Fu's k dots bracelet partitions of n. Fu also proved several congruences modulo primes and modulo powers of 2. Recently, Radu and Sellers extended the set of congruences proven by Fu by proving three congruences modulo squares of primes for 𝔅5(n), 𝔅7(n) and 𝔅11(n). More recently, Cui and Gu, and Xia and the author derived a number of congruences modulo powers of 2 for 𝔅5(n). In this paper, we prove four congruences modulo 2 and two congruences modulo 4 for 𝔅9(n) by establishing the generating functions of 𝔅9(An+B) modulo 4 for some values of A and B.

Generating functions for finite group actions on surfaces

1998 ◽  
Vol 124 (1) ◽  
pp. 21-49 ◽  
Author(s):  
C. MACLACHLAN ◽  
A. MILLER
Keyword(s):  
Finite Group ◽  
Generating Function ◽  
Generating Functions ◽  
Isomorphism Class ◽  
Group Actions ◽  
Equivalence Classes ◽  
Topological Conjugacy ◽  
Finite Group Actions ◽  
Orientable Surfaces

For a fixed finite group G, the numbers Ng of equivalence classes of orientation-preserving actions of G on closed orientable surfaces Σg of genus g can be encoded by a generating function [sum ]Ngzg. When equivalence is determined by the isomorphism class of the quotient orbifold Σg/G, we show that the generating function is rational. When equivalence is topological conjugacy, we examine the cases where G is abelian and show that the generating function is again rational in the cases where G is cyclic.

Sign in / Sign up

Export Citation Format

Share Document