English
Related papers

Related papers: Classifying unavoidable Tverberg partitions

200 papers

A partition n = p_1 + p_2 + ... + p_k with 1 <= p_1 <= p_2 <= ... <= p_k is called non-squashing if p_1 + ... + p_j <= p_{j+1} for 1 <= j <= k-1. Hirschhorn and Sellers showed that the number of non-squashing partitions of n is equal to the…

Combinatorics · Mathematics 2014-09-17 N. J. A. Sloane , James A. Sellers

For a commutative ring $R$, a polynomial $f\in R[x]$ is called separable if $R[x]/f$ is a separable $R$-algebra. We derive formulae for the number of separable polynomials when $R = \mathbb{Z}/n$, extending a result of L. Carlitz. For…

Rings and Algebras · Mathematics 2017-03-22 Jason K. C. Polak

For integers $k,t \geq 2$, and $1\leq r \leq t$ let $D_k^\times(r,t;n)$ be the number of parts among all $k$-indivisible partitions of $n$ (i.e., partitions where all parts are not divisible by $k$) of $n$ that are congruent to $r$ modulo…

Combinatorics · Mathematics 2025-09-30 Faye Jackson , Misheel Otgonbayar

Some new necessary conditions for the existence of vector space partitions are derived. They are applied to the problem of finding the maximum number of spaces of dimension t in a vector space partition of V(2t,q) that contains m_d spaces…

Combinatorics · Mathematics 2011-05-24 Olof Heden , Juliane Lehmann

Several properly countable unions of algebraic sets in $\mathbb{C}^n$ are definable in $\mathbb{C}(t)$ including the set CM of $j$-invariants of complex elliptic curves with complex multiplication. It has been suggested that one could prove…

Logic · Mathematics 2025-08-26 Thomas Scanlon

An internal partition of an $n$-vertex graph $G=(V,E)$ is a partition of $V$ such that every vertex has at least as many neighbors in its own part as in the other part. It has been conjectured that every $d$-regular graph with $n>N(d)$…

Combinatorics · Mathematics 2013-07-22 Amir Ban , Nati Linial

Motivated by Amdeberhan's conjecture on $(t,t+1)$-core partitions with distinct parts, various results on the numbers, the largest sizes and the average sizes of simultaneous core partitions with distinct parts were obtained by many…

Combinatorics · Mathematics 2017-09-05 Huan Xiong

This article examines noncrossing partitions of the unit circle in the complex plane; we call these continuous noncrossing partitions. More precisely, we focus on the degree-$d$ continuous noncrossing partitions where unit complex numbers…

Group Theory · Mathematics 2025-07-02 Michael Dougherty , Jon McCammond

Enumeration of pattern-avoiding objects is an active area of study with connections to such disparate regions of mathematics as Schubert varieties and stack-sortable sequences. Recent research in this area has brought attention to colored…

Combinatorics · Mathematics 2012-06-15 Adam M. Goyt , Lara K. Pudwell

Recent progress building on the groundbreaking work of Mabillard and Wagner has shown that there are important differences between the affine and continuous theory for Tverberg-type results. These results aim to describe the intersection…

Combinatorics · Mathematics 2017-02-20 Florian Frick

A class of random discrete distributions $P$ is introduced by means of a recursive splitting of unity. Assuming supercritical branching, we show that for partitions induced by sampling from such $P$ a power growth of the number of blocks is…

Probability · Mathematics 2007-05-23 Alexander V. Gnedin , Yuri Yakubovich

The elements of a finite partial order $P$ can be identified with the maximal indecomposable two-sided ideals of its incidence algebra $\A$, and then for two such ideals, $I\prec J \iff IJ \not=0$. This offers one way to recover a poset…

Combinatorics · Mathematics 2009-11-10 Rafael D. Sorkin

For which (first-order complete, usually countable) $T$ do there exist non-isomorphic models of $T$ which become isomorphic after forcing with a forcing notion $\mathbb{P}$? Necessarily, $\mathbb{P}$ is non-trivial; i.e.~it adds some new…

Logic · Mathematics 2025-07-03 Saharon Shelah

Let $I(X,R)$ be the incidence algebra of the preordered set $X$ over the ring $R$. In the case of a finite connected partially ordered set $X$, we prove that the subgroup of inner multiplicative automorphisms is a direct factor of the group…

Rings and Algebras · Mathematics 2024-02-01 Evgenii Kaigorodov , Piotr Krylov , Askar Tuganbaev

We describe geometrically and algebraically the set of unattainable points for the Rational Hermite Interpolation Problem (i.e. those points where the problem does not have a solution). We show that this set is a union of equidimensional…

Commutative Algebra · Mathematics 2017-10-03 Cortadellas Teresa , D'Andrea Carlos , Montoro Eulalia

Conjectures involving infinite families of restricted partition congruences can be difficult to verify for a number of individual cases, even with a computer. We demonstrate how the machinery of Radu's algorithm may be modified and employed…

Number Theory · Mathematics 2021-12-08 Cristian-Silviu Radu , Nicolas Allen Smoot

The unrestricted T-system is a family of relations in the Grothendieck ring of the category of the finite-dimensional modules of the Yangian or the quantum affine algebra associated with a complex simple Lie algebra. The unrestricted…

Quantum Algebra · Mathematics 2010-05-26 Rei Inoue , Osamu Iyama , Atsuo Kuniba , Tomoki Nakanishi , Junji Suzuki

Recently, Rattan and the first author (Ann. Comb. 25 (2021) 697-728) proved a conjectured inequality of Berkovich and Uncu (Ann. Comb. 23 (2019) 263-284) concerning partitions with an impermissible part. In this article, we generalize this…

Combinatorics · Mathematics 2022-12-01 Damanvir Singh Binner , Neha Gupta , Manoj Upreti

In this paper, we introduce a natural geometric extension of the partition function. More precisely, we investigate the problem of counting partitions of a rectangle into rectangular blocks with integer sides. Here, two partitions of a…

Combinatorics · Mathematics 2025-10-02 Krystian Gajdzica , Robin Visser , Maciej Zakarczemny

The avoidability, or unavoidability of patterns in words over finite alphabets has been studied extensively. A word (pattern) over a finite set is said to be unavoidable if, for all but finitely many words, there exists a morphism mapping…

Formal Languages and Automata Theory · Computer Science 2019-07-16 Paul Sauer