Related papers: Enumerating partitions arising in homotopy theory
We study the complexity of computation in finitely generated free left, right and two-sided adequate semigroups and monoids. We present polynomial time (quadratic in the RAM model of computation) algorithms to solve the word problem and…
Recently several authors have proved results on Ehrhart series of free sums of rational polytopes. In this note we treat these results from an algebraic viewpoint. Instead of attacking combinatorial statements directly, we derive them from…
We construct a new family of homomorphisms from Specht modules into Foulkes modules for the symmetric group. These homomorphisms are used to give a combinatorial description of the minimal partitions (in the dominance order) which label…
Motivated by ideas from stable homotopy theory we study the space of strongly homotopy associative multiplications on a two-cell chain complex. In the simplest case this moduli space is isomorphic to the set of orbits of a group of…
The space of unitary local systems of rank one on the complement of an arbitrary divisor in a complex projective algebraic variety can be described in terms of parabolic line bundles. We show that multiplier ideals provide natural…
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…
We describe, for the first time, a completely rigorous homotopy (path--following) algorithm (in the Turing machine model) to find approximate zeros of systems of polynomial equations. If the coordinates of the input systems and the initial…
In this note, we consider ordered partitions of integers such that each entry is no more than a fixed portion of the sum. We give a method for constructing all such compositions as well as both an explicit formula and a generating function…
We establish connectedness criteria for graphs associated to monomials in certain quotients of the mod 2 dual Steenrod algebra. We also investigate questions about trees and Hamilton cycles in the context of these graphs. Finally, we…
In this paper we study partitions whose successive ranks belong to a given set. We enumerate such partitions while keeping track of the number of parts, the largest part, the side of the Durfee square, and the height of the Durfee…
We prove Tamura's theorem on partitions of the set of positive integers (a generalization of the more famous Rayleigh-Beatty theorem) using the positive $\mathbb{S}^1$-equivariant symplectic homology.
We prove specific biases in the number of occurrences of parts belonging to two different residue classes $a$ and $b$, modulo a fixed non-negative integer $m$, for the sets of unrestricted partitions, partitions into distinct parts, and…
Improving upon previous work on the subject, we use Wright's Circle Method to derive an asymptotic formula for the number of parts in all partitions of an integer that are in any given arithmetic progression.
We produce a fully faithful functor from finite type nilpotent spaces to cosimplicial binomial rings, thus giving an algebraic model of integral homotopy types. As an application, we construct an integral version of the…
We algorithmically compute integral Eilenberg-MacLane homology of all semigroups of order at most $8$ and present some particular semigroups with notable classifying spaces, refuting conjectures of Nico. Along the way, we give an…
Motivated by the study of integer partitions, we consider partitions of integers into fractions of a particular form, namely with constant denominators and distinct odd or even numerators. When numerators are odd, the numbers of partitions…
We classify certain categories of partitions of finite sets subject to specific rules on the colorization of points and the sizes of blocks. More precisely, we consider pair partitions such that each block contains exactly one white and one…
We introduce a new notation for representing labeled regular bipartite graphs of arbitrary degree. Several enumeration problems for labeled and unlabeled regular bipartite graphs have been introduced. A general algorithm for enumerating all…
We classify semisimple rigid monoidal categories with two isomorphism classes of simple objects over the field of complex numbers. In the appendix written by P.Etingof it is proved that the number of semisimple Hopf algebras with a given…
We introduce a strategy to study irreducible representations of automorphism groups of finite modules over local rings. We prove that these automorphism groups fit in a hierarchy that facilitates a stratification of their irreducible…