Related papers: A bijectional attack on the Razumov-Stroganov conj…
The purpose of this paper is to develop and study recursive proofs of coinductive predicates. Such recursive proofs allow one to discover proof goals in the construction of a proof of a coinductive predicate, while still allowing the use of…
In the paper we complete a case by case proof of Reeder's Conjecture started in our previous work, proving the conjecture for simple Lie algebras of type $D$ and for the exceptional cases.
In this paper, we prove the Sendov conjecture for polynomials of degree nine. We use a new idea to obtain new upper bound for the $\sigma-$sum to zeros of the polynomial.
A particular case of the Jacobian conjecture is considered and for small dimensional cases a computational approach is offered
In this article, we prove a weighted version of Saitoh's conjecture. As an application, we prove a weighted version of Saitoh's conjecture for higher derivatives.
We prove a recent conjecture by Ulas on reducible polynomial substitutions.
In this article, we verify the additivity for rank of a sum of coprime monomials and bivariate polynomials generalizing the result in (\cite{CCG}). We also show similar results hold for cactus rank.
We provide a reduction in the classification problem for non-compact, homogeneous, Einstein manifolds. Using this work, we verify the (Generalized) Alekseevskii Conjecture for a large class of homogeneous spaces.
We introduce a new method for studying the Baum-Connes conjecture, which we call the direct splitting method. The method can simplify and clarify proofs of some of the known cases of the conjecture. In a separate paper, with J. Brodzki, E.…
We provide new sufficient conditions under which Ryser's conjecture holds.
We comment on some apparently weak points in the novel strategies recently developed by various authors aiming at a proof of the Riemann hypothesis. After noting the existence of relevant previous papers where similar tools have been used,…
We prove the Banach strong Novikov conjecture for groups having polynomially bounded higher-order combinatorial functions. This includes all automatic groups.
We prove via a composition lemma, the Kotzig-Ringel-Rosa conjecture, better known as the Graceful Labeling Conjecture. We also prove via a stronger version of the composition lemma a stronger form of the Graceful Labeling Conjecture.
We prove a conjecture about the concordance invariant $\vartheta$, defined in a recent paper by Lewark and Zibrowius. This result simplifies the relation between $\vartheta$ and Rasmussen's $s$-invariant. The proof relies on Bar-Natan's…
We study the Toda conjecture of Eguchi and Yang for the Gromov-Witten invariants of CP^1,using the bihamiltonian method of the formal calculus of variations. We also study its relationship to the Virasoro conjecture for CP^1, recently…
We introduce a new combinatorial object called tower diagrams and prove fundamental properties of these objects. We also introduce an algorithm that allows us to slide words to tower diagrams. We show that the algorithm is well-defined only…
The aim of this work is to prove a conjecture related to the Combinatorial Invariance Conjecture of Kazhdan-Lusztig polynomials, in the parabolic setting, for lower intervals in every arbitrary Coxeter group. This result improves and…
In this note, we disprove two Romanov type conjectures posed by Chen.
A proof of the continuous martingale convergence theorem is provided. It relies on a classical martingale inequality and the almost sure convergence of a uniformly bounded non-negative super-martingale, after a truncation argument.
We provide a refinement of Horn's conjecture by considering spectra with repetitions. To do this we adapt P. Belkale's techniques to our context, in the form proposed by N. Berline, M. Vergne and M. Walter.