Related papers: Generalized iterated-sums signatures
In this text we develop the formalism of products and powers of linear codes under componentwise multiplication. As an expanded version of the author's talk at AGCT-14, focus is put mostly on basic properties and descriptive statements that…
In 2015, the author proved combinatorially character formulas expressing sums of the (formal) dimensions of irreducible representations of symplectic groups, refining some works of Nekrasov and Okounkov, Han, King, and Westbury. In this…
In this paper, we mainly show that generalized hyperharmonic number sums with reciprocal binomial coefficients can be expressed in terms of classical (alternating) Euler sums, zeta values and generalized (alternating) harmonic numbers.
Attribute grammars (AGs) are known to be a useful formalism for semantic analysis and translation. However, debugging AGs is complex owing to inherent difficulties of AGs, such as recursive grammar structure and attribute dependency. In…
We study the symmetric outer product decomposition which decomposes a fully (partially) symmetric tensor into a sum of rank-one fully (partially) symmetric tensors. We present iterative algorithms for the third-order partially symmetric…
We give two general transformations that allows certain quite general basic hypergeometric multi-sums of arbitrary depth (sums that involve an arbitrary sequence $\{g(k)\}$), to be reduced to an infinite $q$-product times a single basic…
In commutative algebra, the theory of Gr\"obner bases enables one to compute in any finitely generated algebra over a given computable field. For non-finitely generated algebras however, other methods have to be pursued. For instance, it…
The notation of generalized Bessel multipliers is obtained by a bounded operator on $\ell^2$ which is inserted between the analysis and synthesis operators. We show that various properties of generalized multipliers are closely related to…
This paper is a continuation to the study of generalized quasi contractive operators, essentially due to Akhtar et al. [A multi-step implicit iterative process for common fixed points of generalized C^{q}-operators in convex metric spaces,…
The sequential data observed in earth science can be regarded as paths in multidimensional space. To read the path effectively, it is useful to convert it into a sequence of numbers called the signature, which can faithfully describe the…
Co lombeau's construction of generalized functions (in its special variant) is extended to a theory of generalized sections of vector bundles. As particular cases, generalized tensor analysis and exterior algebra are studied. A point value…
Gaussian filters have applications in a variety of areas in computer science, from computer vision to speech recognition. The collapsing sum is a matrix operator that was recently introduced to study Gaussian filters combinatorially. In…
The signature of a path is a sequence of tensors whose entries are iterated integrals, playing a key role in stochastic analysis and applications. The set of all signature tensors at a particular level gives rise to the universal signature…
We introduce generalised orbit algebras. The purpose here is to measure how some combinatorial properties can characterize the action of a group of permutations on the subsets. The similarity with orbit algebras is such that it took the…
We present a new algorithm for recovering paths from their third-order signature tensors, an inverse problem in rough analysis. Our algorithm provides the exact solution to this learning problem and improves upon current approaches by an…
We propose a definition of deformed symmetrizable generalized Cartan matrices with several deformation parameters, which admit a categorical interpretation by graded modules over the generalized preprojective algebras in the sense of…
We present a new paradigm for speeding up randomized computations of several frequently used functions in machine learning. In particular, our paradigm can be applied for improving computations of kernels based on random embeddings. Above…
In this paper, to solve a broad class of complex symmetric linear systems, we recast the complex system in a real formulation and apply the generalized successive overrelaxation (GSOR) iterative method to the equivalent real system. We then…
Employing the generalized Parseval equality for the Mellin transform and elementary trigonometric formulas, the iterated Hartley transform on the nonnegative half-axis (the iterated half-Hartley transform) is investigated in L_2. Mapping…
Generalized numberings are an extension of Ershov's notion of numbering, based on partial combinatory algebra (pca) instead of the natural numbers. We study various algebraic properties of generalized numberings, relating properties of the…