Related papers: Closed Form Equations for Triangular Numbers Multi…
We compute the graded polynomial identities of the infinite dimensional upper triangular matrix algebra over an arbitrary field. If the grading group is finite, we prove that the set of graded polynomial identities admits a finite basis. We…
Let $\Bbb Z$ and $\Bbb N$ be the set of integers and the set of positive integers, respectively. For $a,b,c,d,n\in\Bbb N$ let $N(a,b,c,d;n)$ be the number of representations of $n$ by $ax^2+by^2+cz^2+dw^2$, and let $t(a,b,c,d;n)$ be the…
In this paper, we obtain the counting formulaes of convex pentagons and convex hexagons, respectively, in an $n$-triangular net by solving the corresponding recursive formulaes.
All integer solutions $\left(M,a,c\right)$ to the problem of the sums of $M$ consecutive cubed integers $\left(a+i\right)^{3}$ ($a>1$, $0\leq i\leq M-1$) equaling squared integers $c^{2}$ are found by decomposing the product of the…
Finite trigonometric sums occur in various branches of physics, mathematics, and their applications. These sums may contain various powers of one or more trigonometric functions. Sums with one trigonometric function are known, however sums…
In this article we present all nonsingular upper triangular solutions to the constant quantum Yang-Baxter equation $R_{j_1j_2}^{k_1k_2}R_{k_1j_3}^{l_1k_3}R_{k_2k_3}^{l_2l_3}= R_{j_2j_3}^{k_2k_3}R_{j_1k_3}^{k_1l_3}R_{k_1k_2}^{l_1l_2}$ in the…
We have computed a table of the triangle sides of all congruent numbers less than 10,000, which improves and extends the existing public table. We give some background on properties of the triangle sides, and explain how we computed our…
In this paper, we study numbers $n$ that can be factored in three different ways as $n = A_1 B_1 = A_2 B_2 = A_3 B_3$ where $A_1$, $A_2$, $A_3$ are close to each other and $B_1$, $B_2$, $B_3$ are close to each other.
In this paper, we give a new representation of the Fibonacci numbers. This is achieved using Fibonacci trees. With the help of this representation, the nth Fibonacci number can be calculated without having any knowledge about the previous…
The general formulas for finding the quantity of all primitive and nonprimitive triples generated by the given number x have been proposed. Also the formulas for finding the complete quantity of the representations of the integers as a…
We consider the integers having the property of reversing when multiplied by a specific integer k. First, we proved that k should be either 1, 4 or 9. Second, we classify these integers as (10, 1)- reverse multiples, (10, 4)- reverse…
In this survey article, we are interested on minimal triangulations of closed pl manifolds. We present a brief survey on the works done in last 25 years on the following: (i) Finding the minimal number of vertices required to triangulate a…
We give a variety of magic hexagons of Orders from 3 to 7, many of which are extensions of known results. We also give a theorem that their are an infinite number of magic hexagons of Order $n$ for any fixed positive integer $n$ for any…
We present here necessary and sufficient conditions for the invertibility of circulant and symmetric matrices that depend on three parameters and moreover, we explicitly compute the inverse. The techniques we use are related with the…
We consider the representation of primes as a sum of a prime and twice a triangular number. We prove that a subset of the primes having density 1 is expressible in this form. We conjecture that every odd prime number is expressible as a sum…
Any two triangulations of a closed surface with the same number of vertices can be transformed into each other by a sequence of regular flips, provided the number of vertices exceeds a number N depending on the surface. Examples show that…
Existing algorithms for isolating real solutions of zero-dimensional polynomial systems do not compute the multiplicities of the solutions. In this paper, we define in a natural way the multiplicity of solutions of zero-dimensional…
We propose a simple technique that, if combined with algorithms for computing functions of triangular matrices, can make them more efficient. Basically, such a technique consists in a specific scaling similarity transformation that reduces…
In this work, we present an algorithm for the diagonalization of the Integration-by-Parts (IBP) equations. Diagonalized IBP equations are indispensable for reducing loop integrals with high numerator powers to master integrals and for…
Let Q be a non-singular quadratic form with integer coefficients. When Q is indefinite we provide new upper bounds for the least non-trivial integral solution to the equation Q=0. When Q is positive definite we provide improved upper bounds…