Related papers: A note on partial rejection sampling for the hard …
We consider discretization of the 'geometric cover problem' in the plane: Given a set $P$ of $n$ points in the plane and a compact planar object $T_0$, find a minimum cardinality collection of planar translates of $T_0$ such that the union…
Let $\alpha, \beta \in (0,1)$ such that at least one of them is irrational. We take a random walk on the real line such that the choice of $\alpha$ and $\beta$ has equal probability $1/2$. We prove that almost surely the $\alpha\beta$-orbit…
The Yao-Yao partition theorem states that given a probability measure on an affine space of dimension n having a density which is continuous and bounded away from 0, it is possible to partition the space into 2^n regions of equal measure in…
We shift the perspective on the interval fragmentation problem from division points to division spacings. This leads to a proof that is both simpler and stronger, establishing limiting distributions for partition points and spacings and,…
I examine the phenomenology of particle multiplicity distributions, with special emphasis on the low multiplicities that are a background in the study of rapidity gaps. In particular, I analyze the multiplicity distribution in a rapidity…
We give some sufficient conditions of separation of two sets of integer points by a hyperplane. Our conditions are related to the notion of convexity of sets of integer points and are weaker than existing notions.
The cyclic sieving phenomenon of Reiner, Stanton, and White says that we can often count the fixed points of elements of a cyclic group acting on a combinatorial set by plugging roots of unity into a polynomial related to this set. One of…
Selecting relevant features is an important and necessary step for intelligent machines to maximize their chances of success. However, intelligent machines generally have no enough computing resources when faced with huge volume of data.…
In this paper a measure of non-convexity for a simple polygonal region in the plane is introduced. It is proved that for "not far from convex" regions this measure does not decrease under the Minkowski sum operation, and guarantees that the…
An efficient method for obtaining low-density hyperplane separators in the unsupervised context is proposed. Low density separators can be used to obtain a partition of a set of data based on their allocations to the different sides of the…
The launching process of a magnetically driven outflow from an accretion disk is investigated in a local, shearing box model which allows a study of the feedback between accretion and angular momentum loss. The mass-flux instability found…
Multiple models have been suggested over the years to explain the structure and support of accretion disks around supermassive black holes, from the standard thin thermal-pressure-dominated $\alpha$-disk model to more recent models that…
We give a new proof of a determinant evaluation due to Andrews, which has been used to enumerate cyclically symmetric and descending plane partitions. We also prove some related results, including a q-analogue of Andrews's determinant.
There are two main classes of physics-based models for two-dimensional cellular materials: packings of repulsive disks and the vertex model. These models have several disadvantages. For example, disk interactions are typically a function of…
Numerous soft materials jam into an amorphous solid at high packing fraction. This non-equilibrium phase transition is best understood in the context of a model system in which particles repel elastically when they overlap. Recently,…
We examine the value distributions of coefficients in certain $q$-series related to half Appell sums in higher-level and the first moment of the Garvan's $k$-rank of partitions. We prove that these coefficients equal certain restricted…
We study a well known machine learning model -the perceptron- as a simple model of jamming of hard objects. We exhibit two regimes: 1) a convex optimisation regime where jamming is hypostatic and non-critical. 2) a non convex optimisation…
We present an efficient algorithm for uniformly sampling from an arbitrary compact body $\mathcal{X} \subset \mathbb{R}^n$ from a warm start under isoperimetry and a natural volume growth condition. Our result provides a substantial common…
We consider a generalization of the hyperplane problem to arbitrary measures in place of volume and to sections of lower dimensions. We prove this generalization for unconditional convex bodies and for duals of bodies with bounded volume…
We prove a splitting theorem for Riemannian n-manifolds with scalar curvature bounded below by a negative constant and containing certain area-minimising hypersurfaces (Theorem 3). Thus we generalise [25,Theorem 3] by Nunes. This splitting…