Homology of the complex of not 2-divisible partitions

Victor A. Vassiliev

Home/Archive/arXiv

arXiv · 1807.05742

Homology of the complex of not 2-divisible partitions

Victor A. Vassiliev

View original source ↗Read source document ↗Export metadata ↓

Abstract

The rational homology group of the order complex of non-even partitions of a finite set is calculated. A twisted version of the Goresky-MacPherson approach to similar homology calculations is proposed.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Victor A. Vassiliev. 2018-07-16. Homology of the complex of not 2-divisible partitions. https://arxiv.org/abs/1807.05742

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

$2$-large sets are sets of nil-Bohr recurrence

A set $S$ of positive integers is $2$-large if every two-coloring contains arbitrarily long monochromatic arithmetic progressions with common difference in $S$. We prove that every such set meets every nil-Bohr neighborhood of $0$. This proves a conjecture of the first author and gives a sharp answer to a question of Host, Kra, and Maass. We also show that, for every fixed nil-Bohr neighborhood $B$ of $0$ and every $\varepsilon>0$, restricting the common difference to $B$ increases the extremal number for $k$-term arithmetic progressions by at most a factor of $1+\varepsilon$, provided $k$ is sufficiently large.

math.CO↗

arXiv2026

Balanced subgraph counts and quasirandomness: a proof of the Janson--Sós conjecture

Let $F$ be a finite simple graph with $m$ vertices and at least two edges, and let $p\in(0,1]$. We prove that a graph sequence is $p$-quasirandom if and only if the symmetrized counts of copies of $F$ across every balanced partition into $m$ classes have the asymptotics predicted by the random graph with edge probability $p$. This settles a conjecture of Janson and Sós for all such $F$, including graphs with isolated vertices. The proof completes their graph-limit reduction by a concavity argument for a sum of fractional powers determined by the degree sequence of $F$. We also show that a symmetrized subgraph kernel of positive mean can be additive in its coordinates only when the underlying graphon is constant almost everywhere. This rigidity result yields a quasirandomness criterion for generalized restricted subgraph counts, resolving a further conjecture of Janson.

math.CO↗

arXiv2026

On the Number of Iterations in a Kruskal-Type Process

Motivated by the Kruskal counting procedure, this paper investigates a combinatorial elimination process defined on a deck consisting of $m$ copies of each value $1,2,\ldots,n$. Starting from an arbitrary arrangement of the $mn$ cards, the process repeatedly removes a number of consecutive cards equal to the value of the first remaining card. This generates a sequence of elimination steps whose length determines $T$, representing the total number of iterations required to exhaust the deck. The main objective of this paper is to analyze an upper bound $σ(m,n)$ for $T$, valid for every initial configuration of the deck, and to show that this bound is attained by a specific configuration.

math.CO↗