Related papers: Indicator function and complex coding for mixed fr…
Using functional equations, we define functors that generalize standard examples from calculus of one variable. Examples of such functors are discussed and their Taylor towers are computed. We also show that these functors factor through…
We explore a data structure that generalises rectangular multi-dimensional arrays. The shape of an n-dimensional array is typically given by a tuple of n natural numbers. Each element in that tuple defines the length of the corresponding…
Although the study of functional calculus has already established necessary and sufficient conditions for operators to be fractionalized, this paper aims to use our well-conceived notion of integer powers of operators to construct…
The Functional Machine Calculus (FMC), recently introduced by the authors, is a generalization of the lambda-calculus which may faithfully encode the effects of higher-order mutable store, I/O and probabilistic/non-deterministic input.…
Data depth proves successful in the analysis of multivariate data sets, in particular deriving an overall center and assigning ranks to the observed units. Two key features are: the directions of the ordering, from the center towards the…
In this paper, we obtain several new factorization results for certain classes of polynomials having integer coefficients. In doing so, we use the information about prime factorization of the value taken up by such polynomials and their…
This book intends to deepen the study of the fractional calculus, giving special emphasis to variable-order operators. It is organized in two parts, as follows. In the first part, we review the basic concepts of fractional calculus (Chapter…
In this paper, we present a new algorithm and an experimental implementation for factoring elements in the polynomial n'th Weyl algebra, the polynomial n'th shift algebra, and ZZ^n-graded polynomials in the n'th q-Weyl algebra. The most…
We first find the combinatorial degree of any map $f:V\to F$ where $F$ is a finite field and $V$ is a finite-dimensional vector space over $F$. We then simplify and generalize a certain construction due to Chein and Goodaire that was used…
Monads are a useful tool for structuring effectful features of computation such as state, non-determinism, and continuations. In the last decade, several generalisations of monads have been suggested which provide a more fine-grained model…
Two doubly indexed families of polynomials in several indeterminates are considered. They are related to the falling and rising factorials in a similar way as the potential polynomials (introduced by L. Comtet) are related to the ordinary…
The uniform one-dimensional fragment of first-order logic was introduced a few years ago as a generalization of the two-variable fragment of first-order logic to contexts involving relations of arity greater than two. Quantifiers in this…
Planar functions are mappings from a finite field $\mathbb{F}_q$ to itself with an extremal differential property. Such functions give rise to finite projective planes and other combinatorial objects. There is a subtle difference between…
In a seminal 2007 paper, Andrews introduced a class of combinatorial objects that generalize partitions called $k$-marked Durfee symbols. Multivariate rank generating functions for these objects have been shown by many to have interesting…
In [arXiv 0811.3913] the authors introduced the notion of quasi-polynomial function as being a mapping f: X^n -> X defined and valued on a bounded chain X and which can be factorized as f(x_1,...,x_n)=p(phi(x_1),...,phi(x_n)), where p is a…
Some of the most interesting quantities associated with a factor graph are its marginals and its partition sum. For factor graphs \emph{without cycles} and moderate message update complexities, the sum-product algorithm (SPA) can be used to…
In this paper, the Q-factor expression for periodic arrays over a ground plane is determined in terms of the electric current density within the array's unit cell. The expression accounts for the exact shape of the array element. The…
Higher-dimensional analogs of the predictable degree property and column reducedness are defined, and it is proved that the two properties are equivalent. It is shown that every multidimensional convolutional code has, what is called, a…
We consider a scalar-valued implicit function of many variables, and provide two closed formulae for all of its partial derivatives. One formula is based on products of partial derivatives of the defining function, the other one involves…
We define an enumerative function F(n,k,P,m) which is a generalization of binomial coefficients. Special cases of this function are also power function, factorials, rising factorials and falling factorials. The first section of the paper is…