中文
相关论文

相关论文: On the sum of the angles between three vectors

200 篇论文

We give a formula for counting the triangles in a picture consisting of the three sides of a triangle and some cevians. This lets us prove statements that are claimed without proof in the Online Encyclopedia of Integer Sequences and some…

组合数学 · 数学 2024-10-28 Jim Propp , Adam Propp-Gubin

Motivated by a question of Erd\"{o}s and inquiries by Beeson and Laczkovich, we explore the possible $N$ for which a triangle $T$ can tile into $N$ congruent copies of a triangle $R$. The \emph{reptile} cases (where $T$ is similar to $R$)…

组合数学 · 数学 2026-04-07 Yan X Zhang

Paravectors just like integers have a ring structure. By introducing an integrated product we get geometric properties which make paravectors similar to vectors. The concepts of parallelism, perpendicularity and the angle are conceptually…

环与代数 · 数学 2016-05-10 Radomański Józef

The main result of this paper, is the complete parametric description of the family of triangles which have integer sidelengths and with one angle being sixty degrees.

综合数学 · 数学 2008-03-27 Konstantine Zelator

This paper is devoted to the 3-dimensional relative differential geometry of surfaces. In the Euclidean space $\R{E} ^3 $ we consider a surface $\varPhi %\colon \vect{x} = \vect{x}(u^1,u^2) $ with position vector field $\vect{x}$, which is…

微分几何 · 数学 2017-06-29 Stylianos Stamatakis , Ioannis Kaffas , Ioannis Delivos

Trisecting an angle has been proved to be impossible by Euclidean Geometry, using only straight edge and compass. However, there is a method using Origami (paper folding) procedure to trisect an angle. The algebraic analysis of the same…

综合数学 · 数学 2021-02-22 Ramachandra Bhat

We estimate from below the number of lines meeting each of given 4 disjoint smooth closed curves in a given cyclic order in the real projective 3-space and in a given linear order in the Euclidean 3-space. Similarly, we estimate the number…

几何拓扑 · 数学 2007-05-23 Julia Viro

Let ||.|| be a norm in R^d whose unit ball is B. Assume that V\subset B is a finite set of cardinality n, with \sum_{v \in V} v=0. We show that for every integer k with 0 \le k \le n, there exists a subset U of V consisting of k elements…

度量几何 · 数学 2020-12-04 Gergely Ambrus , Imre Barany , Victor Grinberg

Let $P$ be a set of $N$ points in the Euclidean plane, where a positive proportion of points lies off a single straight line. This note points out two facts concerning the number of equivalence classes of triangles that $P$ determines,…

组合数学 · 数学 2012-05-29 Misha Rudnev

Three circles define each of the Brocard points of a triangle. If one adds the three circles through a pair of vertices and the orthocentre one has nine circles. It is described how each of the nine centres of these circles lies at the…

度量几何 · 数学 2010-07-08 Christopher J Bradley

We compute the sum and the alternating sum of the reciprocals of triangular numbers using two standard methods from calculus: a telescoping series approach and a power series approach. We then extend these results to generalized…

数论 · 数学 2026-02-06 Pawel Grzegrzolka , Jeffrey L. Meyer

We give a characterization of all three points in $\mathbb R^4$ with integer coordinates which are at the same Euclidean distance apart. In three dimension the problem is characterized in terms of solutions of the Diophantine equations…

数论 · 数学 2013-07-16 Eugen J. Ionascu

The Descartes circle theorem states that if four circles are mutually tangent with disjoint intersion, then their curvatures (or "bends) b_j = 1/r_j satisfy the relation (b_1 + b_2 + b_3 + b_4)^2 = 2(b_1^2 + b_2^2 + b_3^2 + b_4^2). We show…

度量几何 · 数学 2007-05-23 Jeffrey C. Lagarias , Colin L. Mallows , Allan R. Wilks

We geometrically prove that in a d-dimensional cube with edges of length n, the number of particular d-dimensional tetrahedrons are given by Eulerian numbers. These tetrahedrons tassellate the cube, In this way the sum of the cubes are the…

历史与综述 · 数学 2011-03-23 Mario Barra

In this paper, we consider a set of similar triangles with parallel sides, along with a set of points in the plane. It turns out that the set $\mathbb{R}_2= \{\pm <x >=\pm (x^2,x,1); x\in\mathbb{R} \}$ describes this set of triangles quite…

度量几何 · 数学 2025-09-18 Edward Mieczkowski

Geodesic nets are types of graphs in Riemannian manifolds where each edge is a geodesic segment. One important object used in the construction of geodesic nets is a balanced vertex, where the sum of unit tangent vectors along adjacent edges…

微分几何 · 数学 2025-10-07 Duc Toan Nguyen

We consider the problem of assigning radii to a given set of points in the plane, such that the resulting set of circles is connected, and the sum of radii is minimized. We show that the problem is polynomially solvable if a connectivity…

Baiocchi et al. generalized a few years ago a classical theorem of Ingham and Beurling by means of divided differences. The optimality of their assumption has been proven by the third author of this note. The purpose of this note to extend…

经典分析与常微分方程 · 数学 2009-03-20 Alia Barhoumi , Vilmos Komornik , Michel Mehrenberger

This paper is dedicated to a lattice analog to the classical ``sum of interior angles of a polygon theorem''. In 2008, the first formula expressing conditions on the geometric continued fractions for lattice angles of triangles was derived,…

数论 · 数学 2023-10-03 James Dolan , Oleg Karpenkov

We consider multiple and set-indexed sums of random vectors taking values in Euclidean space of growing dimension. It is shown that, when viewed as finite metric spaces, the sets of values of such sums converge in probability. The limit is…

概率论 · 数学 2026-05-18 Bochen Jin , Alexander Marynych , Ilya Molchanov