Related papers: Splitting multidimensional necklaces
We propose a discrete approach to solve problems on forming polygons from broken sticks, which is akin to counting polygons with sides of integer length subject to certain Diophantine inequalities. Namely, we use MacMahon's Partition…
We present a new extraction of unpolarized Dihadron Fragmentation Functions, which describe the probability density for an unpolarized parton to fragment into a $\pi^+ \pi^-$ pair. Our analysis is based on data from the BELLE collaboration.…
This paper is devoted to the random generation of particular colored necklaces for which the number of beads of a given color is constrained (these necklaces are called v-balanced). We propose an efficient sampler (its expected time…
We show that every graph $G$ on $n$ vertices with $\delta(G) \geq (1/2+\varepsilon)n$ is spanned by a complete blow-up of a cycle with clusters of nearly uniform size $\Omega(\log n)$. The proof is based on a recently introduced approach…
We use the notion of collapse of generalized indiscernible sequences to classify various model theoretic dividing lines. In particular, we use collapse of n-multi-order indiscernibles to characterize op-dimension n; collapse of…
Alternative novel measures of the distance between any two partitions of a n-set are proposed and compared, together with a main existing one, namely 'partition-distance' D(.,.). The comparison achieves by checking their restriction to…
We observe that the necklace polynomials $M_d(x) = \frac{1}{d}\sum_{e\mid d}\mu(e)x^{d/e}$ are highly reducible over $\mathbb{Q}$ with many cyclotomic factors. Furthermore, the sequence $\Phi_d(x) - 1$ of shifted cyclotomic polynomials…
Many common methods for data analysis rely on linear algebra. We provide new results connecting data analysis error to numerical accuracy, which leads to the first meaningful stopping criterion for two way spectral partitioning. More…
In the early 1980's Mike Freedman showed that all knots with trivial Alexander polynomial are topologically slice (with fundamental group Z). This paper contains the first new examples of topologically slice knots. In fact, we give a…
A hinged dissection of a set of polygons S is a collection of polygonal pieces hinged together at vertices that can be folded into any member of S. We present a hinged dissection of all edge-to-edge gluings of n congruent copies of a…
We consider multi-layered cake cutting in order to fairly allocate numerous divisible resources (layers of cake) among a group of agents under two constraints: contiguity and feasibility. We first introduce a new computational model in a…
The number of partitions of n into parts divisible by a or b equals the number of partitions of n in which each part and each difference of two parts is expressible as a non-negative integer combination of a or b. This generalizes…
We propose a new splitting behavior of tree-level string/particle amplitudes for scalars, gluons and gravitons. We identify certain subspaces in the space of Mandelstam variables, where the universal Koba-Nielsen factor splits into two…
In this paper, the problem of bounding the number of reducible curves in a pencil of algebraic plane curves is addressed. Unlike most of the previous related works, each reducible curve of the pencil is here counted with its appropriate…
Since proof-nets for MLL- were introduced by Girard (1987), several studies have appeared dealing with its soundness proof. Bellin & Van de Wiele (1995) produced an elegant proof based on properties of subnets (empires and kingdoms) and…
Let $G=(V(G), E(G))$ be an undirected graph with a measure function $\mu$ assigning non-negative values to subgraphs $H$ so that $\mu(H)$ does not exceed the clique cover number of $H$. When $\mu$ satisfies some additional natural…
We give a Euclidean division algorithm for the real quadratic fields $\mathbb{Q}(\sqrt{m})$ for $m \in \{2, 3, 6, 7, 11, 19\}$, with the property that the norm of the remainder depends on the first Euclidean minimum of the field. In each…
In 1994, Martin Gardner stated a set of questions concerning the dissection of a square or an equilateral triangle in three similar parts. Meanwhile, Gardner's questions have been generalized and some of them are already solved. In the…
Balogh, Bar\'at, Gerbner, Gy\'arf\'as, and S\'ark\"ozy proposed the following conjecture. Let $G$ be a graph on $n$ vertices with minimum degree at least $3n/4$. Then for every $2$-edge-colouring of $G$, the vertex set $V(G)$ may be…
Given a prime number $p$, the study of divisibility properties of a sequence $c(n)$ has two contending approaches: $p$-adic valuations and superconcongruences. The former searches for the highest power of $p$ dividing $c(n)$, for each $n$;…