English
Related papers

Related papers: On the S-matrix conjecture

200 papers

In 1939 P. Tur\'an started to derive lower estimations on the norm of the derivatives of polynomials of (maximum) norm 1 on $I:=[-1,1]$ (interval) and $D:=\{z\in\mathbb{C}~:~|z|\le 1\}$ (disk), under the normalization condition that the…

Classical Analysis and ODEs · Mathematics 2018-05-15 Polina Yu. Glazyrina , Szilárd Gy. Révész

Barry Simon conjectured in 2005 that the Szeg\H{o} matrices, associated with Verblunsky coefficients $\{\alpha_n\}_{n\in\mathbb{Z}_+}$ obeying $\sum_{n = 0}^\infty n^\gamma |\alpha_n|^2 < \infty$ for some $\gamma \in (0,1)$, are bounded for…

Spectral Theory · Mathematics 2020-12-02 David Damanik , Jake Fillman , Shuzheng Guo , Darren C. Ong

Recently, the weak Drazin inverse and its characterization have been crucial studies for matrices of index k. In this article, we have revisited W-weighted DMP and MPD inverses and constructed a general class of unique solutions to certain…

Rings and Algebras · Mathematics 2026-01-01 Rajesh Senapati , Ashish Kumar Nandi

We study the topological dynamics of H\'enon maps. For a parameter set generalizing the Benedicks-Carleson parameters (the Wang-Young parameter set) we obtain the following: The pruning front conjecture (due to Cvitanovi\'c); A kneading…

Dynamical Systems · Mathematics 2024-12-16 Jan P. Boroński , Sonja Štimac

Let $f_r(d,s_1,\ldots,s_r)$ denote the least integer $n$ such that every $n$-point set $P\subseteq\mathbb{R}^d$ admits a partition $P=P_1\cup\cdots\cup P_r$ with the property that for any choice of $s_i$-convex sets $C_i\supseteq P_i$…

Combinatorics · Mathematics 2025-11-06 Wenchong Chen , Gennian Ge , Yang Shu , Zhouningxin Wang , Zixiang Xu

Different variants of approximate inverse iteration like the locally optimal block preconditioned conjugate gradient method became in recent years increasingly popular for the solution of the large matrix eigenvalue problems arising from…

Numerical Analysis · Mathematics 2016-11-15 Harry Yserentant

Let $G$ be a graph with a perfect matching. Denote by $f(G)$ the minimum size of a matching in $G$ which is uniquely extendable to a perfect matching in $G$. Diwan (2019) proved by linear algebra that for $d$-hypercube $Q_d$ ($d\geq 2)$,…

Combinatorics · Mathematics 2025-02-18 Qiaoyun Shi , Heping Zhang

It is shown that the Ramadanov conjecture implies the Cheng conjecture. In particular it follows that the Cheng conjecture holds in dimension two.

Complex Variables · Mathematics 2007-05-23 Stefan Nemirovski , Rasul Shafikov

We prove that a conjecture of Fomin, Fulton, Li, and Poon, associated to ordered pairs of partitions, holds for many infinite families of such pairs. We also show that the bounded height case can be reduced to checking that the conjecture…

Combinatorics · Mathematics 2009-09-29 Francois Bergeron , Riccardo Biagioli , Mercedes H. Rosas

The Kannan-Lov\'asz-Simonovits conjecture says that the Cheeger constant of any logconcave density is achieved to within a universal, dimension-independent constant factor by a hyperplane-induced subset. Here we survey the origin and…

Probability · Mathematics 2018-07-11 Yin Tat Lee , Santosh S. Vempala

Ledoit and Peche proved convergence of certain functions of a random covariance matrix's resolvent; we refer to this as the Ledoit-Peche law. One important application of their result is shrinkage covariance estimation with respect to…

Statistics Theory · Mathematics 2023-02-28 Van Latimer , Benjamin D. Robinson

We obtain, under an additional assumption on the subanalytic abnormal distribution constructed in [4], a proof of the minimal rank Sard conjecture in the analytic category. It establishes that from a given point the set of points accessible…

Differential Geometry · Mathematics 2025-01-14 A Belotto da Silva , A Parusiński , L Rifford

In the 1970s Muckenhoupt and Wheeden made several conjectures relating two weight norm inequalities for the Hardy-Littlewood maximal operator to such inequalities for singular integrals. Using techniques developed for the recent proof of…

Classical Analysis and ODEs · Mathematics 2013-04-12 David Cruz-Uribe , Kabe Moen

In 1984, Plesn\'{i}k determined the minimum total distance for given order and diameter and characterized the extremal graphs and digraphs. We prove the analog for given order and radius, when the order is sufficiently large compared to the…

Combinatorics · Mathematics 2022-04-19 Stijn Cambie

In 1957, Hadwiger conjectured that every convex body in $\mathbb{R}^d$ can be covered by $2^d$ translates of its interior. For over 60 years, the best known bound was of the form $O(4^d \sqrt{d} \log d)$, but this was recently improved by a…

Metric Geometry · Mathematics 2022-06-23 Marcelo Campos , Peter van Hintum , Robert Morris , Marius Tiba

This paper proves a conjecture proposed by Ren and Li (2015: 393, \emph{Journal of Inequalities and Applications}). Our result eliminates the constraints on the parity and size of $m$, as well as the restriction $x > 1$, required in Ren and…

Classical Analysis and ODEs · Mathematics 2025-09-29 Yongbing Luo , Ping Yan

Let $\lambda_\mathbb{K}(m)$ denote the maximal absolute projection constant over the subspaces of dimension $m$. Apart from the trivial case for $ m=1$, the only known value of $\lambda_\mathbb{K}(m)$ is for $ m=2$ and…

Functional Analysis · Mathematics 2024-02-28 Beata Deregowska , Barbara Lewandowska

This paper makes two contributions towards determining some well-studied optimal constants in Fourier analysis \newa{of Boolean functions} and high-dimensional geometry. \begin{enumerate} \item It has been known since 1994 \cite{GL:94} that…

Computational Complexity · Computer Science 2013-05-06 Anindya De , Ilias Diakonikolas , Rocco A. Servedio

The nearest circulant approximation of a real Toeplitz matrix in the Frobenius norm is derived. This matrix is symmetric. It is proven that symmetric circulant matrices are the only real circulant matrices with all real eigenvalues. The…

Rings and Algebras · Mathematics 2022-08-12 Chris Salahub

Given an input matrix polynomial whose coefficients are floating point numbers, we consider the problem of finding the nearest matrix polynomial which has rank at most a specified value. This generalizes the problem of finding a nearest…

Symbolic Computation · Computer Science 2017-12-13 Mark Giesbrecht , Joseph Haraldson , George Labahn