English
Related papers

Related papers: Sierksma's Dutch Cheese Problem

200 papers

A partition on $[n]$ has a crossing if there exists $i\_1<i\_2<j\_1<j\_2$ such that $i\_1$ and $j\_1$ are in the same block, $i\_2$ and $j\_2$ are in the same block, but $i\_1$ and $i\_2$ are not in the same block. Recently, Chen et al.…

Combinatorics · Mathematics 2009-01-23 Mireille Bousquet-Mélou , Guoce Xin

We study the enumeration of set partitions, according to their length, number of parts, cyclic type, and genus. We introduce genus-dependent Bell, Stirling numbers, and Fa\`a di Bruno coefficients. Besides attempting to summarize what is…

Combinatorics · Mathematics 2024-02-13 Robert Coquereaux , Jean-Bernard Zuber

A Dirichlet $k$-partition of a domain $U \subseteq \mathbb{R}^d$ is a collection of $k$ pairwise disjoint open subsets such that the sum of their first Laplace-Dirichlet eigenvalues is minimal. A discrete version of Dirichlet partitions has…

Statistics Theory · Mathematics 2017-08-21 Braxton Osting , Todd Harry Reeb

We prove the following: there is a primitive recursive function f_-^*(-,-), in the three variables, such that: for every natural numbers t,n>0, and c, for any natural number k>=f^*_t(n,c) the following holds. Assume L is an alphabet with…

Combinatorics · Mathematics 2007-05-23 Saharon Shelah

We prove that if a subset of a $d$-dimensional vector space over a finite field with $q$ elements has more than $q^{d-1}$ elements, then it determines all the possible directions. If a set has more than $q^k$ elements, it determines a…

Classical Analysis and ODEs · Mathematics 2015-07-31 Alex Iosevich , Hannah Morgan , Jonathan Pakianathan

We prove that any finite collection of polygons of equal area has a common hinged dissection. That is, for any such collection of polygons there exists a chain of polygons hinged at vertices that can be folded in the plane continuously…

Computational Geometry · Computer Science 2008-06-12 Timothy G. Abbott , Zachary Abel , David Charlton , Erik D. Demaine , Martin L. Demaine , Scott D. Kominers

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 show that the difference between the number of parts in the odd partitions of $n$ and the number of parts in the distinct partitions of $n$ satisfies Euler's recurrence relation for the partition function $p(n)$ when $n$…

Combinatorics · Mathematics 2020-05-08 Mircea Merca

In connection with an unsolved problem of Bang (1951) we give a lower bound for the sum of the base volumes of cylinders covering a d-dimensional convex body in terms of the relevant basic measures of the given convex body. As an…

Metric Geometry · Mathematics 2011-09-29 Karoly Bezdek , Alexander Litvak

The parity of the partition function $p(n)$ remains strikingly mysterious. Beyond a handful of fragmentary results, essentially nothing is known about the distribution of parity. We prove a uniform result on quadratic progressions. If…

Number Theory · Mathematics 2025-10-06 Ken Ono

Let $m$ be a positive integer and $b_{m}(n)$ be the number of partitions of $n$ with parts being powers of 2, where each part can take $m$ colors. We show that if $m=2^{k}-1$, then there exists the natural density of integers $n$ such that…

Number Theory · Mathematics 2022-12-01 Bartosz Sobolewski , Maciej Ulas

Let $A\subset \N_{+}$ and by $P_{A}(n)$ denotes the number of partitions of an integer $n$ into parts from the set $A$. The aim of this paper is to prove several result concerning the existence of integer solutions of Diophantine equations…

Number Theory · Mathematics 2021-09-27 Szabolcs Tengely , Maciej Ulas

We are studying $d$-dimensional geometric problems that have algorithms with $1-1/d$ appearing in the exponent of the running time, for example, in the form of $2^{n^{1-1/d}}$ or $n^{k^{1-1/d}}$. This means that these algorithms perform…

Data Structures and Algorithms · Computer Science 2016-12-06 Dániel Marx , Anastasios Sidiropoulos

In this paper, we consider the Neumann problem for a class of Hessian quotient equations involving a gradient term on the right-hand side in Euclidean space. More precisely, we derive the interior gradient estimates for the $(\Lambda,…

Analysis of PDEs · Mathematics 2025-01-13 Jiabao Gong , Zixuan Liu , Qiang Tu

We compute the exact thermal partition functions of a massive scalar field on flat spacetime backgrounds of the form $\mathbb R^{d-q}\times \mathbb T^{q+1}$ and show that they possess an ${\rm SL}(q+1,\mathbb Z)$ symmetry. Non-trivial…

High Energy Physics - Theory · Physics 2025-01-06 Ankit Aggarwal , Glenn Barnich

The aim of this note is to provoke discussion concerning arithmetic properties of function $p_{d}(n)$ counting partitions of an positive integer $n$ into $d$-th powers, where $d\geq 2$. Besides results concerning the asymptotic behavior of…

Number Theory · Mathematics 2021-02-11 Maciej Ulas

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

We prove three main conjectures of Berkovich and Uncu (Ann. Comb. 23 (2019) 263--284) on the inequalities between the numbers of partitions of $n$ with bounded gap between largest and smallest parts for sufficiently large $n$. Actually our…

Combinatorics · Mathematics 2020-04-29 Wenston J. T. Zang , Jiang Zeng

Given independent normally distributed points A,B,C,D in Euclidean 3-space, let Q denote the plane determined by A,B,C and D^ denote the orthogonal projection of D onto Q. The probability that the tetrahedron ABCD is acute remains…

Probability · Mathematics 2022-03-22 Steven Finch

We prove new formulas for $p_d(n)$, the number of $d$-ary partitions of $n$, and, also, for its polynomial part. Given a partition $\lambda=(\lambda_1,\ldots,\lambda_{\ell})$, its associated $j$-th symmetric elementary partition,…

Combinatorics · Mathematics 2026-01-15 Mircea Cimpoeas , Roxana Tanase