Related papers: Feasibility criteria for high-multiplicity partiti…
Concentration bounds are given for throwing balls into bins independently according to a distribution $p$. The probability of a $k$-loaded bin after $m$ balls is shown to be controlled on both sides by $\rho_{m,k} := m \|p\|_k / k$. This…
In the present paper, a robust approach to a special class of convex feasibility problems is considered. By techniques of convex and variational analysis, conditions for the existence of robust feasible solutions and related error bounds…
The article considers one of the possible generalizations of constraint satisfaction problems where relations are replaced by multivalued membership functions. In this case operations of disjunction and conjunction are replaced by maximum…
Team assembly is a problem that demands trade-offs between multiple fairness criteria and computational optimization. We focus on four criteria: (i) fair distribution of workloads within the team, (ii) fair distribution of skills and…
We suggest necessary conditions of soficness of multidimensional shifts formulated in termsof resource-bounded Kolmogorov complexity. Using this technique we provide examples ofeffective and non-sofic shifts on $\mathbb{Z}^2$ with very low…
We extend a general result showing that the asymptotic behavior of high moments, factorial or standard, of random variables, determines the asymptotically normality, from the one dimensional to the multidimensional setting. This approach…
We obtain sufficient conditions for solutions of the $m$th-order differential inequality $$ \sum_{|\alpha| = m} \partial^\alpha a_\alpha (x, u) \ge f (x) g (|u|) \quad \mbox{in } B_1 \setminus \{ 0 \} $$ to have a removable singularity at…
A new game-theoretic approach for combining multiple classifiers is proposed. A short introduction in Game Theory and coalitions illustrate the way any collective decision scheme can be viewed as a competitive game of coalitions that are…
We give the first positive formulas for the weights of every simple highest weight module $L(\lambda)$ over an arbitrary Kac-Moody algebra. Under a mild condition on the highest weight, we also express the weights of $L(\lambda)$ as an…
The aim in packing problems is to decide if a given set of pieces can be placed inside a given container. A packing problem is defined by the types of pieces and containers to be handled, and the motions that are allowed to move the pieces.…
By using a selective filtration argument, we prove that the satisfiability problem of the unimodal logic of density is in $EXPTIME$. By using a tableau-like approach, we prove that the satisfiability problem of the bimodal logic of weak…
We deal with the boundedness properties of higher order commutators related to some generalizations of the multilinear fractional integral operator of order $m$, $I_\alpha ^m$, from a product of weighted Lebesgue spaces into adequate…
Balls are sequentially allocated into $n$ bins as follows: for each ball, an independent, uniformly random bin is generated. An overseer may then choose to either allocate the ball to this bin, or else the ball is allocated to a new…
The problem of existence of adaptive confidence bands for an unknown density $f$ that belongs to a nested scale of H\"{o}lder classes over $\mathbb{R}$ or $[0,1]$ is considered. Whereas honest adaptive inference in this problem is…
We study a fair division problem with indivisible items, namely the computation of maximin share allocations. Given a set of $n$ players, the maximin share of a single player is the best she can guarantee to herself, if she would partition…
We study a stochastic variant of monotone submodular maximization problem as follows. We are given a monotone submodular function as an objective function and a feasible domain defined on a finite set, and our goal is to find a feasible…
For every list of integers x_1, ..., x_m there is some j such that x_1 + ... + x_j - x_{j+1} - ... - x_m \approx 0. So the list can be nearly balanced and for this we only need one alternation between addition and subtraction. But what if…
The Whitney extension theorem is a classical result in analysis giving a necessary and sufficient condition for a function defined on a closed set to be extendable to the whole space with a given class of regularity. It has been adapted to…
In the fillable array problem one must maintain an array A[1..n] of $w$-bit entries subject to random access reads and writes, and also a $\texttt{fill}(\Delta)$ operation which sets every entry of to some $\Delta\in\{0,\ldots,2^w-1\}$. We…
In this paper, we are interested in the analysis of a well-known free boundary/shape optimization problem motivated by some issues arising in population dynamics. The question is to determine optimal spatial arrangements of favorable and…