Related papers: Bounding extremal functions of forbidden $0-1$ mat…

We give alternative definitions of the boundary relative extremal function and show that Edwards' theorem does not hold in open sets.

We study a general class of functionals providing an analytic handle on the conformal bootstrap equations in one dimension. We explicitly identify the extremal functionals, corresponding to theories saturating conformal bootstrap bounds, in…

Let $up(r, t) = (a_1 a_2 \dots a_r)^t$. We investigate the problem of determining the maximum possible integer $n(r, t)$ for which there exist $2t-1$ permutations $\pi_1, \pi_2, \dots, \pi_{2t-1}$ of $1, 2, \dots, n(r, t)$ such that the…

The aim of this paper is to give an effective version of the Strong Artin Approximation Theorem for binomial equations. First we give an effective version of the Greenberg Approximation Theorem for polynomial equations, then using the…

Saturation problems for forbidden graphs have been a popular area of research for many decades, and recently Brualdi and Cao initiated the study of a saturation problem for 0-1 matrices. We say that 0-1 matrix $A$ is saturating for the…

In this paper we find extremal one-sided approximations of exponential type for a class of truncated and odd functions with a certain exponential subordination. These approximations optimize the $L^1(\mathbb{R}, |E(x)|^{-2}dx)$-error, where…

We study the question of the existence of a dual extremal function for a bounded matrix function on the unit circle in connection with the problem of approximation by analytic matrix functions. We characterize the class of matrix functions,…

Generalized Davenport-Schinzel sequences are sequences that avoid a forbidden subsequence and have a sparsity requirement on their letters. Upper bounds on the lengths of generalized Davenport-Schinzel sequences have been applied to a…

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…

In this article, we prove the existence of extremal functions in higher-order affine Sobolev inequalities. Proofs rely on concentration-compactness methods in spaces of integer or fractional regularity. The tools we use, available in spaces…

A 0-1 matrix $M$ contains a 0-1 matrix pattern $P$ if we can obtain $P$ from $M$ by deleting rows and/or columns and turning arbitrary 1-entries into 0s. The saturation function $\mathrm{sat}(P,n)$ for a 0-1 matrix pattern $P$ indicates the…

The purpose of this paper is to give explicit methods for bounding the number of vertices of finite $k$-regular graphs with given second eigenvalue. Let $X$ be a finite $k$-regular graph and $\mu_1(X)$ the second largest eigenvalue of its…

The systematic study of Tur\'an-type extremal problems for edge-ordered graphs was initiated by Gerbner et al. in 2020. Here we characterize connected edge-ordered graphs with linear extremal functions and show that the extremal function of…

In this paper, we revisit the problem of classifying real algebraic and semialgebraic sets by their topological types, focusing on establishing the effectiveness of bounds rather than deriving new quantitative estimates. Building on Hardt's…

We show explicit formulas for the evaluation of (possibly higher-order) fractional Laplacians of some functions supported on ellipsoids. In particular, we derive the explicit expression of the torsion function and give examples of…

We examine exponential sums of the form $\sum_{n \le X} w(n) e^{2\pi i\alpha n^k}$, for $k=1,2$, where $\alpha$ satisfies a generalized Diophantine approximation and where $w$ are different arithmetic functions that might be multiplicative,…

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…

The main result of this paper is that for any norm on a complex or real $n$-dimensional linear space, every extremal basis satisfies inverted triangle inequality with scaling factor $2^n-1$. Furthermore, the constant $2^n-1$ is tight. We…

Let $ex(n, P)$ be the maximum possible number of ones in any 0-1 matrix of dimensions $n \times n$ that avoids $P$. Matrix $P$ is called minimally non-linear if $ex(n, P) = \omega(n)$ but $ex(n, P') = O(n)$ for every strict subpattern $P'$…

Let $EG_r(n,k)$ denote the maximum number of edges in an $n$-vertex $r$-uniform hypergraph with no Berge cycles of length $k$ or longer. In the first part of this work, we have found exact values of $EG_r(n,k)$ and described the structure…