English
Related papers

Related papers: The Strong Macdonald Conjecture

200 papers

Discussion of "On the Birnbaum Argument for the Strong Likelihood Principle" by Deborah G. Mayo [arXiv:1302.7021].

Methodology · Statistics 2014-11-05 D. A. S. Fraser

In this paper, we prove a conjecture of Schnell in the surface case.

Algebraic Geometry · Mathematics 2024-02-27 Jun Lu , Wan-Yuan Xu

In this paper, we give a simple counter example to the famous Hodge conjecture.

General Mathematics · Mathematics 2013-01-23 Renyi Ma

The Slope Conjecture proposed by Garoufalidis asserts that the degree of the colored Jones polynomial determines a boundary slope, and its refinement, the Strong Slope Conjecture proposed by Kalfagianni and Tran asserts that the linear term…

Geometric Topology · Mathematics 2019-10-23 Kenneth L. Baker , Kimihiko Motegi , Toshie Takata

The paper gives a counter-example to the relative version of the Manin-Mumford conjecture.

Number Theory · Mathematics 2011-04-28 Daniel Bertrand

We prove a Macdonald polynomial analogue of the celebrated Nekrasov-Okounkov hook-length formula from the theory of random partitions. As an application we obtain a proof of one of the main conjectures of Hausel and Rodriguez-Villegas from…

Combinatorics · Mathematics 2018-08-07 Eric M. Rains , S. Ole Warnaar

In this article, we prove the conjecture of Bar-Natan, Garoufalidis, and Khovanov's on the support of the Khovanov's invariants for alternating knots.

Geometric Topology · Mathematics 2007-05-23 Eun Soo Lee

The celebrated Mason's conjecture states that the sequence of independent set numbers of any matroid is log-concave, and even ultra log-concave. The strong form of Mason's conjecture was independently solved by Anari, Liu, Oveis Gharan and…

Combinatorics · Mathematics 2026-01-26 Shiqi Cao , Keyi Chen , Yitian Li , Yuxin Wu

We indicate that an argument of da Costa and Doria in fact proves P=NP. This observation makes their argument appear dubious. We isolate a weak version of one of their lemmas which would already prove P=NP. We point out that even this weak…

Logic · Mathematics 2007-05-23 Ralf Schindler

We prove a version of the Manin-Mumford conjecture for semiabelian varieties over fields of positive characteristic. The proof presented here contains the details of the proof sketched by the author in the article "Diophantine geometry from…

Algebraic Geometry · Mathematics 2007-05-23 Thomas Scanlon

In this paper, we present a new argument (see Lemma 3.4) that allows us to simplify the proof of stability of peakons established in Lin and Liu (2009) (Theorem 1.1).

Analysis of PDEs · Mathematics 2016-01-27 André Kabakouala

We introduce a variant of PCPs, that we refer to as rectangular PCPs, wherein proofs are thought of as square matrices, and the random coins used by the verifier can be partitioned into two disjoint sets, one determining the row of each…

Computational Complexity · Computer Science 2022-11-24 Amey Bhangale , Prahladh Harsha , Orr Paradise , Avishay Tal

The article presents the proof of Casas-Alvero conjecture.

Number Theory · Mathematics 2017-05-09 Edward Dobrowolski

In the paper based on the question of Zhang and L\"{u}[15], we present one theorem which will improve and extend the results of Banerjee-Majumder [2] and a recent result of Li-Huang [9].

Complex Variables · Mathematics 2022-09-15 Abhijit Banerjee , Bikash Chakraborty

In this paper, we extend the notion of Lyndon word to transfinite words. We prove two main results. We first show that, given a transfinite word, there exists a unique factorization in Lyndon words that are densely non-increasing, a…

Formal Languages and Automata Theory · Computer Science 2023-06-22 Olivier Carton , Luc Boasson

A fast consistency prover is a consistent poly-time axiomatized theory that has short proofs of the finite consistency statements of any other poly-time axiomatized theory. Kraj\'\i\v{c}ek and Pudl\'ak proved that the existence of an…

Logic · Mathematics 2020-04-14 Joost J. Joosten

Several results about the union-closed sets conjecture are presented.

Combinatorics · Mathematics 2017-06-21 Yining Hu

Let $g(x)$ be a fixed non-constant complex polynomial. It was conjectured by Schinzel that if $g(h(x))$ has boundedly many terms, then $h(x)\in \C[x]$ must also have boundedly many terms. Solving an older conjecture raised by R\'enyi and by…

Number Theory · Mathematics 2015-05-13 Umberto Zannier

We prove theorems of interest about the recently given $\Lambda^{r}$-strong convergence. We extend the results of F. M\'oricz [On $\Lambda$-strong convergence of numerical sequences and Fourier series, Acta Math.~Hungar., 54 (1989),…

Classical Analysis and ODEs · Mathematics 2016-02-04 Péter Kórus

We study strong approximation for some algebraic varieties over which are defined using norm forms over the rationals. This allows us to confirm a special case of a conjecture due to Harpaz and Wittenberg.

Number Theory · Mathematics 2017-10-03 Tim Browning , Damaris Schindler