Related papers: What did Ryser Conjecture?

This article proposes a unified analytical approach leading to a partial resolution of the Erdos-Straus, Sierpinski conjectures, and their generalization. We introduce an equivalent reformulation of these conjectures while constructing two…

In this paper, we investigate the relative power of several conjectures that attracted recently lot of interest. We establish a connection between the Network Coding Conjecture (NCC) of Li and Li and several data structure like problems…

This paper describes a method used to construct infinitely many probable counterexamples of the abc conjecture over the rational integers.

Universal extensions arise naturally in the Auslander bijections. For an abelian category having Auslander-Reiten duality, we exploit a bijection triangle, which involves the Auslander bijections, universal extensions and the…

This is an informal paper presenting historical results around the recent paper of the author about Lang's Conjecture and torsion of elliptic curves. This paper also discusses a few aspects of the proof.

We overview a web of conjectures about torsors under reductive groups over regular rings and survey some techniques that have been used for making progress on such problems.

New types "extended" (super)conformal algebras $G^{(\frac n2)}$ are presented. (Su\-per)twistor spaces $T$ are subspaces in cosets $G^{(\frac n2)}/H$. The (super)twistor correspondence has a cleary defined geometrical meaning.

We propose a conjectural correspondence between the set of rigid indecomposable modules over the path algebras of acyclic quivers and the set of certain non-self-intersecting curves on Riemann surfaces, and prove the correspondence for the…

The temporal relations that hold between events described by successive utterances are often left implicit or underspecified. We address the role of two phenomena with respect to the recovery of these relations: (1) the referential…

The Union Closed Sets Conjecture is one of the most renowned problems in combinatorics. Its appeal lies in the simplicity of its statement contrasted with the potential complexity of its resolution. The conjecture posits that, in any union…

In 2008 Karasev conjectured that for every set of $r$ blue lines, $r$ green lines, and $r$ red lines in the plane, there exists a partition of them into $r$ colorful triples whose induced triangles intersect. We disprove this conjecture for…

We present the PPT square conjecture introduced by M. Christandl. We prove the conjecture in the case $n=3$ as a consequence of the fact that two-qutrit PPT states have Schmidt at most two. Our result in Lemma 3 is independent from the…

In his celebrated paper "Generic projections", John Mather has given a striking transversality theorem and its applications on generic projections. On the other hand, in this paper, two transversality theorems on generic linearly perturbed…

We present the proofs of the conjectures mentioned in the paper published in the proceedings of the 2024 AAAI conference [1], and discovered by the decomposition methods presented in the same paper.

A beautiful conjecture of Erd\H{o}s-Simonovits and Sidorenko states that if H is a bipartite graph, then the random graph with edge density p has in expectation asymptotically the minimum number of copies of H over all graphs of the same…

In 2007, Dmytrenko, Lazebnik and Williford posed two related conjectures about polynomials over finite fields. Conjecture~1 is a claim about the uniqueness of certain monomial graphs. Conjecture~2, which implies Conjecture~1, deals with…

This paper is a tribute to Robert Bartnik and his work and conjectures on quasi-local mass. We present a framework in which to clearly analyse Bartnik's static vacuum extension conjecture. While we prove that this conjecture is not true in…

We establish the Fourier-Jacobi case of the local Gross-Prasad conjecture for unitary groups, by using local theta correspondence to relate the Fourier-Jacobi case with the Bessel case established by Beuzart-Plessis. To achieve this, we…

The combinatorial structure of a d-dimensional simple convex polytope can be reconstructed from its abstract graph [Blind & Mani 1987, Kalai 1988]. However, no polynomial/efficient algorithm is known for this task, although a polynomially…

One of the most important open problems in the field of graph colouring or even graph theory is the conjecture of Hadwiger. This conjecture was the inspiration for many mathematical works, one of them being the work of F\"uredi, Gy\'arf\'as…