English
Related papers

Related papers: Saxl Conjecture for triple hooks

200 papers

It is shown that every measurable partition ${A_1,..., A_k}$ of $\mathbb{R}^3$ satisfies $$\sum_{i=1}^k||\int_{A_i} xe^{-\frac12||x||_2^2}dx||_2^2\le 9\pi^2.\qquad(*)$$ Let ${P_1,P_2,P_3}$ be the partition of $\mathbb{R}^2$ into $120^\circ$…

Computational Complexity · Computer Science 2014-04-08 Steven Heilman , Aukosh Jagannath , Assaf Naor

We give a short proof that Strassen's asymptotic rank conjecture implies that for every $\varepsilon > 0$ there exists a $(3/2^{2/3} + \varepsilon)^n$-time algorithm for set cover on a universe of size $n$ with sets of bounded size. This…

Computational Complexity · Computer Science 2023-11-07 Kevin Pratt

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

We show that the number of numerical semigroups with multiplicity three, four or five and fixed genus is increasing as a function in the genus. To this end we use the Kunz polytope for these multiplicities. Counting numerical semigroups…

Combinatorics · Mathematics 2018-03-20 P. A. García-Sánchez , D. Marín-Aragón , A. M. Robles-Pérez

We prove that the Herzog-Sch\"onheim Conjecture holds for any group $G$ of order smaller than $1440$. In other words we show that in any non-trivial coset partition $\{g_i U_i\}_{i=1}^n $ of $G$ there exist distinct $1 \leq i, j \leq n$…

Group Theory · Mathematics 2018-03-12 Leo Margolis , Ofir Schnabel

We define a fat staircase to be a Ferrers diagram corresponding to a partition of the form $(n^{\alpha_n}, {n-1}^{\alpha_{n-1}},..., 1^{\alpha_1})$, where $\alpha = (\alpha_1,...,\alpha_n)$ is a composition, or the $180^\circ$ rotation of…

Combinatorics · Mathematics 2010-03-30 Matthew Morin

Considering Schur positivity of differences of plethysms of homogeneous symmetric functions, we introduce a new relation on integer partitions. This relation is conjectured to be a partial order, with its restriction to one part partitions…

Combinatorics · Mathematics 2022-04-04 Étienne Tétreault

We prove equidistribution of two pairs of statistics on boxed plane partitions: (volume, trace) and (corner-hook volume, number of corners). The proof relies on different 3d visualizations of the corresponding non-intersecting path systems.…

Combinatorics · Mathematics 2026-05-15 Alimzhan Amanov , Damir Yeliussizov

We derive a combinatorial multisum expression for the number $D(n,k)$ of partitions of $n$ with Durfee square of order $k$. An immediate corollary is therefore a combinatorial formula for $p(n)$, the number of partitions of $n$. We then…

Combinatorics · Mathematics 2018-12-05 Yuriy Choliy , Andrew V. Sills

We prove various inequalities between the number of partitions with the bound on the largest part and some restrictions on occurrences of parts. We explore many interesting consequences of these partition inequalities. In particular, we…

Combinatorics · Mathematics 2017-08-08 Alexander Berkovich , Ali K. Uncu

Let $X$ be the number of $k$-term arithmetic progressions contained in the $p$-biased random subset of the first $N$ positive integers. We give asymptotically sharp estimates on the logarithmic upper-tail probability $\log \Pr(X \ge E[X] +…

Probability · Mathematics 2024-09-16 Matan Harel , Frank Mousset , Wojciech Samotij

In this paper, we show that both 12312-avoiding partitions and 12321-avoiding partitions of the set $[n+1]$ are in one-to-one correspondence with Schr\"oder paths of semilength $n$ without peaks at even level. As a consequence, the refined…

Combinatorics · Mathematics 2009-03-09 Sherry H. F. Yan

Let $b_{t,i}(n)$ denote the total number of the $i$ hooks in the $t$-regular partitions of $n$. Singh and Barman (J. Number Theory { 264} (2024), 41--58) raised two conjectures on $b_{t,i}(n)$. The first conjecture is on the positivity of…

Combinatorics · Mathematics 2025-01-24 Wenxia Qu , Wenston J. T. Zang

Let $f: \mathbb{Z}_+\rightarrow \mathbb{Z}_+$ be a polynomial with the property that corresponding to every prime $p$ there exists an integer $\ell$ such that $p\nmid f(\ell)$. In this paper, we establish some equidistributed results…

Number Theory · Mathematics 2021-03-31 Nian Hong Zhou

Given a finite set of points in $\mathbb{R}^d$, Tverberg's theorem guarantees the existence of partitions of this set into parts whose convex hulls intersect. We introduce a graph structured on the family of Tverberg partitions of a given…

Combinatorics · Mathematics 2023-10-13 Deborah Oliveros , Érika Roldán , Pablo Soberón , Antonio J. Torres

An approximate formula for the partitions of Goldbach's Conjecture is derived using Prime Number Theorem and a heuristic probabilistic approach. A strong form of Goldbach's conjecture follows in the form of a lower bounding function for the…

General Mathematics · Mathematics 2007-05-23 Max S. C. Woon

A partition of $n$ is $l$-regular if none of its parts is divisible by $l$. Let $b_l(n)$ denote the number of $l$-regular partitions of $n$. In this paper, using the theory of Hecke eigenforms explored by J.-P. Serre, we establish exact…

Number Theory · Mathematics 2020-06-30 Sarma Abinash

The Three Gap Theorem states that for any $\alpha \in \mathbb{R}$ and $N \in \mathbb{N}$, the fractional parts of $\{ 0\alpha, 1\alpha, \dots, (N - 1)\alpha \}$ partition the unit circle into gaps of at most three distinct lengths. We prove…

Number Theory · Mathematics 2023-04-04 Aneesh Dasgupta , Roland Roeder

Strassen's asymptotic rank conjecture [Progr. Math. 120 (1994)] claims a strong submultiplicative upper bound on the rank of a three-tensor obtained as an iterated Kronecker product of a constant-size base tensor. The conjecture, if true,…

Data Structures and Algorithms · Computer Science 2023-10-19 Andreas Björklund , Petteri Kaski

We study a curious class of partitions, the parts of which obey an exceedingly strict congruence condition we refer to as "sequential congruence": the $m$th part is congruent to the $(m+1)$th part modulo $m$, with the smallest part…

Number Theory · Mathematics 2020-06-09 Maxwell Schneider , Robert Schneider
‹ Prev 1 4 5 6 7 8 10 Next ›