Related papers: PBNF-transform as a formulation of Propositional C…
In this paper, we study logics of dependence on the propositional level. We prove that several interesting propositional logics of dependence, including propositional dependence logic, propositional intuitionistic dependence logic as well…
Proposition algebra is based on Hoare's conditional connective, which is a ternary connective comparable to if-then-else and used in the setting of propositional logic. Conditional statements are provided with a simple semantics that is…
Ouroboros functions have shown some interesting properties when subjected to conventional operations. The aim of this paper is to continue our investigation and prove some additional properties of these functions. Using algebraic methods,…
For every algebraically closed field $\boldsymbol k$ of characteristic different from $2$, we prove the following: (1) Generic finite dimensional (not necessarily associative) $\boldsymbol k$-algebras of a fixed dimension, considered up to…
We formulate several polynomial identities. One side of these identities has a nice simple form. Whereas the other has a form of a polynomial whose coefficients contain binomial coefficients double factorials or (and) rising factorials. The…
The space of polynomials in two real variables with values in a 2-dimensional irreducible module of a dihedral group is studied as a standard module for Dunkl operators. The one-parameter case is considered (omitting the two-parameter case…
Decomposable Negation Normal Forms (DNNFs) are Boolean circuits in negation normal form where the subcircuits leading into each AND gate are defined on disjoint sets of variables. We prove a strongly exponential lower bound on the size of…
A class of self-inversive polynomials includes all the self-reciprocal polynomials. Let A denote the set of all self-reciprocal polynomials with n+1 coefficients. Let B denote the set of certain self-inversive and non self-reciprocal…
Dunkl operators are differential-difference operators on $\b R^N$ which generalize partial derivatives. They lead to generalizations of Laplace operators, Fourier transforms, heat semigroups, Hermite polynomials, and so on. In this paper we…
We review our algebraic framework for linear boundary problems (concentrating on ordinary differential equations). Its starting point is an appropriate algebraization of the domain of functions, which we have named integro-differential…
This article is an introduction to a new approach to first principles electronic structure calculation. The starting point is the Hartree-Fock-Roothaan equation, in which molecular integrals are approximated by polynomials by way of Taylor…
We develop a theory of formal multivariate polynomials over commutative rings by treating them as ring terms. Our main result is that two ring terms are s-equivalent (when expanded they yield the same standard polynomial) iff they are…
New methods for derivation of Bell polynomials of the second kind are presented. The methods are based on an ordinary generating function and its composita. The relation between a composita and a Bell polynomial is demonstrated. Main…
We study the operad of associative algebras equipped with a derivation. We show that it is determined by polynomials in several variables and substitution. Replacing polynomials by rational functions gives an operad which is isomorphic to…
Connection coefficient formulas for special functions describe change of basis matrices under a parameter change, for bases formed by the special functions. Such formulas are related to branching questions in representation theory. The…
We introduce BPDL, a combination of propositional dynamic logic PDL with the basic four-valued modal logic BK studied by Odintsov and Wansing (`Modal logics with Belnapian truth values', J. Appl. Non-Class. Log. 20, 279--301 (2010)). We…
In this note we show a simple formula for the coefficients of the polynomial associated with the sums of powers of the terms of an arbitrary arithmetic progression. This formula consists of a double sum involving only ordinary binomial…
The analysis of observable phenomena (for instance, in biology or physics) allows the detection of dynamical behaviors and, conversely, starting from a desired behavior allows the design of objects exhibiting that behavior in engineering.…
We consider rational functions of the form $V(x)/U(x)$, where both $V(x)$ and $U(x)$ are polynomials over the finite field $\mathbb{F}_q$. Polynomials that permute the elements of a field, called {\it permutation polynomials ($PPs$)}, have…
An interactive theorem prover, Isabelle, is under development. In LCF, each inference rule is represented by one function for forwards proof and another (a tactic) for backwards proof. In Isabelle, each inference rule is represented by a…