Related papers: Turan Extremum Problem for Periodic Function with …
All extremal solutions of the truncated $L$-problem of moments in two real variables , with support contained in a given compact set, are described as characteristic functions of semi-algebraic sets given by a single polynomial inequality.…
The systematic study of Tur\'an-type extremal problems for edge-ordered graphs was initiated by Gerbner et al. arXiv:2001.00849. They conjectured that the extremal functions of edge-ordered forests of order chromatic number 2 are…
Given a positive integer $n$ and an $r$-uniform hypergraph (or $r$-graph for short) $F$, the Turan number $ex(n,F)$ of $F$ is the maximum number of edges in an $r$-graph on $n$ vertices that does not contain $F$ as a subgraph. The extension…
The aim of this paper is to investigate extremum problems with pay-off being the total variational distance metric defined on the space of probability measures, subject to linear functional constraints on the space of probability measures,…
We study inequalities between general integral moduli of continuity of a function and the tail integral of its Fourier transform. We obtain, in particular, a refinement of a result due to D. B. H. Cline [2] (Theorem 1.1 below). We note that…
An effective means to approximate an analytic, nonperiodic function on a bounded interval is by using a Fourier series on a larger domain. When constructed appropriately, this so-called Fourier extension is known to converge geometrically…
Let $f\in \mathbb{Q}(x)$ be a non-constant rational function. We consider "Waring's Problem for $f(x)$," i.e., whether every element of $\bbq$ can be written as a bounded sum of elements of $\{f(a)\mid a\in \mathbb{Q}\}$. For rational…
We extend the work of Narasimhan and Bilmes [30] for minimizing set functions representable as a difference between submodular functions. Similar to [30], our new algorithms are guaranteed to monotonically reduce the objective function at…
We study approximation algorithms for variants of the \emph{median string} problem, which asks for a string that minimizes the sum of edit distances from a given set of $m$ strings of length $n$. Only the straightforward $2$-approximation…
The orthogonal polynomials $p_n$ satisfy Tur\'an's inequality if $p_n^2(x)-p_{n-1}(x)p_{n+1}(x)\ge 0$ for $n\ge 1$ and for all $x$ in the interval of orthogonality. We give general criteria for orthogonal polynomials to satisfy Tur\'an's…
We present quadratically convergent algorithms to compute the extremal value of a real parameter for which a given rational transfer function of a linear time-invariant system is passive. This problem is formulated for both continuous-time…
In this work, we study the classical problem of maximizing a submodular function subject to a matroid constraint. We develop deterministic algorithms that are very parsimonious with respect to querying the submodular function, for both the…
This article presents a strongly polynomial-time algorithm for the general linear programming problem. This algorithm is an implicit reduction procedure that works as follows. Primal and dual problems are combined into a special system of…
We show that any submodular minimization (SM) problem defined on a linear constraint set with constraints having up to two variables per inequality, are 2-approximable in polynomial time. If the constraints are monotone (the two variables…
Tropical polyhedra have been recently used to represent disjunctive invariants in static analysis. To handle larger instances, tropical analogues of classical linear programming results need to be developed. This motivation leads us to…
We establish the best (minimum) constant for Ulam stability of first-order linear $h$-difference equations with a periodic coefficient. First, we show Ulam stability and find the Ulam stability constant for a first-order linear equation…
We give upper bounds on the size of the gap between the constant term and the next non-zero Fourier coefficient of an entire modular form of given weight for \Gamma_0(2). Numerical evidence indicates that a sharper bound holds for the…
A classical Tur\'an problem asks for the maximum possible number of edges in a graph of a given order that does not contain a particular graph $H$ as a subgraph. It is well-known that the chromatic number of $H$ is the graph parameter which…
We establish generalizations of the Nyman-Beurling and B\'aez-Duarte criteria concerning lack of zeros of Dirichlet $L$-functions in the semi-plane $\Re(s) >1/p$ for $p\in (1,2]$. We pose and solve a natural extremal problem for Dirichlet…
The topological Tur\'an number $\mathrm{ex}_{\hom}(n,X)$ of a 2-dimensional simplicial complex $X$ asks for the maximum number of edges in an $n$-vertex 3-uniform hypergraph containing no triangulation of $X$ as a subgraph. We prove that…