相关论文: Structure of Binary Sequences
We introduce a generalization of the Stirling numbers via symmetric functions involving two weight functions. The resulting extension unifies previously known Stirling-type sequences with known symmetric function forms, as well as other…
We study the enumeration of set partitions, according to their length, number of parts, cyclic type, and genus. We introduce genus-dependent Bell, Stirling numbers, and Fa\`a di Bruno coefficients. Besides attempting to summarize what is…
For a fixed positive integer $m$ and any partition $m = m_1 + m_2 + \cdots + m_e$ , there exists a sequence $\{n_{i}\}_{i=1}^{k}$ of positive integers such that $$m=\frac{1}{n_{1}}+\frac{1}{n_{2}}+\cdots+\frac{1}{n_{k}},$$ with the property…
Motivated by applications in databases, this paper considers various fragments of the calculus of binary relations. The fragments are obtained by leaving out, or keeping in, some of the standard operators, along with some derived operators…
The number partitioning problem consists of partitioning a sequence of positive numbers ${a_1,a_2,..., a_N}$ into two disjoint sets, ${\cal A}$ and ${\cal B}$, such that the absolute value of the difference of the sums of $a_j$ over the two…
The purpose of this paper is to investigate the connection between context-free grammars and normal ordering problem, and then to explore various extensions of the Stirling grammar. We present grammatical characterizations of several well…
In the first part of this paper the notion of natural metric on the set of natural numbers is defined. It is such metric that the completion of N is a compact metric space that a probability borel measure exists in order that the sequence…
The skew of a binary string is the difference between the number of zeroes and the number of ones, while the length of the string is the sum of these two numbers. We consider certain suffixes of the lexicographically-least de Bruijn…
We give three different computations of the total number of runs of length $i$ in binary $n$-strings, and we discuss the connection of this problem with the compositions of $n$.
Given a sequence of $N$ positive real numbers $\{a_1,a_2,..., a_N \}$, the number partitioning problem consists of partitioning them into two sets such that the absolute value of the difference of the sums of $a_j$ over the two sets is…
We prove connections between Zeckendorf decompositions and Benford's law. Recall that if we define the Fibonacci numbers by $F_1 = 1, F_2 = 2$ and $F_{n+1} = F_n + F_{n-1}$, every positive integer can be written uniquely as a sum of…
We consider the structure of a variation of the Fibonacci sequence which is determined by a Bernoulli process. The associated structure of all Bernoulli variations of the Fibonacci sequence can be represented by a directed binary tree,…
We develop a theory of real numbers as rational Cauchy sequences, in which any two of them, $(a_n)$ and $(b_n)$, are equal iff $\lim\,(a_n-b_n)=0$. We need such reals in the Countable Mathematical Analysis ([4]) which allows to use only…
Farey sequences, Stern-Brocot sequences, the Calkin-Wilf sequences are shown to be generated via almost identical second order recurrence relations. These sequences have combinatorial, computational, and geometric applications, and are…
We study singularity formation in nonlinear differential equations of order $m\leqslant 2$, $y^{(m)}=A(x^{-1},y)$. We assume $A$ is analytic at $(0,0)$ and $\partial_y A(0,0)=\lambda\ne 0$ (say, $\lambda=(-1)^m$). If $m=1$ we assume…
Seth (Mathematics Stack Exchange, http://math.stackexchange.com/q/1812699) posed a problem that is equivalent to the following: how many binary strings of length n have exactly k pairs of consecutive 0s and exactly m pairs of consecutive…
The semiring of discrete dynamical systems is a simple algebraic model for modularity in deterministic systems. The objects of the semiring are finite transformations (viewed as directed graphs and regarded up to isomorphism), the sum of…
We introduce families of jointly symmetric, binary distributions that are generated over directed star graphs whose nodes represent variables and whose edges indicate positive dependences. The families are parametrized in terms of a single…
We introduce multi-colour partition algebras $P_{n,m}(\delta_0, ..., \delta_{m-1})$, which are generalization of both bubble algebras and partition algebras, then define the bubble algebra $T_{n,m}(\delta_0, ..., \delta_{m-1})$ as a…
An algorithm for obtaining all n\times n binary matrices having exactly 2 units in every row and every column is described in the paper. After analysing the work of the algorithm a formula for calculating the number of these matrices has…