Related papers: V Tree -- Continued Fraction Expansion, Stern-Broc…
Let $X_1, ..., X_m$ be a set of $m$ statistically dependent sources over the common alphabet $\mathbb{F}_q$, that are linearly independent when considered as functions over the sample space. We consider a distributed function computation…
A new expansion scheme to evaluate the eigenvalues of the generalized evolution operator (Frobenius-Perron operator) $H_{q}$ relevant to the fluctuation spectrum and poles of the order-$q$ power spectrum is proposed. The ``partition…
Any Boolean function corresponds with a complete full binary decision tree. This tree can in turn be represented in a maximally compact form as a direct acyclic graph where common subtrees are factored and shared, keeping only one copy of…
We partition a series of natural numbers into infinite number sequences. We consider two partitioning options: (a) a forest of unary trees with recurrence formula of Mersenne numbers, and (b) a set of arithmetic progressions with difference…
Farey's sequence is a well-known procedure used to generate proper fractions from 0 to 1. Farey sequence is commonly used in rational approximations of irrational numbers, ford circles and in Riemann hypothesis. Thus, in this paper, we aim…
We present a new definition of non-ambiguous trees (NATs) as labelled binary trees. We thus get a differential equation whose solution can be described combinatorially. This yield a new formula for the number of NATs. We also obtain…
This paper studies increasing trees on $n$ labeled vertices, in which labels increase from the root to the leaves. It is known that the number of binary increasing trees coincides with the number of alternating permutations (Euler numbers).…
Weighted First Order Model Counting (WFOMC) is fundamental to probabilistic inference in statistical relational learning models. As WFOMC is known to be intractable in general ($\#$P-complete), logical fragments that admit polynomial time…
Let A denote the ring of arithmetical functions with unitary convolution, and let V be a finite subset of the positive integers having the property that for every v in V, all unitary divisors of v lie in V. We study the truncation A_V, an…
We build on recent work of Yeats, Courtiel, and others involving connected chord diagrams. We first derive from a Hopf-algebraic foundation a class of tree-like functional equations and prove that they are solved by weighted generating…
In this work we introduce and study fractional measure theoretic elliptic operators on the torus and a new stochastic process named W-Brownian motion. We establish some regularity and spectral results related to the operators cited above,…
We present a new definition of non-ambiguous trees (NATs) as labelled binary trees. We thus get a differential equation whose solution can be described combinatorially. This yields a new formula for the number of NATs. We also obtain…
Given a positive integer $M$ and $q\in(1,M+1]$, let $\mathcal U_q$ be the set of $x\in[0, M/(q-1)]$ having a unique $q$-expansion: there exists a unique sequence $(x_i)=x_1x_2\ldots$ with each $x_i\in\{0,1,\ldots, M\}$ such that \[…
We introduce the Non-commutative Subset Convolution - a convolution of functions useful when working with determinant-based algorithms. In order to compute it efficiently, we take advantage of Clifford algebras, a generalization of…
Quantum Lie algebras (an important class of quadratic algebras arising in the Woronowicz calculus on quantum groups) are generalizations of Lie (super) algebras. Many notions from the theory of Lie (super)algebras admit ``quantum''…
The present paper is in a sense a continuation of \cite{PLS}, it relies on the notation and some results. The problem tackled in both papers is the nature of the continued fraction expansion of $\sqrt[3]{2}$: are the partial quotients…
We provide a trace partitioned Gray code for the set of q-ary strings avoiding a pattern constituted by k consecutive equal symbols. The definition of this Gray code is based on two different constructions, according to the parity of q.…
Common meadows are commutative and associative algebraic structures with two operations (addition and multiplication) with additive and multiplicative identities and for which inverses are total. The inverse of zero is an error term…
One major open conjecture in the area of critical random graphs, formulated by statistical physicists, and supported by a large amount of numerical evidence over the last decade [23, 24, 28, 63] is as follows: for a wide array of random…
Higher-rank Minkowski valuations are efficient means for describing the geometry and connectivity of spatial patterns. We show how to extend the framework of the scalar Minkowski valuations to vector- and tensor-valued measures. The…