Related papers: Equicovering masses in the Euclidean plane
What does it mean for a clustering to be fair? One popular approach seeks to ensure that each cluster contains groups in (roughly) the same proportion in which they exist in the population. The normative principle at play is balance: any…
For each integer $k \in [0,9]$, we count the number of plane cubic curves defined over a finite field $\mathbb{F}_q$ that do not share a common component and intersect in exactly $k\ \mathbb{F}_q$-rational points. We set this up as a…
Piecewise Euclidean structures (identified solid Euclidean polyhedra) on topological 3-dimensional manifolds and pseudo-manifolds are constructed so that they admit pseudo-foliations, a generalized type of foliation. The construction of…
We study properties of a category after quotienting out a suitable chosen group of isomorphisms on each object. Coproducts in the original category are described in its quotient by our new weaker notion of a 'phased coproduct'. We examine…
For stacked simplicial complexes, (special subclasses of such are: trees, triangulations of polygons, stacked polytopes), we give an explicit bijection between partitions of facets (for trees: edges), and partitions of vertices into…
The Hurwitz space is a compactification of the space of rational functions of a given degree. We study the intersection of various strata of this space with its boundary. A study of the cohomology ring of the Hurwitz space then allows us to…
In this paper, we obtain upper and lower bounds for the partition function $p(n)$ by using an elementary geometric inequality in Euclidean space, and we extend the method to generalizations of the partition function.
In this paper, we prove a result on the bisection of mass assignments by parallel hyperplanes on Euclidean vector bundles. Our methods consist of the development of a novel lifting method to define the configuration space--test map scheme,…
We consider spaces of multivariate splines defined on a particular type of simplicial partitions that we call (generalized) oranges. Such partitions are composed of a finite number of maximal faces with exactly one shared medial face. We…
The $k$-center problem is a classical clustering problem in which one is asked to find a partitioning of a point set $P$ into $k$ clusters such that the maximum radius of any cluster is minimized. It is well-studied. But what if we add up…
In this paper we introduce, by means of the category of exterior spaces and using a process that generalizes the Alexandroff compactification, an analogue notion of numerable covering of a space in the proper and exterior setting. An…
New bounds on the number of similar or directly similar copies of a pattern within a finite subset of the line or the plane are proved. The number of equilateral triangles whose vertices all lie within an $n$-point subset of the plane is…
We show that the quantum wavefunctional can be seen as a set of classical fields on the 3D space aggregated by a measure. We obtain a complete description of the wavefunctional in terms of classical local beables. With this correspondence,…
We give a uniform and elementary treatment of many classical and new triply periodic minimal surfaces in Euclidean space, based on a Schwarz-Christoffel formula for periodic polygons in the plane. Our surfaces share the property that…
Considering a finite intersection of balls and a finite union of other balls in an Euclidean space, we propose an exact method to test whether the intersection is covered by the union. We reformulate this problem into quadratic programming…
We treat problems of fair division, their various interconnections, and their relations to Sperner's lemma and the KKM theorem as well as their variants. We prove extensions of Alon's necklace splitting result in certain regimes and relate…
In this paper, we consider the problem of covering a plane region with unit discs. We present an improved upper bound and the first nontrivial lower bound on the number of discs needed for such a covering, depending on the area and…
Consensus clustering fuses diverse basic partitions (i.e., clustering results obtained from conventional clustering methods) into an integrated one, which has attracted increasing attention in both academic and industrial areas due to its…
Polynomial factorization in conventional sense is an ill-posed problem due to its discontinuity with respect to coefficient perturbations, making it a challenge for numerical computation using empirical data. As a regularization, this paper…
Euler's partition identity states that the number of partitions of $n$ into odd parts is equal to the number of partitions of $n$ into distinct parts. Strikingly, Straub proved in 2016 that this identity also holds when counting partitions…