English
Related papers

Related papers: Matrix Waring Problem

200 papers

We find in our quaternionic version of the electroweak theory an apparently hopeless problem: In going from complex to quaternions, the calculation of the real-valued parameters of the CKM matrix drastically changes. We aim to explain this…

High Energy Physics - Theory · Physics 2015-06-26 Stefano De Leo

The $q$-Narayana numbers $N_q(n,k)$ and $q$-Catalan numbers $C_n(q)$ are respectively defined by $$ N_q(n,k)=\frac{1-q}{1-q^n}{n\brack k}{n\brack k-1}\quad\text{and}\quad C_n(q)=\frac{1-q}{1-q^{n+1}}{2n\brack n}, $$ where ${n\brack…

Number Theory · Mathematics 2017-03-02 Victor J. W. Guo , Qiang-Qiang Jiang

This note proves the following inequality: if $n=3k$ for some positive integer $k$, then for any $n$ positive definite matrices $A_1,A_2,\cdots,A_n$, \begin{equation} \frac{1}{n^3}\Big\|\sum_{j_1,j_2,j_3=1}^{n}A_{j_1}A_{j_2}A_{j_3}\Big\|…

Spectral Theory · Mathematics 2018-11-22 Teng Zhang

Let $M_n$ be an $n\times n$ random matrix with i.i.d. Bernoulli(p) entries. We show that there is a universal constant $C\geq 1$ such that, whenever $p$ and $n$ satisfy $C\log n/n\leq p\leq C^{-1}$, \begin{align*} {\mathbb…

Probability · Mathematics 2020-04-08 Alexander E. Litvak , Konstantin E. Tikhomirov

We show that for all $k\ge 1$, there exists an integer $N(k)$ such that for all $n\ge N(k)$ the $k$-th order jet scheme over the commuting $n\times n$ matrix pairs scheme is reducible. At the other end of the spectrum, it is known that for…

Algebraic Geometry · Mathematics 2009-02-23 B. A. Sethuraman , Klemen Šivic

We determine the roots in F_{q^3} of the polynomial X^{2q^k+1} + X + c for each positive integer k and each c in F_q, where q is a power of 2. We introduce a new approach for this type of question, and we obtain results which are more…

Number Theory · Mathematics 2023-02-28 Zhiguo Ding , Michael E. Zieve

For each integer k >= 2, let F(k) denote the largest n for which there exists a permutation \sigma \in S_n, all of whose patterns of length k are distinct. We prove that F(k) = k + \lfloor \sqrt{2k-3} \rfloor + e_k, where e_k \in {-1,0} for…

Combinatorics · Mathematics 2012-06-12 Peter Hegarty

For a periodic function $f$ with bounded variation and integral zero on its period interval, we show that $\sum_{k=1}^\infty c_k^2 (\log\log k)^\gamma <\infty$, $\gamma>4$ implies the almost everywhere convergence of $\sum_{k=1}^\infty c_k…

Classical Analysis and ODEs · Mathematics 2012-11-20 Istvan Berkes

We prove that the known sufficient conditions on the real parameters $(p,q)$ for which the matrix power mean inequality $((A^p+B^p)/2)^{1/p}\le((A^q+B^q)/2)^{1/q}$ holds for every pair of matrices $A,B>0$ are indeed best possible. The proof…

Functional Analysis · Mathematics 2013-04-05 Koenraad M. R. Audenaert , Fumio Hiai

The number of $n \times n$ matrices whose entries are either -1, 0, or 1, whose row- and column- sums are all 1, and such that in every row and every column the non-zero entries alternate in sign, is proved to be $[1!4! >...…

Combinatorics · Mathematics 2008-02-03 Doron Zeilberger

We show that for every positive integer $k$, any tournament can be partitioned into at most $2^{ck}$ $k$-th powers of paths. This result is tight up to the exponential constant. Moreover, we prove that for every $\varepsilon>0$ and every…

Combinatorics · Mathematics 2021-05-27 António Girão , Dániel Korándi , Alex Scott

We have for positive integers $n$, $k$ and finite field $\mathbb{F}_q$, $c(n,k,q)$, as the number of simultaneous similarity classes of $k$-tuples of commuting $n\times n$ matrices over the $\mathbb{F}_q$. In this paper, it has been shown…

Combinatorics · Mathematics 2021-09-29 Uday Bhaskar Sharma

Let E_n={x_i=1, x_i+x_j=x_k, x_i*x_j=x_k: i,j,k \in {1,...,n}}. We prove: (1) there is an algorithm that for every computable function f:N-->N returns a positive integer m(f), for which a second algorithm accepts on the input f and any…

Logic · Mathematics 2013-12-03 Apoloniusz Tyszka

Let $k$ and $n$ be fixed positive integers. For each prime power $q\geqslant k\geqslant 3$, we show that any subset $A\subseteq \mathbb{Z}_q^n$ free of $k$-term arithmetic progressions has size $|A|\leqslant c_k(q)^n$ with a constant…

Number Theory · Mathematics 2016-12-09 Hongze Li

Suppose n >= 2. We show that there is no integer v >= 1 such that for all commutative rings R with identity, every element of the subring J(2^n,R) of R generated by 2^n-th powers can be written in the form \pm f_1^{2^n} \pm \cdots \pm…

Number Theory · Mathematics 2010-07-15 Ted Chinburg

Given $d, N \in \mathbb{N}$, we define $\mathfrak{C}_d(N)$ to be the number of pairs of $d\times d$ matrices $A,B$ with entries in $[-N,N] \cap \mathbb{Z}$ such that $AB = BA$. We prove that $$ N^{10} \ll \mathfrak{C}_3(N) \ll N^{10},$$…

Number Theory · Mathematics 2025-04-23 Jonathan Chapman , Akshat Mudgal

We explore a paradigm which ties together seemingly disparate areas in number theory, additive combinatorics, and geometric combinatorics including the classical Waring problem, the Furstenberg-S\'{a}rk\"{o}zy theorem on squares in sets of…

Combinatorics · Mathematics 2018-08-22 David Covert , Yeşim Demiroğlu Karabulut , Jonathan Pakianathan

We study sums of the form $\sum_{k=m}^n a_{nk} b_{km}$, where $a_{nk}$ and $b_{km}$ are binomial coefficients or unsigned Stirling numbers. In a few cases they can be written in closed form. Failing that, the sums still share many common…

Combinatorics · Mathematics 2025-09-30 Marin Knežević , Vedran Krčadinac , Lucija Relić

For each positive integer $n$, let $g_\Delta(n)$ be the smallest positive integer $g$ such that every complete quadratic polynomial in $n$ variables which can be represented by a sum of odd squares is represented by a sum of at most $g$ odd…

Number Theory · Mathematics 2019-10-18 Daejun Kim

Let $A$ be a matrix with nonnegative real entries. A nonnegative factorization of size $k$ is a representation of $A$ as a sum of $k$ nonnegative rank-one matrices. The space of all such factorizations is a bounded semialgebraic set, and we…

Combinatorics · Mathematics 2018-04-06 Yaroslav Shitov