English
Related papers

Related papers: Lih Wang and Dittert Conjectures on Permanents

200 papers

In this paper we report on new results relating to a conjecture regarding properties of $n\times n$, $n\leq 6$, positive definite matrices. The conjecture has been proven for $n\leq 4$ using computer-assisted sum of squares (SoS) methods…

Symbolic Computation · Computer Science 2023-09-06 Jeffrey Uhlmann

Towards confirming Sun's conjecture on the strict log-concavity of combinatorial sequence involving the n$th$ Bernoulli number, Chen, Guo and Wang proposed a conjecture about the log-concavity of the function…

Classical Analysis and ODEs · Mathematics 2016-06-30 Bo Ning , Yu Zheng

A binary matrix is a matrix with entries from the set $\{0,1\}$. We say that a binary matrix $A$ contains a binary matrix $S$ if $S$ can be obtained from $A$ by removal of some rows, some columns, and changing some $1$-entries to…

Combinatorics · Mathematics 2019-10-15 Josef Cibulka , Jan Kynčl

We prove that any \(2\)-connected graph \(G\) on \(n\) vertices with minimum degree \(\delta(G) \ge \frac{n}{4}+2\) contains a \(2\)-connected subgraph of order \(k\) for every integer \(k\) with \(4 \le k \le n\). This improves a previous…

Combinatorics · Mathematics 2026-03-13 Haiyang Liu , Bo Ning

Let $\pi$ be a permutation of $[n]=\{1,\dots,n\}$ and denote by $\ell(\pi)$ the length of a longest increasing subsequence of $\pi$. Let $\ell_{n,k}$ be the number of permutations $\pi$ of $[n]$ with $\ell(\pi)=k$. Chen conjectured that the…

Combinatorics · Mathematics 2015-11-30 Miklós Bóna , Marie-Louise Lackner , Bruce Sagan

We study and solve several problems in two closely related settings: set families in $2^{[n]}$ with many disjoint pairs of sets and low rank matrices with many zero entries. - More than 40 years ago, Daykin and Erd\H{o}s asked for the…

Combinatorics · Mathematics 2024-11-21 Zach Hunter , Aleksa Milojević , Benny Sudakov , István Tomon

The Tu--Deng Conjecture is concerned with the sum of digits $w(n)$ of $n$ in base~$2$ (the Hamming weight of the binary expansion of $n$) and states the following: assume that $k$ is a positive integer and $1\leq t<2^k-1$. Then \[\Bigl…

Combinatorics · Mathematics 2018-07-12 Lukas Spiegelhofer , Michael Wallner

In a celebrated paper of Marcus and Ree (1959), it was shown that if $A=[a_{ij}]$ is an $n \times n$ doubly stochastic matrix, then there is a permutation $\sigma \in S_n$ such that $\sum_{i,j=1}^{n} a_{i,j}^{2} \leq \sum_{i=1}^{n}…

Metric Geometry · Mathematics 2023-06-12 Ludovick Bouthat , Javad Mashreghi , Frédéric Morneau-Guérin

Let A(n) be a $k\times s$ matrix and $m(n)$ be a $k$ dimensional vector, where all entries of A(n) and $m(n)$ are integer-valued polynomials in $n$. Suppose that $$t(m(n)|A(n))=#\{x\in\mathbb{Z}_{+}^{s}\mid A(n)x=m(n)\}$$ is finite for each…

Combinatorics · Mathematics 2007-10-02 Sheng Chen , Nan Li

Let $b_{t,i}(n)$ denote the total number of the $i$ hooks in the $t$-regular partitions of $n$. Singh and Barman (J. Number Theory { 264} (2024), 41--58) raised two conjectures on $b_{t,i}(n)$. The first conjecture is on the positivity of…

Combinatorics · Mathematics 2025-01-24 Wenxia Qu , Wenston J. T. Zang

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

Classical Analysis and ODEs · Mathematics 2016-06-23 Victor Katsnelson

In 2010, Eun-Young Lee conjectured that if $A,B$ are two $n\times n$ complex matrices and $\left|A\right|, \left|B\right|$ are the absolute values of $A, B$, respectively, then \[ \|A+B\|_F\le…

Functional Analysis · Mathematics 2025-07-15 Teng Zhang

It is conjectured that the dual variety of every smooth nonlinear subvariety of dimension $> \frac{2N}{3}$ in projective $N$-space is a hypersurface, an expectation known as the duality defect conjecture. This would follow from the truth of…

Algebraic Geometry · Mathematics 2020-07-01 Grayson Jorgenson

We prove that $\det A\leq 6^\frac{n}{6}$ whenever $A\in\{0,1\}^{n\times n}$ contains at most $2n$ ones. We also prove an upper bound on the determinant of matrices with the $k$-consecutive ones property, a generalisation of the consecutive…

Combinatorics · Mathematics 2017-11-29 Henning Bruhn , Dieter Rautenbach

In 1965 Erd\H os conjectured that for all $k\ge2$, $s\ge1$ and $n\ge k(s+1)$, an $n$-vertex $k$-uniform hypergraph $\F$ with $\nu(\F)=s$ cannot have more than \newline $\max\{\binom{sk+k-1}k,\;\binom nk-\binom{n-s}k\}$ edges. It took almost…

Combinatorics · Mathematics 2016-09-05 Peter Frankl , Vojtech Rödl , Andrzej Ruciński

Let F be a finite field of characteristic 2 and h be the element x^3+y^3+xyz of F[[x,y,z]]. In an earlier paper we made a precise conjecture as to the values of the colengths of the ideals (x^q,y^q,z^q,h^j) for q a power of 2. We also…

Commutative Algebra · Mathematics 2009-07-16 Paul Monsky

Let $M_n$ be an $n$ by $n$ random matrix where each entry is +1 or -1 independently with probability 1/2. Our main result implies that the probability that $M_n$ is singular is at most $(1/\sqrt{2} + o(1))^n$, improving on the previous best…

Combinatorics · Mathematics 2009-05-05 Jean Bourgain , Van Vu , Philip Matchett Wood

For a sequence $\mathbf w = \{w_j\}_{j = 2}^\infty$ of positive real numbers, consider the positive semi-definite kernel $\kappa_{\mathbf w}(s, u) = \sum_{j = 2}^\infty w_j j^{-s - \overline{u}}$ defined on some right-half plane $\mathbb…

Functional Analysis · Mathematics 2023-02-07 Chaman Kumar Sahu

Given a bipartite graph $H$ and a natural number $s$, let $\mathrm{ex}^*(n,H,s)$ denote the maximum number of edges in an $n$-vertex graph that contains neither $K_{s,s}$ nor an induced copy of $H$. Hunter, Milojevi\'c, Sudakov, and Tomon…

Combinatorics · Mathematics 2026-05-06 Tao Jiang , Sean Longbrake

A famous conjecture of Erd\H os and Straus is that for every integer $n\ge2$, $4/n$ can be represented as $1/x+1/y+1/z$, where $x,y,z$ are positive integers. This conjecture was generalized to $5/n$ by Sierpi\'nski, and then Schinzel…

Number Theory · Mathematics 2026-01-16 Carl Pomerance , Andreas Weingartner