Related papers: On Freedman's link packings
This is an expository note answering a question posed to us by Richard Stanley, in which we prove a limit shape theorem for partitions of $n$ which maximize the number of subpartitions. The limit shape and the growth rate of the number of…
In this paper, we study online multidimensional bin packing problem when all items are hypercubes. Based on the techniques in one dimensional bin packing algorithm Super Harmonic by Seiden, we give a framework for online hypercube packing…
In this paper, we analyze the simplex method with the largest distance rule and derive upper bounds on the number of different basic feasible solutions generated. The pivoting rule was proposed by Pan [10], and in some cases, it was…
We give a sharp upper bound on the multiplicity of a fake weighted projective space with at worst canonical singularities. This is equivalent to giving a sharp upper bound on the index of the sublattice generated by the vertices of a…
We present new upper bounds on the parameters of batch codes with restricted query size. These bounds are an improvement on the Singleton bound. The techniques for derivations of these bounds are based on the ideas in the literature for…
We give effective bounds on the generation of pushforwards of log-pluricanonical bundles twisted by ample line bundles. This gives a partial answer to a conjecture proposed by Popa and Schnell. We prove two types of statements: first, more…
Motivated by recent work of Bukh and Nivasch on one-sided $\varepsilon$-approximants, we introduce the notion of \emph{weighted $\varepsilon$-nets}. It is a geometric notion of approximation for point sets in $\mathbb{R}^d$ similar to…
In this paper, a new upper bound for the Multiple Knapsack Problem (MKP) is proposed, based on the idea of relaxing MKP to a {\em Bounded Sequential Multiple Knapsack Problem}, i.e., a multiple knapsack problem in which item sizes are…
We study the packing of a large number of congruent and non--overlapping circles inside a regular polygon. We have devised efficient algorithms that allow one to generate configurations of $N$ densely packed circles inside a regular polygon…
We consider systems of "pinned balls," i.e., balls that have fixed positions and pseudo-velocities. Pseudo-velocities change according to the same rules as those for velocities of totally elastic collisions between moving balls. The times…
The construction of optimal line packings in real or complex Euclidean spaces has shown to be a tantalizingly difficult task, because it includes the problem of finding maximal sets of equiangular lines. In the regime where equiangular…
Applying the Riemann geometric machinery of volume estimates in terms of curvature, bounds for the minimal distance of packings/codes in the Grassmann and Stiefel manifolds will be derived and analyzed. In the context of space-time block…
We generalize upper bounds for constant dimension codes containing a lifted maximum rank distance code first studied by Etzion and Silberstein. The proof allows to construct several improved codes.
We continue the study of optimal chordal packings, with emphasis on packing subspaces of dimension greater than one. Following a principle outlined in a previous work, where the authors use maximal affine block designs and maximal sets of…
In this work, we improve upon the guarantees for sparse random embeddings, as they were recently provided and analyzed by Freksen at al. (NIPS'18) and Jagadeesan (NIPS'19). Specifically, we show that (a) our bounds are explicit as opposed…
We present a new algorithm for improving lower bounds on $ex(n;\{C_3,C_4\})$, the maximum size (number of edges) of an $n$-vertex graph of girth at least 5. The core of our algorithm is a variant of a hill-climbing heuristic introduced by…
Evaluation of link prediction methods is a hard task in very large complex networks because of the inhibitive computational cost. By setting a lower bound of the number of common neighbors (CN), we propose a new framework to efficiently and…
We analyze linkage strategies for a set I of webpages for which the webmaster wants to maximize the sum of Google's PageRank scores. The webmaster can only choose the hyperlinks starting from the webpages of I and has no control on the…
Computing the number of realizations of a minimally rigid graph is a notoriously difficult problem. Towards this goal, for graphs that are minimally rigid in the plane, we take advantage of a recently published algorithm, which is the…
We consider a problem posed by Erd\H{o}s, Herzog and Piranian on the maximum product of distances of a point set of order $n$ with a given diameter. We prove that it is sufficient to consider convex polygons and obtain results on the…