Related papers: Kruskal's theorem
We find conditions that guarantee that a decomposition of a generic third-order tensor in a minimal number of rank-$1$ tensors (canonical polyadic decomposition (CPD)) is unique up to permutation of rank-$1$ tensors. Then we consider the…
We algebraically compute all possible sectional curvature values for canonical algebraic curvature tensors, and use this result to give a method for constructing general sectional curvature bounds. We use a well-known method to…
We give a new proof of a classical uniqueness theorem of Alexandrov using the weak uniqueness continuation theorem of Bers-Nirenberg. We prove a version of this theorem with the minimal regularity assumption: the spherical hessians of the…
In this note we present variants of Kostov's theorem on a versal deformation of a parabolic point of a complex analytic $1$-dimensional vector field. First we provide a self-contained proof of Kostov's theorem, together with a proof that…
We give a new proof of a theorem of Montejano and Karasev regarding $k$-dimensional transversals to small families of convex sets. While their proof uses technical algebraic and topological tools, our proof is a simple application of the…
This paper presents a simple proof of Dekel (1986)'s representation theorem for betweenness preferences. The proof is based on the separation theorem.
A short proof of the Mazur-Ulam theorem concerning isometries of real normed spaces.
A slight modification to one of Tarski's axioms of plane Euclidean geometry is proposed. This modification allows another of the axioms to be omitted from the set of axioms and proven as a theorem. This change to the system of axioms…
In this note, we present a simple non-directed graph proof of Sharkovsky's theorem which is different from the one given in [2].
We introduce an inductive method for the study of the uniqueness of decompositions of tensors, by means of tensors of rank 1. The method is based on the geometric notion of weak defectivity. For three-dimensional tensors of type (a, b, c),…
We introduce a new fixed point theorem of Krasnoselskii type for discontinuous operators. As an application we use it to study the existence of positive solutions of a second-order differential problem with separated boundary conditions and…
A symmetric tensor of small rank decomposes into a configuration of only few vectors. We study the variety of tensors for which this configuration is a unit norm tight frame.
The uniform Kruskal theorem extends the original result for trees to general recursive data types. As shown by A. Freund, M. Rathjen and A. Weiermann, it is equivalent to $\Pi^1_1$-comprehension, over $\mathsf{RCA_0}$ with the chain…
The notion of a tensor captures three great ideas: equivariance, multilinearity, separability. But trying to be three things at once makes the notion difficult to understand. We will explain tensors in an accessible and elementary way…
This paper provides a new simple proof of Hesse's theorem in projective geometry for any dimension.
This paper aims to give an elementary proof for Toponogov's theorem in Alexandrov geometry with lower curvature bound. The idea of the proof comes from the fact that, in Riemannian geometry, sectional curvature can be embodied in the second…
We find some extensions of the Kraft-Russell Generic Equivalence Theorem and using it we obtain a simple proof of a result of Dubouloz and Kishimoto.
We introduce the Cuntz-Thomsen picture of $\mathcal{C}$-equivariant Kasparov theory, denoted $\mathrm{KK}^\mathcal{C}$, for a unitary tensor category $\mathcal{C}$ with countably many isomorphism classes of simple objects. We use this…
We outline a proof of the categorical geometric Langlands conjecture for GL(2), as formulated in reference [AG], modulo a number of more tractable statements that we call Quasi-Theorems.
This paper proposes a simple test for compositionality (i.e., literal usage) of a word or phrase in a context-specific way. The test is computationally simple, relying on no external resources and only uses a set of trained word vectors.…