Related papers: Polynomials as terms and the Boolean Independence …
An expression in terms of (cyclotomic) harmonic sums can be simplified by the quasi-shuffle algebra in terms of the so-called basis sums. By construction, these sums are algebraically independent within the quasi-shuffle algebra. In this…
The paper gives a general condition on permutations, condition under which a semicircular matrix is free independent, or asymptotically free independent from the semicircular matrix obtained by permuting its entries. In particular, it is…
As in the cases of freeness and monotonic independence, the notion of conditional freeness is meaningful when complex-valued states are replaced by positive conditional expectations. In this framework, the paper presents several positivity…
We introduce poly-Bernoulli polynomials in two variables by using a generalization of Stirling numbers of the second kind that we studied in a previous work. We prove the bi-variate poly-Bernoulli polynomial version of some known results on…
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 extend to several variables an earlier result of ours, according to which an entire function of one variable of sufficiently small exponential type, having all derivatives of even order taking integer values at two points, is a…
The resultant of two univariate polynomials is an invariant of great importance in commutative algebra and vastly used in computer algebra systems. Here we present an algorithm to compute it over Artinian principal rings with a modified…
An ordinal view of independence is studied in the framework of possibility theory. We investigate three possible definitions of dependence, of increasing strength. One of them is the counterpart to the multiplication law in probability…
The theory of standard bases in polynomial rings with coefficients in a ring R with respect to local orderings is developed. R is a commutative Noetherian ring with 1 and we assume that linear equations are solvable in R.
In this paper we use the Lyndon-Shirshov basis to study the shuffle type polynomials. We give a free noncommutative binomial (or multinomial) theorem in terms of the Lyndon-Shirshov basis. Another noncommutative binomial theorem given by…
We study substitutive systems generated by nonprimitive substitutions and show that transitive subsystems of substitutive systems are substitutive. As an application we obtain a complete characterisation of the sets of words that can appear…
Let $F(x,y)$ be a polynomial over the rationals. We show that if $F$ is not an expander (over the rationals) then it has a special multiplicative or additive form. For example if $F$ is a homogeneous non-expander polynomial then…
The purpose of this paper is to prove that certain limits of polynomial rings are themselves polynomial rings, and show how this observation can be used to deduce some interesting results in commutative algebra. In particular, we give two…
We generalize two main theorems of matching polynomials of undirected simple graphs, namely, real-rootedness and the Heilmann-Lieb root bound. Viewing the matching polynomial of a graph $G$ as the independence polynomial of the line graph…
Two objects are independent if they do not affect each other. Independence is well-understood in classical information theory, but less in algorithmic information theory. Working in the framework of algorithmic information theory, the paper…
We prove Dirichlet's theorem for polynomial rings: Let F be a pseudo algebraically closed field. Then for all relatively prime polynomials a(X), b(X)\in F[X] and for every sufficiently large positive integer n there exist infinitely many…
We give an elementary probabilistic proof of a binomial identity. The proof is obtained by computing the probability of a certain event in two different ways, yielding two different expressions for the same quantity.
Probabilistic independence is a useful concept for describing the result of random sampling---a basic operation in all probabilistic languages---and for reasoning about groups of random variables. Nevertheless, existing verification methods…
We introduce a multivariate analogue of Bernoulli polynomials and give their fundamental properties: difference and differential relations, symmetry, explicit formula, inversion formula, multiplication theorem, and binomial type formula.…
The paper [GLZ] "L-functions of Carlitz modules, resultantal varieties and rooted binary trees" is devoted to a description of some resultantal varieties related to L-functions of Carlitz modules. It contains a conjecture that some of these…