Related papers: A refinement of the Sylvester problem: Probabiliti…

This paper makes a combinatorial study of the two monoids and the two types of tableaux that arise from the two possible generalizations of the Patience Sorting algorithm from permutations (or standard words) to words. For both types of…

We prove a general theorem providing smoothed analysis estimates for conic condition numbers of problems of numerical analysis. Our probability estimates depend only on geometric invariants of the corresponding sets of ill-posed inputs.…

The $k$-tiling problem for a convex polytope $P$ is the problem of covering $\mathbb R^d$ with translates of $P$ using a discrete multiset $\Lambda$ of translation vectors, such that every point in $\mathbb R^d$ is covered exactly $k$…

Randomized higher-order computation can be seen as being captured by a lambda calculus endowed with a single algebraic operation, namely a construct for binary probabilistic choice. What matters about such computations is the probability of…

A $\delta$-vector $\delta(\Pc)= (\delta_0, \delta_1, ..., \delta_d)$ is called shifted symmetric if $\delta_{d-i} = \delta_{i+1}$ for each $0 \leq i \leq [(d-1)/2]$. A natural family of $(0,1)$-polytopes with shifted symmetric…

Consider an n-dimensional projective toric variety X defined by a convex lattice polytope P. David Cox introduced the toric residue map given by a collection of n+1 divisors Z_0,...,Z_n on X. In the case when the Z_i are T-invariant…

Let $P$ be a bounded convex subset of $\mathbb R^n$ of positive volume. Denote the smallest degree of a polynomial $p(X_1,\dots,X_n)$ vanishing on $P\cap\mathbb Z^n$ by $r_P$ and denote the smallest number $u\geq0$ such that every function…

The compound decision problem for a vector of independent Poisson random variables with possibly different means has half a century old solution. However, it appears that the classical solution needs smoothing adjustment even when there are…

In this paper, we proposed an interesting problem that might be classified into enumerative combinatorics. Featuring a distinctive two-fold dependence upon the sequences' terms, our problem can be really difficult, which calls for novel…

For an integer $m\geq 1$, a combinatorial manifold $\widetilde{M}$ is defined to be a geometrical object $\widetilde{M}$ such that for $\forall p\in\widetilde{M}$, there is a local chart $(U_p,\phi_p)$ enable $\phi_p:U_p\to…

The smoothed analysis of algorithms is concerned with the expected running time of an algorithm under slight random perturbations of arbitrary inputs. Spielman and Teng proved that the shadow-vertex simplex method has polynomial smoothed…

We consider an extended version of Horn's problem: given two orbits $\mathcal{O}_\alpha$ and $\mathcal{O}_\beta$ of a linear representation of a compact Lie group, let $A\in \mathcal{O}_\alpha$, $B\in \mathcal{O}_\beta$ be independent and…

We show that the problem of finding the simplex of largest volume in the convex hull of $n$ points in $\mathbb{Q}^d$ can be approximated with a factor of $O(\log d)^{d/2}$ in polynomial time. This improves upon the previously best known…

This paper considers smooth strongly convex and strongly concave (SC-SC) stochastic saddle point (SSP) problems. Suppose there is an arbitrary oracle that in expectation returns an $\epsilon$-solution in the sense of certain gaps, which can…

We study the problem of binary classification from the point of view of learning convex polyhedra in Hilbert spaces, to which one can reduce any binary classification problem. The problem of learning convex polyhedra in finite-dimensional…

Given independent normally distributed points A,B,C,D in Euclidean 3-space, let Q denote the plane determined by A,B,C and D^ denote the orthogonal projection of D onto Q. The probability that the tetrahedron ABCD is acute remains…

Let P be a convex polytope not simple in general. In the focus of this paper lies a simplicial complex K_P which carries complete information about the combinatorial type of P. In the case when P is simple, K_P is the same as dP*, where P*…

We consider the following geometric optimization problem: find a convex polygon of maximum area contained in a given simple polygon $P$ with $n$ vertices. We give a randomized near-linear-time $(1-\varepsilon)$-approximation algorithm for…

We study a class of hypothesis testing problems in which, upon observing the realization of an $n$-dimensional Gaussian vector, one has to decide whether the vector was drawn from a standard normal distribution or, alternatively, whether…

Let $X$ be a finite set in $Z^d$. We consider the problem of optimizing linear function $f(x) = c^T x$ on $X$, where $c\in Z^d$ is an input vector. We call it a problem $X$. A problem $X$ is related with linear program $\max\limits_{x \in…