Related papers: Continuous Tur\'an numbers

Solutions to conservation laws satisfy the monotonicity property: the number of local extrema is a non-increasing function of time, and local maximum/minimum values decrease/increase monotonically in time. This paper investigates this…

In this paper, we investigate the compactness of extremal functions for a critical singular anisotropic Trudinger-Moser inequality established by Lu-Shen-Xue-Zhu\cite{ref1}. We prove by means of blow-up analysis that the extremals…

We study the extremal function $S^k_d(n)$, defined as the maximum number of regular $(k-1)$-simplices spanned by $n$ points in $\mathbb{R}^d$. For any fixed $d\geq2k\geq6$, we determine the asymptotic behavior of $S^k_d(n)$ up to a…

Let $X$ be a partially ordered set with the property that each family of order intervals of the form $[a,b],[a,\rightarrow )$ with the finite intersection property has a nonempty intersection. We show that every directed subset of $X$ has a…

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…

In this paper our aim is to characterize the set of extreme points of the set of all n-dimensional copulas (n > 1). We have shown that a copula must induce a singular measure with respect to Lebesgue measure in order to be an extreme point…

Let $\{X_{\mathbf{n}} : \mathbf{n}\in\mathbb{Z}^d\}$ be a weakly dependent stationary field with maxima $M_{A} := \sup\{X_{\mathbf{i}} : \mathbf{i}\in A\}$ for finite $A\subset\mathbb{Z}^d$ and $M_{\mathbf{n}} := \sup\{X_{\mathbf{i}} :…

An order-$s$ Davenport-Schinzel sequence over an $n$-letter alphabet is one avoiding immediate repetitions and alternating subsequences with length $s+2$. The main problem is to determine the maximum length of such a sequence, as a function…

Extremal functions for the $n$th coefficient in the Krzy\.z conjecture are atomic singular inner functions with at most $n$ atoms. This paper gives a lower bound on the number of atoms $N$ of the form $N\geq cn$, marking progress toward…

We establish the existence, uniqueness, and $W^{1,2,p}$-regularity of solutions to fully-nonlinear, parabolic obstacle problems when the obstacle is the pointwise supremum of functions in $W^{1,2,p}$ and the nonlinear operator is required…

In this paper we introduce a unifying approach to the generalized Tur\'an problem and supersaturation results in graph theory. The supersaturation-extremal function $satex(n, F : m, G)$ is the least number of copies of a subgraph $G$ an…

For a family of graphs $\mathcal{F}$, the Tur\'{a}n number $ex(n,\mathcal{F})$ is the maximum number of edges in an $n$-vertex graph containing no member of $\mathcal{F}$ as a subgraph. The maximum number of edges in an $n$-vertex connected…

In this paper we shall consider the growth at infinity of a sequence $(P_n)$ of entire functions of bounded orders. Our results extend the results in \cite{trong-tuyen2} for the growth of entire functions of genus zero. Given a sequence of…

Geometrical objects with integral side lengths have fascinated mathematicians through the ages. We call a set $P=\{p_1,...,p_n\}\subset\mathbb{Z}^2$ a maximal integral point set over $\mathbb{Z}^2$ if all pairwise distances are integral and…

Given a graph $H$, the extremal number $\mathrm{ex}(n,H)$ is the largest number of edges in an $H$-free graph on $n$ vertices. We make progress on a number of conjectures about the extremal number of bipartite graphs. First, writing…

Let $\{Z(\tau,s), (\tau,s)\in [a,b]\times[0,T]\}$ with some positive constants $a,b,T$ be a centered Gaussian random field with variance function $\sigma^{2}(\tau,s)$ satisfying $\sigma^{2}(\tau,s)=\sigma^{2}(\tau)$. We firstly derive the…

We discuss the following extremal problem and its relevance to the sum of the so-called superoptimal singular values of a matrix function: Given an $m\times n$ matrix function $\Phi$ on the unit circle $\mathbb{T}$, when is there a matrix…

The VC-dimension of a family P of n-permutations is the largest integer k such that the set of restrictions of the permutations in P on some k-tuple of positions is the set of all k! permutation patterns. Let r_k(n) be the maximum size of a…

Let $\mathcal{H}$ be a set of graphs. The planar Tur\'an number, $ex_\mathcal{P}(n,\mathcal{H})$, is the maximum number of edges in an $n$-vertex planar graph which does not contain any member of $\mathcal{H}$ as a subgraph. When…

For an arbitrary convex function $\Psi:[1,\infty) \to [1,\infty)$, we consider uniqueness in the following two related extremal problems: Problem A boundary value problem: Establish the existence of, and describe the mapping $f$, achieving…