Related papers: Decomposition results for multiplicative actions a…
We show that the set of realizations of a given dimension of a max-plus linear sequence is a finite union of polyhedral sets, which can be computed from any realization of the sequence. This yields an (expensive) algorithm to solve the…
We continue to investigate which polynomials can possibly occur as factors in the denominators of rational solutions of a given partial linear difference equation. In an earlier article we had introduced the distinction between periodic and…
Following an approach presented by N. Frantzikinakis, we prove that any multiple correlation sequence, defined by invertible measure preserving actions of commuting transformations with integer part polynomial iterates, is the sum of a…
An algorithm for matrix factorization of polynomials was proposed in \cite{fomatati2022tensor} and it was shown that this algorithm produces better results than the standard method for factoring polynomials on the class of summand-reducible…
Multiparameter persistence modules can be uniquely decomposed into indecomposable summands. Among these indecomposables, intervals stand out for their simplicity, making them preferable for their ease of interpretation in practical…
This paper presents a reformulation of the Leibniz product rule as a finite sum that expresses the fractional derivative of the product of two differentiable functions. This paper then proves the cases for when the product consists of an…
This paper presents some results on a well-known problem in Algebraic Signal Sampling and in other areas of applied mathematics: reconstruction of piecewise-smooth functions from their integral measurements (like moments, Fourier…
We study the existence of the product of two weighted modulation spaces. For this purpose we discuss two different strategies. The more simple one allows transparent proofs in various situations. However, our second method allows a closer…
The fundamental properties of biquaternions (complexified quaternions) are presented including several different representations, some of them new, and definitions of fundamental operations such as the scalar and vector parts, conjugates,…
We study the asymptotic behavior of Multiple Meixner polynomials of first and second kind, respectively (see J. Arves\'u et al. J. Comput. Appl. Math., 153, (2003)). We use an algebraic function formulation for the solution of the…
We introduce a new approach to an enumerative problem closely linked with the geometry of branched coverings; that is, we study the number of ways a permutation can be decomposed into a product of a given number of 2-cycles, 3-cycles, etc.…
The theory and computation of tensors with different tensor products play increasingly important roles in scientific computing and machine learning. Different products aim to preserve different algebraic properties from the matrix algebra,…
Purpose of writing this paper is to solve a transcendental function containing a product of a variable and its double exponential by a unique method of approximation. If the value of the said product is given, then its inverse function is…
We propose an iterative estimating equations procedure for analysis of longitudinal data. We show that, under very mild conditions, the probability that the procedure converges at an exponential rate tends to one as the sample size…
Based on a reduction processing, we rewrite a hypergeometric term as the sum of the difference of a hypergeometric term and a reduced hypergeometric term (the reduced part, in short). We show that when the initial hypergeometric term has a…
A positive linear recurrence sequence is of the form $H_{n+1} = c_1 H_n + \cdots + c_L H_{n+1-L}$ with each $c_i \ge 0$ and $c_1 c_L > 0$, with appropriately chosen initial conditions. There is a notion of a legal decomposition (roughly,…
This paper presents a novel algorithm for constructing a sum-of-squares (SOS) decomposition for positive semi-definite polynomials with rational coefficients. Unlike previous methods that typically yield SOS decompositions with…
We introduce and study the definition, main properties and applications of iterated twisted tensor products of algebras, motivated by the problem of defining a suitable representative for the product of spaces in noncommutative geometry. We…
In this technical report, certain interesting classification of arithmetical functions is proposed. The notion of additively decomposable and multiplicatively decomposable arithmetical functions is proposed. The concepts of arithmetical…
We present a new argument in the study of positive entropy measures for higher rank diagonalisable actions. The argument relies on a quantitative form of recurrence along unipotent directions (that are not known to preserve the measure).…