Related papers: PBNF-transform as a formulation of Propositional C…
This paper is the second in a series of planned papers which provide first bijective proofs of alternating sign matrix results. Based on the main result from the first paper, we construct a bijective proof of the enumeration formula for…
Phylogenetic invariants are certain polynomials in the joint probability distribution of a Markov model on a phylogenetic tree. Such polynomials are of theoretical interest in the field of algebraic statistics and they are also of practical…
We provide direct elementary proofs of several explicit expressions for Bernoulli numbers and Bernoulli polynomials. As a byproduct of our method of proof, we provide natural definitions for generalized Bernoulli numbers and polynomials of…
Normal forms allow the use of a restricted class of coordinate transformations (typically homogeneous polynomials) to put the bifurcations found in nonlinear dynamical systems into a few standard forms. We investigate here the consequences…
Analytic expressions for the Fourier transforms of the Chebyshev and Legendre polynomials are derived, and the latter is used to find a new representation for the half-order Bessel functions. The numerical implementation of the so-called…
Despite the relevance of the binomial distribution for probability theory and applied statistical inference, its higher-order moments are poorly understood. The existing formulas are either not general enough, or not structured and…
We investigate the following question: if a polynomial can be evaluated at rational points by a polynomial-time boolean algorithm, does it have a polynomial-size arithmetic circuit? We argue that this question is certainly difficult.…
We reduce the calculation of the simplest Hodge integrals to some sums over decorated trees. Since Hodge integrals are already calculated, this gives a proof of a rather interesting combinatorial theorem and a new representation of…
We describe Haskell implementations of interesting combinatorial generation algorithms with focus on boolean functions and logic circuit representations. First, a complete exact combinational logic circuit synthesizer is described as a…
We extend classical Propositional Logic (PL) by adding a new primitive binary connective $\varphi|\psi$, intended to represent the "superposition" of sentences $\varphi$ and $\psi$, an operation motivated by the corresponding notion of…
By a symbolic method, we introduce multivariate Bernoulli and Euler polynomials as powers of polynomials whose coefficients involve multivariate L\'evy processes. Many properties of these polynomials are stated straightforwardly thanks to…
The purpose of this paper is to give a characterisation of divided power algebras over a reduced operad. Such a characterisation is given in terms of polynomial operations, following the classical example of divided power algebras. We…
The main purpose of this paper is to study generalized (self-) reciprocal Appell polynomials, which play a certain role in connection with Faulhaber-type polynomials. More precisely, we show for any Appell sequence when satisfying a…
It is well-known that the size of propositional classical proofs can be huge. Proof theoretical studies discovered exponential gaps between normal or cut free proofs and their respective non-normal proofs. The aim of this work is to study…
Isomorphism between formulae is defined with respect to categories formalizing equality of deductions in classical propositional logic and in the multiplicative fragment of classical linear propositional logic caught by proof nets. This…
We investigate the computational problem of determining whether a bivariate polynomial with non-negative coefficients and no constant term can attain a prime value. While classical conjectures such as Bouniakowsky's provide necessary…
In this article, we define general normal forms for any logic that has propositional part and whose non-propositional connectives distribute over the finite disjunctions. We do not require the non-propositional connectives to be closed on…
In this paper we investigate the complexity of abduction, a fundamental and important form of non-monotonic reasoning. Given a knowledge base explaining the world's behavior it aims at finding an explanation for some observed manifestation.…
There is a commutative algebra of differential-difference operators, with two parameters, associated to any dihedral group with an even number of reflections. The intertwining operator relates this algebra to the algebra of partial…
Logical formalisms provide a natural and concise means for specifying and reasoning about preferences. In this paper, we propose lexicographic logic, an extension of classical propositional logic that can express a variety of preferences,…