Related papers: How to Construct a Large Table of Babylonian Mathe…
The procedure for constructing the massive particle surfaces in static space-times is described in detail and the equivalence of the main results with the results of the geodesic approach is demonstrated.
Given a permutation polynomial of a large finite field, finding its inverse is usually a hard problem. Based on a piecewise interpolation formula, we construct the inverses of cyclotomic mapping permutation polynomials of arbitrary finite…
We describe a general algorithm for generating various families of ribbon tableaux and computing their spin polynomials. This algorithm is derived from a new matricial coding. An advantage of this new notation lies in the fact that it…
We explore a novel link between two seemingly disparate mathematical concepts: Egyptian fractions and fractals. By examining the decomposition of rationals into sums of distinct unit fractions, a practice rooted in ancient Egyptian…
We survey some results that provide different versions of classical results through different summability methods. Specifically, in order to adapt such classical results, we analyze which properties should satisfy the summability methods.…
We describe a simple way of constructing exponentially growing solutions of the second order systems with the Laplacian as the principal term.
In this Phd. thesis, a structural analysis of construction schemes is developed. The importance of this study will be justified by constructing several distinct combinatorial objects which have been of great interest in mathematics. We then…
This paper develops a general methodology to connect propositional and first-order interpolation. In fact, the existence of suitable skolemizations and of Herbrand expansions together with a propositional interpolant suffice to construct a…
A method is proposed for defining an arbitrary number of differential calculi over a given noncommutative associative algebra. As an example the generalized quantum plane is studied. It is found that there is a strong correlation, but not a…
In this paper, the author gives two methods to construct complete Lie algebras. Both methods show that the derivation algebras of some Lie algebras are complete.
A set of algorithms is presented for efficient numerical calculation of the time evolution of classical dynamical systems. Starting with a first approximation for solving the differential equations that has a "reversible" character, we show…
The Carrell-Chapuy recurrence formulas dramatically improve the efficiency of counting orientable rooted maps by genus, either by number of edges alone or by number of edges and vertices. This paper presents an implementation of these…
The idea of writing a table of probabilistic data for a quantum or classical system, and of decomposing this table in a compact way, leads to a shortcut for Hardy's formalism, and gives new perspectives on foundational issues.
In this article one builds a class of recursive sets, one establishes properties of these sets, and one proposes applications.
A bi-Hamiltonian formulation is proposed for triangular systems resulted by perturbations around solutions, from which infinitely many symmetries and conserved functionals of triangular systems can be explicitly constructed, provided that…
We have developed a set of techniques for performing large scale ab initio calculations using multigrid accelerations and a real-space grid as a basis. The multigrid methods permit efficient calculations on ill-conditioned systems with long…
An algorithm is presented that generates sets of size equal to the degree of a given variety defined by a homogeneous ideal. This algorithm suggests a versatile framework to study various problems in combinatorial algebraic geometry and…
The main aim of this paper is to classify the distinct multiplicative Lie algebra structures (up to isomorphism) on a given group. We also see that for a given group $G$, every homomorphism from the non-abelian exterior square $G \wedge G$…
Here we give a procedure to construct a reciprocal matrix for which the right and entrywise inverse left Perron eigenvectors have any pair of given orders. An explicit example when the matrix is of size 4 is presented. In particular, it…
We present a method for constructing countable models of small theories and apply it to prove theorems on the maximal number of countable non-isomorphic models of linearly ordered theories.