Downloads & Free Reading Options - Results

Partitions de la chanson Herotique de l'album Hybride d'Elya Sibelyus.

A partition of a finite abelian group gives rise to a dual partition on the character group via the Fourier transform. Properties of the dual partitions are investigated and a convenient test is given for the case that the bidual partition coincides the primal partition. Such partitions permit MacWilliams identities for the partition enumerators of additive codes. It is shown that dualization commutes with taking products and symmetrized products of partitions on cartesian powers of the given group. After translating the results to Frobenius rings, which are identified with their character module, the approach is applied to partitions that arise from poset structures.

We investigate the diagonal generating function of the Jacobi-Stirling numbers of the second kind $ \JS(n+k,n;z)$ by generalizing the analogous results for the Stirling and Legendre-Stirling numbers. More precisely, letting $\JS(n+k,n;z)=p_{k,0}(n)+p_{k,1}(n)z+...+p_{k,k}(n)z^k$, we show that $(1-t)^{3k-i+1}\sum_{n\geq0}p_{k,i}(n)t^n$ is a polynomial in $t$ with nonnegative integral coefficients and provide combinatorial interpretations of the coefficients by using Stanley's theory of $P$-partitions.

For every partition of a positive integer $n$ in $k$ parts and every point of an infinite Grassmannian we obtain a solution of the $k$ component differential-difference KP hierarchy and a corresponding Baker function. A partition of $n$ also determines a vertex operator construction of the fundamental representations of the infinite matrix algebra $gl_\infty$ and hence a $\tau$ function. We use these fundamental representations to study the Gauss decomposition in the infinite matrix group $Gl_\infty$ and to express the Baker function in terms of $\tau$-functions. The reduction to loop algebras is discussed.

The generating function of reverse plane partitions of a fixed shape factors into a product featuring the hook-lengths of this shape. This result, which was first obtained by Stanley, can be explained bijectively using the Hillman-Grassl correspondence between reverse plane partitions and tableaux weighted by hook-lengths. In this extended abstract an alternative bijection between the same families of objects is presented. This construction is best perceived as a set of rules for building reverse plane partitions, viewed as arrangements of stacks of cubes, using bricks in the shape of rim-hooks.

Video lecture introducing CHS addressing, LBA, partitions, and DOS/GPT partition tables.

We consider a point process on one-dimensional lattice originated from the harmonic analysis on the infinite symmetric group, and defined by the z-measures with the deformation (Jack) parameter 2. We derive an exact Pfaffian formula for the correlation function of this process. Namely, we prove that the correlation function is given as a Pfaffian with a matrix kernel. The kernel is given in terms of the Gauss hypergeometric functions, and can be considered as a matrix analogue of the Hypergeometric kernel introduced by A. Borodin and G. Olshanski. Our result holds for all values of admissible complex parameters.

Let T be a C^2-expanding self-map of a compact, connected, smooth, Riemannian manifold M. We correct a minor gap in the proof of a theorem from the literature: the set of points whose forward orbits are nondense has full Hausdorff dimension. Our correction allows us to strengthen the theorem. Combining the correction with Schmidt games, we generalize the theorem in dimension one: given a point x in M, the set of points whose forward orbit closures miss x is a winning set.

We establish a necessary and sufficient condition for a heptagonal knot to be figure-8 knot. The condition is described by a set of Radon partitions formed by vertices of the heptagon. In addition we relate this result to the number of nontrivial heptagonal knots in linear embeddings of the complete graph $K_7$ into $\mathbb{R}^3$.

We establish a necessary and sufficient condition for a heptagonal knot to be figure-8 knot. The condition is described by a set of Radon partitions formed by vertices of the heptagon. In addition we relate this result to the number of nontrivial heptagonal knots in linear embeddings of the complete graph $K_7$ into $\mathbb{R}^3$.

We provide a combinatorial description of exclusion statistics in terms of minimal difference $p$ partitions. We compute the probability distribution of the number of parts in a random minimal $p$ partition. It is shown that the bosonic point $ p=0$ is a repulsive fixed point for which the limiting distribution has a Gumbel form. For all positive $p$ the distribution is shown to be Gaussian.

Pattern avoidance in the symmetric group $S_n$ has provided a number of useful connections between seemingly unrelated problems from stack-sorting to Schubert varieties. Recent work has generalized these results to $S_n\wr C_c$, the objects of which can be viewed as "colored permutations". Another body of research that has grown from the study of pattern avoidance in permutations is pattern avoidance in $\Pi_n$, the set of set partitions of $[n]$. Pattern avoidance in set partitions is a generalization of the well-studied notion of noncrossing partitions. Motivated by recent results in pattern avoidance in $S_n \wr C_c$ we provide a catalog of initial results for pattern avoidance in colored partitions, $\Pi_n \wr C_c$. We note that colored set partitions are not a completely new concept. \emph{Signed} (2-colored) set partitions appear in the work of Bj\"{o}rner and Wachs involving the homology of partition lattices. However, we seek to study these objects in a new enumerative context.

We prove a lower bound expansion on the probability that a random $\pm 1$ matrix is singular, and conjecture that such expansions govern the actual probability of singularity. These expansions are based on naming the most likely, second most likely, and so on, ways that a Bernoulli matrix can be singular; the most likely way is to have a null vector of the form $e_i \pm e_j$, which corresponds to the integer partition 11, with two parts of size 1. The second most likely way is to have a null vector of the form $e_i \pm e_j \pm e_k \pm e_\ell$, which corresponds to the partition 1111. The fifth most likely way corresponds to the partition 21111. We define and characterize the "novel partitions" which show up in this series. As a family, novel partitions suffice to detect singularity, i.e., any singular Bernoulli matrix has a left null vector whose underlying integer partition is novel. And, with respect to this property, the family of novel partitions is minimal. We prove that the only novel partitions with six or fewer parts are 11, 1111, 21111, 111111, 221111, 311111, and 322111. We prove that there are fourteen novel partitions having seven parts. We formulate a conjecture about which partitions are "first place and runners up," in relation to the Erd\H{o}s-Littlewood-Offord bound. We prove some bounds on the interaction between left and right null vectors.

We show that a version of Ramsey's theorem for trees for arbitrary exponents is equivalent to the subsystem ACA' of reverse mathematics.

In this paper, we use a partition of the links of a network in order to uncover its community structure. This approach allows for communities to overlap at nodes, so that nodes may be in more than one community. We do this by making a node partition of the line graph of the original network. In this way we show that any algorithm which produces a partition of nodes can be used to produce a partition of links. We discuss the role of the degree heterogeneity and propose a weighted version of the line graph in order to account for this.

In this paper, we use a partition of the links of a network in order to uncover its community structure. This approach allows for communities to overlap at nodes, so that nodes may be in more than one community. We do this by making a node partition of the line graph of the original network. In this way we show that any algorithm which produces a partition of nodes can be used to produce a partition of links. We discuss the role of the degree heterogeneity and propose a weighted version of the line graph in order to account for this.

In this short note many conjectures on partitions of integers as summations of prime numbers are presented, which are extension of Goldbach conjecture.

The polynomial partitioning method of Guth and Katz [arXiv:1011.4105] has numerous applications in discrete and computational geometry. It partitions a given $n$-point set $P\subset\mathbb{R}^d$ using the zero set $Z(f)$ of a suitable $d$-variate polynomial $f$. Applications of this result are often complicated by the problem, what should be done with the points of $P$ lying within $Z(f)$? A natural approach is to partition these points with another polynomial and continue further in a similar manner. So far it has been pursued with limited success---several authors managed to construct and apply a second partitioning polynomial, but further progress has been prevented by technical obstacles. We provide a polynomial partitioning method with up to $d$ polynomials in dimension $d$, which allows for a complete decomposition of the given point set. We apply it to obtain a new algorithm for the semialgebraic range searching problem. Our algorithm has running time bounds similar to a recent algorithm by Agarwal, Sharir, and the first author [SIAM~J.~Comput. 42(2013) 2039--2062], but it is simpler both conceptually and technically. While this paper has been in preparation, Basu and Sombra, as well as Fox, Pach, Sheffer, Suk, and Zahl, obtained results concerning polynomial partitions which overlap with ours to some extent.

Nice formulae for plane partitions with bounded size of parts (or boxed plane partitions), which generalize the norm-trace generating function by Stanley and the trace generating function by Gansner, are exhibited. The derivation of the nice formulae is based on lattice path combinatorics of biorthogonal polynomials, especially of the little $q$-Laguerre polynomials and a generalization of the little $q$-Laguerre polynomials. A summation formula which generalizes the $q$-Chu-Vandermonde identity is also shown and utilized to prove the orthogonality of the generalized little $q$-Laguerre polynomials.

We construct and study the space C(\R^d,n) of all partitions of \R^d into n non-empty open convex regions (n-partitions). A representation on the upper hemisphere of an n-sphere is used to obtain a metric and thus a topology on this space. We show that the space of partitions into possibly empty regions C(\R^d,\le n) yields a compactification with respect to this metric. We also describe faces and face lattices, combinatorial types, and adjacency graphs for $n$-partitions, and use these concepts to show that C(\R^d,n) is a union of elementary semialgebraic sets.

Applications of harmonic analysis on finite groups were recently introduced to measure partition problems, with a variety of equipartition types by convex fundamental domains obtained as the vanishing of prescribed Fourier transforms. Considering the circle group, we extend this approach to the compact Lie group setting, in which case the annihilation of transforms in the classical Fourier series produces measure transversality similar in spirit to the classical centerpoint theorem of Rado: for any $q\geq 2$, the existence of a complex hyperplane whose surrounding regular $q$-fans are close -- in an $L^2$-sense -- to equipartitioning a given set of measures. The proofs of these results represent the first application of continuous as opposed to finite group actions in the usual equivariant topological reductions prevalent in combinatorial geometry.

Markov partitions persisting in a neighbourhood of hyperbolic components of rational maps were constructed under the condition that closures of Fatou components are disjoint in \cite{R1}. Given such a partition, we characterize all nearby hyperbolic components in terms of the symbolic dynamics. This means we can count them, and also obtain topological information. We also determine extra conditions under which all nearby type IV hyperbolic components are given by matings. These are probably the first known results of this type.

We introduce Coxeter-sortable elements of a Coxeter group W. For finite W, we give bijective proofs that Coxeter-sortable elements are equinumerous with clusters and with noncrossing partitions. We characterize Coxeter-sortable elements in terms of their inversion sets and, in the classical cases, in terms of permutations.

Panzerschiff Deutschland - Schumann  Noten für Blasorchester  Partitions Orchestre d'Harmonie

We study certain probability measures on partitions of n=1,2,..., originated in representation theory, and demonstrate their connections with random matrix theory and multivariate hypergeometric functions. Our measures depend on three parameters including an analog of the beta parameter in random matrix models. Under an appropriate limit transition as n goes to infinity, our measures converge to certain limit measures, which are of the same nature as one-dimensional log-gas with arbitrary beta>0. The first main result says that averages of products of ``characteristic polynomials'' with respect to the limit measures are given by the multivariate hypergeometric functions of type (2,0). The second main result is a computation of the limit correlation functions for the even values of beta.

We prove that every $1$-error-correcting code over a finite field can be embedded in a $1$-perfect code of some larger length. Embedding in this context means that the original code is a subcode of the resulting $1$-perfect code and can be obtained from it by repeated shortening. Further, we generalize the results to partitions: every partition of the Hamming space into $1$-error-correcting codes can be embedded in a partition of a space of some larger dimension into $1$-perfect codes. For the partitions, the embedding length is close to the theoretical bound for the general case and optimal for the binary case. Keywords: error-correcting code, $1$-perfect code, $1$-perfect partition, embedding

In this expository paper we summarize the connection between random partitions and 4-dimensional supersymmetric gauge theories discovered in hep-th/0306238. There is also a brief section about how this extends to 3-dimensional partitions which is best read together with math-ph/0412008.

Approved For Rel P #~ 142RDP61,00763A000100050060-3 JUXmb 2939 Pm.* Roal Smato "I C n ti 1 o iti 1. It I Roca . 1717 ftd that 1 partitions b* ,2 March 1959) U & 1 .. Atdxesmee 0&-LO,ey3 ,, qr 4 25X Approved For Releasl 14 I P61-00763A000100050060-3

Approved For Rel P #~ 142RDP61,00763A000100050060-3 JUXmb 2939 Pm.* Roal Smato "I C n ti 1 o iti 1. It I Roca . 1717 ftd that 1 partitions b* ,2 March 1959) U & 1 .. Atdxesmee 0&-LO,ey3 ,, qr 4 25X Approved For Releasl 14 I P61-00763A000100050060-3

In [1] we define Smarandache Factor Partition Function (SFP), as follows: Let α 1 , α 2 , α 3 , ... α r be a set of r natural numbers and P 1 , P 2 , P 3 , ... P r be arbitrarily chosen distinct primes then F( α 1 , α 2 , α 3 , ... α r ) called the Smarandache Factor Partition of   ( α 1 , α 2 , α 3 , ... α r ) is defined as the number of ways in which the number N =   could be expressed as the product of its' divisors. For simplicity, we denote F( α 1 , α 2 , α 3 , ... α r ) = F' (N), where   N =   and P r is the r th prime. P 1 =2, P 2 = 3 etc. In this note an algorithm to list out all the SFPs of a number without missing any is developed.

Bois Boudrant Marsch - Friedrich Zikoff Arrangement de Michel Nowak Partitions pour orchestre d'harmonie Partitions disponibles aux Editions Andel https://www.andelmusic.be/index-fr.aspx

We provide a variational derivation of the limit shape of minimal difference partitions and discuss the link with exclusion statistics. Also see arXiv:0707.2312 for a related paper.

Ensembles of single-source events, produced in peripheral and central collisions and correponding respectively to quasi-projectile and quasi-fusion sources, are analyzed. After selections on fragment kinematic properties, excitation energies of the sources are derived using the calorimetric method and the mean behaviour of fragments of the two ensembles are compared. Differences observed in their partitions, especially the charge asymmetry, can be related to collective energy deposited in the systems during the collisions.

Joselito Bienvenida - Pascual Marquina Narro Arrgt: Michel Nowak Partitions pour orchestre d'harmonie Partitions disponibles aux Editions Andel https://www.andelmusic.be/fr/search.aspx?s=nowak&t=overall

We describe new constructions of graphs which exhibit perfect state transfer on continuous-time quantum walks. Our constructions are based on variants of the double cones [BCMS09,ANOPRT10,ANOPRT09] and the Cartesian graph products (which includes the n-cube) [CDDEKL05]. Some of our results include: (1) If $G$ is a graph with perfect state transfer at time $t_{G}$, where $t_{G}\Spec(G) \subseteq \ZZ\pi$, and $H$ is a circulant with odd eigenvalues, their weak product $G \times H$ has perfect state transfer. Also, if $H$ is a regular graph with perfect state transfer at time $t_{H}$ and $G$ is a graph where $t_{H}|V_{H}|\Spec(G) \subseteq 2\ZZ\pi$, their lexicographic product $G[H]$ has perfect state transfer. (2) The double cone $\overline{K}_{2} + G$ on any connected graph $G$, has perfect state transfer if the weights of the cone edges are proportional to the Perron eigenvector of $G$. This generalizes results for double cone on regular graphs studied in [BCMS09,ANOPRT10,ANOPRT09]. (3) For an infinite family $\GG$ of regular graphs, there is a circulant connection so the graph $K_{1}+\GG\circ\GG+K_{1}$ has perfect state transfer. In contrast, no perfect state transfer exists if a complete bipartite connection is used (even in the presence of weights) [ANOPRT09]. We also describe a generalization of the path collapsing argument [CCDFGS03,CDDEKL05], which reduces questions about perfect state transfer to simpler (weighted) multigraphs, for graphs with equitable distance partitions.

This paper studies topological properties of the lattices of non-crossing partitions of types A and B and of the poset of injective words. Specifically, it is shown that after the removal of the bottom and top elements (if existent) these posets are doubly Cohen-Macaulay. This strengthens the well-known facts that these posets are Cohen-Macaulay. Our results rely on a new poset fiber theorem which turns out to be a useful tool to prove double (homotopy) Cohen-Macaulayness of a poset. Applications to complexes of injective words are also included.

The lattice of the set partitions of $[n]$ ordered by refinement is studied. Given a map $\phi: [n] \rightarrow [n]$, by taking preimages of elements we construct a partition of $[n]$. Suppose $t$ partitions $p_1,p_2,\dots,p_t$ are chosen independently according to the uniform measure on the set of mappings $[n]\rightarrow [n]$. The probability that the coarsest refinement of all $p_i$'s is the finest partitions $\{\{1\},\dots,\{n\}\}$ is shown to approach $1$ for any $t\geq 3$ and $e^{-1/2}$ for $t=2$. The probability that the finest coarsening of all $p_i$'s is the one-block partition is shown to approach 1 if $t(n)-\log{n}\rightarrow \infty$ and $0$ if $t(n)-\log{n}\rightarrow -\infty$. The size of the maximal block of the finest coarsening of all $p_i$'s for a fixed $t$ is also studied.

Graph partitioning, a well studied problem of parallel computing has many applications in diversified fields such as distributed computing, social network analysis, data mining and many other domains. In this paper, we introduce FGPGA, an efficient genetic approach for producing feasible graph partitions. Our method takes into account the heterogeneity and capacity constraints of the partitions to ensure balanced partitioning. Such approach has various applications in mobile cloud computing that include feasible deployment of software applications on the more resourceful infrastructure in the cloud instead of mobile hand set. Our proposed approach is light weight and hence suitable for use in cloud architecture. We ensure feasibility of the partitions generated by not allowing over-sized partitions to be generated during the initialization and search. Our proposed method tested on standard benchmark datasets significantly outperforms the state-of-the-art methods in terms of quality of partitions and feasibility of the solutions.

We prove that the planar hexagonal honeycomb is asymptotically optimal for a large class of optimal partition problems, in which the cells are assumed to be convex, and the criterion is to minimize either the sum or the maximum among the energies of the cells, the cost being a shape functional $F$ which satisfies a few assumptions. They are: monotonicity under inclusions; homogeneity under dilations; a Faber-Krahn inequality for convex hexagons; a convexity-type inequality for the map which associates with every $n \in \mathbb{N}$ the minimizers of $F$ among convex $n$-gons with given area. In particular, our result allows to obtain the honeycomb conjecture for the Cheeger constant and for the logarithmic capacity (still assuming the cells to be convex). Moreover we show that, in order to get the conjecture also for the first Dirichlet eigenvalue of the Laplacian, it is sufficient to establish some facts about the behaviour of $\lambda _1$ among convex pentagons, hexagons, and heptagons with prescribed area.

The Gr\"unbaum-Hadwiger-Ramos hyperplane mass partition problem was introduced by Gr\"unbaum (1960) in a special case and in general form by Ramos (1996). It asks for the "admissible" triples $(d,j,k)$ such that for any $j$ masses in $\mathbb{R}^d$ there are $k$ hyperplanes that cut each of the masses into $2^k$ equal parts. Ramos' conjecture is that the Avis-Ramos necessary lower bound condition $dk\ge j(2^k-1)$ is also sufficient. We develop a "join scheme" for this problem, such that non-existence of an $G_k$-equivariant map between spheres $(S^d)^{*k} \rightarrow S(W_k\oplus U_k^{\oplus j})$ that extends a test map on the subspace of $(S^d)^{*k}$ where the hyperoctahedral group $G_k$ acts non-freely, implies that $(d,j,k)$ is admissible. For the sphere $(S^d)^{*k}$ we obtain a very efficient regular cell decomposition, whose cells get a combinatorial interpretation with respect to measures on a modified moment curve. This allows us to apply relative equivariant obstruction theory successfully, even in the case when the difference of dimensions of the spheres $(S^d)^{*k}$ and $S(W_k\oplus U_k^{\oplus j})$ is greater than one. The evaluation of obstruction classes leads to counting problems for concatenated Gray codes. Thus we give a rigorous, unified treatment of the previously announced cases of the Gr\"unbaum-Hadwiger-Ramos problem, as well as a number of new cases for Ramos' conjecture.

The Gr\"unbaum-Hadwiger-Ramos hyperplane mass partition problem was introduced by Gr\"unbaum (1960) in a special case and in general form by Ramos (1996). It asks for the "admissible" triples $(d,j,k)$ such that for any $j$ masses in $\mathbb{R}^d$ there are $k$ hyperplanes that cut each of the masses into $2^k$ equal parts. Ramos' conjecture is that the Avis-Ramos necessary lower bound condition $dk\ge j(2^k-1)$ is also sufficient. We develop a "join scheme" for this problem, such that non-existence of an $G_k$-equivariant map between spheres $(S^d)^{*k} \rightarrow S(W_k\oplus U_k^{\oplus j})$ that extends a test map on the subspace of $(S^d)^{*k}$ where the hyperoctahedral group $G_k$ acts non-freely, implies that $(d,j,k)$ is admissible. For the sphere $(S^d)^{*k}$ we obtain a very efficient regular cell decomposition, whose cells get a combinatorial interpretation with respect to measures on a modified moment curve. This allows us to apply relative equivariant obstruction theory successfully, even in the case when the difference of dimensions of the spheres $(S^d)^{*k}$ and $S(W_k\oplus U_k^{\oplus j})$ is greater than one. The evaluation of obstruction classes leads to counting problems for concatenated Gray codes. Thus we give a rigorous, unified treatment of the previously announced cases of the Gr\"unbaum-Hadwiger-Ramos problem, as well as a number of new cases for Ramos' conjecture.

Digital Repository of Scientific Institutes (RCIN) was established and is being developed mainly as an outcome of two projects acquired and jointly accomplished by a group of Polish scientific institutes.

We discuss the suitability of spreadsheet processors as tools for programming streaming systems. We argue that, while spreadsheets can function as powerful models for stream operators, their fundamental boundedness limits their scope of application. We propose two extensions to the spreadsheet model and argue their utility in the context of programming streaming systems.

For a given sequence of weights (non-negative numbers), we consider partitions of the positive integer n. Each n-partition is selected uniformly at random from the set of all such partitions. Under a classical scheme of assumptions on the weight sequence, which are due to Meinardus (1954), we show that the largest part in a random weighted partition, appropriately normalized, converges weakly, as n tends to infinity, to a random variable having the extreme value (Gumbel's) distribution. This limit theorem extends some known results on particular types of integer partitions and on the Bose-Einstein model of ideal gas.

For a given sequence of weights (non-negative numbers), we consider partitions of the positive integer n. Each n-partition is selected uniformly at random from the set of all such partitions. Under a classical scheme of assumptions on the weight sequence, which are due to Meinardus (1954), we show that the largest part in a random weighted partition, appropriately normalized, converges weakly, as n tends to infinity, to a random variable having the extreme value (Gumbel's) distribution. This limit theorem extends some known results on particular types of integer partitions and on the Bose-Einstein model of ideal gas.

In this paper, we use a simple discrete dynamical system to study the integers partitions and their lattice. The set of the reachable configurations equiped with the order induced by the transitions of the system is exactly the lattice of integer partitions equiped with the dominance ordering. We first explain how this lattice can be constructed, by showing its strong self-similarity property. Then, we define a natural extension of the system to infinity. Using a self-similar tree, we obtain an efficient coding of the obtained lattice. This approach gives an interesting recursive formula for the number of partitions of an integer, where no closed formula have ever been found. It also gives informations on special sets of partitions, such as length bounded partitions.

Louis Solomon showed that the group algebra of the symmetric group $\mathfrak{S}_{n}$ has a subalgebra called the descent algebra, generated by sums of permutations with a given descent set. In fact, he showed that every Coxeter group has something that can be called a descent algebra. There is also a commutative, semisimple subalgebra of Solomon's descent algebra generated by sums of permutations with the same number of descents: an "Eulerian" descent algebra. For any Coxeter group that is also a Weyl group, Paola Cellini proved the existence of a different Eulerian subalgebra based on a modified definition of descent. We derive the existence of Cellini's subalgebra for the case of the symmetric group and of the hyperoctahedral group using a variation on Richard Stanley's theory of $P$-partitions.

This article is an extensive study of partitions with fixed number of odd and even-indexed odd parts. We use these partitions to generalize recent results of C. Savage and A. Sills. Moreover, we derive explicit formulas for generating functions for partitions with bounds on the largest part, the number of parts and with a fixed value of BG-rank or with a fixed value of alternating sum of parts. We extend the work of C. Boulet, and as a result, obtain a four-variable generalization of Gaussian binomial coefficients. In addition we provide combinatorial interpretation of the Berkovich-Warnaar identity for Rogers-Szego polynomials.

We introduce a new concept of resonance on discrete dynamical systems. This concept formalizes the observation that, in various combinatorially-natural cyclic group actions, orbit cardinalities are all multiples of divisors of a fundamental frequency. Our main result is an equivariant bijection between plane partitions in a box (or order ideals in the product of three chains) under rowmotion and increasing tableaux under $K$-promotion. Both of these actions were observed to have orbit sizes that were small multiples of divisors of an expected orbit size, and we show this is an instance of resonance, as $K$-promotion cyclically rotates the set of labels appearing in the increasing tableaux. We extract a number of corollaries from this equivariant bijection, including a strengthening of a theorem of [P. Cameron--D. Fon-der-Flaass '95] and several new results on the order of $K$-promotion. Along the way, we adapt the proof of the conjugacy of promotion and rowmotion from [J. Striker--N. Williams '12] to give a generalization in the setting of $n$-dimensional lattice projections. Finally we discuss known and conjectured examples of resonance relating to alternating sign matrices and fully-packed loop configurations.

Memoir on the Theory of the Partitions of Numbers. Part II. MacMahon, P Proceedings of the Royal Society of London (1854-1905). 1898-01-01. 64:224–227