Related papers: Solution of the propeller conjecture in $\mathbb{R…

The randomized $k$-number partitioning problem is the task to distribute $N$ i.i.d. random variables into $k$ groups in such a way that the sums of the variables in each group are as similar as possible. The restricted $k$-partitioning…

We explicitly calculate the triangle inequalities for the group PSO(8). Therefore we explicitly solve the eigenvalues of sum problem for this group (equivalently describing the side-lengths of geodesic triangles in the corresponding…

We establish the Noether inequality for projective $3$-folds. More precisely, we prove that the inequality $${\rm vol}(X)\geq \tfrac{4}{3}p_g(X)-{\tfrac{10}{3}}$$ holds for all projective $3$-folds $X$ of general type with either…

Assume $\mathsf{M}_n$ is the $n$-dimensional permutation module for the symmetric group $\mathsf{S}_n$, and let $\mathsf{M}_n^{\otimes k}$ be its $k$-fold tensor power. The partition algebra $\mathsf{P}_k(n)$ maps surjectively onto the…

In this paper we study constrained subspace approximation problem. Given a set of $n$ points $\{a_1,\ldots,a_n\}$ in $\mathbb{R}^d$, the goal of the {\em subspace approximation} problem is to find a $k$ dimensional subspace that best…

Let ${\rm rad}(n)$ denote the product of distinct prime factors of an integer $n\geq 1$. The celebrated $abc$ conjecture asks whether every solution to the equation $a+b=c$ in triples of coprime integers $(a,b,c)$ must satisfy ${\rm…

For fixed weights w_1,...,w_n, and for d>0, we let B denote a collection of d*n balls, with d balls of weight w_i for each i=1,...,n. We consider the problem of assigning the balls to n bins with capacities C_1,...,C_n, in such a way that…

Recently, [Phys. Rev. Lett. 130, 221501 (2023)] Jacobson and Visser calculated the quantum partition function of a fixed, finite volume of a region with the topology of a ball in the saddle point approximation within the context of…

We prove a theorem on algebraic osculation and we apply our result to the Computer Algebra problem of polynomial factorization. We consider X a smooth completion of the complex plane and D an effective divisor supported on the boundary of…

In this article, we define and study a geometry and an order on the set of partitions of an even number of objects. One of the definitions involves the partition algebra, a structure of algebra on the set of such partitions depending on an…

The Kochen-Specker no-go theorem established that hidden-variable theories in quantum mechanics necessarily admit contextuality. This theorem is formally stated in terms of the partial Boolean algebra structure of projectors on a Hilbert…

We extend the work of An, Guan and Kleinbock on bounded orbits of diagonalizable flows on $\mathrm{SL}_3(\mathbb{R})/\mathrm{SL}_3(\mathbb{Z})$ to $\mathrm{SL}_3(\mathbb{C})/\mathrm{SL}_3(\mathcal{O}_{\mathbb{K}})$, where $\mathbb{K}$ is an…

We perform a rigorous study of the identical sphere packing problem in $\mathbb{Z}^3$ and of phase transitions in the corresponding hard-core model. The sphere diameter $D>0$ and the fugacity $u\gg 1$ are the varying parameters of the…

Let $R$ be a finite valuation ring of order $q^r$ where $q$ is odd and $A$ be a subset of $R$. In the present paper, we prove that there exists a point $u$ in the Cartesian product set $A\times A\subset R^2$ such that the size of the pinned…

Phase transitions in combinatorial problems have recently been shown to be useful in locating "hard" instances of combinatorial problems. The connection between computational complexity and the existence of phase transitions has been…

Let $X$ be a smooth projective integral variety over a finitely generated field $k$ of characteristic $p>0$. We show that the finiteness of the exponent of the $p$-primary part of $\mathrm{Br}(X_{k^s})^{G_k}$ is equivalent to the Tate…

This is the eighth and final paper in a series giving a proof of the Kepler conjecture, which asserts that the density of a packing of congruent spheres in three dimensions is never greater than $\pi/\sqrt{18}\approx 0.74048...$. This is…

Let $P_{n}$ be a set of $n$ points, including the origin, in the unit square $U = [0,1]^2$. We consider the problem of constructing $n$ axis-parallel and mutually disjoint rectangles inside $U$ such that the bottom-left corner of each…

We prove that every set of $n$ points in $\mathbb{R}^3$ spans $O(n^{295/197+\epsilon})$ unit distances. This is an improvement over the previous bound of $O(n^{3/2})$. A key ingredient in the proof is a new result for cutting circles in…

We revisit the coalition structure generation problem in which the goal is to partition the players into exhaustive and disjoint coalitions so as to maximize the social welfare. One of our key results is a general polynomial-time algorithm…