Related papers: Proof of Irvine's Conjecture via Mechanized Guessi…

We prove a recent conjecture by Ulas on reducible polynomial substitutions.

Recently, Z.-W. Sun introduced two kinds of polynomials related to the Delannoy numbers, and proved some supercongruences on sums involving those polynomials. We deduce new summation formulas for squares of those polynomials and use them to…

A family of congruences interpolating between those of Wilson and Giuga is constructed. Several elementary results are established, in order to present a possible approach to establishing Giuga's conjecture.

Let S_d be the symmetric group on d letters and let k be a field of characteristic p>2. Tensoring an irreducible S_d module with the sign representation defines an involution on the p-regular partitions of d. It is suprisingly difficult to…

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

In this paper, we survey some recent results on the Artin conjecture and discuss some aspects for the Artin conjecture.

We prove the Strengthened Hanna Neumann Conjecture. We give a more direct cohomological interpretation of the conjecture in terms of "typical" covering maps, and use graph Galois theory to "symmetrize" the conjecture. The conjecture is then…

This paper is a brief and informal presentation of cirquent calculus, a novel proof system for resource-conscious logics. As such, it is a refinement of sequent calculus with mechanisms that allow to explicitly account for the possibility…

Applying E. Kowalski's recent generalization of the large sieve we prove that certain properties expected to be typical (irreducibility of the characteristic polynomial, absence of squares among the matrix coefficients...) are indeed…

The aim of this note is a proof of a recent conjecture of Kellner concerning the number of distinct prime factors of a particular product of primes. The proof uses profound results from analytic number theory, such as Granville-Ramar\'{e}'s…

We explore the application of automated reasoning techniques to unknot detection, a classical problem of computational topology. We adopt a two-pronged experimental approach, using a theorem prover to try to establish a positive result…

In this note, we use the method of [3] to give a simple proof of famous Witten conjecture. Combining the coefficients derived in our note and this method, we can derive more recursion formulas of Hodge integrals.

For a class of irreducible Markov chains with an infinitely countable set of states, we establish a new verifiable necessary and sufficient condition for recurrence and transience. We show that if one of the basic assumptions is not…

The paper introduces a generalization for known probabilistic models such as log-linear and graphical models, called here multiplicative models. These models, that express probabilities via product of parameters are shown to capture…

The famous concyclicity theorem stated by John H. Conway is here reconsidered by means of a parametrisation of the associated triangular configuration with arbitrary triplets of real numbers ($\alpha$;$\beta$;$\gamma$). This theorem, thus…

We present a new proof of Whitney's broken circuit theorem based on induction on the number of edges and the deletion-contraction formula.

This paper discusses the semantics and proof theory of Nilsson's probabilistic logic, outlining both the benefits of its well-defined model theory and the drawbacks of its proof theory. Within Nilsson's semantic framework, we derive a set…

A geometric argument is given to prove that the Seifert genus of a positive knot equals its slice genus. A combinatorial invariant, giving a lower bound for the slice genus, is formulated for arbitrary knots. Properties and applications of…

We give an algorithm to determine whether Wilf's conjecture holds for all numerical semigroups with a given multiplicity $m$, and use it to prove Wilf's conjecture holds whenever $m \le 18$. Our algorithm utilizes techniques from polyhedral…

We prove the Invariant Subspace Conjecture for separable Hilbert spaces.