Related papers: Generalized sums of linear orders
The problem of simultaneous decomposition of binary forms as sums of powers of linear forms is studied. For generic forms the minimal number of linear forms needed is found and the space parametrizing all the possible decompositions is…
Multiple binomial sums form a large class of multi-indexed sequences, closed under partial summation, which contains most of the sequences obtained by multiple summation of products of binomial coefficients and also all the sequences with…
We compare two known methods of extending a complex, unital, commutative normed algebra so as to include solutions to sets of monic polynomials over the original algebra. (One of these is a generalisation of a construction from the thesis…
A finite-dimensional unital and associative algebra over $\mathbb{R}$, or what we shall call simply "an algebra" in this paper for short, generalities the construction by which we derive the complex numbers by "adjoining an element $i$" to…
Direct links between generalized harmonic numbers, linear Euler sums and Tornheim double series are established in a more perspicuous manner than is found in existing literature. We show that every linear Euler sum can be decomposed into a…
We study notions of generic and coarse computability in the context of computable structure theory. Our notions are stratified by the $\Sigma_\beta$ hierarchy. We focus on linear orderings. We show that at the $\Sigma_1$ level all linear…
We propose a simple approach to formal deformations of associative algebras. It exploits the machinery of multiplicative coresolutions of an associative algebra A in the category of A-bimodules. Specifically, we show that certain…
A quantitative model of concurrent interaction is introduced. The basic objects are linear combinations of partial order relations, acted upon by a group of permutations that represents potential non-determinism in synchronisation. This…
We present a common ground for infinite sums, unordered sums, Riemann/Lebesgue integrals, arc length and some generalized means. It is based on extending functions on finite sets using Hausdorff metric in a natural way.
Utilizing spectral residues of parameterized, recursively defined sequences, we develop a general method for generating identities of composition sums. Specific results are obtained by focusing on coefficient sequences of solutions of first…
We consider a class of generalized binomials emerging in fractional calculus. After establishing some general properties, we focus on a particular yet relevant case, for which we provide several ready-for-use combinatorial identities,…
We consider two classes of computations which admit taking linear combinations of execution runs: probabilistic sampling and generalized animation. We argue that the task of program learning should be more tractable for these architectures…
In this paper some generalizations of the sum of powers of natural numbers is considered. In particular, the class of sums whose generating function is the power of the generating function for the classical sums of powers is studying. The…
Multigraded linear series generalize the classical morphism to the linear series of a basepoint-free line bundle on a scheme. We investigate the collection of the natural cornering morphisms into elementary bigraded linear series obtained…
Some class of sums which naturally include the sums of powers of integers is considered. A number of conjectures concerning a representation of these sums is made.
Explicit determinations of several classes of trigonometric sums are given. These sums can be viewed as analogues or generalizations of Gauss sums. In a previous paper, two of the present authors considered primarily sine sums associated…
A generalized matrix function is a generalization of determinant and permanent function. In this paper, we introduced the formula for the value of a generalized matrix function of a linear sum of permutation matrices. We show that a linear…
We perform certain alternating binomial summations with parameters that occur in the analysis of algorithms. A combination of integral and special function and special number representations is used. The results are sufficiently general to…
Sorting is a common and ubiquitous activity for computers. It is not surprising that there exist a plethora of sorting algorithms. For all the sorting algorithms, it is an accepted performance limit that sorting algorithms are linearithmic…
A common theme in mathematics is to define generalized solutions to deal with problems that potentially do not have solutions. A classical example is the introduction of least squares solutions via the normal equations associated with a…