Related papers: How to Construct a Large Table of Babylonian Mathe…
From the matrix point of view, we use the recursion to discuss four combinatorial numbers in terms of the integer lattice paths, this is different from Andr\'a's method (Andra). We give four tables and matrices, and their relations, and…
This paper presents a methodology for constructing iterative schemes of any order of convergence for solving nonlinear systems of equations. It also provides formulas for the order of convergence of any iterative schemes constructed using…
We employ the notions of `sequential function' and `interrogation' (dialogue) in order to define new partial combinatory algebra structures on sets of functions. These structures are analyzed using J. Longley's preorder-enriched category of…
This article discusses the reasons for the choice of the sexagesimal system by ancient Sumerians. It is shown that Sumerians chose this specific numeral system based on logical and practical reasons which enabled them to deal with big…
Transseries in the sense of \'Ecalle are constructed using a topological approach. A general contractive mapping principle is formulated and proved, showing the closure of transseries under a wide class of operations. In the second part we…
The reciprocal Pascal matrix has entries $\binom{i+j}{j}^{-1}$. Explicit formullae for its LU-decomposition, the LU-decomposition of its inverse, and some related matrices are obtained. For all results, $q$-analogues are also presented.
By means of a generalization of the S-expansion method we construct a procedure to obtain expanded higher-order Lie algebras. It is shown that the direct product between an Abelian semigroup S and a higher-order Lie algebra…
A short pedagogical introduction to a differential method used to calculate multi-loop scalar integrals is presented. As an example it is shown how to obtain, using the method, large mass expansion of the two loop sunrise master integrals.
This exposition begins with a systematic account of the theory of group schemes, ultimately specializing to algebraic tori.
Laman graphs model planar frameworks which are rigid for a general choice of distances between the vertices. There are finitely many ways, up to isometries, to realize a Laman graph in the plane. In a recent paper we provide a recursion…
Compositionality is a key property for dealing with complexity, which has been studied from many points of view in diverse fields. Particularly, the composition of individual computations (or programs) has been widely studied almost since…
We give an exact formula for the number of distinct square patterns of a given size that occur in the Squiral tiling.
Let $\A$ be a finitary hereditary abelian category with enough projectives. We study the Hall algebra of complexes of fixed size over projectives. Explicitly, we first give a relation between Hall algebras of complexes of fixed size and…
Using three different approaches, we analyze the complexity of various birational maps constructed from simple operations (inversions) on square matrices of arbitrary size. The first approach consists in the study of the images of lines,…
We construct integrals of motion for multidimensional classical systems from ladder operators of one-dimensional systems. This method can be used to obtain new systems with higher order integrals. We show how these integrals generate a…
We use model theoretic techniques to construct explicit first-order axiomatizations for the classes of posets that can be represented as systems of sets, where the order relation is given by inclusion, and existing meets and joins of…
In this paper, we survey and refine several results -- some previously established in the literature -- that facilitate the construction of exponential bases on planar domains with explicit control over the associated frame bounds. We apply…
Using groups with triality we obtain some general multiplication formulas in Moufang loops, construct Moufang extensions of abelian groups, and describe the structure of minimal extensions for finite simple Moufang loops over abelian…
In this article we show how to compute a matrix representation and the implicit equation by means of the method developed in [Botbol: arXiv:1007.3437], using the computer algebra system Macaulay2 \cite{M2}. As it is probably the most…
A priori, the set of birational transformations of an algebraic variety is just a group. We survey the possible algebraic structures that we may add to it, using in particular parametrised family of birational transformations.