English
Related papers

Related papers: Turan Extremum Problem for Periodic Function with …

200 papers

The century old extremal problem, solved by Carath\'eodory and Fej\'er, concerns a nonnegative trigonometric polynomial normalized by a0 = 1, and the quantity to be maximized is the coefficient a1. In the complex exponential form, the…

Analysis of PDEs · Mathematics 2015-05-05 Sándor Krenedits , Szilárd Gy. Révész

We discuss approximation of extremal functions by polynomials in the weighted Bergman spaces $A^p_\alpha$ where $-1 < \alpha < 0$ and $-1 < \alpha < p-2$. We obtain bounds on how close the approximation is to the true extremal function in…

Complex Variables · Mathematics 2017-05-19 Timothy Ferguson

We study the following question posed by Turan. Suppose K is a convex body in Euclidean space which is symmetric with respect to the origin. Of all positive definite functions supported in K, and with value 1 at the origin, which one has…

Classical Analysis and ODEs · Mathematics 2007-05-23 Mihail N. Kolountzakis , Szilard Gy. Revesz

For any quantity of interest in a system governed by ordinary differential equations, it is natural to seek the largest (or smallest) long-time average among solution trajectories, as well as the extremal trajectories themselves. Upper…

Dynamical Systems · Mathematics 2019-04-16 Ian Tobasco , David Goluskin , Charles R. Doering

We study some approximation problems on a strict subset of the circle by analytic functions of the Hardy space H2 of the unit disk (in C), whose modulus satisfy a pointwise constraint on the complentary part of the circle. Existence and…

Functional Analysis · Mathematics 2009-11-10 Laurent Baratchart , Juliette Leblond , Fabien Seyfert

We study a class of mean curvature equations $-\mathcal Mu=H+\lambda u^p$ where $\mathcal M$ denotes the mean curvature operator and for $p\geq 1$. We show that there exists an extremal parameter $\lambda^*$ such that this equation admits a…

Analysis of PDEs · Mathematics 2010-04-15 Antoine Mellet , Julien Vovelle

We solve two continuous extremal problems on the classes of monotone functions: in the first problem we find extremal values for a line integral of a coordinate-wise monotone function of two variables from a rearrange\-ment-invariant class…

Functional Analysis · Mathematics 2026-03-03 Oleg Kovalenko

The paper is devoted to the study of the unconditional extremal problem for a fractional linear integral functional defined on a set of probability distributions. In contrast to results proved earlier, the integrands of the integral…

Optimization and Control · Mathematics 2019-06-14 Peter Shnurkov , Kseniia Adamova

We obtain extremal majorants and minorants of exponential type for a class of even functions on $\R$ which includes $\log |x|$ and $|x|^\alpha$, where $-1 < \alpha < 1$. We also give periodic versions of these results in which the majorants…

Classical Analysis and ODEs · Mathematics 2011-06-06 Emanuel Carneiro , Jeffrey D. Vaaler

Let \( \mathcal{F} \) be a family of graphs. The generalized Tur\'an number \( \operatorname{ex}(n, K_r, \mathcal{F}) \) is the maximum number of $K_r$ in an \( n \)-vertex graph that does not contain any member of \( \mathcal{F} \) as a…

Combinatorics · Mathematics 2025-03-18 Yongchun Lu , Liying Kang , Yisai Xue

The purpose of [1] was as follows. ?We consider special sets of continuants which occur in applications. For these sets we solve the problem of finding maximal and minimal continuants. There are several methods for finding extremum such as…

Number Theory · Mathematics 2021-06-08 I. D. Kan

Caro and Yuster (Electronic J.Comb 7 (2000)) studied a generalization of the Turan problem, where a certain function (instead of the size) of an F-free graph of order n has to be maximized. We prove that for a wide class of functions the…

Combinatorics · Mathematics 2007-05-23 Oleg Pikhurko

We consider continuous linear programs over a continuous finite time horizon $T$, with a constant coefficient matrix, linear right hand side functions and linear cost coefficient functions, where we search for optimal solutions in the space…

Optimization and Control · Mathematics 2019-05-02 Evgeny Shindin , Gideon Weiss

Our main goal is to investigate supercritical Hardy-Sobolev type inequalities with a logarithmic term and their corresponding variational problem. We prove the existence of extremal functions for the associated variational problem, despite…

Analysis of PDEs · Mathematics 2025-05-14 José Francisco de Oliveira , Jeferson Silva

The Tur\'{a}n problem asks for the largest number of edges ex$(n,H)$ in an $n$-vertex graph not containing a fixed forbidden subgraph $H$, which is one of the most important problems in extremal graph theory. However the order of magnitude…

Combinatorics · Mathematics 2024-08-06 Tao Zhang , Zixiang Xu , Gennian Ge

Suppose $[\mu]_{T(\Delta)}$ is a point of the universal Teichm\"uller space $T(\Delta)$. In 1998, it was shown by Bo\v{z}in et al. that there exists $\mu$ such that $\mu$ has non-constant modulus and is uniquely extremal in…

Complex Variables · Mathematics 2009-01-24 Guowu Yao

A convenient framework for dealing with asymptotic limit problems of probabilistic nature is provided. These problems include questions such as finding the asymptotic proportion of terms of a sequence falling inside a given interval, or the…

History and Overview · Mathematics 2024-04-08 Michaël Bensimhoun

We investigate natural Tur\'an problems for mixed graphs, generalizations of graphs where edges can be either directed or undirected. We study a natural \textit{Tur\'an density coefficient} that measures how large a fraction of directed…

Combinatorics · Mathematics 2024-03-26 Nitya Mani , Edward Yu

We use an estimate for character sums over finite fields of Katz to solve open problems of Montgomery and Turan. Let h=>2 be an integer. We prove that inf_{|z_k| => 1} max_{v=1,...,n^h} |sum_{k=1}^n z_k^v| <= (h-1+o(1)) sqrt n. This gives…

Number Theory · Mathematics 2007-07-11 Johan Andersson

Let $\mathcal{F}$ be a family of $r$-graphs. The Tur\'an number $ex_r(n;\mathcal{F})$ is defined to be the maximum number of edges in an $r$-graph of order $n$ that is $\mathcal{F}$-free. The famous Erd\H{o}s Matching Conjecture shows that…

Combinatorics · Mathematics 2018-12-11 Jian Wang , Weihua Yang