Related papers: La Derivada del Coseno
We give a simple proof of Dorronsoro's theorem and use similar ideas to establish an equivalence for embeddings of vector fields.
We show that any point in the convex hull of each of (d+1) sets of (d+1) points in general position in \R^d is contained in at least (d+1)^2/2 simplices with one vertex from each set. This improves the known lower bounds for all d >= 4.
All the already known results on self descriptive numbers, together with the demonstration of the uniqueness for bases greater than 6, are here obtained through a systematic scheme of proof and not trial and error. The proof is also…
We prove that every transitive and non minimal semigroup with dense minimal points is sensitive. When the system is almost open, we obtain a generalization of this result.
In 1975 Wegner conjectured that the nerve of every finite good cover in R^d is d-collapsible. We disprove this conjecture. A good cover is a collection of open sets in R^d such that the intersection of every subcollection is either empty or…
It is known that polytopes with at most two nonsimple vertices are reconstructible from their graphs, and that $d$-polytopes with at most $d-2$ nonsimple vertices are reconstructible from their 2-skeletons. Here we close the gap between 2…
A popular curve shown in introductory maths textbooks, seems like a circle. But it is actually a different curve. This paper discusses some elementary approaches to identify the geometric object, including novel technological means by using…
A short, fairly self-contained proof is given of the Poincar\'e Conjecture. In the previous version there was an error on Page 8. This gap has now been filled.
Edwards' Theorem establishes duality between a convex cone in the space of continuous functions on a compact space and the set of representing or Jensen measures for this cone. In this paper we prove non-compact versions of this theorem.
The Generalized Lax Conjecture asks whether every hyperbolicity cone is a section of a semidefinite cone of sufficiently high dimension. We prove that the space of hyperbolicity cones of hyperbolic polynomials of degree $d$ in $n$ variables…
The girth of a graph is defined as the length of a shortest cycle in the graph. A $(k; g)$-cage is a graph of minimum order among all $k$-regular graphs with girth $g$. A cycle $C$ in a graph $G$ is termed nonseparating if the graph…
For a vertex $x$ of a digraph, $d^+(x)$ ($d^-(x)$, resp.) is the number of vertices at distance 1 from (to, resp.) $x$ and $d^{++}(x)$ is the number of vertices at distance 2 from $x$. In 1995, Seymour conjectured that for any oriented…
The Pythagorean Theorem has been proved in hundreds of ways, yet it inspires fresh insights through geometry and trigonometry. In this paper, we offer a new proof based on three circles that circumscribe the sides of a right triangle.…
We give a new proof, using comparatively simple techniques, of the Sullivan conjecture: the space of pointed maps from the classifying space of the cyclic group of order $p$ to any finite-dimensional CW complex $K$ is contractible.
We prove that if $X$ and $Y$ are first countable compact Hausdorff spaces, then the set of all diameter-preserving linear bijections from $C(X)$ to $C(Y)$ is algebraically reflexive.
We present an elementary proof of the fundamental theorem of algebra, following Cauchy's version but avoiding his use of circular functions. It is written in the same spirit as Littlewood's proof of 1941, but reduces it to more elementary…
It is well known that a center of a given circle cannot be constructed using only a straightedge and that this was proven by David Hilbert. Still it is not so clear what kind of object is proven to be non-existing. We analyze different…
Let G be an acyclic digraph, and let a, b, c, d be vertices, where a, b are sources, c, d are sinks, and every other vertex has in-degree and out-degree at least two. In 1985, Thomassen showed that there do not exist disjoint directed paths…
This proof of Godel's first incompleteness theorem doesn't require omega-consistency, nor does it refer to codes of negated sentences as in Rosser's. It begins from where Godel's usual proof ends, and stalks it till it ends proving it.
Let $(X,T)$ be a dynamical system where $X$ is a compact metric space and $T:X\rightarrow X$ is continuous and invertible. Assume the Lebesgue covering dimension of $X$ is $d$. We show that for a generic continuous map…