Related papers: Four proofs of the directed Brooks' Theorem
We prove an infinite analogue of the main theorem of discrete Morse theory formulated in terms of discrete Morse matchings. Our theorem holds under the assumption that the given Morse matching induces finitely many equivalence classes of…
We prove new results on the derivative of the Minkowski question mark function. Some of our theorems are non-improvable.
These informal notes, not intended for publication, provide an approach to the Borsuk--Ulam theorem via Stokes' theorem, in a similar spirit to Lima's proof of the Brouwer fixed point theorem. They are intended to be accessible to anyone…
We give a purely combinatorial proof for a two-fold generalization of van der Waerden-Brauer's theorem and Hindman's theorem. We also give tower bounds for a finite version of it.
We prove that every congruence distributive variety has directed J\'{o}nsson terms, and every congruence modular variety has directed Gumm terms. The directed terms we construct witness every case of absorption witnessed by the original…
In this note we extend a theorem from [13] about uniform circle random coverings
We prove some new results related to Tanaka's formula.
The $P$ versus $NP$ problem is still unsolved. But there are several oracles with $P$ unequal $NP$ relative to them. Here we will prove, that $P\not=NP$ relative to a $P$-complete oracle. In this paper, we use padding arguments as the proof…
We give a new proof of the existence of designs, which is much shorter and gives better bounds.
We present a new proof of Whitney's broken circuit theorem based on induction on the number of edges and the deletion-contraction formula.
In this paper we present new, short and elementary proofs of the famous projection and section theorems that are used in Stochastic Calculus.
We show that it is coNP-complete to decide whether a given proof structure of pomset logic is a correct proof net, using the graph-theoretic used in a previous paper of ours (arXiv:1901.10247).
A multivariate Gauss-Lucas theorem is proved, sharpening and generalizing previous results on this topic. The theorem is stated in terms of a seemingly new notion of convexity. Applications to multivariate stable polynomials are given.
This paper studies the modal logical aspects of provability predicates and consistency statements for theories of arithmetic. First, we provide an overview of previous works on the correspondence between various derivability conditions for…
In this paper, we prove and disprove several generalizations of unbounded versions of the Fuglede-Putnam theorem.
We present a solution of Exercise 1.2.1 of [2] which yields a short new proof of a key step in one of proofs of Brouwer's fixed point theorem, 1910. A few people asked the author about the details of the solution and they might be…
We present a proof-theoretic analysis of the logic NL$\lambda$ (Barker \& Shan 2014, Barker 2019). We notably introduce a novel calculus of proof nets and prove it is sound and complete with respect to the sequent calculus for the logic. We…
We prove that the provability logic of all provability predicates is exactly Fitting, Marek, and Truszczy\'nski's pure logic of necessitation $\mathsf{N}$. Moreover, we introduce three extensions $\mathsf{N4}$, $\mathsf{NR}$, and…
For formulas of the Implicational Propositional Calculus (IPC) that are theorems of the classical Propositional Calculus (PC) we show that PC proofs yield IPC proofs. As a consequence, completeness of PC yields completeness of IPC.
We claim to resolve the P=?NP problem via a formal argument for P=NP.