Related papers: A note on the Steinitz Lemma
The Steinitz lemma, a classic from 1913, states that $a_1,\ldots,a_n$, a sequence of vectors in $\R^d$ with $\sum_1^n a_i=0$, can be rearranged so that every partial sum of the rearranged sequence has norm at most $2d\max \|a_i\|$. In the…
We construct variants of the Riemann zeta function with convenient properties and make conjectures about their dynamics; some of the conjectures are based on an analogy with the dynamical system of zeta. More specifically, we study the…
The well-known Leibniz theorem (Leibniz Criterion or alternating series test) of convergence of alternating series is generalized for the case when the absolute value of terms of series are "not absolutely monotonously" convergent to zero.…
Calibrations are a possible tool to validate the minimality of a certain candidate. They have been introduced in the context of minimal surfaces and adapted to the case of Steiner problem in several variants. Our goal is to compare the…
We introduce a variant of the $k$-nearest neighbor classifier in which $k$ is chosen adaptively for each query, rather than supplied as a parameter. The choice of $k$ depends on properties of each neighborhood, and therefore may…
In this note, we derive concentration inequalities for random vectors with subGaussian norm (a generalization of both subGaussian random vectors and norm bounded random vectors), which are tight up to logarithmic factors.
In this note we establish some appropriate conditions for stochastic equality of two random variables/vectors which are ordered with respect to convex ordering or with respect to supermodular ordering. Multivariate extensions of this result…
The main aim of the present note is to consider bounded orthomorphisms between locally solid vector lattices. We establish a version of the remarkable Zannen theorem regarding equivalence between orthomomorphisms and the underlying vector…
We study the least gradient problem in bounded regions with Lipschitz boundary in the plane. We provide a set of conditions for the existence of solutions in non-convex simply connected regions. We assume the boundary data is continuous and…
We study in optimal control the important relation between invariance of the problem under a family of transformations, and the existence of preserved quantities along the Pontryagin extremals. Several extensions of Noether theorem are…
$ $In many optimization problems, a feasible solution induces a multi-dimensional cost vector. For example, in load-balancing a schedule induces a load vector across the machines. In $k$-clustering, opening $k$ facilities induces an…
One important question in the theory of lattices is to detect a shortest vector: given a norm and a lattice, what is the smallest norm attained by a non-zero vector contained in the lattice? We focus on the infinity norm and work with…
We present order reduction results for linear time invariant descriptor systems. Results are given for both forced and unforced systems as well methods for constructing the reduced order systems. Our results establish a precise connection…
The paper explores a new extremality model involving collections of arbitrary families of sets. We demonstrate its applicability to set-valued optimization problems with general preferences, weakening the assumptions of the known results…
The Steinitz constant in dimension $d$ is the smallest value $c(d)$ such that for any norm on $\mathbb{R}^{ d}$ and for any finite zero-sum sequence in the unit ball, the sequence can be permuted such that the norm of each partial sum is…
Stanley's inequalities for partially ordered sets establish important log-concavity relations for sequences of linear extensions counts. Their extremals however, i.e., the equality cases of these inequalities, were until now poorly…
In this paper, we propose a Newton method for unconstrained set optimization problems to find its weakly minimal solutions with respect to lower set-less ordering. The objective function of the problem under consideration is given by…
Via a family of monotone scalar functions, a preorder on a set is extended to its power set and then used to construct a hull operator and a corresponing complete lattice of sets. A function mappping into the preordered set is extended to a…
In ranking problems, the goal is to learn a ranking function from labeled pairs of input points. In this paper, we consider the related comparison problem, where the label indicates which element of the pair is better, or if there is no…
We establish a sharp upper estimate for the order of a canonical system in terms of the Hamiltonian. This upper estimate becomes an equality in the case of Krein strings. As an application we prove a conjecture of Valent about the order of…