Related papers: La Derivada del Coseno
We show that the Simple Loop Conjecture holds for any representation $\rho\colon\pi_1(S)\longrightarrow \text{PSL}(2,\,\mathbb R)$ that is discrete but not faithful. That is, we show the existence of a simple closed curve in the kernel of…
In this short note we prove that for every $k\in \mathbb{N}$ there is a $t_k\in\mathbb{N}$ such that for every digraph $G$ there are either $k$ edge-disjoint directed cycles in $G$ or a set $X$ of at most $t_k$ edges such that $G-X$…
We prove the consistency of: for suitable strongly inaccessible cardinal lambda the dominating number, i.e., the cofinality of ^{lambda}lambda, is strictly bigger than cov_lambda(meagre), i.e. the minimal number of nowhere dense subsets of…
We present an alternative cyclic proof system for Peano arithmetic that could be simpler than the existing ones and well-adapted both for proof analysis and for automatizing inductive proof search. In addition, we will show how various…
A non-algorithmic, generalized version of a recent result, asserting that a natural relaxation of the Koml\'os conjecture from boolean discrepancy to spherical discrepancy is true, is proved by a very short argument using convex geometry.
Poncelet's theorem states that if there exists an n-sided polygon which is inscribed in a given conic C and circumscribed about another conic D, then there are infinitely many such n-gons. Proofs of this theorem that we are aware of,…
Given a directed graph $D$ of order $n\geq 4$ and a nonempty subset $Y$ of vertices of $D$ such that in $D$ every vertex of $Y$ reachable from every other vertex of $Y$. Assume that for every triple $x,y,z\in Y$ such that $x$ and $y$ are…
We prove several reflection theorems on $D$-spaces, which are Hausdorff topological spaces $X$ in which for every open neighbourhood assignment $U$ there is a closed discrete subspace $D$ such that \[ \bigcup\{U(x): x\in D\}=X. \] The…
We prove several reflection theorems on $D$-spaces, which are Hausdorff topological spaces $X$ in which for every open neighbourhood assignment $U$ there is a closed discrete subspace $D$ such that \[ \bigcup\{U(x): x\in D\}=X. \] The…
How was this proof overlooked for 181 years? We give a simple proof of Descartes's circle theorem using Cayley-Menger determinants.
Corsten and Frankl conjectured that a simplex is diameter-Ramsey if and only if its circumcenter lies in its convex hull. We disprove this conjecture in every dimension $d\ge 3$. The main tool is a sufficient criterion based on a…
We prove that if a space X is well ordered $(\alpha A)$, or linearly semi-stratifiable, or elastic then X is a D-space.
The formula for the dihedral angle of the simplex of n dimensions, arccos(1/n), is derived using classical geometry.
We introduce the notion of operadic torsors and operadic quasi-torsors. We show that if an operadic (quasi-)torsor between two operads exists, then these operads are (quasi-)isomorphic. As an application we present the (arguably) shortest…
In this expository note we present simple proofs of the lower bound of Ramsey numbers (Erd\"os theorem), and of the estimation of discrepancy. Neither statements nor proofs require any knowledge beyond high-school curriculum (except a minor…
A polyomino is a finite, edge-connected set of cells in the plane. At the present time, an enumeration of all polyominoes is nowhere in sight. On the other hand, there are several subsets of polyominoes for which generating functions are…
Arguably the simplest variation of this style of proof as we avoid reducing to the cubic case entirely.
Many versions of the Stokes theorem are known. More advanced of them require complicated mathematical machinery to be formulated which discourages the users. Our theorem is sufficiently simple to suit the handbooks and yet it is pretty…
Let X be a smooth curve of genus g. When pi>=3g and d>=pi-2g+1 we show the existence of a double covering gamma:C-->X where C a smooth curve of genus pi with a base-point-free pencil of degree d which is not the pull-back of a pencil on X.
Motivated by the almost completely open problem of characterizing unbounded coincidence sets of global solutions of the classical obstacle problem in higher dimensions, we give in this note a concise and easy-to-extend proof of the known…