English
Related papers

Related papers: Enumerating partitions arising in homotopy theory

200 papers

We investigate the set of partial partitions of a finite set, ordered by inclusion. With this ordering the set of partial partitions can be studied as an abstract simplicial complex. We use the theory of shellable nonpure complexes to find…

Combinatorics · Mathematics 2023-11-21 Michael J. Gottstein

Let $p_n$ be the number of partitions of an integer $n$. For each of the partition statistics of counting their parts, ranks, or cranks, there is a natural family of integer polynomials. We investigate their asymptotics and the limiting…

Combinatorics · Mathematics 2007-11-12 Robert P. Boyer , William M. Y. Goh

Categories of partitions are combinatorial structures arising from the representation theory of certain compact quantum groups and are linked to classical diagram algebras such as the Temperley-Lieb algebra. In this paper, we present…

Data Structures and Algorithms · Computer Science 2025-02-11 Nicolas Faroß , Sebastian Volz

We introduce the ramified partition algebra, which is a physically motivated and natural generalization of the partition algebra. We investigate its representation theory and demonstrate quasi--heredity under certain conditions. Under these…

Representation Theory · Mathematics 2007-05-23 P P Martin , A Elgamal

We prove that generating subspaces of matrix rings over finite fields are counted by polynomials. We use this result to define and study two-variable versions of polynomials counting isomorphism classes of absolutely irreducible…

Representation Theory · Mathematics 2025-10-09 Markus Reineke

We introduce a family of univariate polynomials indexed by integer partitions. At prime powers, they count the number of subspaces in a finite vector space that transform under a regular diagonal matrix in a specified manner. This…

Combinatorics · Mathematics 2024-09-17 Amritanshu Prasad , Samrith Ram

The cohomology ring of a finite group, with coefficients in a finite field, can be computed by a machine, as Carlson has showed. Here "compute" means to find a presentation in terms of generators and relations, and involves only the…

Algebraic Topology · Mathematics 2009-05-20 Pierre Guillot

We demonstrate that statistics for several types of set partitions are described by generating functions which appear in the theory of integrable equations.

Exactly Solvable and Integrable Systems · Physics 2017-05-30 V. E. Adler

A system of homogeneous linear equations with integer coefficients is partition regular if, whenever the natural numbers are finitely coloured, the system has a monochromatic solution. The Finite Sums theorem provided the first example of…

Combinatorics · Mathematics 2013-12-20 Ben Barber , Neil Hindman , Imre Leader

We extend classical results of Rado on partition regularity of systems of linear equations with integer coefficients to the case when the coefficient ring is either an arbitrary integral domain or a noetherian ring. In particular, we show…

Combinatorics · Mathematics 2021-03-08 Jakub Byszewski , Elżbieta Krawczyk

We consider binomial and inverse binomial sums at infinity and rewrite them in terms of a small set of constants, such as powers of $\pi$ or $\log(2)$. In order to perform these simplifications, we view the series as specializations of…

Number Theory · Mathematics 2015-10-30 Jakob Ablinger

A computationally challenging classical elimination theory problem is to compute polynomials which vanish on the set of tensors of a given rank. By moving away from computing polynomials via elimination theory to computing pseudowitness…

Algebraic Geometry · Mathematics 2016-07-08 Alessandra Bernardi , Noah S. Daleo , Jonathan D. Hauenstein , Bernard Mourrain

In this paper we study the topology of the strata, indexed by number partitions $\lambda$, in the natural stratification of the space of monic hyperbolic polynomials of degree $n$. We prove stabilization theorems for removing an independent…

Combinatorics · Mathematics 2007-05-23 Dmitry N. Kozlov

We prove asymptotic upper bounds on the number of $d$-partitions (paving matroids of fixed rank) and partial Steiner systems (sparse paving matroids of fixed rank), using a mixture of entropy counting, sparse encoding, and the probabilistic…

Combinatorics · Mathematics 2022-02-21 Remco van der Hofstad , Rudi Pendavingh , Jorn van der Pol

In this paper, we introduce and develop the circle embedding method. This method hinges essentially on a combinatorial-geometric structure which we choose to call circles of partition. We provide applications in the context of problems that…

General Mathematics · Mathematics 2026-04-21 Theophilus Agama , Berndt Gensel

It is widely believed that the parity of the partition function $p(n)$ is ``random.'' Contrary to this expectation, in this note we prove the existence of infinitely many congruence relations modulo 4 among its values. For each square-free…

Number Theory · Mathematics 2022-12-15 Ken Ono

In this paper we present a new formula for the number of unrestricted partitions of $n$. We do this by introducing a correspondence between the number of unrestrited partitions of $n$ and the number of non-negative solutions of systems of…

Combinatorics · Mathematics 2019-06-27 Hemar Godinho , José Plínio O. Santos

In this paper we completely classify which graded polynomial R-algebras in finitely many even degree variables can occur as the singular cohomology of a space with coefficients in R, a 1960 question of N. E. Steenrod, for a commutative ring…

Algebraic Topology · Mathematics 2008-12-30 Kasper K. S. Andersen , Jesper Grodal

Using the index theory of seaweed algebras, we explore various new integer partition statistics. We find relations to some well-known varieties of integer partitions as well as a surprising periodicity result.

Combinatorics · Mathematics 2018-10-10 Vincent Coll , Andrew Mayers , Nick Mayers

We consider the problem of learning an unknown partition of an $n$ element universe using rank queries. Such queries take as input a subset of the universe and return the number of parts of the partition it intersects. We give a simple…

Data Structures and Algorithms · Computer Science 2024-09-23 Deeparnab Chakrabarty , Hang Liao
‹ Prev 1 2 3 10 Next ›