相关论文: Generating functions, Fibonacci numbers and ration…

Based on the structure of Fibonacci sequence, we give a new proof for the irrationality exponents of the Fibonacci real numbers. Moreover, we obtain all the irrationality exponents of the real numbers corresponding to the differences of…

We discuss some examples that illustrate the countability of the positive rational numbers and related sets. Techniques include radix representations, Godel numbering, the fundamental theorem of arithmetic, continued fractions, Egyptian…

Fibonacci numbers and the golden ratio can be found in nearly all domains of Science, appearing when self-organization processes are at play and/or expressing minimum energy configurations. Several non-exhaustive examples are given in…

We consider various classes of Motzkin trees as well as lambda-terms for which we derive asymptotic enumeration results. These classes are defined through various restrictions concerning the unary nodes or abstractions, respectively: We…

We prove that for any fixed d the generating function of the projection of the set of integer points in a rational d-dimensional polytope can be computed in polynomial time. As a corollary, we deduce that various interesting sets of lattice…

We study spectral gaps of cellular differentials for finite cyclic coverings of knot complements. Their asymptotics can be expressed in terms of irrationality exponents associated with ratios of logarithms of algebraic numbers determined by…

It is known that each of the successive quotient groups of the grope and solvable filtrations of the knot concordance group has an infinite rank subgroup. The generating knots of these subgroups are constructed using iterated doubling…

Tree-child networks are a recently-described class of directed acyclic graphs that have risen to prominence in phylogenetics (the study of evolutionary trees and networks). Although these networks have a number of attractive mathematical…

We examine two different ways of encoding a counting function, as a rational generating function and explicitly as a function (defined piecewise using the greatest integer function). We prove that, if the degree and number of input…

Knots are fascinating topological structures that have been observed in various contexts, ranging from micro-worlds to macro-systems, and are conjectured to play a fundamental role in their respective fields. In order to characterize their…

Various methods have been used to construct rational points and rational curves on rationally connected algebraic varieties. We survey recent advances in two of them, the descent and the fibration method, in a number-theoretical context…

A non-crossing pairing on a bitstring matches 1s and 0s in a manner such that the pairing diagram is nonintersecting. By considering such pairings on arbitrary bitstrings $1^{n_1} 0^{m_1} ... 1^{n_r} 0^{m_r}$, we generalize classical…

In this note we describe a new method of counting the number of unordered factorizations of a natural number by means of a generating function and a recurrence relation arising from it, which improves an earlier result in this direction.

We consider the question of when a rational homology 3-sphere is rational homology cobordant to a connected sum of lens spaces. We prove that every rational homology cobordism class in the subgroup generated by lens spaces is represented by…

Let $F(x)=\sum\limits_{n=1}^\infty\tau(n)x^n$ be the generating function for the number $\tau(n)$ of spanning trees in the circulant graphs $C_{n}(s_1,s_2,\ldots,s_k).$ We show that $F(x)$ is a rational function with integer coefficients…

A well-known algorithm for unknotting knots involves traversing a knot diagram and changing each crossing that is first encountered from below. The minimal number of crossings changed in this way across all diagrams for a knot is called the…

We consider diagrams of links in $S^2$ obtained by projection from $S^3$ with the Hopf map and the minimal crossing number for such diagrams. Knots admitting diagrams with at most one crossing are classified. Some properties of these knots…

Let $f_1=1,f_2=2$ and $f_i=f_{i-1}+f_{i-2}$ for $i>2$ be the sequence of Fibonacci numbers. Let $\Phi_h(n)$ be the quantity of partitions of natural number $n$ into $h$ different Fibonacci numbers. In terms of Zeckendorf partition of $n$ I…

Arborescent knots are the ones which can be represented in terms of double fat graphs or equivalently as tree Feynman diagrams. This is the class of knots for which the present knowledge is enough for lifting topological description to the…

Fibonacci anyons are non-Abelian particles for which braiding is universal for quantum computation. Reichardt has shown how to systematically generate nontrivial braids for three Fibonacci anyons which yield unitary operations with…