中文
相关论文

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

200 篇论文

Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…

离散数学 · 计算机科学 2008-06-20 Tsiriniaina Andriamampianina

It is well known that permutations avoiding any 3-length pattern are enumerated by the Catalan numbers. If the three patterns 123, 132 and 213 are avoided at the same time we obtain a class of permutations enumerated by the Fibonacci…

组合数学 · 数学 2007-05-23 E. Barcucci , A. Bernini , M. Poneti

We considered the properties of generalized Fibonacci and Lucas numbers class. The analogues of well-known Fibonacci identities for generalized numbers are obtained. We gained a new identity of product convolution of generalized Fibonacci…

组合数学 · 数学 2024-06-06 Vladimir V. Kruchinin , Maria Y. Perminova

The manuscript studies configurations of non-overlapping non-bonding dominoes on finite rectangular boards of unit squares characterized by row and column number. The non-bonding dominoes are defined here by the requirement that any domino…

组合数学 · 数学 2024-04-30 Richard J. Mathar

We classify all knot diagrams of genus two and three, and give applications to positive, alternating and homogeneous knots, including a classification of achiral genus 2 alternating knots, slice or achiral 2-almost positive knots, a proof…

几何拓扑 · 数学 2008-08-30 A. Stoimenow

Generating functions for a fixed genus map and hypermap enumeration become rational after a simple explicit change of variables. Their numerators are polynomials with integer coefficients that obey a differential recursion, and denominators…

组合数学 · 数学 2016-09-20 M. Kazarian , P. Zograf

We investigate combinatorial properties of a kind of insets we defined in an earlier paper, interpreting them now in terms of restricted ternary words. This allows us to give new combinatorial interpretations of a number of known integer…

组合数学 · 数学 2019-05-14 Milan Janjic

We explore the application of automated reasoning techniques to unknot detection, a classical problem of computational topology. We adopt a two-pronged experimental approach, using a theorem prover to try to establish a positive result…

计算机科学中的逻辑 · 计算机科学 2014-05-19 Andrew Fish , Alexei Lisitsa

Sequences are often conveniently encoded in the form of a generating function depending on a formal variable. This note presents two observations that allow one to draw conclusions about the generated sequence from the generating function.…

经典分析与常微分方程 · 数学 2025-11-17 Alex Kasman , Robert Milson

We investigate general properties of number sequences which allow explicit representation in terms of products. We find that such sequences form whole families of number sequences sharing similar recursive identities. Restricting to the…

数论 · 数学 2015-09-01 Michelle Rudolph-Lilith

A triangular field of rational numbers is characterized, with relations to Stirling numbers 2nd, Hyperbolic functions, and centered Binomial distribution. A Generating function is given.

数论 · 数学 2021-02-23 Andreas B. G. Blobel

The braid axis of a closed 3-braid lifts to a genus one fibered knot in the double cover of S^3 branched over the closed braid. Every (null homologous) genus one fibered knot in a 3-manifold may be obtained in this way. Using this…

几何拓扑 · 数学 2007-05-23 Kenneth L. Baker

We give constructions to realize an odd number, which is representable as sum of two squares, as determinant of an achiral knot, thus proving that these are exactly the numbers occurring as such determinants. Later we study which numbers…

几何拓扑 · 数学 2008-08-30 A. Stoimenow

We study higher-dimensional interlacing Fibonacci sequences, generated via both Chebyshev type functions and $m$-dimensional recurrence relations. For each integer $m$, there exist both rational and integer versions of these sequences,…

Chebyshev polynomials and their modifications are attributes of various fields of mathematics. In particular, they are generating functions of the rows elements of certain Riordan matrices. In paper, we give a selection of some…

数论 · 数学 2019-03-26 E. Burlachenko

We introduce natural language processing into the study of knot theory, as made natural by the braid word representation of knots. We study the UNKNOT problem of determining whether or not a given knot is the unknot. After describing an…

几何拓扑 · 数学 2020-11-02 Sergei Gukov , James Halverson , Fabian Ruehle , Piotr Sułkowski

We present several types of ordinary generating functions involving central binomial coefficients, harmonic numbers, and odd harmonic numbers. Our results complement those of Boyadzhiev from 2012 and Chen from 2016. Based on these…

组合数学 · 数学 2024-01-08 Kunle Adegoke , Robert Frontczak , Taras Goy

The aim of this paper is to construct general forms of ordinary generating functions for special numbers and polynomials involving Fibonacci type numbers and polynomials, Lucas numbers and polynomials, Chebyshev polynomials, Sextet…

综合数学 · 数学 2023-06-16 Yilmaz Simsek

We study compositions whose parts are colored by subsequences of the Fibonacci numbers. We give explicit bijections between Fibonacci colored compositions and several combinatorial objects, including certain restricted ternary and…

组合数学 · 数学 2022-03-15 Juan B. Gil , Jessica A. Tomasko

Binary representations of the trefoil and other knots of up to ten crossings in the simple cubic lattice were created. The BiEntropy of each knot was computed using a variety of binary encodings and compared against controls. This showed…

综合数学 · 数学 2018-02-13 Grenville J. Croll