Related papers: Lih Wang and Dittert Conjectures on Permanents

A conjecture of Luo, Tian and Wu (2022) says that for every positive integer $k$ and every finite tree $T$ with bipartition $X$ and $Y$ (denote $t = \max\{|X|,|Y |\})$, every $k$-connected bipartite graph $G$ with $\delta(G) \geq k + t$…

Luo, Tian and Wu conjectured in 2022 that for any tree $T$ with bipartition $X$ and $Y$, every $k$-connected bipartite graph $G$ with $\delta(G) \geq k + t$, where $t = \max\{|X|,|Y |\}$, contains a subtree $T' \cong T$ such that $G-V(T')$…

Motivated by certain questions in physics, Atiyah defined a determinant function which to any set of $n$ distinct points $x_1,..., x_n$ in $\mathbb R^3$ assigns a complex number $D(x_1,..., x_n)$. In a joint work, he and Sutcliffe stated…

Given an arithmetical function $f$, by $f(a, b)$ and $f[a, b]$ we denote the function $f$ evaluated at the greatest common divisor $(a, b)$ of positive integers $a$ and $b$ and evaluated at the least common multiple $[a, b]$ respectively. A…

In 2019, P. Higgins formulated [1] a question about bipartite graphs (see Conjecture 1 below); this question arises in the study of regular finite semigroups. F. V. Petrov formulated [2] another combinatorial conjecture (Conjecture 3);…

In 1847, Kirkman proved that there exists a Steiner triple system on $n$ vertices (equivalently a triangle decomposition of the edges of $K_n$) whenever $n$ satisfies the necessary divisibility conditions (namely $n\equiv 1,3 \mod 6$). In…

We prove a conjectured determinantal inequality: \frac{\det J}{\prod_{i=1}^nJ_{ii}}\le 2(1-\frac{1}{n-1})^{n-1}, where $J$ is a real $n\times n$ ($n\ge 2$) diagonally balanced symmetric matrix.

Dong and Wang in [Theor. Comput. Sci. 771 (2019) 93--98] conjectured that the resulting graph of the $n$-dimensional folded hypercube $FQ_n$ by deleting any perfect matching is isomorphic to the hypercube $Q_n$. In this paper, we show that…

Recently Conrey, Farmer and Zirnbauer conjectured formulas for the averages over a family of ratios of products of shifted L-functions. Their L-functions Ratios Conjecture predicts both the main and lower order terms for many problems,…

We show that for every $r \geq 1$, and all $r$ distinct (sufficiently large) primes $p_1,..., p_r > p_0(r)$, there exist infinitely many integers $n$ such that ${2n \choose n}$ is divisible by these primes to only low multiplicity. From a…

Let $T$ be an $n\times n$ random matrix, such that each diagonal entry $T_{i,i}$ is a continuous random variable, independent from all the other entries of $T$. Then for every $n\times n$ matrix $A$ and every $t\ge0$ $$…

The Frankl conjecture, also known as the union-closed sets conjecture, states that in any finite non-empty union-closed family, there exists an element in at least half of the sets. From an optimization point of view, one could instead…

Recently, Andrews, Chan, Kim and Osburn introduced a $q$-series $h(q)$ for the study of the first positive rank and crank moments for overpartitions. They conjectured that for all integers $m \geq 3$, \begin{equation*}\label{hqcon}…

Strassen's asymptotic rank conjecture [Progr. Math. 120 (1994)] claims a strong submultiplicative upper bound on the rank of a three-tensor obtained as an iterated Kronecker product of a constant-size base tensor. The conjecture, if true,…

Erd\H{o}s and Gy\'arf\'as conjectured in 1994 that every graph with minimum degree at least 3 has a cycle of length a power of 2. In 2022, Gao and Shan (Graphs and Combinatorics) proved that the conjecture is true for $P_8$-free graphs,…

In this paper, certain classes of Hilbert spaces of Dirichlet series with weighted norms and their corresponding multiplier algebras will be explored. For a sequence $\{w_n\}_{n=n_0}^\infty $ of positive numbers, define \[\mathcal…

The BMV conjecture states that for \(n\times n\) Hermitian matrices \(A\) and \(B\) the function \(f_{A,B}(t)=\tr e^{tA+B}\) is exponentially convex. Recently the BMV conjecture was proved by Herbert Stahl. The proof of Herbert Stahl is…

Let $M_{n}$ denote a random symmetric $n\times n$ matrix, whose entries on and above the diagonal are i.i.d. Rademacher random variables (taking values $\pm 1$ with probability $1/2$ each). Resolving a conjecture of Vu, we prove that the…

The joint spectral radius of a pair of 2x2 real matrices $(A_0,A_1)\in M_2(\mathbb{R})^2$ is defined to be $r(A_0,A_1)= \limsup_{n\to\infty} \max \{\|A_{i_1}...A_{i_n}\|^{1/n}: i_j\in\{0,1\}\}$, the optimal growth rate of the norm of…

Let $G$ be a graph with adjacency matrix $A(G)$. We conjecture that \[2n^+(G) \le n^-(G)(n^-(G) + 1),\] where $n^+(G)$ and $n^-(G)$ denote the number of positive and negative eigenvalues of $A(G)$, respectively. This conjecture generalizes…