English
Related papers

Related papers: Markoff-Lagrange spectrum and extremal numbers

200 papers

We consider the stochastic differential equations of the form \begin{equation*} \begin{cases} dX^ x(t) = \sigma(X(t-)) dL(t) \\ X^ x(0)=x,\quad x\in\mathbb{R}^ d, \end{cases} \end{equation*} where $\sigma:\mathbb{R}^ d\to \mathbb{R}^ d$ is…

Probability · Mathematics 2015-08-20 Pani W. Fernando , Erika Hausenblas , Paul Razafimandimby

This paper is dedicated to the study of two famous subsets of the real line, namely Lagrange spectrum $L$ and Markov spectrum $M$. Our first result, Theorem 2.1, provides a rigorous estimate on the smallest value $t_1$ such that the portion…

Number Theory · Mathematics 2022-08-31 Carlos Matheus , Carlos Gustavo Moreira , Mark Pollicott , Polina Vytnova

A zero-one matrix $M$ is said to contain another zero-one matrix $A$ if we can delete some rows and columns of $M$ and replace some $1$-entries with $0$-entries such that the resulting matrix is $A$. The extremal number of $A$, denoted…

Combinatorics · Mathematics 2024-03-08 Barnabás Janzer , Oliver Janzer , Van Magnan , Abhishek Methuku

Non-stationary approximations of the final value of a converging sequence are discussed, and we show that extremal eigenvalues can be reasonably estimated from the CG iterates without much computation at all. We introduce estimators of…

Numerical Analysis · Mathematics 2013-02-21 Divya Anand Subba , Murugesan Venkatapathi

We establish an asymptotic formula for the number of integer solutions to the Markoff-Hurwitz equation \[ x_{1}^{2}+x_{2}^{2}+\ldots+x_{n}^{2}=ax_{1}x_{2}\ldots x_{n}+k. \] When $n\geq4$ the previous best result is by Baragar (1998) that…

Number Theory · Mathematics 2018-06-14 Alex Gamburd , Michael Magee , Ryan Ronan

We consider three classes of linear differential equations on distribution functions, with a fractional order $\alpha\in [0,1].$ The integer case $\alpha =1$ corresponds to the three classical extreme families. In general, we show that…

Probability · Mathematics 2019-08-05 Lotfi Boudabsa , Thomas Simon , Pierre Vallois

The authors found extremals of arbitrary left-invariant sub-Finsler metric on the Engel group defined by a distribution of rank two. They use for this the Pontryagin Maximum Principle for the corresponding time-optimal problem in…

Differential Geometry · Mathematics 2020-06-12 Valera Berestovskii , Irina Zubareva

Let $X,Y$ be jointly Gaussian vectors, and consider random variables $U,V$ that satisfy the Markov constraint $U-X-Y-V$. We prove an extremal inequality relating the mutual informations between all ${4 \choose 2}$ pairs of random variables…

Information Theory · Computer Science 2014-04-29 Thomas Courtade , Jiantao Jiao

We provide an upper bound on the uniform exponent of approximation to a triple (xi, xi^2, xi^3) by rational numbers with the same denominator, valid for any transcendental real number xi. This upper bound refines a previous result of…

Number Theory · Mathematics 2015-05-13 Damien Roy

In this paper, we obtain some exact $L_2$ Bernstein-Markov inequalities for generalized Hermite and Gegenbauer weight. More precisely, we determine the exact values of the extremal problem $$M_n^2(L_2(W_\lambda),{\rm D}):=\sup_{0\neq…

Classical Analysis and ODEs · Mathematics 2024-11-26 Jiansong Li , Jiaxin Geng , Yun Ling , Heping Wang

Let $p_{n}$ denote the $n$th prime and for any fixed positive integer $k$ and $X\geq 2$, put \[ G_{k}(X):=\max _{p _{n+k}\leq X} \min \{ p_{n+1}-p_{n}, \ldots , p_{n+k}-p_{n+k-1} \}. \] Ford, Maynard and Tao proved that there exists an…

Number Theory · Mathematics 2024-06-06 Keiju Sono

We prove that the number of multigraphs with vertex set $\{1, \ldots, n\}$ such that every four vertices span at most nine edges is $a^{n^2 + o(n^2)}$ where $a$ is transcendental (assuming Schanuel's conjecture from number theory). This is…

Combinatorics · Mathematics 2019-03-27 Dhruv Mubayi , Caroline Terry

Let $\textbf{k} := (k_1,\ldots,k_s)$ be a sequence of natural numbers. For a graph $G$, let $F(G;\textbf{k})$ denote the number of colourings of the edges of $G$ with colours $1,\dots,s$ such that, for every $c \in \{1,\dots,s\}$, the edges…

Combinatorics · Mathematics 2023-12-18 Oleg Pikhurko , Katherine Staden

Motivated by the equation satisfied by the extremals of certain Hardy-Sobolev type inequalities, we show sharp $L^q$ regularity for finite energy solutions of p-laplace equations involving critical exponents and possible singularity on a…

Analysis of PDEs · Mathematics 2007-05-23 Dimiter Vassilev

Let lambda_1, \lambda_2, \lambda_3, \lambda_4 be non-zero real numbers, not all negative, with \lambda_1/\lambda_2 irrational and algebraic. Suppose that \mathcal{V} is a well-spaced sequence and \delta >0. In this paper, it is proved that…

Number Theory · Mathematics 2023-12-12 Yuhui Liu

Given an additively written abelian group $G$ and a set $X\subseteq G$, we let $\mathsf{D}(X)$ denote the Davenport constant of $X$, namely the largest non-negative integer $n$ for which there exists a sequence $x_1, \dots, x_n$ of elements…

Number Theory · Mathematics 2025-10-24 Benjamin Girard , Alain Plagne

We prove the existence of extremals for fractional Moser-Trudinger inequalities in an interval and on the whole real line. In both cases we use blow-up analysis for the corresponding Euler-Lagrange equation, which requires new sharp…

Analysis of PDEs · Mathematics 2019-04-24 Gabriele Mancini , Luca Martinazzi

Let $\Gamma$ be a function that maps two arbitrary graphs $G$ and $H$ to a non-negative real number such that $$\alpha(G^{\boxtimes n})\leq \alpha(H^{\boxtimes n})\Gamma(G,H)^n$$ where $n$ is any natural number and $G^{\boxtimes n}$ is the…

Combinatorics · Mathematics 2024-12-10 Sharareh Alipour , Amin Gohari , Mehrshad Taziki

We determine the optimal constants in the classical inequalities relating the sub-Gaussian norm \(\|X\|_{\psi_2}\) and the sub-Gaussian parameter \(\sigma_X\) for centered real-valued random variables. We show that \(\sqrt{3/8} \cdot…

Probability · Mathematics 2025-07-09 Lasse Leskelä , Matvei Zhukov

For a graph G and an integer t we let mcc_t(G) be the smallest m such that there exists a coloring of the vertices of G by t colors with no monochromatic connected subgraph having more than m vertices. Let F be any nontrivial minor-closed…

Combinatorics · Mathematics 2007-05-23 N. Linial , J. Matousek , O. Sheffet , G. Tardos