Related papers: A note on the subadditivity problem for maximal sh…
Residual finiteness growth gives an invariant that indicates how well-approximated a finitely generated group is by its finite quotients. We briefly survey the state of the subject. We then improve on the best known upper and lower bounds…
In this paper a new variational approach concerning functions (continuous) over Hilbert spaces is presented.
We consider semidefinite programming (SDP) approaches for solving the maximum satisfiability problem (MAX-SAT) and the weighted partial MAX-SAT. It is widely known that SDP is well-suited to approximate the (MAX-)2-SAT. Our work shows the…
We present an optimization problem emerging from optimal control theory and situated at the intersection of fractional programming and linear max-min programming on polytopes. A na\"ive solution would require solving four nested, possibly…
We present a practical and powerful new framework for both unconstrained and constrained submodular function optimization based on discrete semidifferentials (sub- and super-differentials). The resulting algorithms, which repeatedly compute…
Sums of translates generalize logarithms of weighted algebraic polynomials. The paper presents the solution to the minimax and maximin problems on the real axis for sums of translates. We prove that there is a unique function that is…
We investigate the continuous non-monotone DR-submodular maximization problem subject to a down-closed convex solvable constraint. Our first contribution is to construct an example to demonstrate that (first-order) stationary points can…
The aim of this paper is to describe some partial advances in the solution of the following two problems. Find the maximal order of vanishing at infinity of a non-zero Drinfeld quasi-modular form of given weight. Determine differential…
We consider the possible sizes of large sumfree sets contained in the discrete hypercube $\{1,...,n\}^k$, and we determine upper and lower bounds for the maximal size as $n$ becomes large. We also discuss a continuous analogue in which our…
In this paper, we present the concept of subdifferential for fuzzy n-cell number valued functions. Then we state some theorems related to subdifferentiability based on the new definition. Finally, we present some applications emphasized on…
We collect some open problems about minimal presentations of numerical semigroups and, more generally, about defining ideals and free resolutions of their semigroup rings and associated graded rings. We emphasize both long-standing problems…
In this paper, we consider certain finite sums related to the "largest odd divisor", and we obtain, using simple ideas and recurrence relations, sharp upper and lower bounds for these sums.
Recently there has been renewed interests in derivative free approaches to stochastic optimization. In this paper, we examine the rates of convergence for the Kiefer-Wolfowitz algorithm and the mirror descent algorithm, under various…
In this work we study weighted total least squares problems on infinite dimensional spaces. We show that in most cases this problem does not admit a solution (except in the trivial case) and then, we consider a regularization on the…
We study the parametrized complexity of fundamental relations between multidimensional subshifts, such as equality, conjugacy, inclusion, and embedding, for subshifts of finite type (SFTs) and effective subshifts. We build on previous work…
More precise estimation of the greedy algorithm complexity for a special case of the set cover problem is given in this paper.
We propose some adaptive mirror descent dethods for convex programming problems with delta-subgradients and prove some theoretical results.
We study the problem concerning the variation of the Hardy-Littlewood maximal function in higher dimensions. As the main result, we prove that the variation of the non-centered Hardy-Littlewood maximal function of a radial function is…
A coordinate-free proof of the Maximum Principle is provided in the specific case of an optimal control problem with fixed time. Our treatment heavily relies on a special notion of variation of curves that consist of a concatenation of…
We give a number of approximation metatheorems for monotone maximization problems expressible in the first-order logic, in substantially more general settings than the previously known. We obtain * constant-factor approximation algorithm in…