Related papers: Closed Form Equations for Triangular Numbers Multi…

A formula for calculating Extensions of (mainly integral) Polynomial Functors is established, based upon projective resolutions. Sample computations are performed, which, in particular, exhibit a surprising non-trivial extension of Divided…

We prove that it is $\#\mathsf{P}$-complete to count the triangulations of a (non-simple) polygon.

In this work, we consider a boundary value problem for nonlinear triharmonic equation. Due to the reduction of nonlinear boundary value problems to operator equation for nonlinear terms we establish the existence, uniqueness and positivity…

In some matrix formations, factorizations and transformations, we need special matrices with some properties and we wish that such matrices should be easily and simply generated and of integers. In this paper, we propose a zero-sum rule for…

This small note proves that the set of triangular numbers is a finitely stable additive basis. This, together with a previous result by the author, shows that triangular numbers and squares are, among all polygonal numbers, the only ones…

We investigate the large values of class numbers of cubic fields, showing that one can find arbitrary long sequences of "close" abelian cubic number fields with class numbers as large as possible. We also give a first step toward an…

It is unknown at present whether a magic square of squared integers exists. Such an object is defined to be a 3 by 3 grid of 9 distinct integer squares, such that the entries of each row, column, and two main diagonals sum to the same…

In this paper, we obtain some formulas for double nonlinear Euler sums involving harmonic numbers and alternating harmonic numbers. By using these formulas, we give new closed form sums of several quadratic Euler series through Riemann zeta…

Despite the moduli space of triangles being three dimensional, we prove the existence of two triangles which are not isometric to each other for which the first, second and fourth Dirichlet eigenvalues coincide, establishing a numerical…

We take a categorical approach to describe ternary derivations and ternary automorphisms of triangular algebras. New classes of automorphisms and derivations of triangular algebras are also introduced and studied.

In this paper we show that there exist infinitely many square-free numbers of the form $n^2+n+1$. We achieve this by deriving an asymptotic formula by improving the reminder term from previous results.

Let $n$ be a non-negative integer and $A=\{a_1,\ldots,a_k\}$ be a multi-set with $k$ not necessarily distinct members, where $a_1\leqslant\ldots\leqslant a_k$. We denote by $\Delta(n,A)$ the number of ways to partition $n$ as the form…

For each positive integer n greater than or equal to 2, a new approach to expressing real numbers as sequences of nonnegative integers is given. The n=2 case is equivalent to the standard continued fraction algorithm. For n=3, it reduces to…

We obtain an iterative formula that converges incrementally to the smallest singular value. Similarly, we obtain an iterative formula that converges decreasingly to the largest singular value.

Recently, cutting planes derived from maximal lattice-free convex sets have been studied intensively by the integer programming community. An important question in this research area has been to decide whether the closures associated with…

We consider integers whose squares have just three decimal digits. Examples are e.g. given by $2108436491907081488939581538^2 = 4445504440405440505004450045555054500055550554550445444$ and $10100000000010401000000000101^2 =…

We study certain linear algebra algorithms for recursive block matrices. This representation has useful practical and theoretical properties. We summarize some previous results for block matrix inversion and present some results on…

We look at the number of solutions of an equation of the form f_1*f_2*...*f_k=a in a finite field, where each f_i is a multilinear polynomial. We use two methods to construct a solution of this problem for the cases a=0, a<>0, and we…

For $ k \geq 2 $, let $ A = (a_{1}, a_{2}, \ldots, a_{k}) $ be a $k$-tuple of positive integers with $\gcd(a_{1}, a_2, \ldots, a_k) = 1$. For a non-negative integer $s$, the generalized Frobenius number of $A$, denoted as $\mathtt{g}(A;s) =…

We study the problem of computing the matrix exponential of a block triangular matrix in a peculiar way: Block column by block column, from left to right. The need for such an evaluation scheme arises naturally in the context of option…