Related papers: On some problems about ternary paths -- a linear a…
We consider a class of lattice paths with certain restrictions on their ascents and down steps and use them as building blocks to construct various families of Dyck paths. We let every building block $P_j$ take on $c_j$ colors and count all…
We develop a one step matrix method in order to obtain approximate solutions of first order systems and non-linear ordinary differential equations, reducible to first order systems. We find a sequence of such solutions that converge to the…
An elementary, at the undergraduate level derivation is given of precise upper bounds of the number of various RNA secondary structures. The method works when the generating function has multiple singularities at the circle of convergence,…
This paper presents an iteration method for solving linear particle transport problems in binary stochastic mixtures. It is based on nonlinear projection approach. The method is defined by a hierarchy of equations consisting of the…
A simple symmetric random walk is considered on a spider that is a collection of half lines (we call them legs) joined at the origin. We establish a strong approximation of this random walk by the so-called Brownian spider. Transition…
A symmetric tensor may be regarded as a partially symmetric tensor in several different ways. These produce different notions of rank for the symmetric tensor which are related by chains of inequalities. By exploiting algebraic tools such…
A matrix approach to continuous iteration is proposed for general formal series. It leads, in particular, to an order{to{order iteration of the exponential function, and consequently to an algorithmic approach to tetration. Lower{order…
By "parallelogram geometry" we mean the elementary, "commutative", geometry corresponding to vector addition, and by "trapezoid geometry" a certain "non-commutative deformation" of the former. This text presents an elementary approach via…
We describe the ternary and the generalized superderivations of finite-dimensional semisimple Jordan superalgebras over an algebraically closed field of characteristic zero and of finite-dimensional simple Jordan superalgebras with…
This paper presents a bijection between ascent sequences and upper triangular matrices whose non-negative entries are such that all rows and columns contain at least one non-zero entry. We show the equivalence of several natural statistics…
We consider walks on the edges of the square lattice $\mathbb Z^2$ which obey \emph{two-step rules,} which allow (or forbid) steps in a given direction to be followed by steps in another direction. We classify these rules according to a…
When a semigroup has a unary operation, it is possible to define two binary operations, namely, left and right division. In addition it is well known that groups can be defined in terms of those two divisions. The aim of this paper is to…
In the first part of this paper I give an elementary overview about some number sequences which count various sorts of lattice paths in strips along the x-axis and compute their generating functions in terms of Fibonacci and Lucas…
We construct six unitary trace invariants for 2 by 2 quaternionic matrices which separate the unitary similarity classes of such matrices, and show that this set is minimal. We prove two quaternionic versions of a well known…
The meander problem is a combinatorial problem which provides a toy model of the compact folding of polymer chains. In this paper we study various questions relating to the enumeration of meander diagrams, using diagrammatical methods. By…
Pivoting methods are of vital importance for linear programming, the simplex method being the by far most well-known. In this paper, a primal-dual pair of linear programs in canonical form is considered. We show that there exists a sequence…
This is the first in a series of papers which deal with the development of novel methods for solving a system of linear algebraic equations with a time complexity lower than existing algorithms. The NxN system of linear equations, Ax = b,…
Following Poupard's study of strictly ordered binary trees with respect to two parameters, namely, "end of minimal chain" and "parent of maximum leaf" a true Tree Calculus is being developed to solve a partial difference equation system and…
In this paper, nonstandard multistep methods are considered. It is shown that under some (sufficient and necessary) conditions, these methods attain the same order as their standard counterparts - to prove this statement, a nonstandard…
We find the connection between 3-dimensional commutative algebras with a trivial trace and plane quartics and its bitangents.