Related papers: Two Formulas for the BR Multiplicity
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…
Let ${\mathbb F}_0$ be an algebraically closed field, with $char({\mathbb F}_0)=0$. In this article, for prime numbers $p\geq 2$, we construct smooth affine algebras $B$ over ${\mathbb F}_0$, with $\dim B=p+2$. Further, we construct…
Generalizations of the classical affine Lelieuvre formula to surfaces in projective three-dimensional space and to hypersurfaces in multi- dimensional projective space are given. A discrete version of the projective Lelieuvre formula is…
We investigate products of certain double cosets for the symmetric group and use the findings to derive some multiplication formulas for q-Schur superalgebras. This gives a combinatorialisation of the relative norm approach developed by the…
A generalization of Chern-Simons gauge theory is formulated in any dimension and arbitrary gauge group where gauge fields and gauge parameters are differential forms of any degree. The quaternion algebra structure of this formulation is…
In the recent article arXiv:1606.03351, Apagodu and Zeilberger discuss some applications of an algorithm for finding and proving congruence identities (modulo primes) of indefinite sums of many combinatorial sequence. At the end they…
A formula for the irregularity of a cyclic multiple plane associated to a branch curve that has arbitrary singularities and is transverse to the line at infinity is established. The irregularity is expressed as a sum of superabundances of…
We study the distribution of consecutive sums of two squares in arithmetic progressions. If $\{E_n\}_{n \in \mathbb{N}}$ is the sequence of sums of two squares in increasing order, we show that for any modulus $q$ and any congruence classes…
We prove sufficient conditions for the two-weight boundedness of the Bergman projection on the unit ball. The first condition is in terms of Orlicz averages of the weights, while the second condition is in terms of the mixed…
In this paper we study recurrences concerning the combinatorial sum $[n,r]_m=\sum_{k\equiv r (mod m)}\binom {n}{k}$ and the alternate sum $\sum_{k\equiv r (mod m)}(-1)^{(k-r)/m}\binom{n}{k}$, where m>0, $n\ge 0$ and r are integers. For…
We generalise Birch's seminal work on forms in many variables to handle a system of forms in which the degrees need not all be the same. This allows us to prove the Hasse principle, weak approximation, and the Manin-Peyre conjecture for a…
We prove results generalizing the classical Riemann Singularity Theorem to the case of integral, singular curves. The main result is a computation of the multiplicity of the theta divisor of an integral, nodal curve at an arbitrary point.…
Abstract simulation of one transition system by another is introduced as a means to simulate a potentially infinite class of similar transition sequences within a single transition sequence. This is useful for proving confluence under…
We study the arithmetic of complete intersections in projective space over number fields. Our main results include arithmetic Torelli theorems and versions of the Shafarevich conjecture, as proved for curves and abelian varieties by…
We use the classical umbral calculus to describe Riordan arrays. Here, a Riordan array is generated by a pair of umbrae, and this provides efficient proofs of several basic results of the theory such as the multiplication rule, the…
Cumulants are a notion that comes from the classical probability theory, they are an alternative to a notion of moments. We adapt the probabilistic concept of cumulants to the setup of a linear space equipped with two multiplication…
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 present a method to simplify expressions in the context of an equational theory. The basic ideas and concepts of the method have been presented previously elsewhere but here we tackle the difficult task of making it efficient in…
The usual product $m\cdot n$ on $\mathbb{Z}$ can be viewed as the sum of $n$ terms of an arithmetic progression whose first term is $a_{1}=m-n+1$ and whose difference is $d=2$. Generalizing this idea, we define new similar product mappings,…
Abramov's algorithm enables us to decide whether a univariate rational function can be written as a difference of another rational function, which has been a fundamental algorithm for rational summation. In 2014, Chen and Singer generalized…