相关论文: Proof of Irvine's Conjecture via Mechanized Guessi…

We present a direct proof of the second conjecture made by M. Atiyah and P. Sutcliffe for the case of convex quadrilaterals. Unlike previous work on this conjecture, our proof does not require any computer aided computations. The new proof…

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.

In this article, following an insight of Kontsevich, we extend the famous Weil conjecture (as well as the strong form of the Tate conjecture) from the realm of algebraic geometry to the broad noncommutative setting of dg categories. As a…

We formulate a precise conjecture that, if true, extends the converse theorem of Hecke without requiring hypotheses on twists by Dirichlet characters or an Euler product. The main idea is to linearize the Euler product, replacing it by…

We provide a proof of the Borwein Conjecture using analytic methods.

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…

Reinhardt's conjecture, a formalization of the statement that a truthful knowing machine can know its own truthfulness and mechanicalness, was proved by Carlson using sophisticated structural results about the ordinals and transfinite…

We present an information theoretic proof of the nonsignalling multiprover parallel repetition theorem, a recent extension of its two-prover variant that underlies many hardness of approximation results. The original proofs used de Finetti…

Linear logic is a substructural logic proposed as a refinement of classical and intuitionistic logics, with applications in programming languages, game semantics, and quantum physics. We present a template for Gentzen-style linear logic…

Based on various strategies and a new general doubling operator, we obtain several simple proofs of the celebrated Sharkovsky's cycle coexistence theorem. A simple non-directed graph proof which is especially suitable for a calculus course…

The proof of the relative consistency of the axiom of choice has been mechanized using Isabelle/ZF. The proof builds upon a previous mechanization of the reflection theorem. The heavy reliance on metatheory in the original proof makes the…

We conjecture that bounded generalised polynomial functions cannot be generated by finite automata, except for the trivial case when they are ultimately periodic. Using methods from ergodic theory, we are able to partially resolve this…

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.

In this note we give a counterexample to a conjecture proposed by Ciliberto about special linear systems of P^n through multiple base points.

We construct a combinatorial model that is described by the cube recurrence, a nonlinear recurrence relation introduced by Propp, which generates families of Laurent polynomials indexed by points in $\mathbb{Z}^3$. In the process, we prove…

We uncover a strong correspondence between Bayesian Networks and (Multiplicative) Linear Logic Proof-Nets, relating the two as a representation of a joint probability distribution and at the level of computation, so yielding a…

We give a reformuation of the Tate conjecture for a surface over a finite field in terms of suitable affine open subsets. We then present three attempts to prove this reformulation, each of them falling short. Interestingly, the last two…

This paper advocates the usefulness of new theories of uncertainty for the purpose of modeling some facets of uncertain knowledge, especially vagueness, in AI. It can be viewed as a partial reply to Cheeseman's (among others) defense of…

We exhibit a family of sequences of noncommutative variables, recursively defined using monic palindromic polynomials in $\mathbb Q[x]$, and show that each possesses the Laurent phenomenon. This generalizes a conjecture by Kontsevich.

In this article, we prove a generalization of a theorem (Ogg's conjecture) due to Bary Mazur for arbitrary $N\in \N$ and for {\it number fields}. The main new observation is a modification of a theorem due to Glenn Stevens for the…