Related papers: How to construct generalized van der Corput sequen…
This work proposes a methodology to develop new numerical integration algorithms for ordinary differential equations based on state quantization, generalizing the notions of Linearly Implicit Quantized State Systems (LIQSS) methods. Using…
In almost all text generation applications, word sequences are constructed in a left-to-right (L2R) or right-to-left (R2L) manner, as natural language sentences are written either L2R or R2L. However, we find that the natural language…
In this paper we present a method for direct evaluation of generalized B-splines (GB-splines) via the local representation of these curves as piecewise functions. To accomplish this we introduce a local structure that makes GB-spline curves…
This paper reformulates the problem of finding a longest common increasing subsequence of the two given input sequences in a very succinct way. An extremely simple linear space algorithm based on the new formula can find a longest common…
An algorithm is developed for efficiently constructing the Lorentz covariant effective three-point vertices of the decay of a particle into two daughter particles in which all the masses and spins of the three particles can be arbitrary.…
In this paper we consider Lie superalgebras decomposable as the sum of two proper subalgebras. Any of these algebras has the form of the vector space sum $L=A+B$ where $A$ and $B$ are proper simple subalgebras which need not be ideals of…
This article investigates integer sequences that partition the sequence into blocks of various lengths - irregular arrays. The main result of the article is explicit formulas for numbering of irregular arrays. A generalization of Cantor…
In this paper, we extend the classical arithmetic defined over the set of natural numbers N, to the set of all finite directed connected multigraphs having a pair of distinct distinguished vertices. Specifically, we introduce a model F on…
Axioms for the generalization of root systems were defined and classified (irreducible) by V. Serganova, which precisely correspond to the root systems of basic classical Lie Superalgebras. Here, we present a unified method for constructing…
The LC method described in this work seeks to approximate the roots of polynomial equations in one variable. This book allows you to explore the LC method, which uses geometric structures of Lines L and Circumferences C in the plane of…
We provide a dynamical proof of the van der Corput inequality for sequences in Hilbert spaces that is based on the Furstenberg correspondence principle. This is done by reducing the inequality to the mean ergodic theorem for contractions on…
This paper surveys and illustrates geometric methods for constructing normal bases allowing efficient finite field arithmetic. These bases are constructed using the additive group, the multiplicative group and the Lucas torus. We describe…
This paper presents an innovative approach to the study of recurrent sequences by introducing the concept of arithmetic pseudo-operators. Unlike conventional operators, these pseudo-operators are pure complex numbers with specific…
Geometric number systems, obtained by extending the real number system to include new anticommuting square roots of +1 and -1, provide a royal road to higher mathematics by largely sidestepping the tedious languages of tensor analysis and…
We analyze the problem of global reconstruction of functions as accurately as possible, based on partial information in the form of a truncated power series at some point, and additional analyticity properties. This situation occurs…
This paper develops new combinatorial approaches to analyze and compute special set partitions, called complementary set partitions, which are fundamental in the study of generalized cumulants. Moving away from traditional graph-based and…
In this note, we use a basic identity, derived from the generalized doubling integrals of \cite{C-F-G-K1}, in order to explain the existence of various global Rankin-Selberg integrals for certain $L$-functions. To derive these global…
Generalizations of linear numeration systems in which the set of natural numbers is recognizable by finite automata are obtained by describing an arbitrary infinite regular language following the lexicographic ordering. For these systems of…
Set Shaping Theory (SST) moves beyond the classical fixed-space model by constructing bijective mappings the original sequence set into structured regions of a larger sequence space. These shaped subsets are characterized by a reduced…
Building on classical aspects of the theory of Diophantine approximation, we consider the collection of all accumulation points of normalized integer vector translates of points $q\alpha$ with $\alpha\in\mathbb{R}^d$ and $q\in\mathbb{Z}$.…