Related papers: Integer Subsets with High Volume and Low Perimeter

The fundamental question considered in algorithms on strings is that of indexing, that is, preprocessing a given string for specific queries. By now we have a number of efficient solutions for this problem when the queries ask for an exact…

We study geometric variations of the discriminating code problem. In the \emph{discrete version} of the problem, a finite set of points $P$ and a finite set of objects $S$ are given in $\mathbb{R}^d$. The objective is to choose a subset…

This paper studies the probabilistic function approximation problem over reproducing kernel Hilbert spaces. We show the existence and uniqueness of the optimizer under mild assumptions. Furthermore, we generalize the celebrated representer…

A new initialization method for hidden parameters in a neural network is proposed. Derived from the integral representation of the neural network, a nonparametric probability distribution of hidden parameters is introduced. In this…

Given a set of vectors (the data) in a Hilbert space H, we prove the existence of an optimal collection of subspaces minimizing the sum of the square of the distances between each vector and its closest subspace in the collection. This…

The edge isoperimetric problem for a graph $G$ is to determine, for each $n$, the minimum number of edges leaving any set of $n$ vertices. In general this problem is NP-hard, but exact solutions are known in some special cases, for example…

Integer octagonal constraints (a.k.a. ``Unit Two Variables Per Inequality'' or ``UTVPI integer constraints'') constitute an interesting class of constraints for the representation and solution of integer problems in the fields of constraint…

We develop a new method to estimate the area, and more generally the intrinsic volumes, of a compact subset $X$ of $\mathbb{R}^d$ from a set $Y$ that is close in the Hausdorff distance. This estimator enjoys a linear rate of convergence as…

We consider the family of $\Phi$-Subset problems, where the input consists of an instance $I$ of size $N$ over a universe $U_I$ of size $n$ and the task is to check whether the universe contains a subset with property $\Phi$ (e.g., $\Phi$…

We develop a new approach to address some classical questions concerning the size and structure of integer distance sets. Our main result is that any integer distance set in the Euclidean plane is either very sparse or has all but an…

We explore how the asymptotic structure of a random $n$-term weak integer composition of $m$ evolves, as $m$ increases from zero. The primary focus is on establishing thresholds for the appearance and disappearance of substructures. These…

In this work we show that the prime distribution is deterministic. Indeed the set of prime numbers P can be expressed in terms of two subsets of N using three specific selection rules, acting on two sets of prime candidates. The prime…

We consider the SUBSET SUM problem and its important variants in this paper. In the SUBSET SUM problem, a (multi-)set $X$ of $n$ positive numbers and a target number $t$ are given, and the task is to find a subset of $X$ with the maximal…

In a large class of statistical inverse problems it is necessary to suppose that the transformation that is inverted is known. Although, in many applications, it is unrealistic to make this assumption, the problem is often insoluble without…

Let P denote the set of all primes. Suppose that P_1, P_2, P_3 are three subsets of P with the sum of their lower densities relative to P is greater than 2. We prove that for sufficiently large odd integer n, there exist p_i\in P_i such…

In this paper, we first give a new result characterizing the strongly connected digraphs with a diameter equal to that of their line digraphs. Then, we introduce the concepts of the inner diameter and inner radius of a digraph and study…

In this paper we produce a few continuations of our previous work on partitions into fractions. Specifically, we study strictly increasing integer sequences $\{n_j\}$ such that there are partitions for all integers less than the floor of…

It is well-known that an algorithm exists which approximates the NP-complete problem of Set Cover within a factor of ln(n), and it was recently proven that this approximation ratio is optimal unless P = NP. This optimality result is the…

A density estimation method in a Bayesian nonparametric framework is presented when recorded data are not coming directly from the distribution of interest, but from a length biased version. From a Bayesian perspective, efforts to…

P(n,s) denotes the number of permutations of 1,2,...n that have exactly s sequences. Canfield and Wilf [math.CO/0609704] recently showed that P(n,s) can be written as a sum of s polynomials in n. We determine these polynomials explicitly…