Related papers: Fully-projected subsets
Given a basic compact semi-algebraic set $\K\subset\R^n$, we introduce a methodology that generates a sequence converging to the volume of $\K$. This sequence is obtained from optimal values of a hierarchy of either semidefinite or linear…
The recently proposed projection quantization, which is a method to quantize particular subspaces of systems with known quantum theory, is shown to yield a genuine quantization in several cases. This may be inferred from exact results…
A method of Proctor [European J. Combin. 5 (1984), no. 4, 331-350] realizes the set of arbitrary plane partitions in a box and the set of symmetric plane partitions as bases of linear representations of Lie groups. We extend this method by…
In this paper, we consider the feasibility problem, which aims to find a feasible point for the constraint set $\{x \in \mathbb{R}^n: c(x) = 0\}$ over a possibly non-regular subset $\mathcal{X} \subset \mathbb{R}^n$. Under the constraint…
It is proved that the projection constants of two- and three-dimensional spaces are bounded by $4/3$ and $(1+\sqrt 5)/2$, respectively. These bounds are attained precisely by the spaces whose unit balls are the regular hexagon and…
Let $I_M$ and $I_N$ be defining ideals of toric varieties such that $I_M$ is a projection of $I_N$, i.e. $I_N \subseteq I_M$. We give necessary and sufficient conditions for the equality $I_M=rad(I_N+(f_1,...,f_s))$, where $f_1,...,f_s$…
We consider two problems regarding some divisibility properties of the subset sums of a set $A\subseteq \{1, 2, \ldots ,n\}$. At the beginning, we study the cardinality of $A$ which has the following property: For every $d\le n$ there is a…
In projective clustering we are given a set of n points in $R^d$ and wish to cluster them to a set $S$ of $k$ linear subspaces in $R^d$ according to some given distance function. An $\eps$-coreset for this problem is a weighted (scaled)…
For two families of random polytopes we compute explicitly the expected sums of the conic intrinsic volumes and the Grassmann angles at all faces of any given dimension of the polytope under consideration. As special cases, we compute the…
Given an n-tuple {a_1, ..., a_n} of self-adjoint operators on an infinite dimensional Hilbert space H and a positive integer k, there exists a projection p of rank k such that, for each for j = 1, ..., n, pa_jp is a scalar multiple of p.…
This is a little investigation into the classification of complexes of direct sums of line bundles on projective spaces. We consider complexes on projective k-space Pk : O_Pk(-1)^a --> O_Pk^b --> O_Pk(1)^c, with the first map injective and…
Projection algorithms are well known for their simplicity and flexibility in solving feasibility problems. They are particularly important in practice due to minimal requirements for software implementation and maintenance. In this work, we…
Clustering is a fundamental problem in unsupervised machine learning with many applications in data analysis. Popular clustering algorithms such as Lloyd's algorithm and $k$-means++ can take $\Omega(ndk)$ time when clustering $n$ points in…
The long-standing problem of minimal projections is addressed from a computational point of view. Techniques to determine bounds on the projection constants of univariate polynomial spaces are presented. The upper bound, produced by a…
In an earlier paper we showed that we can improve results by Emmy Noether and Alexander Ostrowski concerning the reducibility modulo p of absolutely irreducible polynomials with integer coefficients by giving the problem a geometric turn…
For any finite totally ordered set, the multisets of intervals form an abelian category. Various classes of subcategories admit natural combinatorial descriptions, and counting them yields familiar integer sequences. Surprisingly, in some…
We announce two breakthrough results concerning important questions in the Theory of Computational Complexity. In this expository paper, a systematic and comprehensive geometric characterization of the Subset Sum Problem is presented. We…
Consider the set $\{1,2,\ldots,3n\}$. We are interested in the number of partitions of this set into subsets of three elements each, where the sum of two of them equals the third. We give some criteria such a partition has to fulfill, which…
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…
Dimension profiles were introduced in [8,11] to give a formula for the box-counting and packing dimensions of the orthogonal projections of a set $R^n$ onto almost all $m$-dimensional subspaces. However, these definitions of dimension…