English
Related papers

Related papers: Lih Wang and Dittert Conjectures on Permanents

200 papers

Let $M$ be an $n\times n$ matrix with iid subgaussian entries with mean $0$ and variance $1$ and let $\sigma_n(M)$ denote the least singular value of $M$. We prove that \[\mathbb{P}\big( \sigma_{n}(M) \leq \varepsilon n^{-1/2} \big) =…

Probability · Mathematics 2025-01-09 Ashwin Sah , Julian Sahasrabudhe , Mehtaab Sawhney

Integer partitions have long been of interest to number theorists, perhaps most notably Ramanujan, and are related to many areas of mathematics including combinatorics, modular forms, representation theory, analysis, and mathematical…

Number Theory · Mathematics 2020-10-20 Adriana L. Duncan , Simran Khunger , Holly Swisher , Ryan Tamura

Let $\mathcal{D}=(d_n)_{n=1}^\infty$ be a bounded sequence of integers with $d_n\ge 2$ and let $(i, j)$ be a pair of strictly positive numbers with $i+j=1$. We prove that the set of $x \in \RR$ for which there exists some constant $c(x) >…

Number Theory · Mathematics 2014-01-14 Dzmitry Badziahin , Jason Levesley , Sanju Velani

We show that every matrix $A \in \mathbb{R}^{n\times n}$ is at least $\delta$$\|A\|$-close to a real matrix $A+E \in \mathbb{R}^{n\times n}$ whose eigenvectors have condition number at most $\tilde{O}_{n}(\delta^{-1})$. In fact, we prove…

Functional Analysis · Mathematics 2020-05-20 Vishesh Jain , Ashwin Sah , Mehtaab Sawhney

Let $n\in\mathbb{Z}^+$. In [8] we ask the question whether any sequence of $n$ consecutive integers greater than $n^2$ and smaller than $(n+1)^2$ contains at least one prime number, and we show that this is actually the case for every…

Number Theory · Mathematics 2014-06-20 Germán Paz

In this paper we investigate the permanent of $(-1,1)$-matrices over fields of zero characteristics and our main goal is to provide a sharp upper bound for the value of the permanent of such matrices depending on matrix rank, solving Wang's…

Combinatorics · Mathematics 2018-10-11 Mikhail V. Budrevich , Alexander E. Guterman

Given two $\left( n+1\right) \times\left( n+1\right)$-matrices $A$ and $B$ over a commutative ring, and some $k\in\left\{ 0,1,\ldots,n\right\}$, we consider the $\dbinom{n}{k}\times\dbinom{n}{k}$-matrix $W$ whose entries are $\left(…

Rings and Algebras · Mathematics 2026-04-16 Darij Grinberg

A classic conjecture of F\"{u}redi, Kahn and Seymour (1993) states that given any hypergraph with non-negative edge weights $w(e)$, there exists a matching $M$ such that $\sum_{e \in M} (|e|-1+1/|e|)\, w(e) \geq w^*$, where $w^*$ is the…

Combinatorics · Mathematics 2023-10-13 Nikhil Bansal , David G. Harris

A modified totient function ($\phi_2$) is seen to play a significant role in the study of the twin prime distribution. The function is defined as $\phi_2(n):=\#\{a\le n ~\vert ~\textrm{$a(a+2)$ is coprime to $n$}\}$ and is shown here to…

Number Theory · Mathematics 2023-07-21 Shaon Sahoo

In a recent advance towards the Prime $k$-tuple Conjecture, Maynard and Tao have shown that if $k$ is sufficiently large in terms of $m$, then for an admissible $k$-tuple $\mathcal{H}(x) = \{gx + h_j\}_{j=1}^k$ of linear forms in…

Number Theory · Mathematics 2014-10-21 William D. Banks , Tristan Freiberg , Caroline L. Turnage-Butterbaugh

We study the number of $s$-element subsets $J$ of a given abelian group $G$, such that $|J+J|\leq K|J|$. Proving a conjecture of Alon, Balogh, Morris and Samotij, and improving a result of Green and Morris, who proved the conjecture for $K$…

Combinatorics · Mathematics 2019-05-06 Marcelo Soares Campos

In 1994 Drew, Johnson and Loewy conjectured that for $n \ge 4$, the cp-rank of any $n\times n$ completely positive matrices is at most $\lfloor{n^2}/{4}\rfloor$. Recently this conjecture has been proved for $n=5$ and disproved for $n\ge 7$,…

Optimization and Control · Mathematics 2017-06-02 Naomi Shaked-Monderer

We show that Lieb's concavity theorem holds more generally for any unitary invariant matrix function $\phi:\mathbf{H}_+^n\rightarrow \mathbb{R}_+^n$ that is concave and satisfies H\"older's inequality. Concretely, we prove the joint…

Functional Analysis · Mathematics 2019-05-08 De Huang

Let $p$ be prime and $X$ be a Haar-random $n \times n$ matrix over $\mathbb{Z}_{p}$, the ring of $p$-adic integers. Let $P_{1}(t), \dots, P_{l}(t) \in \mathbb{Z}_{p}[t]$ be monic polynomials of degree at most $2$ whose images modulo $p$ are…

Number Theory · Mathematics 2022-01-24 Gilyoung Cheong , Nathan Kaplan

A simple graph $G$ is \emph{overfull} if $|E(G)|>\Delta\lfloor|V(G)|/2\rfloor$. By the pigeonhole principle, every overfull graph $G$ has $\chi'(G)>\Delta$. The \emph{core} of a graph, denoted $G_\Delta$, is the subgraph induced by its…

Combinatorics · Mathematics 2019-11-18 Daniel W. Cranston , Landon Rabern

Erd\H{o}s proved that $\mathcal{F}(A) := \sum_{a \in A}\frac{1}{a\log a}$ converges for any primitive set of integers $A$ and later conjectured this sum is maximized when $A$ is the set of primes. Banks and Martin further conjectured that…

Number Theory · Mathematics 2020-07-07 Andrés Gómez-Colunga , Charlotte Kavaler , Nathan McNew , Mirilla Zhu

The walk matrix of an $n$-vertex graph $G$ with adjacency matrix $A$, denoted by $W(G)$, is $[e,Ae,\ldots,A^{n-1}e]$, where $e$ is the all-ones vector. Let $G\circ P_m$ be the rooted product of $G$ and a rooted path $P_m$ (taking an…

Combinatorics · Mathematics 2024-10-04 Wei Wang , Zhidan Yan , Lihuan Mao

We study the set D of positive integers d for which the equation $\phi(a)-\phi(b)=d$ has infinitely many solution pairs (a,b), where $\phi$ is Euler's totient function. We show that the minumum of D is at most 154, exhibit a specific A so…

Number Theory · Mathematics 2022-07-05 Kevin Ford , Sergei Konyagin

In 1963, Dirac proved that every $n$-vertex graph has $k$ vertex-disjoint triangles if $n\geq 3k$ and minimum degree $\delta(G)\geq \frac{n+k}{2}$. The base case $n=3k$ can be reduced to the Corr\'adi-Hajn\'al Theorem. Towards a rainbow…

Combinatorics · Mathematics 2025-10-03 Xu Liu , Bo Ning , Yuting Tian

We prove that there are infinitely many $n$ such that $\omega(n+k) \ll \log k$ for all integers $k \ge 2$. This improves on a result of Tao-Ter\"{a}v\"{a}inen (2025), who has $O(k)$ in place of $O(\log k)$. As corollaries, we make progress…

Number Theory · Mathematics 2026-04-17 Cheuk Fung Lau