相关论文: How to sum up triangles

Algebraic deformations provide a systematic approach to generalizing the symmetries of a physical theory through the introduction of new fundamental constants. The applications of deformations of Lie algebras and Hopf algebras to both…

The group SU(3) is parameterized in terms of generalized ``Euler angles''. The differential operators of SU(3) corresponding to the Lie Algebra elements are obtained, the invariant forms are found, the group invariant volume element is…

We introduce the theory of generalised ultracategories, these are relational extensions to ultracategories as defined by Lurie. An essential example of generalised ultracategories are topological spaces, and these play a fundamental role in…

We formulate a number of new results in Algebraic Geometry and outline their derivation from Theorem 2.12 which belongs to Algebraic Combinatorics.

We generalize the classical Ceva's and Menelaus's theorems to curvilinear triangles bounded by circular arcs. We introduce trilinear coordinates associated with such triangles and develop several geometric constructions. In particular, for…

The generalized Riordan group consists of infinite lower triangular matrices that correspond to certain operators in the space of formal power series. Each such group contains the matrix (generalized Pascal matrix), elements of which are…

The trinomial transform of a sequence is a generalization of the well-known binomial transform, replacing binomial coefficients with trinomial coefficients. We examine Pascal-like triangles under trinomial transform, focusing on the ternary…

The 3-Decomposition Conjecture states that every connected cubic graph can be decomposed into a spanning tree, a 2-regular subgraph and a matching. We show that this conjecture holds for the class of connected plane cubic graphs.

Abelian groups are classified by the existence of certain additive decompositions of group-valued functions of several variables with arity gap 2.

We give an overview about some elementary properties of Hoggatt matrices, which are generalizations of Pascal triangle, and study q-analogs and Fibonacci analogs and derive a common generalization.

This article demonstrates, using numerous examples of varying complexity, how one can visually prove summation formulas involving binomial coefficients by exclusively using the recurrence relation for binomial coefficients and its…

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…

Several Lebesgue-type decomposition theorems in analysis have a strong relation to the operation called: parallel sum. The aim of this paper is to investigate this relation from a new point of view. Namely, using a natural generalization of…

A classical theory of Desarguesian geometry, originating with D. Hilbert in his 1899 treatise, Grundlagen der Geometrie, leads from axioms to the construction of a division ring from which coordinates may be assigned to points, and…

We provide a summary of research on disjoint zero-sum subsets in finite Abelian groups, which is a branch of additive group theory and combinatorial number theory. An orthomorphism of a group $\Gamma$ is defined as a bijection $\varphi$…

Theorem. There are general position points A, B, C, P on the projective plane. Let A_P be the intersection point of lines AP and BC. Analogously define B_P and C_P. Take any points A_1, B_1, C_1 on AP, BP, CP, respectively. Let W_C be the…

In classical geometric algebra, there have been several treatments of affine and projective planes based on fields. In this thesis we approach affine and projective planes from a constructive point of view and we base our geometry on local…

This exposition begins with a systematic account of the theory of group schemes, ultimately specializing to algebraic tori.

After defining convex near-polygons, a formula enumerating the number of triangulations of such configurations is derived in terms of edge-polynomials. The paper describes also a transfer-matrix approach for computing quantities related to…

We pursue the investigation of generalizations of the Pascal triangle based on binomial coefficients of finite words. These coefficients count the number of times a finite word appears as a subsequence of another finite word. The finite…