Related papers: Non-Rectangular Convolutions and (Sub-)Cadences wi…

In this paper we study the cones corresponding to sums of squares of $n$-ary $d$-ic forms with at most $k$ terms. We show that these are strictly nested as $k$ increases, leading to the usual sum of squares cone. We also discuss the duals…

Convolution sums are introduced and special instances of the cyclic convolution on finite sets is examined in more detail. The distributions that emerge are multidimensional generalizations of the Catalan and Narayana numbers. This work…

Let p be a prime and let a be a positive integer. In this paper we determine $\sum_{k=0}^{p^a-1}\binom{2k}{k+d}/m^k$ and $\sum_{k=1}^{p-1}\binom{2k}{k+d}/(km^{k-1})$ modulo $p$ for all d=0,...,p^a, where m is any integer not divisible by p.…

The sums $\sum_{j = 0}^k {u_{rj + s}^{2n}z^j }$, $\sum_{j = 0}^k {u_{rj + s}^{2n-1}z^j }$, $\sum_{j = 0}^k {v_{rj + s}^{n}z^j }$ and $\sum_{j = 0}^k {w_{rj + s}^{n}z^j }$ are evaluated; where $n$ is any positive integer, $r$, $s$ and $k$…

Let A be a subset of the real line. We study the fractal dimensions of the k-fold iterated sumsets kA, defined as kA = A+...+A (k times). We show that for any non-decreasing sequence {a_k} taking values in [0,1], there exists a compact set…

Using $p$-adic numbers, we partially categorize the cycles of a sizable class of polynomial dynamical systems. In turn, we prove a few results related to the non-trivial cycles of the $\textit{Collatz map}$ $\text{Col} : \mathbb{Z}_+ \to…

In this work, we study the discrete observables $$E_k = \sum_{i,j=1}^n (i-j)^k A_{i,j}$$ associated with $n\times n$ alternating sign matrices $A = (A_{i,j})$. This work develops exact formulas for expectations using Bernoulli polynomials,…

We describe an efficient algorithm for computing the matrix vector products that appear in the numerical resolution of boundary integral equations in 2 space dimension. This work is an extension of the so-called Sparse Cardinal Sine…

In this paper, we present a new method for the analysis of piecewise dynamical systems that are similar to the Collatz conjecture in regard to certain properties of the commutator of their sub-functions. We use the fact that the commutator…

Let $B_n$ be the $n$-th balancing number. In this paper, we give some explicit expressions of $\sum_{l=0}^{2 r-3}(-1)^l\binom{2 r-3}{l}\sum_{j_1+\cdots+j_r=n-2 l\atop j_1,\dots,j_r\ge 1}B_{j_1}\cdots B_{j_r}$ and…

We use QCD sum rules to determine the difference between moments of the non-singlet structure functions. This combination decouples from the singular behaviour of the structure functions near x=1 as calculated in the quark-gluon basis and…

Algorithms are developed for calculating dealiased linear convolution sums without the expense of conventional zero-padding or phase-shift techniques. For one-dimensional in-place convolutions, the memory requirements are identical with the…

Let G be a graph embedded on a surface of genus g with b boundary cycles. We describe algorithms to compute multiple types of non-trivial cycles in G, using different techniques depending on whether or not G is an undirected graph. If G is…

This paper is devoted to the study of the log-convexity of combinatorial sequences. We show that the log-convexity is preserved under componentwise sum, under binomial convolution, and by the linear transformations given by the matrices of…

We give a family of congruences for the binomial coefficients ${kp-1\choose p-1}$ in terms of multiple harmonic sums, a generalization of the harmonic numbers. Each congruence in this family (which depends on an additional parameter $n$)…

Observations depending on sums of random variables are common throughout many fields; however, no efficient solution is currently known for performing max-product inference on these sums of general discrete distributions (max-product…

In this paper we introduce the algorithm and the fixed point hardware to calculate the normalized singular value decomposition of a non-symmetric matrices using Givens fast (approximate) rotations. This algorithm only uses the basic…

Tensor diagonalization means transforming a given tensor to an exactly or nearly diagonal form through multiplying the tensor by non-orthogonal invertible matrices along selected dimensions of the tensor. It is generalization of approximate…

We are interested in ordering the elements of a subset A of the non-zero integers modulo n in such a way that all the partial sums are distinct. We conjecture that this can always be done and we prove various partial results about this…

We primarily investigate congruences modulo $p$ for finite sums of the form $\sum_k\binom{rk}{k}x^k/k$ over the ranges $0<k<p$ and $0<k<p/r$, where $p$ is a prime larger than the positive integer $r$. Here $x$ is an indeterminate, thus…