English
Related papers

Related papers: Mixed-Mean Inequality for Submatrix

200 papers

We show that any weighted geometric mean of Chebyshev polynomials is bounded from above by another Chebyshev polynomial. We also study a related homogeneous cyclic inequality $$ \left (\sum_{i=1}^n x_i^{(a+b+1)/2} \right )^2 \geq…

Classical Analysis and ODEs · Mathematics 2023-01-03 Mohammad Javaheri , Harry Shen

Let $m_{2}<m_{1}$ be two given nonnegative integers with $n=m_{1}+m_{2}+1$. For suitably differentiable $f$, we let $P,Q\in \pi_{n}$ be the Hermite polynomial interpolants to $f$ which satisfy $P^{(j)}(a)=f^{(j)}(a),j=0,1,...,m_{1}$ and…

Classical Analysis and ODEs · Mathematics 2008-05-20 Alan Horwitz

We study the maximum-average submatrix problem, in which given an $N \times N$ matrix $J$ one needs to find the $k \times k$ submatrix with the largest average of entries. We study the problem for random matrices $J$ whose entries are…

Disordered Systems and Neural Networks · Physics 2024-01-24 Vittorio Erba , Florent Krzakala , Rodrigo Pérez , Lenka Zdeborová

In this paper we employ some operator techniques to establish some refinements and reverses of the Callebaut inequality involving the geometric mean and Hadamard product under some mild conditions. In particular, we show \begin{align*}…

Functional Analysis · Mathematics 2016-04-05 Mojtaba Bakherad

In the kernel clustering problem we are given a (large) $n\times n$ symmetric positive semidefinite matrix $A=(a_{ij})$ with $\sum_{i=1}^n\sum_{j=1}^n a_{ij}=0$ and a (small) $k\times k$ symmetric positive semidefinite matrix $B=(b_{ij})$.…

Data Structures and Algorithms · Computer Science 2009-06-29 Subhash Khot , Assaf Naor

In the present paper we initiate the study of a certain kind of partition inequality, by showing, for example, that if $M\geq 5$ is an integer and the integers $a$ and $b$ are relatively prime to $M$ and satisfy $1\leq a<b<M/2$, and the…

Number Theory · Mathematics 2019-01-09 James Mc Laughlin

Let $F$ be a field and let $F^{r\times s}$ denote the space of $r\times s$ matrices over $F$. Given equinumerous subsets $\mathcal{A}=\{A_i\mid i \in I\}\subseteq F^{r\times r}$ and $\mathcal{B}=\{B_i\mid i\in I\}\subseteq F^{s\times s}$ we…

Combinatorics · Mathematics 2018-03-02 S. P. Glasby , Cheryl E. Praeger

We give a simpler proof of a result of Holland concerning a mixed arithmetic-geometric mean inequality. We also prove a result of mixed mean inequality involving the symmetric means.

Classical Analysis and ODEs · Mathematics 2007-09-18 Peng Gao

We consider $n^2\times n^2$ real symmetric and hermitian matrices $M_n$, which are equal to sum of $m_n$ tensor products of vectors $X^\mu=B(Y^\mu\otimes Y^\mu)$, $\mu=1,\dots,m_n$, where $Y^\mu$ are i.i.d. random vectors from $\mathbb R^n…

Mathematical Physics · Physics 2020-03-11 Daria Tieplova

Let $W_{k,n}^{i}(m)$ denote a matrix with rows and columns indexed by the $k$-subsets and $n$-subsets, respectively, of an $m$-element set. The row $S$, column $T$ entry of $W_{k,n}^{i}(m)$ is $1$ if $|S \cap T| = i$, and is $0$ otherwise.…

Combinatorics · Mathematics 2023-05-09 Joshua E. Ducey , Colby J. Sherwood

Let $n>1$ and $k>0$ be fixed integers. A matrix is said to be level if all its column sums are equal. A level matrix with $m$ rows is called reducible if we can delete $j$ rows, $0<j<m$, so that the remaining matrix is level. We ask if…

Combinatorics · Mathematics 2014-01-24 George Seelinger , Papa Sissokho , Larry Spence , Charles Vanden Eynden

Bidiagonal matrices are widespread in numerical linear algebra, not least because of their use in the standard algorithm for computing the singular value decomposition and their appearance as LU factors of tridiagonal matrices. We show that…

Numerical Analysis · Mathematics 2023-11-14 Nicholas J. Higham

Let $G$ be a graph and let $S(G)$, $M(G)$, and $T(G)$ be the subdivision, the middle, and the total graph of $G$, respectively. Let ${\rm dim}(G)$, ${\rm edim}(G)$, and ${\rm mdim}(G)$ be the metric dimension, the edge metric dimension, and…

Combinatorics · Mathematics 2022-12-07 Ali Ghalavand , Sandi Klavžar , Mostafa Tavakoli , Ismael G. Yero

Given an integer $g$ and also some given integers $m$ (sufficiently large) and $c_1,\dots, c_m$, we show that the number of all non-negative integers $n\le M$ with the property that there exist non-negative integers $k_1,\dots, k_m$ such…

Number Theory · Mathematics 2021-02-04 Dragos Ghioca , Alina Ostafe , Sina Saleh , Igor E. Shparlinski

For $k\geq i\geq 1$, let $B_{k,i}(n)$ denote the number of partitions of $n$ such that part 1 appears at most $i-1$ times, two consecutive integers l and $l+1$ appear at most $k-1$ times and if l and $l+1$ appear exactly $k-1$ times then…

Combinatorics · Mathematics 2012-03-21 William Y. C. Chen , Doris D. M. Sang , Diane Y. H. Shi

Consider S_n, the symmetric group on n letters, and let maj pi denote the major index of a permutation pi in S_n. Given positive integers k,l and nonnegative integers i,j, define m_n^{k,l}(i,j) := number of pi in S_n such that maj pi = i…

Combinatorics · Mathematics 2007-05-23 Helene Barcelo , Bruce Sagan , Sheila Sundaram

In this paper, we establish some nontrivial and effective upper bounds for the least common multiple of consecutive terms of a finite arithmetic progression. Precisely, we prove that for any two coprime positive integers $a$ and $b$, with…

Number Theory · Mathematics 2020-04-17 Sid Ali Bousla

We establish a characterization of almost $P$-matrices via a sign non-reversal property. In this we are inspired by the analogous results for $N$-matrices. Next, the interval hull of two $m \times n$ matrices $A=(a_{ij})$ and $B =…

Rings and Algebras · Mathematics 2020-09-10 Projesh Nath Choudhury , M. Rajesh Kannan

We will show in this text that, for all non-negative integers $n$ and $l$, the following equality is verified: \[\sum_{i=0}^{l} {n-i \choose i}{l+i \choose 2i+1}=\sum_{i=0}^{l} {n-i \choose i-1}{l+i \choose 2i}.\] We will first address the…

Combinatorics · Mathematics 2026-04-28 Flavien Mabilat

Let $A \in \mathbb{Z}^{m \times n}$ be an integral matrix and $a$, $b$, $c \in \mathbb{Z}$ satisfy $a \geq b \geq c \geq 0$. The question is to recognize whether $A$ is $\{a,b,c\}$-modular, i.e., whether the set of $n \times n$…

Optimization and Control · Mathematics 2022-06-15 Christoph Glanzer , Ingo Stallknecht , Robert Weismantel