Related papers: Logarithmic behavior of some combinatorial sequenc…
Mechanisms for the automation of uncertainty are required for expert systems. Sometimes these mechanisms need to obey the properties of probabilistic reasoning. A purely numeric mechanism, like those proposed so far, cannot provide a…
A logic is presented for reasoning on iterated sequences of formulae over some given base language. The considered sequences, or "schemata", are defined inductively, on some algebraic structure (for instance the natural numbers, the lists,…
The evaluation of iterated primitives of powers of logarithms is expressed in closed form. The expressions contain polynomials with coefficients given in terms of the harmonic numbers and their generalizations. The logconcavity of these…
We show the existence of regular combinatorial objects which previously were not known to exist. Specifically, for a wide range of the underlying parameters, we show the existence of non-trivial orthogonal arrays, t-designs, and t-wise…
As a first application of a very old theorem, known as Herschel's theorem, we provide direct elementary proofs of several explicit expressions for some numbers and polynomials that are known in combinatorics. The second application deals…
A new general and unified method of summation, which is both regular and consistent, is invented. It is based on the idea concerning a way of integers reordering. The resulting theory includes a number of explicit and closed form summation…
Based on continued fractions with subtractions, we identify the set of real numbers with the set of infinite integer sequences with all terms but the first one greater or equal to two. Each such sequence produces in a canonical way a unique…
A sequence $\{z_n\}_{n\geq0}$ is called ratio log-convex in the sense that the ratio sequence $\{\frac{z_{n+1}}{z_n}\}_{n\geq0}$ is log-convex. Based on a three-term recurrence for sequences, we develop techniques for dealing with the ratio…
We explore a physical model of ordered sums of integers as trains of rods. The trains for a fixed, possibly infinite, set of rod lengths naturally correspond to nodes in a tree; relations among finite linear recursions encoded in the…
Graded modal logics generalise standard modal logics via families of modalities indexed by an algebraic structure whose operations mediate between the different modalities. The graded "of-course" modality $!_r$ captures how many times a…
Using sequences of finite length with positive integer elements and the inversion statistic on such sequences, a collection of binomial and multinomial identities are extended to their $q$-analog form via combinatorial proofs. Using the…
We develop a novel, fundamental and surprisingly simple randomized iterative method for solving consistent linear systems. Our method has six different but equivalent interpretations: sketch-and-project, constrain-and-approximate, random…
Linear algebra algorithms often require some sort of iteration or recursion as is illustrated by standard algorithms for Gaussian elimination, matrix inversion, and transitive closure. A key characteristic shared by these algorithms is that…
In the application of autoregressive models the order of the model is often estimated using either a sequence of likelihood ratio tests, a likelihood based information criterion, or a residual based test. The properties of such procedures…
A new proof for adjoint systems of linear equations is presented. The argument is built on the principles of Algorithmic Differentiation. Application to scalar multiplication sets the base line. Generalization yields adjoint inner vector,…
In this work, we explore proof theoretical connections between sequent, nested and labelled calculi. In particular, we show a general algorithm for transforming a class of nested systems into sequent calculus systems, passing through linear…
This paper argues that mathematical objects are constructions and that constructions introduce a flexibility in the ways that mathematical objects are represented (as sets of binary sequences for example) and presented (in a particular…
We present a method to obtain congruences modulo powers of 2 for sequences given by recurrences of finite depth with polynomial coefficients. We apply this method to Catalan numbers, Fu\ss-Catalan numbers, and to subgroup counting functions…
Sequence of numbers generated by the recurrence relation based on the Collatz conjecture is investigated. An arithmetic operation on the Collatz conjecture is called descending operation, and ascending operation is carried out reversely to…
We propose a modular method for proving termination of general logic programs (i.e., logic programs with negation). It is based on the notion of acceptable programs, but it allows us to prove termination in a truly modular way. We consider…